{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:RBKF4GBXS7ZZ4NXEYZYZPVLJAP","short_pith_number":"pith:RBKF4GBX","schema_version":"1.0","canonical_sha256":"88545e183797f39e36e4c67197d56903c71feb7ad85e02beb6ea4d60f597c81a","source":{"kind":"arxiv","id":"cs/0510070","version":3},"attestation_state":"computed","paper":{"title":"On Coding for Reliable Communication over Packet Networks","license":"","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Desmond S. Lun, Michelle Effros, Muriel Medard, Ralf Koetter","submitted_at":"2005-10-23T22:42:43Z","abstract_excerpt":"We present a capacity-achieving coding scheme for unicast or multicast over lossy packet networks. In the scheme, intermediate nodes perform additional coding yet do not decode nor even wait for a block of packets before sending out coded packets. Rather, whenever they have a transmission opportunity, they send out coded packets formed from random linear combinations of previously received packets. All coding and decoding operations have polynomial complexity.\n  We show that the scheme is capacity-achieving as long as packets received on a link arrive according to a process that has an average"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"cs/0510070","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-10-23T22:42:43Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"6bd7a3535e9fce84e0f9dc72518aa734087ec8ee2ff0c6639d560c84ce0317c2","abstract_canon_sha256":"f7324dc74a570f4886b66230d51b5f117386e32422f507739a2eeafe7b099e91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:10:44.486393Z","signature_b64":"k6dK5g1wjll/6FOWeHTxm5STwBFRPr2ysqyBgpq0KGd+ZjQev1DNFsPbXEIVXAo7vG0vBQtbw7SmIde1hoLIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88545e183797f39e36e4c67197d56903c71feb7ad85e02beb6ea4d60f597c81a","last_reissued_at":"2026-07-04T15:10:44.486022Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:10:44.486022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Coding for Reliable Communication over Packet Networks","license":"","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Desmond S. Lun, Michelle Effros, Muriel Medard, Ralf Koetter","submitted_at":"2005-10-23T22:42:43Z","abstract_excerpt":"We present a capacity-achieving coding scheme for unicast or multicast over lossy packet networks. In the scheme, intermediate nodes perform additional coding yet do not decode nor even wait for a block of packets before sending out coded packets. Rather, whenever they have a transmission opportunity, they send out coded packets formed from random linear combinations of previously received packets. All coding and decoding operations have polynomial complexity.\n  We show that the scheme is capacity-achieving as long as packets received on a link arrive according to a process that has an average"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0510070","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0510070/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0510070","created_at":"2026-07-04T15:10:44.486085+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0510070v3","created_at":"2026-07-04T15:10:44.486085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0510070","created_at":"2026-07-04T15:10:44.486085+00:00"},{"alias_kind":"pith_short_12","alias_value":"RBKF4GBXS7ZZ","created_at":"2026-07-04T15:10:44.486085+00:00"},{"alias_kind":"pith_short_16","alias_value":"RBKF4GBXS7ZZ4NXE","created_at":"2026-07-04T15:10:44.486085+00:00"},{"alias_kind":"pith_short_8","alias_value":"RBKF4GBX","created_at":"2026-07-04T15:10:44.486085+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RBKF4GBXS7ZZ4NXEYZYZPVLJAP","json":"https://pith.science/pith/RBKF4GBXS7ZZ4NXEYZYZPVLJAP.json","graph_json":"https://pith.science/api/pith-number/RBKF4GBXS7ZZ4NXEYZYZPVLJAP/graph.json","events_json":"https://pith.science/api/pith-number/RBKF4GBXS7ZZ4NXEYZYZPVLJAP/events.json","paper":"https://pith.science/paper/RBKF4GBX"},"agent_actions":{"view_html":"https://pith.science/pith/RBKF4GBXS7ZZ4NXEYZYZPVLJAP","download_json":"https://pith.science/pith/RBKF4GBXS7ZZ4NXEYZYZPVLJAP.json","view_paper":"https://pith.science/paper/RBKF4GBX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0510070&json=true","fetch_graph":"https://pith.science/api/pith-number/RBKF4GBXS7ZZ4NXEYZYZPVLJAP/graph.json","fetch_events":"https://pith.science/api/pith-number/RBKF4GBXS7ZZ4NXEYZYZPVLJAP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RBKF4GBXS7ZZ4NXEYZYZPVLJAP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RBKF4GBXS7ZZ4NXEYZYZPVLJAP/action/storage_attestation","attest_author":"https://pith.science/pith/RBKF4GBXS7ZZ4NXEYZYZPVLJAP/action/author_attestation","sign_citation":"https://pith.science/pith/RBKF4GBXS7ZZ4NXEYZYZPVLJAP/action/citation_signature","submit_replication":"https://pith.science/pith/RBKF4GBXS7ZZ4NXEYZYZPVLJAP/action/replication_record"}},"created_at":"2026-07-04T15:10:44.486085+00:00","updated_at":"2026-07-04T15:10:44.486085+00:00"}