{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TRTWL6VL4MDDAFCCYUXULWNWF2","short_pith_number":"pith:TRTWL6VL","schema_version":"1.0","canonical_sha256":"9c6765faabe306301442c52f45d9b62e9ffedcb3b02d451e219b3ade12fe0325","source":{"kind":"arxiv","id":"1510.03951","version":1},"attestation_state":"computed","paper":{"title":"Are Generalized Cut-Set Bounds Tight for the Deterministic Interference Channel?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Salman Avestimehr, Mehrdad Kiamari","submitted_at":"2015-10-14T02:36:33Z","abstract_excerpt":"We propose the idea of extended networks, which is constructed by replicating the users in the two-user deterministic interference channel (DIC) and designing the interference structure among them, such that any rate that can be achieved by each user in the original network can also be achieved simultaneously by all replicas of that user in the extended network. We demonstrate that by carefully designing extended networks and applying the generalized cut-set (GCS) bound to them, we can derive a tight converse for the two-user DIC. Furthermore, we generalize our techniques to the three-user DIC"},"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":"1510.03951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-14T02:36:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5d15bdc810e03cc6997e2a5e2590f057f66909793875adc0c70b46bdb542f49f","abstract_canon_sha256":"e055e936e40fb6ed59da6e1e8bb6494e085fd0093f077addb5b56836277fc566"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:09.707830Z","signature_b64":"17A54mpKfdofZ6vjCB/OQSSimMeZvaYwV9ZBihAwTint+dYAi0OGUVnKFYWgRkNTNKfjjwlYjMKRrJRnurO3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c6765faabe306301442c52f45d9b62e9ffedcb3b02d451e219b3ade12fe0325","last_reissued_at":"2026-05-18T01:30:09.707242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:09.707242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Are Generalized Cut-Set Bounds Tight for the Deterministic Interference Channel?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Salman Avestimehr, Mehrdad Kiamari","submitted_at":"2015-10-14T02:36:33Z","abstract_excerpt":"We propose the idea of extended networks, which is constructed by replicating the users in the two-user deterministic interference channel (DIC) and designing the interference structure among them, such that any rate that can be achieved by each user in the original network can also be achieved simultaneously by all replicas of that user in the extended network. We demonstrate that by carefully designing extended networks and applying the generalized cut-set (GCS) bound to them, we can derive a tight converse for the two-user DIC. Furthermore, we generalize our techniques to the three-user DIC"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03951","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":"1510.03951","created_at":"2026-05-18T01:30:09.707331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.03951v1","created_at":"2026-05-18T01:30:09.707331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03951","created_at":"2026-05-18T01:30:09.707331+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRTWL6VL4MDD","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRTWL6VL4MDDAFCC","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRTWL6VL","created_at":"2026-05-18T12:29:42.218222+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/TRTWL6VL4MDDAFCCYUXULWNWF2","json":"https://pith.science/pith/TRTWL6VL4MDDAFCCYUXULWNWF2.json","graph_json":"https://pith.science/api/pith-number/TRTWL6VL4MDDAFCCYUXULWNWF2/graph.json","events_json":"https://pith.science/api/pith-number/TRTWL6VL4MDDAFCCYUXULWNWF2/events.json","paper":"https://pith.science/paper/TRTWL6VL"},"agent_actions":{"view_html":"https://pith.science/pith/TRTWL6VL4MDDAFCCYUXULWNWF2","download_json":"https://pith.science/pith/TRTWL6VL4MDDAFCCYUXULWNWF2.json","view_paper":"https://pith.science/paper/TRTWL6VL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.03951&json=true","fetch_graph":"https://pith.science/api/pith-number/TRTWL6VL4MDDAFCCYUXULWNWF2/graph.json","fetch_events":"https://pith.science/api/pith-number/TRTWL6VL4MDDAFCCYUXULWNWF2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRTWL6VL4MDDAFCCYUXULWNWF2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRTWL6VL4MDDAFCCYUXULWNWF2/action/storage_attestation","attest_author":"https://pith.science/pith/TRTWL6VL4MDDAFCCYUXULWNWF2/action/author_attestation","sign_citation":"https://pith.science/pith/TRTWL6VL4MDDAFCCYUXULWNWF2/action/citation_signature","submit_replication":"https://pith.science/pith/TRTWL6VL4MDDAFCCYUXULWNWF2/action/replication_record"}},"created_at":"2026-05-18T01:30:09.707331+00:00","updated_at":"2026-05-18T01:30:09.707331+00:00"}