{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:PU7T4CCMHT4DNPPJUNNFH2NQBN","short_pith_number":"pith:PU7T4CCM","canonical_record":{"source":{"id":"1001.4588","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-26T03:55:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c19c5a5988dd8cef1f489882483bcfe6bddab8e487f75f78ab0701214deed5dd","abstract_canon_sha256":"ea68c4520147666d4120a8040bf08df0527e090e2b8bb461fbd9e5221c7a3550"},"schema_version":"1.0"},"canonical_sha256":"7d3f3e084c3cf836bde9a35a53e9b00b4037f7f08779ba30c7341d9d14316c6d","source":{"kind":"arxiv","id":"1001.4588","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.4588","created_at":"2026-05-18T02:24:39Z"},{"alias_kind":"arxiv_version","alias_value":"1001.4588v3","created_at":"2026-05-18T02:24:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.4588","created_at":"2026-05-18T02:24:39Z"},{"alias_kind":"pith_short_12","alias_value":"PU7T4CCMHT4D","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PU7T4CCMHT4DNPPJ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PU7T4CCM","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:PU7T4CCMHT4DNPPJUNNFH2NQBN","target":"record","payload":{"canonical_record":{"source":{"id":"1001.4588","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-26T03:55:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c19c5a5988dd8cef1f489882483bcfe6bddab8e487f75f78ab0701214deed5dd","abstract_canon_sha256":"ea68c4520147666d4120a8040bf08df0527e090e2b8bb461fbd9e5221c7a3550"},"schema_version":"1.0"},"canonical_sha256":"7d3f3e084c3cf836bde9a35a53e9b00b4037f7f08779ba30c7341d9d14316c6d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:39.440625Z","signature_b64":"c0Da7QT1jKas7SdzUu2VYSfHsJt4joEzNP68oiU/CisR4rcnDa/B18VWBSY48Eg8am9K7efH7s+X0GrC1pkQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d3f3e084c3cf836bde9a35a53e9b00b4037f7f08779ba30c7341d9d14316c6d","last_reissued_at":"2026-05-18T02:24:39.440126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:39.440126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.4588","source_version":3,"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:24:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DBlZBFHyrrT3pIBeIJAdK8Gtl/TnIowWfbjb/qSdCmnos+Qo7CgDPrheB/ve35zQVlwmIi9rHqKoDgGz8ii0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:21:09.137573Z"},"content_sha256":"9475b59f5187c0346c37b6226237cfa967baf90dcb65704054df0ee9b098991e","schema_version":"1.0","event_id":"sha256:9475b59f5187c0346c37b6226237cfa967baf90dcb65704054df0ee9b098991e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:PU7T4CCMHT4DNPPJUNNFH2NQBN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interference Decoding for Deterministic Channels","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","submitted_at":"2010-01-26T03:55:55Z","abstract_excerpt":"An inner bound to the capacity region of a class of deterministic interference channels with three user pairs is presented. The key idea is to simultaneously decode the combined interference signal and the intended message at each receiver. It is shown that this interference-decoding inner bound is tight under certain strong interference conditions. The inner bound is also shown to strictly contain the inner bound obtained by treating interference as noise, which includes interference alignment for deterministic channels. The gain comes from judicious analysis of the number of combined interfe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.4588","kind":"arxiv","version":3},"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:24:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qkLwfqmyXMkQ3zujlYm21O0Impu5WY0dk4IrWW2X6ceDM5y1DG9lV/Y+qVDfwi4ZyJWfuV1lmse7mIY9ZZ/YCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:21:09.138126Z"},"content_sha256":"0b5109e39e5b282dfce37933fb05299dc0da4536216c7c930dae0c6acf037ebb","schema_version":"1.0","event_id":"sha256:0b5109e39e5b282dfce37933fb05299dc0da4536216c7c930dae0c6acf037ebb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PU7T4CCMHT4DNPPJUNNFH2NQBN/bundle.json","state_url":"https://pith.science/pith/PU7T4CCMHT4DNPPJUNNFH2NQBN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PU7T4CCMHT4DNPPJUNNFH2NQBN/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-03T05:21:09Z","links":{"resolver":"https://pith.science/pith/PU7T4CCMHT4DNPPJUNNFH2NQBN","bundle":"https://pith.science/pith/PU7T4CCMHT4DNPPJUNNFH2NQBN/bundle.json","state":"https://pith.science/pith/PU7T4CCMHT4DNPPJUNNFH2NQBN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PU7T4CCMHT4DNPPJUNNFH2NQBN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:PU7T4CCMHT4DNPPJUNNFH2NQBN","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":"ea68c4520147666d4120a8040bf08df0527e090e2b8bb461fbd9e5221c7a3550","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-26T03:55:55Z","title_canon_sha256":"c19c5a5988dd8cef1f489882483bcfe6bddab8e487f75f78ab0701214deed5dd"},"schema_version":"1.0","source":{"id":"1001.4588","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.4588","created_at":"2026-05-18T02:24:39Z"},{"alias_kind":"arxiv_version","alias_value":"1001.4588v3","created_at":"2026-05-18T02:24:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.4588","created_at":"2026-05-18T02:24:39Z"},{"alias_kind":"pith_short_12","alias_value":"PU7T4CCMHT4D","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PU7T4CCMHT4DNPPJ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PU7T4CCM","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:0b5109e39e5b282dfce37933fb05299dc0da4536216c7c930dae0c6acf037ebb","target":"graph","created_at":"2026-05-18T02:24:39Z","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":"An inner bound to the capacity region of a class of deterministic interference channels with three user pairs is presented. The key idea is to simultaneously decode the combined interference signal and the intended message at each receiver. It is shown that this interference-decoding inner bound is tight under certain strong interference conditions. The inner bound is also shown to strictly contain the inner bound obtained by treating interference as noise, which includes interference alignment for deterministic channels. The gain comes from judicious analysis of the number of combined interfe","authors_text":"Abbas El Gamal, Bernd Bandemer","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-26T03:55:55Z","title":"Interference Decoding for Deterministic Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.4588","kind":"arxiv","version":3},"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:9475b59f5187c0346c37b6226237cfa967baf90dcb65704054df0ee9b098991e","target":"record","created_at":"2026-05-18T02:24:39Z","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":"ea68c4520147666d4120a8040bf08df0527e090e2b8bb461fbd9e5221c7a3550","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-26T03:55:55Z","title_canon_sha256":"c19c5a5988dd8cef1f489882483bcfe6bddab8e487f75f78ab0701214deed5dd"},"schema_version":"1.0","source":{"id":"1001.4588","kind":"arxiv","version":3}},"canonical_sha256":"7d3f3e084c3cf836bde9a35a53e9b00b4037f7f08779ba30c7341d9d14316c6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d3f3e084c3cf836bde9a35a53e9b00b4037f7f08779ba30c7341d9d14316c6d","first_computed_at":"2026-05-18T02:24:39.440126Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:39.440126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c0Da7QT1jKas7SdzUu2VYSfHsJt4joEzNP68oiU/CisR4rcnDa/B18VWBSY48Eg8am9K7efH7s+X0GrC1pkQBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:39.440625Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.4588","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9475b59f5187c0346c37b6226237cfa967baf90dcb65704054df0ee9b098991e","sha256:0b5109e39e5b282dfce37933fb05299dc0da4536216c7c930dae0c6acf037ebb"],"state_sha256":"451fa094baa6bc607d1c4d67244836b6ff75b82ceee3769930301fd29ee6a6f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yEkp0KTZP+LZl9Z821J/fJzdl7eU8BVHhZSB+4lLO0Pd+qulIKh2xXFj9sFlZ1l80i+/aw6dOICumiGNXxFWDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:21:09.140835Z","bundle_sha256":"ea54bd12a22ae5d4f399fc3290183839be2f041b6799cd6ad3d59afec921941c"}}