{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2BK5RUJE3GRNP7NWL2223HN243","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":"7b4ae9bf54cc8a08c4bcbaea7963580714184e71e8281ea7cfcadd0288b8e771","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-06T15:36:42Z","title_canon_sha256":"50553b11ee01ce68ebceffaa182f796dde2b8ab96ced802ef67348a2816ef69f"},"schema_version":"1.0","source":{"id":"1704.01891","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01891","created_at":"2026-05-18T00:46:54Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01891v1","created_at":"2026-05-18T00:46:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01891","created_at":"2026-05-18T00:46:54Z"},{"alias_kind":"pith_short_12","alias_value":"2BK5RUJE3GRN","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2BK5RUJE3GRNP7NW","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2BK5RUJE","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:e0a51f5ba7eac1384bf1f7abb64e6af956d86367e6247dbbcf3ac648ce41e60b","target":"graph","created_at":"2026-05-18T00:46:54Z","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":"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","authors_text":"Congduan Li, John MacLaren Walsh, Steven Weber","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-06T15:36:42Z","title":"On Multi-source Networks: Enumeration, Rate Region Computation, and Hierarchy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01891","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:0df85abbe13ce769c314d4698e57d57af49b808946f05951f26322dd9c562130","target":"record","created_at":"2026-05-18T00:46:54Z","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":"7b4ae9bf54cc8a08c4bcbaea7963580714184e71e8281ea7cfcadd0288b8e771","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-06T15:36:42Z","title_canon_sha256":"50553b11ee01ce68ebceffaa182f796dde2b8ab96ced802ef67348a2816ef69f"},"schema_version":"1.0","source":{"id":"1704.01891","kind":"arxiv","version":1}},"canonical_sha256":"d055d8d124d9a2d7fdb65eb5ad9dbae6e057bb0b97bd64b794afacbb11da47bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d055d8d124d9a2d7fdb65eb5ad9dbae6e057bb0b97bd64b794afacbb11da47bb","first_computed_at":"2026-05-18T00:46:54.071936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:54.071936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a0WV8wEHt5E+2uozUP5UFQLeCkbk0EUYK8H+7yqF0jOeNZhw8JmBtnCbjRYemT84j3nx67aK6jW7n1Z8sgH2BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:54.072453Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.01891","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0df85abbe13ce769c314d4698e57d57af49b808946f05951f26322dd9c562130","sha256:e0a51f5ba7eac1384bf1f7abb64e6af956d86367e6247dbbcf3ac648ce41e60b"],"state_sha256":"00269f6ea60dcb047afec0b7287c9b84f8089905556b1a216fa5dd40d549e8b3"}