{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:34BIG755LZTIZGWEQINIRKBVJH","short_pith_number":"pith:34BIG755","canonical_record":{"source":{"id":"1508.05726","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-24T08:56:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c734b55ce56f60050bc9a7e6558b3601985e2d287d47eb7c5c0061e3d57d77c0","abstract_canon_sha256":"1fd9122e334a24f1b5d5ba310ca4d21c7e7929bada7ae5727ea1555195bd939a"},"schema_version":"1.0"},"canonical_sha256":"df02837fbd5e668c9ac4821a88a83549e929c2234f19d3a92c1626aa7451e145","source":{"kind":"arxiv","id":"1508.05726","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05726","created_at":"2026-05-18T00:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05726v2","created_at":"2026-05-18T00:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05726","created_at":"2026-05-18T00:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"34BIG755LZTI","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"34BIG755LZTIZGWE","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"34BIG755","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:34BIG755LZTIZGWEQINIRKBVJH","target":"record","payload":{"canonical_record":{"source":{"id":"1508.05726","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-24T08:56:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c734b55ce56f60050bc9a7e6558b3601985e2d287d47eb7c5c0061e3d57d77c0","abstract_canon_sha256":"1fd9122e334a24f1b5d5ba310ca4d21c7e7929bada7ae5727ea1555195bd939a"},"schema_version":"1.0"},"canonical_sha256":"df02837fbd5e668c9ac4821a88a83549e929c2234f19d3a92c1626aa7451e145","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:04.742985Z","signature_b64":"YXBgjxOhpxHHTDXoOl3X33VQYmkVwc8aJrb4OJtLODUnuAl6NyL7nS/faklsh5bJQyxpAI96jO9ImkHfkZGMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df02837fbd5e668c9ac4821a88a83549e929c2234f19d3a92c1626aa7451e145","last_reissued_at":"2026-05-18T00:19:04.742287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:04.742287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.05726","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:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7E9DMLBeQT5sPkpemolFOKYKkh7BpKYshcRJ2OI+S87tfRg2DImhpFUkQQtlRf9pJxW9SExXLdxrqo24cmmODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:57:59.991221Z"},"content_sha256":"6af0c073c89dbef18f12817b3bf15f5f1e7b4dd05cd600722d1e3a5782e08985","schema_version":"1.0","event_id":"sha256:6af0c073c89dbef18f12817b3bf15f5f1e7b4dd05cd600722d1e3a5782e08985"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:34BIG755LZTIZGWEQINIRKBVJH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Codewords With Memory Improve Achievable Rate Regions of the Memoryless Gaussian Interference Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav, Wasim Huleihel","submitted_at":"2015-08-24T08:56:45Z","abstract_excerpt":"The two-user Gaussian interference channel (GIC) has been extensively studied in the literature during the last four decades. The full characterization of the capacity region of the GIC is a long-standing open problem, except the case of strong or very strong interference. For general GIC's, many inner bounds have been provided over the years, among of them, the Han-Kobayashi (HK) region, is the most celebrated one. Unfortunately, the calculation of the HK region is prohibitively complex, due to the appearance of some auxiliary random variables, whose optimal choice is an open problem. As in o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05726","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:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5scKd7i/N6c2BVWO5ZeSu3fjgnQUviCfz1VoK5pvGtonIGApnxNZoOny3zkct4w0IsF1ryfCxsZpvmwuroqMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:57:59.991896Z"},"content_sha256":"aa342804ef79e8f6d2c11b76d52f03f120450d3340411ddad962ee664936db8d","schema_version":"1.0","event_id":"sha256:aa342804ef79e8f6d2c11b76d52f03f120450d3340411ddad962ee664936db8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/34BIG755LZTIZGWEQINIRKBVJH/bundle.json","state_url":"https://pith.science/pith/34BIG755LZTIZGWEQINIRKBVJH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/34BIG755LZTIZGWEQINIRKBVJH/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-27T08:57:59Z","links":{"resolver":"https://pith.science/pith/34BIG755LZTIZGWEQINIRKBVJH","bundle":"https://pith.science/pith/34BIG755LZTIZGWEQINIRKBVJH/bundle.json","state":"https://pith.science/pith/34BIG755LZTIZGWEQINIRKBVJH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/34BIG755LZTIZGWEQINIRKBVJH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:34BIG755LZTIZGWEQINIRKBVJH","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":"1fd9122e334a24f1b5d5ba310ca4d21c7e7929bada7ae5727ea1555195bd939a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-24T08:56:45Z","title_canon_sha256":"c734b55ce56f60050bc9a7e6558b3601985e2d287d47eb7c5c0061e3d57d77c0"},"schema_version":"1.0","source":{"id":"1508.05726","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05726","created_at":"2026-05-18T00:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05726v2","created_at":"2026-05-18T00:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05726","created_at":"2026-05-18T00:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"34BIG755LZTI","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"34BIG755LZTIZGWE","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"34BIG755","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:aa342804ef79e8f6d2c11b76d52f03f120450d3340411ddad962ee664936db8d","target":"graph","created_at":"2026-05-18T00:19: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 two-user Gaussian interference channel (GIC) has been extensively studied in the literature during the last four decades. The full characterization of the capacity region of the GIC is a long-standing open problem, except the case of strong or very strong interference. For general GIC's, many inner bounds have been provided over the years, among of them, the Han-Kobayashi (HK) region, is the most celebrated one. Unfortunately, the calculation of the HK region is prohibitively complex, due to the appearance of some auxiliary random variables, whose optimal choice is an open problem. As in o","authors_text":"Neri Merhav, Wasim Huleihel","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-24T08:56:45Z","title":"Codewords With Memory Improve Achievable Rate Regions of the Memoryless Gaussian Interference Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05726","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:6af0c073c89dbef18f12817b3bf15f5f1e7b4dd05cd600722d1e3a5782e08985","target":"record","created_at":"2026-05-18T00:19: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":"1fd9122e334a24f1b5d5ba310ca4d21c7e7929bada7ae5727ea1555195bd939a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-24T08:56:45Z","title_canon_sha256":"c734b55ce56f60050bc9a7e6558b3601985e2d287d47eb7c5c0061e3d57d77c0"},"schema_version":"1.0","source":{"id":"1508.05726","kind":"arxiv","version":2}},"canonical_sha256":"df02837fbd5e668c9ac4821a88a83549e929c2234f19d3a92c1626aa7451e145","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df02837fbd5e668c9ac4821a88a83549e929c2234f19d3a92c1626aa7451e145","first_computed_at":"2026-05-18T00:19:04.742287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:04.742287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YXBgjxOhpxHHTDXoOl3X33VQYmkVwc8aJrb4OJtLODUnuAl6NyL7nS/faklsh5bJQyxpAI96jO9ImkHfkZGMAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:04.742985Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.05726","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6af0c073c89dbef18f12817b3bf15f5f1e7b4dd05cd600722d1e3a5782e08985","sha256:aa342804ef79e8f6d2c11b76d52f03f120450d3340411ddad962ee664936db8d"],"state_sha256":"2b18f999a82786420ed297a9b15b28ff8924aff257f01fcce76170023c6df27d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PtK49qDhLO1lPWTLyLoQjPSQfnYXhpzf4Rq/eJVtZuA5XcOhxUaYYnjY6uV/qn11qkQA3gwTKrOcIOhchQlUCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:57:59.995420Z","bundle_sha256":"bab0fd19cfbde4f96835ceed807c74cd84159e92f391e0853043c3bb3050ddfd"}}