{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:KMKZIXCU3AS4DY3SIPQLLOX33G","short_pith_number":"pith:KMKZIXCU","schema_version":"1.0","canonical_sha256":"5315945c54d825c1e37243e0b5bafbd98560178dec2c36c72c4f1d9baebe3cf9","source":{"kind":"arxiv","id":"1001.1658","version":2},"attestation_state":"computed","paper":{"title":"On the Capacity of Non-Coherent Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christina Fragouli, Mahdi Jafari Siavoshani, Soheil Mohajer, Suhas Diggavi","submitted_at":"2010-01-11T13:46:05Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1001.1658","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-11T13:46:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8adfa398d936e9435bf3c7281fdd3bf9c923fb79dbd5d4a139d208bc2f6e1a48","abstract_canon_sha256":"8c0f9d333aaa823b2b87068a0ee9a5587f2d166edaf4e0342a2698053fae9b0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:55.202750Z","signature_b64":"1zjY4J66HEzZE9x79GXdCIRkxrsZ77i2/cSej1CXhXg1nzcgvLNg7vm4O2a/thxmZwX3TEMc+vZTnip63pXNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5315945c54d825c1e37243e0b5bafbd98560178dec2c36c72c4f1d9baebe3cf9","last_reissued_at":"2026-05-18T04:35:55.202343Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:55.202343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Capacity of Non-Coherent Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christina Fragouli, Mahdi Jafari Siavoshani, Soheil Mohajer, Suhas Diggavi","submitted_at":"2010-01-11T13:46:05Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.1658","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1001.1658","created_at":"2026-05-18T04:35:55.202400+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.1658v2","created_at":"2026-05-18T04:35:55.202400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.1658","created_at":"2026-05-18T04:35:55.202400+00:00"},{"alias_kind":"pith_short_12","alias_value":"KMKZIXCU3AS4","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"KMKZIXCU3AS4DY3S","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"KMKZIXCU","created_at":"2026-05-18T12:26:09.077623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KMKZIXCU3AS4DY3SIPQLLOX33G","json":"https://pith.science/pith/KMKZIXCU3AS4DY3SIPQLLOX33G.json","graph_json":"https://pith.science/api/pith-number/KMKZIXCU3AS4DY3SIPQLLOX33G/graph.json","events_json":"https://pith.science/api/pith-number/KMKZIXCU3AS4DY3SIPQLLOX33G/events.json","paper":"https://pith.science/paper/KMKZIXCU"},"agent_actions":{"view_html":"https://pith.science/pith/KMKZIXCU3AS4DY3SIPQLLOX33G","download_json":"https://pith.science/pith/KMKZIXCU3AS4DY3SIPQLLOX33G.json","view_paper":"https://pith.science/paper/KMKZIXCU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.1658&json=true","fetch_graph":"https://pith.science/api/pith-number/KMKZIXCU3AS4DY3SIPQLLOX33G/graph.json","fetch_events":"https://pith.science/api/pith-number/KMKZIXCU3AS4DY3SIPQLLOX33G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KMKZIXCU3AS4DY3SIPQLLOX33G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KMKZIXCU3AS4DY3SIPQLLOX33G/action/storage_attestation","attest_author":"https://pith.science/pith/KMKZIXCU3AS4DY3SIPQLLOX33G/action/author_attestation","sign_citation":"https://pith.science/pith/KMKZIXCU3AS4DY3SIPQLLOX33G/action/citation_signature","submit_replication":"https://pith.science/pith/KMKZIXCU3AS4DY3SIPQLLOX33G/action/replication_record"}},"created_at":"2026-05-18T04:35:55.202400+00:00","updated_at":"2026-05-18T04:35:55.202400+00:00"}