{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:KMKZIXCU3AS4DY3SIPQLLOX33G","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":"8c0f9d333aaa823b2b87068a0ee9a5587f2d166edaf4e0342a2698053fae9b0e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-11T13:46:05Z","title_canon_sha256":"8adfa398d936e9435bf3c7281fdd3bf9c923fb79dbd5d4a139d208bc2f6e1a48"},"schema_version":"1.0","source":{"id":"1001.1658","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.1658","created_at":"2026-05-18T04:35:55Z"},{"alias_kind":"arxiv_version","alias_value":"1001.1658v2","created_at":"2026-05-18T04:35:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.1658","created_at":"2026-05-18T04:35:55Z"},{"alias_kind":"pith_short_12","alias_value":"KMKZIXCU3AS4","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KMKZIXCU3AS4DY3S","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KMKZIXCU","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:2f2040348e2b419af4ff118bcdac78068af35a618a2825df3f7a3d7efa8ba541","target":"graph","created_at":"2026-05-18T04:35:55Z","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 the problem of multicasting information from a source to a set of receivers over a network where intermediate network nodes perform randomized network coding operations on the source packets. We propose a channel model for the non-coherent network coding introduced by Koetter and Kschischang in [6], that captures the essence of such a network operation, and calculate the capacity as a function of network parameters. We prove that use of subspace coding is optimal, and show that, in some cases, the capacity-achieving distribution uses subspaces of several dimensions, where the emplo","authors_text":"Christina Fragouli, Mahdi Jafari Siavoshani, Soheil Mohajer, Suhas Diggavi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-11T13:46:05Z","title":"On the Capacity of Non-Coherent Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.1658","kind":"arxiv","version":2},"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:834790c64962a96352072f2e49a3a7632f2009505f7774ce5502986da474dc9c","target":"record","created_at":"2026-05-18T04:35:55Z","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":"8c0f9d333aaa823b2b87068a0ee9a5587f2d166edaf4e0342a2698053fae9b0e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-11T13:46:05Z","title_canon_sha256":"8adfa398d936e9435bf3c7281fdd3bf9c923fb79dbd5d4a139d208bc2f6e1a48"},"schema_version":"1.0","source":{"id":"1001.1658","kind":"arxiv","version":2}},"canonical_sha256":"5315945c54d825c1e37243e0b5bafbd98560178dec2c36c72c4f1d9baebe3cf9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5315945c54d825c1e37243e0b5bafbd98560178dec2c36c72c4f1d9baebe3cf9","first_computed_at":"2026-05-18T04:35:55.202343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:35:55.202343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1zjY4J66HEzZE9x79GXdCIRkxrsZ77i2/cSej1CXhXg1nzcgvLNg7vm4O2a/thxmZwX3TEMc+vZTnip63pXNCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:35:55.202750Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.1658","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:834790c64962a96352072f2e49a3a7632f2009505f7774ce5502986da474dc9c","sha256:2f2040348e2b419af4ff118bcdac78068af35a618a2825df3f7a3d7efa8ba541"],"state_sha256":"7ade7cbb6ed64fd1af8452c77b9ae5615c46d1220cc50fa0beeeb04d13e91c8f"}