{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:W25UP47GPQWJRJLTGZHZ5NNTK7","short_pith_number":"pith:W25UP47G","schema_version":"1.0","canonical_sha256":"b6bb47f3e67c2c98a573364f9eb5b357f183c7d28275310ecec488cfffaf5a13","source":{"kind":"arxiv","id":"1502.04273","version":1},"attestation_state":"computed","paper":{"title":"Multicoding Schemes for Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ayfer \\\"Ozg\\\"ur, Haim Permuter, Ritesh Kolte","submitted_at":"2015-02-15T02:51:34Z","abstract_excerpt":"The best known inner bound for the 2-user discrete memoryless interference channel is the Han-Kobayashi rate region. The coding schemes that achieve this region are based on rate-splitting and superposition coding. In this paper, we develop a multicoding scheme to achieve the same rate region. A key advantage of the multicoding nature of the proposed coding scheme is that it can be naturally extended to more general settings, such as when encoders have state information or can overhear each other. In particular, we extend our coding scheme to characterize the capacity region of the state-depen"},"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":"1502.04273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-15T02:51:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8ba731b4c37fa0d56e3cfd5fb4a7ffc44c482c857816f7639fdfcd4c6dd507de","abstract_canon_sha256":"7857a9d8b5bd9c7471ff50e48c9ec6b18dea1343f4e752a1d45a8619688e9e8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:00.084039Z","signature_b64":"7kkQTvFs3ScANoiP3Znc6L1GTaK8skgqItTIRYCwFOflqro6CDKP44cWeS+IMLDfgyPaoe9WbtwCSHCY9VWbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6bb47f3e67c2c98a573364f9eb5b357f183c7d28275310ecec488cfffaf5a13","last_reissued_at":"2026-05-18T02:27:00.083387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:00.083387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multicoding Schemes for Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ayfer \\\"Ozg\\\"ur, Haim Permuter, Ritesh Kolte","submitted_at":"2015-02-15T02:51:34Z","abstract_excerpt":"The best known inner bound for the 2-user discrete memoryless interference channel is the Han-Kobayashi rate region. The coding schemes that achieve this region are based on rate-splitting and superposition coding. In this paper, we develop a multicoding scheme to achieve the same rate region. A key advantage of the multicoding nature of the proposed coding scheme is that it can be naturally extended to more general settings, such as when encoders have state information or can overhear each other. In particular, we extend our coding scheme to characterize the capacity region of the state-depen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04273","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":"1502.04273","created_at":"2026-05-18T02:27:00.083505+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.04273v1","created_at":"2026-05-18T02:27:00.083505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04273","created_at":"2026-05-18T02:27:00.083505+00:00"},{"alias_kind":"pith_short_12","alias_value":"W25UP47GPQWJ","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"W25UP47GPQWJRJLT","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"W25UP47G","created_at":"2026-05-18T12:29:47.479230+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/W25UP47GPQWJRJLTGZHZ5NNTK7","json":"https://pith.science/pith/W25UP47GPQWJRJLTGZHZ5NNTK7.json","graph_json":"https://pith.science/api/pith-number/W25UP47GPQWJRJLTGZHZ5NNTK7/graph.json","events_json":"https://pith.science/api/pith-number/W25UP47GPQWJRJLTGZHZ5NNTK7/events.json","paper":"https://pith.science/paper/W25UP47G"},"agent_actions":{"view_html":"https://pith.science/pith/W25UP47GPQWJRJLTGZHZ5NNTK7","download_json":"https://pith.science/pith/W25UP47GPQWJRJLTGZHZ5NNTK7.json","view_paper":"https://pith.science/paper/W25UP47G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.04273&json=true","fetch_graph":"https://pith.science/api/pith-number/W25UP47GPQWJRJLTGZHZ5NNTK7/graph.json","fetch_events":"https://pith.science/api/pith-number/W25UP47GPQWJRJLTGZHZ5NNTK7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W25UP47GPQWJRJLTGZHZ5NNTK7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W25UP47GPQWJRJLTGZHZ5NNTK7/action/storage_attestation","attest_author":"https://pith.science/pith/W25UP47GPQWJRJLTGZHZ5NNTK7/action/author_attestation","sign_citation":"https://pith.science/pith/W25UP47GPQWJRJLTGZHZ5NNTK7/action/citation_signature","submit_replication":"https://pith.science/pith/W25UP47GPQWJRJLTGZHZ5NNTK7/action/replication_record"}},"created_at":"2026-05-18T02:27:00.083505+00:00","updated_at":"2026-05-18T02:27:00.083505+00:00"}