{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7HPVKR6KWGIJSZU5M2HHXMMMVG","short_pith_number":"pith:7HPVKR6K","schema_version":"1.0","canonical_sha256":"f9df5547cab19099669d668e7bb18ca9a5a038e9de79d2dda610a282e67bab08","source":{"kind":"arxiv","id":"1504.05294","version":2},"attestation_state":"computed","paper":{"title":"On Approximating the Sum-Rate for Multiple-Unicasts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Karthikeyan Shanmugam, Megasthenis Asteris","submitted_at":"2015-04-21T03:58:18Z","abstract_excerpt":"We study upper bounds on the sum-rate of multiple-unicasts. We approximate the Generalized Network Sharing Bound (GNS cut) of the multiple-unicasts network coding problem with $k$ independent sources. Our approximation algorithm runs in polynomial time and yields an upper bound on the joint source entropy rate, which is within an $O(\\log^2 k)$ factor from the GNS cut. It further yields a vector-linear network code that achieves joint source entropy rate within an $O(\\log^2 k)$ factor from the GNS cut, but \\emph{not} with independent sources: the code induces a correlation pattern among the sou"},"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":"1504.05294","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-21T03:58:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"81b09b0e02a688dbef62a0a40333bd4b770480ffef0b48e26d88be678aadb424","abstract_canon_sha256":"614f43187632198b8aa633070e6e3a559489b84c5c5ca2b103b52e125b4492f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:57.737561Z","signature_b64":"gCCQi0Bhz2NJREtS9UKJUeSuH2VIAWJGUoSE/bISX1hsYMYfp+RgJ9D4Q7cDuVSUKVuI8wfXAMnK4L3AnfVuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9df5547cab19099669d668e7bb18ca9a5a038e9de79d2dda610a282e67bab08","last_reissued_at":"2026-05-18T01:26:57.736976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:57.736976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Approximating the Sum-Rate for Multiple-Unicasts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Karthikeyan Shanmugam, Megasthenis Asteris","submitted_at":"2015-04-21T03:58:18Z","abstract_excerpt":"We study upper bounds on the sum-rate of multiple-unicasts. We approximate the Generalized Network Sharing Bound (GNS cut) of the multiple-unicasts network coding problem with $k$ independent sources. Our approximation algorithm runs in polynomial time and yields an upper bound on the joint source entropy rate, which is within an $O(\\log^2 k)$ factor from the GNS cut. It further yields a vector-linear network code that achieves joint source entropy rate within an $O(\\log^2 k)$ factor from the GNS cut, but \\emph{not} with independent sources: the code induces a correlation pattern among the sou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05294","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":"1504.05294","created_at":"2026-05-18T01:26:57.737071+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05294v2","created_at":"2026-05-18T01:26:57.737071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05294","created_at":"2026-05-18T01:26:57.737071+00:00"},{"alias_kind":"pith_short_12","alias_value":"7HPVKR6KWGIJ","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7HPVKR6KWGIJSZU5","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7HPVKR6K","created_at":"2026-05-18T12:29:10.953037+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/7HPVKR6KWGIJSZU5M2HHXMMMVG","json":"https://pith.science/pith/7HPVKR6KWGIJSZU5M2HHXMMMVG.json","graph_json":"https://pith.science/api/pith-number/7HPVKR6KWGIJSZU5M2HHXMMMVG/graph.json","events_json":"https://pith.science/api/pith-number/7HPVKR6KWGIJSZU5M2HHXMMMVG/events.json","paper":"https://pith.science/paper/7HPVKR6K"},"agent_actions":{"view_html":"https://pith.science/pith/7HPVKR6KWGIJSZU5M2HHXMMMVG","download_json":"https://pith.science/pith/7HPVKR6KWGIJSZU5M2HHXMMMVG.json","view_paper":"https://pith.science/paper/7HPVKR6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05294&json=true","fetch_graph":"https://pith.science/api/pith-number/7HPVKR6KWGIJSZU5M2HHXMMMVG/graph.json","fetch_events":"https://pith.science/api/pith-number/7HPVKR6KWGIJSZU5M2HHXMMMVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7HPVKR6KWGIJSZU5M2HHXMMMVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7HPVKR6KWGIJSZU5M2HHXMMMVG/action/storage_attestation","attest_author":"https://pith.science/pith/7HPVKR6KWGIJSZU5M2HHXMMMVG/action/author_attestation","sign_citation":"https://pith.science/pith/7HPVKR6KWGIJSZU5M2HHXMMMVG/action/citation_signature","submit_replication":"https://pith.science/pith/7HPVKR6KWGIJSZU5M2HHXMMMVG/action/replication_record"}},"created_at":"2026-05-18T01:26:57.737071+00:00","updated_at":"2026-05-18T01:26:57.737071+00:00"}