{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:34B3MNCMX2ICVOOBUCT7EM23A7","short_pith_number":"pith:34B3MNCM","canonical_record":{"source":{"id":"1210.4596","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-16T23:34:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e836aaf367f3310022d9b76928f660b63609168c264521c91dfeefb76cb4a1b1","abstract_canon_sha256":"962b4beadd100b1ef7a1fe05861a043e9c0fe00aeffe74c9420b2ce2c283e009"},"schema_version":"1.0"},"canonical_sha256":"df03b6344cbe902ab9c1a0a7f2335b07cb1f17129e443edf732e3c800f9d1cb5","source":{"kind":"arxiv","id":"1210.4596","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4596","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4596v2","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4596","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"34B3MNCMX2IC","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"34B3MNCMX2ICVOOB","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"34B3MNCM","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:34B3MNCMX2ICVOOBUCT7EM23A7","target":"record","payload":{"canonical_record":{"source":{"id":"1210.4596","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-16T23:34:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e836aaf367f3310022d9b76928f660b63609168c264521c91dfeefb76cb4a1b1","abstract_canon_sha256":"962b4beadd100b1ef7a1fe05861a043e9c0fe00aeffe74c9420b2ce2c283e009"},"schema_version":"1.0"},"canonical_sha256":"df03b6344cbe902ab9c1a0a7f2335b07cb1f17129e443edf732e3c800f9d1cb5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:04.708266Z","signature_b64":"xfztEBg6zI3vQ/9faSAvDBh7sLRoJju+mtAPu2BfITG4Nsd/0UCPEExsMunyOvp0xOQZEy4gNo4xgNzBgHt5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df03b6344cbe902ab9c1a0a7f2335b07cb1f17129e443edf732e3c800f9d1cb5","last_reissued_at":"2026-05-18T00:59:04.707356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:04.707356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.4596","source_version":2,"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-18T00:59:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GYNcJl9iuGdgZTxj5Yxjf85lGGuwfaewgk9Kli35C3sAYkhVc+/F5tCAs9x6hr40WWwy3oRdMrVcCjGxq7CJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:58:07.861507Z"},"content_sha256":"93721c4b64e380e20eb6e9a10e234cf9f6f6e77dbc9230989f732beaaf70d943","schema_version":"1.0","event_id":"sha256:93721c4b64e380e20eb6e9a10e234cf9f6f6e77dbc9230989f732beaaf70d943"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:34B3MNCMX2ICVOOBUCT7EM23A7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Achievable Rates for Interference Networks with Random Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abbas El Gamal, Bernd Bandemer, Young-Han Kim","submitted_at":"2012-10-16T23:34:27Z","abstract_excerpt":"The optimal rate region for interference networks is characterized when encoding is restricted to random code ensembles with superposition coding and time sharing. A simple simultaneous nonunique decoding rule, under which each receiver decodes for the intended message as well as the interfering messages, is shown to achieve this optimal rate region regardless of the relative strengths of signal, interference, and noise. This result implies that the Han-Kobayashi bound, the best known inner bound on the capacity region of the two-user-pair interference channel, cannot be improved merely by usi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4596","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"},"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-18T00:59:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nUbDuMYlrbhpX/yu8mXe55IIIx6dlH1Ki0Lzq0LJwH4qv1thtrjhd6+D0zPkisa+ijH8fToyA3C+bTS2McsqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:58:07.862147Z"},"content_sha256":"0347c61fa1e8f697e91e15cb39b3560ee93f8d07fb7867388a29f6bd4e312c86","schema_version":"1.0","event_id":"sha256:0347c61fa1e8f697e91e15cb39b3560ee93f8d07fb7867388a29f6bd4e312c86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/34B3MNCMX2ICVOOBUCT7EM23A7/bundle.json","state_url":"https://pith.science/pith/34B3MNCMX2ICVOOBUCT7EM23A7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/34B3MNCMX2ICVOOBUCT7EM23A7/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-06-02T21:58:07Z","links":{"resolver":"https://pith.science/pith/34B3MNCMX2ICVOOBUCT7EM23A7","bundle":"https://pith.science/pith/34B3MNCMX2ICVOOBUCT7EM23A7/bundle.json","state":"https://pith.science/pith/34B3MNCMX2ICVOOBUCT7EM23A7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/34B3MNCMX2ICVOOBUCT7EM23A7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:34B3MNCMX2ICVOOBUCT7EM23A7","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":"962b4beadd100b1ef7a1fe05861a043e9c0fe00aeffe74c9420b2ce2c283e009","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-16T23:34:27Z","title_canon_sha256":"e836aaf367f3310022d9b76928f660b63609168c264521c91dfeefb76cb4a1b1"},"schema_version":"1.0","source":{"id":"1210.4596","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4596","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4596v2","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4596","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"34B3MNCMX2IC","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"34B3MNCMX2ICVOOB","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"34B3MNCM","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:0347c61fa1e8f697e91e15cb39b3560ee93f8d07fb7867388a29f6bd4e312c86","target":"graph","created_at":"2026-05-18T00:59:04Z","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 optimal rate region for interference networks is characterized when encoding is restricted to random code ensembles with superposition coding and time sharing. A simple simultaneous nonunique decoding rule, under which each receiver decodes for the intended message as well as the interfering messages, is shown to achieve this optimal rate region regardless of the relative strengths of signal, interference, and noise. This result implies that the Han-Kobayashi bound, the best known inner bound on the capacity region of the two-user-pair interference channel, cannot be improved merely by usi","authors_text":"Abbas El Gamal, Bernd Bandemer, Young-Han Kim","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-16T23:34:27Z","title":"Optimal Achievable Rates for Interference Networks with Random Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4596","kind":"arxiv","version":2},"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:93721c4b64e380e20eb6e9a10e234cf9f6f6e77dbc9230989f732beaaf70d943","target":"record","created_at":"2026-05-18T00:59:04Z","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":"962b4beadd100b1ef7a1fe05861a043e9c0fe00aeffe74c9420b2ce2c283e009","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-16T23:34:27Z","title_canon_sha256":"e836aaf367f3310022d9b76928f660b63609168c264521c91dfeefb76cb4a1b1"},"schema_version":"1.0","source":{"id":"1210.4596","kind":"arxiv","version":2}},"canonical_sha256":"df03b6344cbe902ab9c1a0a7f2335b07cb1f17129e443edf732e3c800f9d1cb5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df03b6344cbe902ab9c1a0a7f2335b07cb1f17129e443edf732e3c800f9d1cb5","first_computed_at":"2026-05-18T00:59:04.707356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:04.707356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xfztEBg6zI3vQ/9faSAvDBh7sLRoJju+mtAPu2BfITG4Nsd/0UCPEExsMunyOvp0xOQZEy4gNo4xgNzBgHt5DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:04.708266Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4596","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93721c4b64e380e20eb6e9a10e234cf9f6f6e77dbc9230989f732beaaf70d943","sha256:0347c61fa1e8f697e91e15cb39b3560ee93f8d07fb7867388a29f6bd4e312c86"],"state_sha256":"ac863da629ac86eecf34f298cef32ed53ea377018d362d1906188766b1a6913e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8IOFzbmWDCUN19RNUL7KGGICOzMkOf1w0u+gBTpmhugvuGSTgZpHJmKYAhelOS4Lw9Z+XAJJd9NEKTjW5oAaAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:58:07.865338Z","bundle_sha256":"9dfc4917a53abfbd5032b62c966779e815b61189a9aa2e29c690b8f872bc2477"}}