{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FWHDSD6LABKQBHZ7WEV2KJIREG","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":"f35f483154d21cdea66e03a5589c90915b2f62e19932c9dbfa28219163a90c10","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-28T19:55:23Z","title_canon_sha256":"34413f3f70b754a155d764cffd87926cbd68a4aaecf650f0466c8768dfd0cd22"},"schema_version":"1.0","source":{"id":"1105.5736","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5736","created_at":"2026-05-18T02:21:49Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5736v1","created_at":"2026-05-18T02:21:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5736","created_at":"2026-05-18T02:21:49Z"},{"alias_kind":"pith_short_12","alias_value":"FWHDSD6LABKQ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FWHDSD6LABKQBHZ7","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FWHDSD6L","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:ee2618087e4efbe1413dea1ca5be649837c8620ffac5b0dc0abdf1656aa9f672","target":"graph","created_at":"2026-05-18T02:21:49Z","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":"In this paper, the problem of designing network codes that are both communicationally and computationally efficient over packet line networks with worst-case schedules is considered. In this context, random linear network codes (dense codes) are asymptotically capacity-achieving, but require highly complex coding operations. To reduce the coding complexity, Maymounkov et al. proposed chunked codes (CC). Chunked codes operate by splitting the message into non-overlapping chunks and send a randomly chosen chunk at each transmission time by a dense code. The complexity, that is linear in the chun","authors_text":"Amir H. Banihashemi, Anoosheh Heidarzadeh","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-28T19:55:23Z","title":"Network Codes with Overlapping Chunks over Line Networks: A Case for Linear-Time Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5736","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:b330ca2a6a60d693051157d8825ca336e5e0eadaff2afa4d8457bc4aae97e774","target":"record","created_at":"2026-05-18T02:21:49Z","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":"f35f483154d21cdea66e03a5589c90915b2f62e19932c9dbfa28219163a90c10","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-28T19:55:23Z","title_canon_sha256":"34413f3f70b754a155d764cffd87926cbd68a4aaecf650f0466c8768dfd0cd22"},"schema_version":"1.0","source":{"id":"1105.5736","kind":"arxiv","version":1}},"canonical_sha256":"2d8e390fcb0055009f3fb12ba5251121bca93a237930960d52198fb17c6291a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d8e390fcb0055009f3fb12ba5251121bca93a237930960d52198fb17c6291a4","first_computed_at":"2026-05-18T02:21:49.448283Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:49.448283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CaVv7e1Vij9L/4f2XiUZ0xLzcjrkcnA42YZ6JBujkqVuX3nmIVY2IjKxd66mf27B4imts14aViwJBfs/tZkLCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:49.448750Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.5736","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b330ca2a6a60d693051157d8825ca336e5e0eadaff2afa4d8457bc4aae97e774","sha256:ee2618087e4efbe1413dea1ca5be649837c8620ffac5b0dc0abdf1656aa9f672"],"state_sha256":"6b4cf8c161d3917488c2cd0935d54516991ac9ac9ac736c318e09fa59eb37e5e"}