{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T15:48:26Z","timestamp":1783612106804,"version":"3.55.0"},"reference-count":0,"publisher":"RFC Editor","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.17487\/rfc9262","type":"report","created":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T05:27:16Z","timestamp":1665811636000},"source":"Crossref","is-referenced-by-count":7,"title":["Tree Engineering for Bit Index Explicit Replication (BIER-TE)"],"prefix":"10.17487","author":[{"given":"M.","family":"Menth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G.","family":"Cauchie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"7045","published-online":{"date-parts":[[2022,10]]},"container-title":[],"original-title":[],"deposited":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T05:27:17Z","timestamp":1665811637000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rfc-editor.org\/info\/rfc9262"}},"subtitle":[],"editor":[{"given":"T.","family":"Eckert","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"editor"}]}],"short-title":[],"issued":{"date-parts":[[2022,10]]},"references-count":0,"URL":"https:\/\/doi.org\/10.17487\/rfc9262","relation":{},"subject":[],"published":{"date-parts":[[2022,10]]}}}