{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:W25UP47GPQWJRJLTGZHZ5NNTK7","short_pith_number":"pith:W25UP47G","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"},"canonical_sha256":"b6bb47f3e67c2c98a573364f9eb5b357f183c7d28275310ecec488cfffaf5a13","source":{"kind":"arxiv","id":"1502.04273","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04273","created_at":"2026-05-18T02:27:00Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04273v1","created_at":"2026-05-18T02:27:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04273","created_at":"2026-05-18T02:27:00Z"},{"alias_kind":"pith_short_12","alias_value":"W25UP47GPQWJ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W25UP47GPQWJRJLT","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W25UP47G","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:W25UP47GPQWJRJLTGZHZ5NNTK7","target":"record","payload":{"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"},"canonical_sha256":"b6bb47f3e67c2c98a573364f9eb5b357f183c7d28275310ecec488cfffaf5a13","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"},"source_kind":"arxiv","source_id":"1502.04273","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:27:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5RxHmaC6w9GBqyz8mCgUN00Gisc3wFrFz+DgDWR/dhymaAM0OFUu6qaBp+GkMINbkmB+tdnT8OxJurl9vRPbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:52:11.099518Z"},"content_sha256":"0ab6fadc942bef88288db2186e36cfd180d9a82a2eafdf61c51b79f6fb7a773a","schema_version":"1.0","event_id":"sha256:0ab6fadc942bef88288db2186e36cfd180d9a82a2eafdf61c51b79f6fb7a773a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:W25UP47GPQWJRJLTGZHZ5NNTK7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:27:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DvCFpHGrSHdC6s6/RPz4Cw7DUbjQ6wgZNkY/M0mcAje21Os1KO86vJFdYN3eSUPoBNXCJchByuJfPV2Y/mzdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:52:11.100226Z"},"content_sha256":"b7bc4489d49a7f8a12fba25cbd18111f321c1f9b7f4827d2a8e3ff9acd3ff4f5","schema_version":"1.0","event_id":"sha256:b7bc4489d49a7f8a12fba25cbd18111f321c1f9b7f4827d2a8e3ff9acd3ff4f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W25UP47GPQWJRJLTGZHZ5NNTK7/bundle.json","state_url":"https://pith.science/pith/W25UP47GPQWJRJLTGZHZ5NNTK7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W25UP47GPQWJRJLTGZHZ5NNTK7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T14:52:11Z","links":{"resolver":"https://pith.science/pith/W25UP47GPQWJRJLTGZHZ5NNTK7","bundle":"https://pith.science/pith/W25UP47GPQWJRJLTGZHZ5NNTK7/bundle.json","state":"https://pith.science/pith/W25UP47GPQWJRJLTGZHZ5NNTK7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W25UP47GPQWJRJLTGZHZ5NNTK7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:W25UP47GPQWJRJLTGZHZ5NNTK7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7857a9d8b5bd9c7471ff50e48c9ec6b18dea1343f4e752a1d45a8619688e9e8e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-15T02:51:34Z","title_canon_sha256":"8ba731b4c37fa0d56e3cfd5fb4a7ffc44c482c857816f7639fdfcd4c6dd507de"},"schema_version":"1.0","source":{"id":"1502.04273","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04273","created_at":"2026-05-18T02:27:00Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04273v1","created_at":"2026-05-18T02:27:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04273","created_at":"2026-05-18T02:27:00Z"},{"alias_kind":"pith_short_12","alias_value":"W25UP47GPQWJ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W25UP47GPQWJRJLT","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W25UP47G","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:b7bc4489d49a7f8a12fba25cbd18111f321c1f9b7f4827d2a8e3ff9acd3ff4f5","target":"graph","created_at":"2026-05-18T02:27:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ayfer \\\"Ozg\\\"ur, Haim Permuter, Ritesh Kolte","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-15T02:51:34Z","title":"Multicoding Schemes for Interference Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04273","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0ab6fadc942bef88288db2186e36cfd180d9a82a2eafdf61c51b79f6fb7a773a","target":"record","created_at":"2026-05-18T02:27:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7857a9d8b5bd9c7471ff50e48c9ec6b18dea1343f4e752a1d45a8619688e9e8e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-15T02:51:34Z","title_canon_sha256":"8ba731b4c37fa0d56e3cfd5fb4a7ffc44c482c857816f7639fdfcd4c6dd507de"},"schema_version":"1.0","source":{"id":"1502.04273","kind":"arxiv","version":1}},"canonical_sha256":"b6bb47f3e67c2c98a573364f9eb5b357f183c7d28275310ecec488cfffaf5a13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6bb47f3e67c2c98a573364f9eb5b357f183c7d28275310ecec488cfffaf5a13","first_computed_at":"2026-05-18T02:27:00.083387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:00.083387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7kkQTvFs3ScANoiP3Znc6L1GTaK8skgqItTIRYCwFOflqro6CDKP44cWeS+IMLDfgyPaoe9WbtwCSHCY9VWbCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:00.084039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04273","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ab6fadc942bef88288db2186e36cfd180d9a82a2eafdf61c51b79f6fb7a773a","sha256:b7bc4489d49a7f8a12fba25cbd18111f321c1f9b7f4827d2a8e3ff9acd3ff4f5"],"state_sha256":"f3b747d93a66d543bd870ca66a8c89570c2b6fe6467a346dd3082ad865eff2c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h3xNKtGhxD4ykRxrSE662Wi6j4PyK3+889N0Npwd49GSUPOhwXQRITKE+RZnOBccVzD02dVXTYFn3LTpHgCIBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:52:11.104260Z","bundle_sha256":"62c985169760120e72150c9d43745ae97895967592337a53a4185d1b7545db2d"}}