{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2BK5RUJE3GRNP7NWL2223HN243","short_pith_number":"pith:2BK5RUJE","schema_version":"1.0","canonical_sha256":"d055d8d124d9a2d7fdb65eb5ad9dbae6e057bb0b97bd64b794afacbb11da47bb","source":{"kind":"arxiv","id":"1704.01891","version":1},"attestation_state":"computed","paper":{"title":"On Multi-source Networks: Enumeration, Rate Region Computation, and Hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Congduan Li, John MacLaren Walsh, Steven Weber","submitted_at":"2017-04-06T15:36:42Z","abstract_excerpt":"Recent algorithmic developments have enabled computers to automatically determine and prove the capacity regions of small hypergraph networks under network coding. A structural theory relating network coding problems of different sizes is developed to make best use of this newfound computational capability. A formal notion of network minimality is developed which removes components of a network coding problem that are inessential to its core complexity. Equivalence between different network coding problems under relabeling is formalized via group actions, an algorithm which can directly list s"},"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":"1704.01891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-06T15:36:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"50553b11ee01ce68ebceffaa182f796dde2b8ab96ced802ef67348a2816ef69f","abstract_canon_sha256":"7b4ae9bf54cc8a08c4bcbaea7963580714184e71e8281ea7cfcadd0288b8e771"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:54.072453Z","signature_b64":"a0WV8wEHt5E+2uozUP5UFQLeCkbk0EUYK8H+7yqF0jOeNZhw8JmBtnCbjRYemT84j3nx67aK6jW7n1Z8sgH2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d055d8d124d9a2d7fdb65eb5ad9dbae6e057bb0b97bd64b794afacbb11da47bb","last_reissued_at":"2026-05-18T00:46:54.071936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:54.071936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Multi-source Networks: Enumeration, Rate Region Computation, and Hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Congduan Li, John MacLaren Walsh, Steven Weber","submitted_at":"2017-04-06T15:36:42Z","abstract_excerpt":"Recent algorithmic developments have enabled computers to automatically determine and prove the capacity regions of small hypergraph networks under network coding. A structural theory relating network coding problems of different sizes is developed to make best use of this newfound computational capability. A formal notion of network minimality is developed which removes components of a network coding problem that are inessential to its core complexity. Equivalence between different network coding problems under relabeling is formalized via group actions, an algorithm which can directly list s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01891","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.01891","created_at":"2026-05-18T00:46:54.072021+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.01891v1","created_at":"2026-05-18T00:46:54.072021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01891","created_at":"2026-05-18T00:46:54.072021+00:00"},{"alias_kind":"pith_short_12","alias_value":"2BK5RUJE3GRN","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2BK5RUJE3GRNP7NW","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2BK5RUJE","created_at":"2026-05-18T12:30:55.937587+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/2BK5RUJE3GRNP7NWL2223HN243","json":"https://pith.science/pith/2BK5RUJE3GRNP7NWL2223HN243.json","graph_json":"https://pith.science/api/pith-number/2BK5RUJE3GRNP7NWL2223HN243/graph.json","events_json":"https://pith.science/api/pith-number/2BK5RUJE3GRNP7NWL2223HN243/events.json","paper":"https://pith.science/paper/2BK5RUJE"},"agent_actions":{"view_html":"https://pith.science/pith/2BK5RUJE3GRNP7NWL2223HN243","download_json":"https://pith.science/pith/2BK5RUJE3GRNP7NWL2223HN243.json","view_paper":"https://pith.science/paper/2BK5RUJE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.01891&json=true","fetch_graph":"https://pith.science/api/pith-number/2BK5RUJE3GRNP7NWL2223HN243/graph.json","fetch_events":"https://pith.science/api/pith-number/2BK5RUJE3GRNP7NWL2223HN243/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2BK5RUJE3GRNP7NWL2223HN243/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2BK5RUJE3GRNP7NWL2223HN243/action/storage_attestation","attest_author":"https://pith.science/pith/2BK5RUJE3GRNP7NWL2223HN243/action/author_attestation","sign_citation":"https://pith.science/pith/2BK5RUJE3GRNP7NWL2223HN243/action/citation_signature","submit_replication":"https://pith.science/pith/2BK5RUJE3GRNP7NWL2223HN243/action/replication_record"}},"created_at":"2026-05-18T00:46:54.072021+00:00","updated_at":"2026-05-18T00:46:54.072021+00:00"}