{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2ZYBDU54VUCCURPIZXZJRWV4RD","short_pith_number":"pith:2ZYBDU54","schema_version":"1.0","canonical_sha256":"d67011d3bcad042a45e8cdf298dabc88d4ad7d0a3a145e889cf1accb84680024","source":{"kind":"arxiv","id":"1305.3706","version":2},"attestation_state":"computed","paper":{"title":"Cut-Set Bounds on Network Information Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Grant, Satyajit Thakor, Terence Chan","submitted_at":"2013-05-16T08:22:08Z","abstract_excerpt":"Explicit characterization of the capacity region of communication networks is a long standing problem. While it is known that network coding can outperform routing and replication, the set of feasible rates is not known in general. Characterizing the network coding capacity region requires determination of the set of all entropic vectors. Furthermore, computing the explicitly known linear programming bound is infeasible in practice due to an exponential growth in complexity as a function of network size. This paper focuses on the fundamental problems of characterization and computation of oute"},"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":"1305.3706","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-16T08:22:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"02c6f67d0936139ae4a48603bf364ce288724d03e891b36a39d6823b4dad8139","abstract_canon_sha256":"aa20c3d2d7d23828face519cb7b0c203dccd9e4704d005bd2e1ccd38036daa2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:21.020649Z","signature_b64":"nHcz8VwSlmza5W+q0ZPLbNikpXZw+qBjjz5xEVQRl6gmC2C8icUgoRqD05VbLPoybkoDGD68WeoEtr+Ez/Q/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d67011d3bcad042a45e8cdf298dabc88d4ad7d0a3a145e889cf1accb84680024","last_reissued_at":"2026-05-18T01:17:21.020189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:21.020189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cut-Set Bounds on Network Information Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Grant, Satyajit Thakor, Terence Chan","submitted_at":"2013-05-16T08:22:08Z","abstract_excerpt":"Explicit characterization of the capacity region of communication networks is a long standing problem. While it is known that network coding can outperform routing and replication, the set of feasible rates is not known in general. Characterizing the network coding capacity region requires determination of the set of all entropic vectors. Furthermore, computing the explicitly known linear programming bound is infeasible in practice due to an exponential growth in complexity as a function of network size. This paper focuses on the fundamental problems of characterization and computation of oute"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3706","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":"1305.3706","created_at":"2026-05-18T01:17:21.020250+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.3706v2","created_at":"2026-05-18T01:17:21.020250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3706","created_at":"2026-05-18T01:17:21.020250+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ZYBDU54VUCC","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ZYBDU54VUCCURPI","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ZYBDU54","created_at":"2026-05-18T12:27:32.513160+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/2ZYBDU54VUCCURPIZXZJRWV4RD","json":"https://pith.science/pith/2ZYBDU54VUCCURPIZXZJRWV4RD.json","graph_json":"https://pith.science/api/pith-number/2ZYBDU54VUCCURPIZXZJRWV4RD/graph.json","events_json":"https://pith.science/api/pith-number/2ZYBDU54VUCCURPIZXZJRWV4RD/events.json","paper":"https://pith.science/paper/2ZYBDU54"},"agent_actions":{"view_html":"https://pith.science/pith/2ZYBDU54VUCCURPIZXZJRWV4RD","download_json":"https://pith.science/pith/2ZYBDU54VUCCURPIZXZJRWV4RD.json","view_paper":"https://pith.science/paper/2ZYBDU54","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.3706&json=true","fetch_graph":"https://pith.science/api/pith-number/2ZYBDU54VUCCURPIZXZJRWV4RD/graph.json","fetch_events":"https://pith.science/api/pith-number/2ZYBDU54VUCCURPIZXZJRWV4RD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ZYBDU54VUCCURPIZXZJRWV4RD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ZYBDU54VUCCURPIZXZJRWV4RD/action/storage_attestation","attest_author":"https://pith.science/pith/2ZYBDU54VUCCURPIZXZJRWV4RD/action/author_attestation","sign_citation":"https://pith.science/pith/2ZYBDU54VUCCURPIZXZJRWV4RD/action/citation_signature","submit_replication":"https://pith.science/pith/2ZYBDU54VUCCURPIZXZJRWV4RD/action/replication_record"}},"created_at":"2026-05-18T01:17:21.020250+00:00","updated_at":"2026-05-18T01:17:21.020250+00:00"}