{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LCOE6TOULZ62GNDM5HBKWO6RPO","short_pith_number":"pith:LCOE6TOU","canonical_record":{"source":{"id":"1202.0343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-02T03:01:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ad1639f83eebb8575961589d5d910d3c5e82f6ebc710f793cdaa9a02fefd01bd","abstract_canon_sha256":"5ecb0af97fc18253e5507793834d09a73b0e31c274a62cca493787b042c4e24d"},"schema_version":"1.0"},"canonical_sha256":"589c4f4dd45e7da3346ce9c2ab3bd17bb385dc21c595d73a9fbc3105495a5f3e","source":{"kind":"arxiv","id":"1202.0343","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0343","created_at":"2026-05-18T04:03:18Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0343v1","created_at":"2026-05-18T04:03:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0343","created_at":"2026-05-18T04:03:18Z"},{"alias_kind":"pith_short_12","alias_value":"LCOE6TOULZ62","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LCOE6TOULZ62GNDM","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LCOE6TOU","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LCOE6TOULZ62GNDM5HBKWO6RPO","target":"record","payload":{"canonical_record":{"source":{"id":"1202.0343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-02T03:01:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ad1639f83eebb8575961589d5d910d3c5e82f6ebc710f793cdaa9a02fefd01bd","abstract_canon_sha256":"5ecb0af97fc18253e5507793834d09a73b0e31c274a62cca493787b042c4e24d"},"schema_version":"1.0"},"canonical_sha256":"589c4f4dd45e7da3346ce9c2ab3bd17bb385dc21c595d73a9fbc3105495a5f3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:18.648748Z","signature_b64":"4bGjJvshAOoVau+XLJOUxElWtfp4pi1tNdToMPi6afpc9/R93iSUWHx5MY4x8EYtK7uEb2zuXQ3Q3RxStppCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"589c4f4dd45e7da3346ce9c2ab3bd17bb385dc21c595d73a9fbc3105495a5f3e","last_reissued_at":"2026-05-18T04:03:18.648011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:18.648011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.0343","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-18T04:03:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nRKR/WAI8wxOtk1eK9oTqT8sfxjUgJ2UBU7DYBOCDbLbmVyY4upROuuFEdflKrglx2Re620ug2ov9dSpzEmOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:49:04.479721Z"},"content_sha256":"67290133788b68694b907e04cf0a05a742bc8edf6552c9a5333643d9623ddaa9","schema_version":"1.0","event_id":"sha256:67290133788b68694b907e04cf0a05a742bc8edf6552c9a5333643d9623ddaa9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LCOE6TOULZ62GNDM5HBKWO6RPO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How Fast Can Dense Codes Achieve the Min-Cut Capacity of Line Networks?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir H. Banihashemi, Anoosheh Heidarzadeh","submitted_at":"2012-02-02T03:01:20Z","abstract_excerpt":"In this paper, we study the coding delay and the average coding delay of random linear network codes (dense codes) over line networks with deterministic regular and Poisson transmission schedules. We consider both lossless networks and networks with Bernoulli losses. The upper bounds derived in this paper, which are in some cases more general, and in some other cases tighter, than the existing bounds, provide a more clear picture of the speed of convergence of dense codes to the min-cut capacity of line networks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0343","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-18T04:03:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qQdkPeDxQodprfxdGo9XLDEVw/3TQwOAKTA4Kia/fpHaXOK95mtX4mCYXYKtJ04PD+VH+pDX7g/zOUGofRXmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:49:04.480060Z"},"content_sha256":"5685ba65b8191cf0d02ac1dfaefb19811811b40dba581eb0393c68142cff769c","schema_version":"1.0","event_id":"sha256:5685ba65b8191cf0d02ac1dfaefb19811811b40dba581eb0393c68142cff769c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LCOE6TOULZ62GNDM5HBKWO6RPO/bundle.json","state_url":"https://pith.science/pith/LCOE6TOULZ62GNDM5HBKWO6RPO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LCOE6TOULZ62GNDM5HBKWO6RPO/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-20T07:49:04Z","links":{"resolver":"https://pith.science/pith/LCOE6TOULZ62GNDM5HBKWO6RPO","bundle":"https://pith.science/pith/LCOE6TOULZ62GNDM5HBKWO6RPO/bundle.json","state":"https://pith.science/pith/LCOE6TOULZ62GNDM5HBKWO6RPO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LCOE6TOULZ62GNDM5HBKWO6RPO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LCOE6TOULZ62GNDM5HBKWO6RPO","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":"5ecb0af97fc18253e5507793834d09a73b0e31c274a62cca493787b042c4e24d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-02T03:01:20Z","title_canon_sha256":"ad1639f83eebb8575961589d5d910d3c5e82f6ebc710f793cdaa9a02fefd01bd"},"schema_version":"1.0","source":{"id":"1202.0343","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0343","created_at":"2026-05-18T04:03:18Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0343v1","created_at":"2026-05-18T04:03:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0343","created_at":"2026-05-18T04:03:18Z"},{"alias_kind":"pith_short_12","alias_value":"LCOE6TOULZ62","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LCOE6TOULZ62GNDM","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LCOE6TOU","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:5685ba65b8191cf0d02ac1dfaefb19811811b40dba581eb0393c68142cff769c","target":"graph","created_at":"2026-05-18T04:03:18Z","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, we study the coding delay and the average coding delay of random linear network codes (dense codes) over line networks with deterministic regular and Poisson transmission schedules. We consider both lossless networks and networks with Bernoulli losses. The upper bounds derived in this paper, which are in some cases more general, and in some other cases tighter, than the existing bounds, provide a more clear picture of the speed of convergence of dense codes to the min-cut capacity of line networks.","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":"2012-02-02T03:01:20Z","title":"How Fast Can Dense Codes Achieve the Min-Cut Capacity of Line Networks?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0343","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:67290133788b68694b907e04cf0a05a742bc8edf6552c9a5333643d9623ddaa9","target":"record","created_at":"2026-05-18T04:03:18Z","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":"5ecb0af97fc18253e5507793834d09a73b0e31c274a62cca493787b042c4e24d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-02T03:01:20Z","title_canon_sha256":"ad1639f83eebb8575961589d5d910d3c5e82f6ebc710f793cdaa9a02fefd01bd"},"schema_version":"1.0","source":{"id":"1202.0343","kind":"arxiv","version":1}},"canonical_sha256":"589c4f4dd45e7da3346ce9c2ab3bd17bb385dc21c595d73a9fbc3105495a5f3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"589c4f4dd45e7da3346ce9c2ab3bd17bb385dc21c595d73a9fbc3105495a5f3e","first_computed_at":"2026-05-18T04:03:18.648011Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:18.648011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4bGjJvshAOoVau+XLJOUxElWtfp4pi1tNdToMPi6afpc9/R93iSUWHx5MY4x8EYtK7uEb2zuXQ3Q3RxStppCBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:18.648748Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0343","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67290133788b68694b907e04cf0a05a742bc8edf6552c9a5333643d9623ddaa9","sha256:5685ba65b8191cf0d02ac1dfaefb19811811b40dba581eb0393c68142cff769c"],"state_sha256":"16b86e9f27d3881835b02728e85b529dd21345bcf6ea57056f1672655c3ef9e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7yEyU06XpnafaE8qgwVKeFtPyY1dVON4kCkq4AQHANnCSnxYL/iQxC3V8TDAdbvwwS1g9ZR1Dq6AyXHxzIbTBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:49:04.481916Z","bundle_sha256":"aab78f634c6b79d29771dfb18f1b3a5003108f81c0e76744a9422bd1551fd6d7"}}