{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:I4Y2KMNYRY7LKSWG7RCK6MZG6P","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":"0463713e298eb3418a063ed4b8476388d330721051f722b63c779d616682b704","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T19:54:37Z","title_canon_sha256":"d97a20c77dba4a7b9e6b73d3734abaab921917fcd7d7e326b20ef44b4b424e4a"},"schema_version":"1.0","source":{"id":"1102.2868","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2868","created_at":"2026-05-18T04:28:46Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2868v1","created_at":"2026-05-18T04:28:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2868","created_at":"2026-05-18T04:28:46Z"},{"alias_kind":"pith_short_12","alias_value":"I4Y2KMNYRY7L","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"I4Y2KMNYRY7LKSWG","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"I4Y2KMNY","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:f29a154d1498bcc3390a13588f6a82137d531a763f8c4f202762144773ff0d13","target":"graph","created_at":"2026-05-18T04:28:46Z","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 paper establishes the capacity region of the Gaussian interference channel with many transmitter-receiver pairs constrained to use point-to-point codes. The capacity region is shown to be strictly larger in general than the achievable rate regions when treating interference as noise, using successive interference cancellation decoding, and using joint decoding. The gains in coverage and achievable rate using the optimal decoder are analyzed in terms of ensemble averages using stochastic geometry. In a spatial network where the nodes are distributed according to a Poisson point process and ","authors_text":"Abbas El Gamal, David Tse, Francois Baccelli","cross_cats":["math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T19:54:37Z","title":"Interference Networks with Point-to-Point Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2868","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:e7b153b305e1e48ae135d16ab8cdc59772412498fbd0d27350b518e0ef4706d0","target":"record","created_at":"2026-05-18T04:28:46Z","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":"0463713e298eb3418a063ed4b8476388d330721051f722b63c779d616682b704","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T19:54:37Z","title_canon_sha256":"d97a20c77dba4a7b9e6b73d3734abaab921917fcd7d7e326b20ef44b4b424e4a"},"schema_version":"1.0","source":{"id":"1102.2868","kind":"arxiv","version":1}},"canonical_sha256":"4731a531b88e3eb54ac6fc44af3326f3f1ca49693447a6360190d5f8841fd213","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4731a531b88e3eb54ac6fc44af3326f3f1ca49693447a6360190d5f8841fd213","first_computed_at":"2026-05-18T04:28:46.244271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:46.244271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rzt7py6Sfo5fNqkX9M94bKy0fwaJWVZRBOC1pdneMUMD39Z6NQpJIdwRqWcK0+taIhiZF74xHvjH7pZ89IY5CA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:46.244936Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2868","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7b153b305e1e48ae135d16ab8cdc59772412498fbd0d27350b518e0ef4706d0","sha256:f29a154d1498bcc3390a13588f6a82137d531a763f8c4f202762144773ff0d13"],"state_sha256":"4123ab798376f9828b91d02fc4f9b6f3c7e66390133ce30b37e1b01e3b349dcd"}