{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZN7L65IPHJLMCC2YMEZQNY2BYO","short_pith_number":"pith:ZN7L65IP","schema_version":"1.0","canonical_sha256":"cb7ebf750f3a56c10b58613306e341c384a41c381d02f8d0626dec0c5888cb54","source":{"kind":"arxiv","id":"1103.3596","version":3},"attestation_state":"computed","paper":{"title":"Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding with Correlated Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amin Aminzadeh Gohari, Shenghao Yang, Sidharth Jaggi","submitted_at":"2011-03-18T10:45:52Z","abstract_excerpt":"Cut-set bounds on achievable rates for network communication protocols are not in general tight. In this paper we introduce a new technique for proving converses for the problem of transmission of correlated sources in networks, that results in bounds that are tighter than the corresponding cut-set bounds. We also define the concept of \"uncertainty region\" which might be of independent interest. We provide a full characterization of this region for the case of two correlated random variables. The bounding technique works as follows: on one hand we show that if the communication problem is solv"},"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":"1103.3596","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-18T10:45:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9ec995a3106cea63770993f1dbcc17bcaa1aeebfcbc186d655dd73cbda45acc6","abstract_canon_sha256":"dc3291a3e65cb33eff53c70847be98ff887a51a21e60bc42e55f54efd9045a7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:10.477818Z","signature_b64":"Evagc3+uyGZbtOAPujyagqu93In1jwebQYhL752TB/4hA1GdtlnF+hMFI5KzamWgtayhM+40ynsQVa2oBrmzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb7ebf750f3a56c10b58613306e341c384a41c381d02f8d0626dec0c5888cb54","last_reissued_at":"2026-05-18T04:21:10.477168Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:10.477168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding with Correlated Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amin Aminzadeh Gohari, Shenghao Yang, Sidharth Jaggi","submitted_at":"2011-03-18T10:45:52Z","abstract_excerpt":"Cut-set bounds on achievable rates for network communication protocols are not in general tight. In this paper we introduce a new technique for proving converses for the problem of transmission of correlated sources in networks, that results in bounds that are tighter than the corresponding cut-set bounds. We also define the concept of \"uncertainty region\" which might be of independent interest. We provide a full characterization of this region for the case of two correlated random variables. The bounding technique works as follows: on one hand we show that if the communication problem is solv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3596","kind":"arxiv","version":3},"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":"1103.3596","created_at":"2026-05-18T04:21:10.477273+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.3596v3","created_at":"2026-05-18T04:21:10.477273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3596","created_at":"2026-05-18T04:21:10.477273+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZN7L65IPHJLM","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZN7L65IPHJLMCC2Y","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZN7L65IP","created_at":"2026-05-18T12:26:47.523578+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/ZN7L65IPHJLMCC2YMEZQNY2BYO","json":"https://pith.science/pith/ZN7L65IPHJLMCC2YMEZQNY2BYO.json","graph_json":"https://pith.science/api/pith-number/ZN7L65IPHJLMCC2YMEZQNY2BYO/graph.json","events_json":"https://pith.science/api/pith-number/ZN7L65IPHJLMCC2YMEZQNY2BYO/events.json","paper":"https://pith.science/paper/ZN7L65IP"},"agent_actions":{"view_html":"https://pith.science/pith/ZN7L65IPHJLMCC2YMEZQNY2BYO","download_json":"https://pith.science/pith/ZN7L65IPHJLMCC2YMEZQNY2BYO.json","view_paper":"https://pith.science/paper/ZN7L65IP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.3596&json=true","fetch_graph":"https://pith.science/api/pith-number/ZN7L65IPHJLMCC2YMEZQNY2BYO/graph.json","fetch_events":"https://pith.science/api/pith-number/ZN7L65IPHJLMCC2YMEZQNY2BYO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZN7L65IPHJLMCC2YMEZQNY2BYO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZN7L65IPHJLMCC2YMEZQNY2BYO/action/storage_attestation","attest_author":"https://pith.science/pith/ZN7L65IPHJLMCC2YMEZQNY2BYO/action/author_attestation","sign_citation":"https://pith.science/pith/ZN7L65IPHJLMCC2YMEZQNY2BYO/action/citation_signature","submit_replication":"https://pith.science/pith/ZN7L65IPHJLMCC2YMEZQNY2BYO/action/replication_record"}},"created_at":"2026-05-18T04:21:10.477273+00:00","updated_at":"2026-05-18T04:21:10.477273+00:00"}