{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:YDRNXLVXBGBXJCGR7JPXE4PNAO","short_pith_number":"pith:YDRNXLVX","canonical_record":{"source":{"id":"cs/0508047","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-08-08T02:09:13Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"1fb06b6c9c68311515e6ad55716f5ccb470b4f1f24df741876ef22700f30dea3","abstract_canon_sha256":"b9dbc175c059953c9f5ed1be197ffd9c64df6327d7255678dcfd0b40b0ccd5b0"},"schema_version":"1.0"},"canonical_sha256":"c0e2dbaeb709837488d1fa5f7271ed039cfc168fa2cf903ea0020bce4552b4f5","source":{"kind":"arxiv","id":"cs/0508047","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0508047","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0508047v1","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508047","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_12","alias_value":"YDRNXLVXBGBX","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_16","alias_value":"YDRNXLVXBGBXJCGR","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_8","alias_value":"YDRNXLVX","created_at":"2026-07-04T15:03:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:YDRNXLVXBGBXJCGR7JPXE4PNAO","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0508047","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-08-08T02:09:13Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"1fb06b6c9c68311515e6ad55716f5ccb470b4f1f24df741876ef22700f30dea3","abstract_canon_sha256":"b9dbc175c059953c9f5ed1be197ffd9c64df6327d7255678dcfd0b40b0ccd5b0"},"schema_version":"1.0"},"canonical_sha256":"c0e2dbaeb709837488d1fa5f7271ed039cfc168fa2cf903ea0020bce4552b4f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:03:00.399194Z","signature_b64":"Y5dGCpCdJxK0tIHcnxjofhJSYycrSgJAlWW0C7jZ5XMmt1deEW9RipfrUZ6zppyijj3gHKfFU5xdpcH1Jj9tBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0e2dbaeb709837488d1fa5f7271ed039cfc168fa2cf903ea0020bce4552b4f5","last_reissued_at":"2026-07-04T15:03:00.398811Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:03:00.398811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0508047","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-07-04T15:03:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NiNHGpx5+7D6C3zHaWtHODBZwT3h93eMOSunR3IU/HRMjmRD1JKAGdEAwq4l0TNoEBiU9SZ0IpiPe7yvuBIQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T02:43:53.582576Z"},"content_sha256":"6953348a755a87ea46a884c79635983b92cfff2f4b330d2e57c535d29cfc86cc","schema_version":"1.0","event_id":"sha256:6953348a755a87ea46a884c79635983b92cfff2f4b330d2e57c535d29cfc86cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:YDRNXLVXBGBXJCGR7JPXE4PNAO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Further Results 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-08-08T02:09:13Z","abstract_excerpt":"In \"On Coding for Reliable Communication over Packet Networks\" (Lun, Medard, and Effros, Proc. 42nd Annu. Allerton Conf. Communication, Control, and Computing, 2004), a capacity-achieving coding scheme for unicast or multicast over lossy wireline or wireless packet networks is presented. We extend that paper's results in two ways: First, we extend the network model to allow packets received on a link to arrive according to any process with an average rate, as opposed to the assumption of Poisson traffic with i.i.d. losses that was previously made. Second, in the case of Poisson traffic with i."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0508047","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0508047/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"},"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-07-04T15:03:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MMYITxRTLNqxbb3LwYyMPxL80K889RmEKjejU/qhP94+SznIPWxSwV9rXAGs5cYgGJHumpuXcme+g21iHSwbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T02:43:53.583056Z"},"content_sha256":"1f1833c465dc3326d96c7f974da1fc5deff09a0b57b484c01c7afcfc93bffae9","schema_version":"1.0","event_id":"sha256:1f1833c465dc3326d96c7f974da1fc5deff09a0b57b484c01c7afcfc93bffae9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDRNXLVXBGBXJCGR7JPXE4PNAO/bundle.json","state_url":"https://pith.science/pith/YDRNXLVXBGBXJCGR7JPXE4PNAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDRNXLVXBGBXJCGR7JPXE4PNAO/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-08-06T02:43:53Z","links":{"resolver":"https://pith.science/pith/YDRNXLVXBGBXJCGR7JPXE4PNAO","bundle":"https://pith.science/pith/YDRNXLVXBGBXJCGR7JPXE4PNAO/bundle.json","state":"https://pith.science/pith/YDRNXLVXBGBXJCGR7JPXE4PNAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDRNXLVXBGBXJCGR7JPXE4PNAO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:YDRNXLVXBGBXJCGR7JPXE4PNAO","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":"b9dbc175c059953c9f5ed1be197ffd9c64df6327d7255678dcfd0b40b0ccd5b0","cross_cats_sorted":["cs.NI","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-08-08T02:09:13Z","title_canon_sha256":"1fb06b6c9c68311515e6ad55716f5ccb470b4f1f24df741876ef22700f30dea3"},"schema_version":"1.0","source":{"id":"cs/0508047","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0508047","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0508047v1","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508047","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_12","alias_value":"YDRNXLVXBGBX","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_16","alias_value":"YDRNXLVXBGBXJCGR","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_8","alias_value":"YDRNXLVX","created_at":"2026-07-04T15:03:00Z"}],"graph_snapshots":[{"event_id":"sha256:1f1833c465dc3326d96c7f974da1fc5deff09a0b57b484c01c7afcfc93bffae9","target":"graph","created_at":"2026-07-04T15:03:00Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0508047/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In \"On Coding for Reliable Communication over Packet Networks\" (Lun, Medard, and Effros, Proc. 42nd Annu. Allerton Conf. Communication, Control, and Computing, 2004), a capacity-achieving coding scheme for unicast or multicast over lossy wireline or wireless packet networks is presented. We extend that paper's results in two ways: First, we extend the network model to allow packets received on a link to arrive according to any process with an average rate, as opposed to the assumption of Poisson traffic with i.i.d. losses that was previously made. Second, in the case of Poisson traffic with i.","authors_text":"Desmond S. Lun, Michelle Effros, Muriel Medard, Ralf Koetter","cross_cats":["cs.NI","math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2005-08-08T02:09:13Z","title":"Further Results on Coding for Reliable Communication over Packet Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0508047","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:6953348a755a87ea46a884c79635983b92cfff2f4b330d2e57c535d29cfc86cc","target":"record","created_at":"2026-07-04T15:03:00Z","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":"b9dbc175c059953c9f5ed1be197ffd9c64df6327d7255678dcfd0b40b0ccd5b0","cross_cats_sorted":["cs.NI","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-08-08T02:09:13Z","title_canon_sha256":"1fb06b6c9c68311515e6ad55716f5ccb470b4f1f24df741876ef22700f30dea3"},"schema_version":"1.0","source":{"id":"cs/0508047","kind":"arxiv","version":1}},"canonical_sha256":"c0e2dbaeb709837488d1fa5f7271ed039cfc168fa2cf903ea0020bce4552b4f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0e2dbaeb709837488d1fa5f7271ed039cfc168fa2cf903ea0020bce4552b4f5","first_computed_at":"2026-07-04T15:03:00.398811Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:03:00.398811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y5dGCpCdJxK0tIHcnxjofhJSYycrSgJAlWW0C7jZ5XMmt1deEW9RipfrUZ6zppyijj3gHKfFU5xdpcH1Jj9tBg==","signature_status":"signed_v1","signed_at":"2026-07-04T15:03:00.399194Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0508047","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6953348a755a87ea46a884c79635983b92cfff2f4b330d2e57c535d29cfc86cc","sha256:1f1833c465dc3326d96c7f974da1fc5deff09a0b57b484c01c7afcfc93bffae9"],"state_sha256":"b56adb60f701f07caf20be4a4c78dba2dee988963a18da93a6a05cb740dd7d9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q0M+prqFRgigAFlgshPxgpr2CqF8wh7/XjXACSeYwlSq3SWQp7F5PfS5vxW+YiA6Gh70KdPSl07CdLtpNfscBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T02:43:53.586437Z","bundle_sha256":"615f39334d768b991402414d08d289f4aa8d4ce43f1197d4b2476fa243d77ee7"}}