{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:N4X65U63QZ4P3HBCNW2EIAFK7X","short_pith_number":"pith:N4X65U63","canonical_record":{"source":{"id":"cs/0508124","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-08-29T09:47:20Z","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"title_canon_sha256":"5066f3ba98498f76ce92b4554b03f875d03ddb0a71d058239eef1d3ab0342a98","abstract_canon_sha256":"cc0f3a4ef954c712c4a389fbc3bd9c849a11bca486d9fff1e52de65f8aa10dd6"},"schema_version":"1.0"},"canonical_sha256":"6f2feed3db8678fd9c226db44400aafdd58f643a0512db08f17371fbca86e46d","source":{"kind":"arxiv","id":"cs/0508124","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0508124","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0508124v1","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508124","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"N4X65U63QZ4P","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"N4X65U63QZ4P3HBC","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"N4X65U63","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:N4X65U63QZ4P3HBCNW2EIAFK7X","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0508124","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-08-29T09:47:20Z","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"title_canon_sha256":"5066f3ba98498f76ce92b4554b03f875d03ddb0a71d058239eef1d3ab0342a98","abstract_canon_sha256":"cc0f3a4ef954c712c4a389fbc3bd9c849a11bca486d9fff1e52de65f8aa10dd6"},"schema_version":"1.0"},"canonical_sha256":"6f2feed3db8678fd9c226db44400aafdd58f643a0512db08f17371fbca86e46d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:26.704667Z","signature_b64":"Gt2QGyuOdfvNWJtd4v6DbFzIrqxc9VwbWDQn850v7FDHVQC3bzI33wmaUG7qQ8wbzgETIktqK2BdZzggnHP6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f2feed3db8678fd9c226db44400aafdd58f643a0512db08f17371fbca86e46d","last_reissued_at":"2026-05-18T00:58:26.704089Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:26.704089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0508124","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:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b72t/NbosXI/InWMAtjprFJqUbjhJq0pffUSsXU0UynQJ5yE2KqTRqLldugxcu8sxjg1jyFPQyOneWqY8DviCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:19:54.652828Z"},"content_sha256":"4d8dd979f3a1dfb9abced00614fa8d977ab99975e4a39ee2992186c870633abb","schema_version":"1.0","event_id":"sha256:4d8dd979f3a1dfb9abced00614fa8d977ab99975e4a39ee2992186c870633abb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:N4X65U63QZ4P3HBCNW2EIAFK7X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coding Schemes for Line Networks","license":"","headline":"","cross_cats":["cs.DC","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Amin Shokrollahi, Christina Fragouli, Payam Pakzad","submitted_at":"2005-08-29T09:47:20Z","abstract_excerpt":"We consider a simple network, where a source and destination node are connected with a line of erasure channels. It is well known that in order to achieve the min-cut capacity, the intermediate nodes are required to process the information. We propose coding schemes for this setting, and discuss each scheme in terms of complexity, delay, achievable rate, memory requirement, and adaptability to unknown channel parameters. We also briefly discuss how these schemes can be extended to more general networks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0508124","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:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u8qkFzMcQHIFwenTzt0EurA5veFbf5iccPZA+w0lEkCoK1c9IhXj4ACJQAo0GZwAk3AGzvYOYnFnIJFwLkeFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:19:54.653166Z"},"content_sha256":"b227316bd93ed4b2b065af3355036332c21f61e247d92d715402d8b22d17e2c6","schema_version":"1.0","event_id":"sha256:b227316bd93ed4b2b065af3355036332c21f61e247d92d715402d8b22d17e2c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N4X65U63QZ4P3HBCNW2EIAFK7X/bundle.json","state_url":"https://pith.science/pith/N4X65U63QZ4P3HBCNW2EIAFK7X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N4X65U63QZ4P3HBCNW2EIAFK7X/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-05-31T07:19:54Z","links":{"resolver":"https://pith.science/pith/N4X65U63QZ4P3HBCNW2EIAFK7X","bundle":"https://pith.science/pith/N4X65U63QZ4P3HBCNW2EIAFK7X/bundle.json","state":"https://pith.science/pith/N4X65U63QZ4P3HBCNW2EIAFK7X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N4X65U63QZ4P3HBCNW2EIAFK7X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:N4X65U63QZ4P3HBCNW2EIAFK7X","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":"cc0f3a4ef954c712c4a389fbc3bd9c849a11bca486d9fff1e52de65f8aa10dd6","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-08-29T09:47:20Z","title_canon_sha256":"5066f3ba98498f76ce92b4554b03f875d03ddb0a71d058239eef1d3ab0342a98"},"schema_version":"1.0","source":{"id":"cs/0508124","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0508124","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0508124v1","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508124","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"N4X65U63QZ4P","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"N4X65U63QZ4P3HBC","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"N4X65U63","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:b227316bd93ed4b2b065af3355036332c21f61e247d92d715402d8b22d17e2c6","target":"graph","created_at":"2026-05-18T00:58:26Z","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":"We consider a simple network, where a source and destination node are connected with a line of erasure channels. It is well known that in order to achieve the min-cut capacity, the intermediate nodes are required to process the information. We propose coding schemes for this setting, and discuss each scheme in terms of complexity, delay, achievable rate, memory requirement, and adaptability to unknown channel parameters. We also briefly discuss how these schemes can be extended to more general networks.","authors_text":"Amin Shokrollahi, Christina Fragouli, Payam Pakzad","cross_cats":["cs.DC","cs.NI","math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2005-08-29T09:47:20Z","title":"Coding Schemes for Line Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0508124","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:4d8dd979f3a1dfb9abced00614fa8d977ab99975e4a39ee2992186c870633abb","target":"record","created_at":"2026-05-18T00:58:26Z","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":"cc0f3a4ef954c712c4a389fbc3bd9c849a11bca486d9fff1e52de65f8aa10dd6","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-08-29T09:47:20Z","title_canon_sha256":"5066f3ba98498f76ce92b4554b03f875d03ddb0a71d058239eef1d3ab0342a98"},"schema_version":"1.0","source":{"id":"cs/0508124","kind":"arxiv","version":1}},"canonical_sha256":"6f2feed3db8678fd9c226db44400aafdd58f643a0512db08f17371fbca86e46d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f2feed3db8678fd9c226db44400aafdd58f643a0512db08f17371fbca86e46d","first_computed_at":"2026-05-18T00:58:26.704089Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:26.704089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gt2QGyuOdfvNWJtd4v6DbFzIrqxc9VwbWDQn850v7FDHVQC3bzI33wmaUG7qQ8wbzgETIktqK2BdZzggnHP6Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:26.704667Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0508124","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d8dd979f3a1dfb9abced00614fa8d977ab99975e4a39ee2992186c870633abb","sha256:b227316bd93ed4b2b065af3355036332c21f61e247d92d715402d8b22d17e2c6"],"state_sha256":"4879c102475ca1629c01c11311cd81ecbc28d851cfadfff395a2fd5507b786dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dkftB2XIYQrqQ9xDivUHR3TyA/NhmT0pVGW9SADCyr7r8jhbXpWLDXME6E2lTXv2/4ZjFJMs1AgwXPUX1EOpAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:19:54.655308Z","bundle_sha256":"02ea3494a03fb6c38359410cf02c2a829371a8fc6299ce07bb52ee270008b08b"}}