{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:I3VYIUZNLBVFIES6DQM6LZPUBB","short_pith_number":"pith:I3VYIUZN","schema_version":"1.0","canonical_sha256":"46eb84532d586a54125e1c19e5e5f40865a6514ef3687efe32ca1f53c11bea36","source":{"kind":"arxiv","id":"1507.05728","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":"2015-07-21T07:27:36Z","abstract_excerpt":"This paper investigates the enumeration, rate region computation, and hierarchy of general multi-source multi-sink hyperedge networks under network coding, which includes multiple network models, such as independent distributed storage systems and index coding problems, as special cases. A notion of minimal networks and a notion of network equivalence under group action are defined. An efficient algorithm capable of directly listing single minimal canonical representatives from each network equivalence class is presented and utilized to list all minimal canonical networks with up to 5 sources "},"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":"1507.05728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-21T07:27:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"50553b11ee01ce68ebceffaa182f796dde2b8ab96ced802ef67348a2816ef69f","abstract_canon_sha256":"dea28515ac6339b0bab2ff6696ebd89a2375a1e9a600b37cf84c5148f09f5619"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:32.646341Z","signature_b64":"5GAVSh32nD1ZTOSyy0i5HpErxV9pZCPWqAjGLdhTAcAdraC9e00ZbKkFzH+1PxawMzMACfzLSGCEWQdrAi7VCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46eb84532d586a54125e1c19e5e5f40865a6514ef3687efe32ca1f53c11bea36","last_reissued_at":"2026-05-18T01:36:32.645778Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:32.645778Z","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":"2015-07-21T07:27:36Z","abstract_excerpt":"This paper investigates the enumeration, rate region computation, and hierarchy of general multi-source multi-sink hyperedge networks under network coding, which includes multiple network models, such as independent distributed storage systems and index coding problems, as special cases. A notion of minimal networks and a notion of network equivalence under group action are defined. An efficient algorithm capable of directly listing single minimal canonical representatives from each network equivalence class is presented and utilized to list all minimal canonical networks with up to 5 sources "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05728","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":"1507.05728","created_at":"2026-05-18T01:36:32.645905+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.05728v1","created_at":"2026-05-18T01:36:32.645905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05728","created_at":"2026-05-18T01:36:32.645905+00:00"},{"alias_kind":"pith_short_12","alias_value":"I3VYIUZNLBVF","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"I3VYIUZNLBVFIES6","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"I3VYIUZN","created_at":"2026-05-18T12:29:25.134429+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/I3VYIUZNLBVFIES6DQM6LZPUBB","json":"https://pith.science/pith/I3VYIUZNLBVFIES6DQM6LZPUBB.json","graph_json":"https://pith.science/api/pith-number/I3VYIUZNLBVFIES6DQM6LZPUBB/graph.json","events_json":"https://pith.science/api/pith-number/I3VYIUZNLBVFIES6DQM6LZPUBB/events.json","paper":"https://pith.science/paper/I3VYIUZN"},"agent_actions":{"view_html":"https://pith.science/pith/I3VYIUZNLBVFIES6DQM6LZPUBB","download_json":"https://pith.science/pith/I3VYIUZNLBVFIES6DQM6LZPUBB.json","view_paper":"https://pith.science/paper/I3VYIUZN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.05728&json=true","fetch_graph":"https://pith.science/api/pith-number/I3VYIUZNLBVFIES6DQM6LZPUBB/graph.json","fetch_events":"https://pith.science/api/pith-number/I3VYIUZNLBVFIES6DQM6LZPUBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I3VYIUZNLBVFIES6DQM6LZPUBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I3VYIUZNLBVFIES6DQM6LZPUBB/action/storage_attestation","attest_author":"https://pith.science/pith/I3VYIUZNLBVFIES6DQM6LZPUBB/action/author_attestation","sign_citation":"https://pith.science/pith/I3VYIUZNLBVFIES6DQM6LZPUBB/action/citation_signature","submit_replication":"https://pith.science/pith/I3VYIUZNLBVFIES6DQM6LZPUBB/action/replication_record"}},"created_at":"2026-05-18T01:36:32.645905+00:00","updated_at":"2026-05-18T01:36:32.645905+00:00"}