{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:HLDK4O36PNZJTZUMGLNHFLH5WF","short_pith_number":"pith:HLDK4O36","canonical_record":{"source":{"id":"0802.1754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-02-13T02:01:54Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"999fe011ec063509d95c83fd15b8576ebf79678212a78a06a32794be6f8d909c","abstract_canon_sha256":"9a1000086b1c27f874969b26ab49a918d4af436583a17c516a4c552dad8146af"},"schema_version":"1.0"},"canonical_sha256":"3ac6ae3b7e7b7299e68c32da72acfdb15f6c322d3f40afa1fa5ef268935417fe","source":{"kind":"arxiv","id":"0802.1754","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0802.1754","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"0802.1754v1","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.1754","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"HLDK4O36PNZJ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"HLDK4O36PNZJTZUM","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"HLDK4O36","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:HLDK4O36PNZJTZUMGLNHFLH5WF","target":"record","payload":{"canonical_record":{"source":{"id":"0802.1754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-02-13T02:01:54Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"999fe011ec063509d95c83fd15b8576ebf79678212a78a06a32794be6f8d909c","abstract_canon_sha256":"9a1000086b1c27f874969b26ab49a918d4af436583a17c516a4c552dad8146af"},"schema_version":"1.0"},"canonical_sha256":"3ac6ae3b7e7b7299e68c32da72acfdb15f6c322d3f40afa1fa5ef268935417fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:25.760958Z","signature_b64":"pBBuMIVyLATTkO0GnSYeajWBjqhZeblabJh8LdRNEzP4OxmQZZkfs/UDENlUD2cNZB05134qiVatAenLCUt4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ac6ae3b7e7b7299e68c32da72acfdb15f6c322d3f40afa1fa5ef268935417fe","last_reissued_at":"2026-05-18T00:58:25.760230Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:25.760230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0802.1754","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zOxPrTDL08zANjkiBPd7bX/2seISIUxj0lEV4V/xTIZ2Ro/nomtKYEOsKLXGZ5n+DMzdgQ8GSeAFjtlbTbTXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:45:42.493848Z"},"content_sha256":"1d7f62749d4fb9b7231013cf8070b91de5dd627b914ab2ecb17993f284005326","schema_version":"1.0","event_id":"sha256:1d7f62749d4fb9b7231013cf8070b91de5dd627b914ab2ecb17993f284005326"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:HLDK4O36PNZJTZUMGLNHFLH5WF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ARQ for Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Devavrat Shah, Jay Kumar Sundararajan, Muriel M\\'edard","submitted_at":"2008-02-13T02:01:54Z","abstract_excerpt":"A new coding and queue management algorithm is proposed for communication networks that employ linear network coding. The algorithm has the feature that the encoding process is truly online, as opposed to a block-by-block approach. The setup assumes a packet erasure broadcast channel with stochastic arrivals and full feedback, but the proposed scheme is potentially applicable to more general lossy networks with link-by-link feedback. The algorithm guarantees that the physical queue size at the sender tracks the backlog in degrees of freedom (also called the virtual queue size). The new notion "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.1754","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ck0WLJC9ZGTdOKHKyv8TLS1vT0+uT/kFf65dumeHLfsCB++NLZp8wJZyQ6XMpgih4+YBw4WUYhNuonfH3d1rCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:45:42.494206Z"},"content_sha256":"0d74bc2adbc8683f12ab581fbf5a4aa8f9465544ed78f58df291276583874fa9","schema_version":"1.0","event_id":"sha256:0d74bc2adbc8683f12ab581fbf5a4aa8f9465544ed78f58df291276583874fa9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HLDK4O36PNZJTZUMGLNHFLH5WF/bundle.json","state_url":"https://pith.science/pith/HLDK4O36PNZJTZUMGLNHFLH5WF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HLDK4O36PNZJTZUMGLNHFLH5WF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T09:45:42Z","links":{"resolver":"https://pith.science/pith/HLDK4O36PNZJTZUMGLNHFLH5WF","bundle":"https://pith.science/pith/HLDK4O36PNZJTZUMGLNHFLH5WF/bundle.json","state":"https://pith.science/pith/HLDK4O36PNZJTZUMGLNHFLH5WF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HLDK4O36PNZJTZUMGLNHFLH5WF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:HLDK4O36PNZJTZUMGLNHFLH5WF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9a1000086b1c27f874969b26ab49a918d4af436583a17c516a4c552dad8146af","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-02-13T02:01:54Z","title_canon_sha256":"999fe011ec063509d95c83fd15b8576ebf79678212a78a06a32794be6f8d909c"},"schema_version":"1.0","source":{"id":"0802.1754","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0802.1754","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"0802.1754v1","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.1754","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"HLDK4O36PNZJ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"HLDK4O36PNZJTZUM","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"HLDK4O36","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:0d74bc2adbc8683f12ab581fbf5a4aa8f9465544ed78f58df291276583874fa9","target":"graph","created_at":"2026-05-18T00:58:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A new coding and queue management algorithm is proposed for communication networks that employ linear network coding. The algorithm has the feature that the encoding process is truly online, as opposed to a block-by-block approach. The setup assumes a packet erasure broadcast channel with stochastic arrivals and full feedback, but the proposed scheme is potentially applicable to more general lossy networks with link-by-link feedback. The algorithm guarantees that the physical queue size at the sender tracks the backlog in degrees of freedom (also called the virtual queue size). The new notion ","authors_text":"Devavrat Shah, Jay Kumar Sundararajan, Muriel M\\'edard","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-02-13T02:01:54Z","title":"ARQ for Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.1754","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1d7f62749d4fb9b7231013cf8070b91de5dd627b914ab2ecb17993f284005326","target":"record","created_at":"2026-05-18T00:58:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9a1000086b1c27f874969b26ab49a918d4af436583a17c516a4c552dad8146af","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-02-13T02:01:54Z","title_canon_sha256":"999fe011ec063509d95c83fd15b8576ebf79678212a78a06a32794be6f8d909c"},"schema_version":"1.0","source":{"id":"0802.1754","kind":"arxiv","version":1}},"canonical_sha256":"3ac6ae3b7e7b7299e68c32da72acfdb15f6c322d3f40afa1fa5ef268935417fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ac6ae3b7e7b7299e68c32da72acfdb15f6c322d3f40afa1fa5ef268935417fe","first_computed_at":"2026-05-18T00:58:25.760230Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:25.760230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pBBuMIVyLATTkO0GnSYeajWBjqhZeblabJh8LdRNEzP4OxmQZZkfs/UDENlUD2cNZB05134qiVatAenLCUt4AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:25.760958Z","signed_message":"canonical_sha256_bytes"},"source_id":"0802.1754","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d7f62749d4fb9b7231013cf8070b91de5dd627b914ab2ecb17993f284005326","sha256:0d74bc2adbc8683f12ab581fbf5a4aa8f9465544ed78f58df291276583874fa9"],"state_sha256":"c9a0ed07da0504e1fcdc82272a4b4dc517f1c89d5d02f44dce2d049af3b367d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EeASFc5ME6iweN0o5bo3YXPThLv8N3hVezR0O2Elrm5/L0kW692hF4d+7xiVpFbUmq2gudUn8+WEumtqZG5GAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:45:42.496474Z","bundle_sha256":"f0ee782b83140d48a8957a9479cc98a74e301378d961b5b4b81c95a1bc882d94"}}