{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:DGNIBDQYVBD4VAZUYG35AOZSIM","short_pith_number":"pith:DGNIBDQY","canonical_record":{"source":{"id":"0907.5165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-07-29T15:47:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"226d317fa82ebbbe8942d325b9faa5f14333c2af8f277bdc7a9dd1efe40e002c","abstract_canon_sha256":"fe920004c14494a94e9f772c186668ee099c5b2be1087a22f759b8c4d713bb38"},"schema_version":"1.0"},"canonical_sha256":"199a808e18a847ca8334c1b7d03b324304330c2a5ac3d65c49caadb2db4a9e77","source":{"kind":"arxiv","id":"0907.5165","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.5165","created_at":"2026-05-18T04:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"0907.5165v1","created_at":"2026-05-18T04:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.5165","created_at":"2026-05-18T04:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"DGNIBDQYVBD4","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"DGNIBDQYVBD4VAZU","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"DGNIBDQY","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:DGNIBDQYVBD4VAZUYG35AOZSIM","target":"record","payload":{"canonical_record":{"source":{"id":"0907.5165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-07-29T15:47:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"226d317fa82ebbbe8942d325b9faa5f14333c2af8f277bdc7a9dd1efe40e002c","abstract_canon_sha256":"fe920004c14494a94e9f772c186668ee099c5b2be1087a22f759b8c4d713bb38"},"schema_version":"1.0"},"canonical_sha256":"199a808e18a847ca8334c1b7d03b324304330c2a5ac3d65c49caadb2db4a9e77","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:47.265639Z","signature_b64":"E4HMilu6+5rTCYBlAV4gRNiuQKcTKJRoRebY2ZOsbCmW7yPntNptJ3UDBDW6ZP5keo8KT8uNMTnvm5ToXzC4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"199a808e18a847ca8334c1b7d03b324304330c2a5ac3d65c49caadb2db4a9e77","last_reissued_at":"2026-05-18T04:13:47.265263Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:47.265263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0907.5165","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-18T04:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2HmOMstC15X5qtKp+uuf80O3pipUPTOXztrqA2czOZ01+hY3GqrQ/FUFtXOD1C73n9b/XAXeykAOkX+J4RyXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:28:59.551460Z"},"content_sha256":"0ad01af44d7a9bf6bffc4ad10ff439bcf54fb8b87488dba633f630f40422664e","schema_version":"1.0","event_id":"sha256:0ad01af44d7a9bf6bffc4ad10ff439bcf54fb8b87488dba633f630f40422664e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:DGNIBDQYVBD4VAZUYG35AOZSIM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interference alignment-based sum capacity bounds for random dense Gaussian interference networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Matthew Aldridge, Oliver Johnson, Robert Piechocki","submitted_at":"2009-07-29T15:47:48Z","abstract_excerpt":"We consider a dense $K$ user Gaussian interference network formed by paired transmitters and receivers placed independently at random in a fixed spatial region. Under natural conditions on the node position distributions and signal attenuation, we prove convergence in probability of the average per-user capacity $\\csum/K$ to $\\half \\ep \\log(1 + 2 \\SNR)$. The achievability result follows directly from results based on an interference alignment scheme presented in recent work of Nazer et al. Our main contribution comes through an upper bound, motivated by ideas of `bottleneck capacity' developed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.5165","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-18T04:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1GCAiPJ5zumedMhkI3VbQbn5gCdxB6/KZaAdtuhBeqiabVRHjOn6VHybhcRBdVsHrC4DHhgVYDtsSpk4pk05Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:28:59.551805Z"},"content_sha256":"d4aa590937db41c78fd26b4e8d8b7bf866f31319682557d0cf9b8b5d8c4e2d79","schema_version":"1.0","event_id":"sha256:d4aa590937db41c78fd26b4e8d8b7bf866f31319682557d0cf9b8b5d8c4e2d79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DGNIBDQYVBD4VAZUYG35AOZSIM/bundle.json","state_url":"https://pith.science/pith/DGNIBDQYVBD4VAZUYG35AOZSIM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DGNIBDQYVBD4VAZUYG35AOZSIM/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-02T23:28:59Z","links":{"resolver":"https://pith.science/pith/DGNIBDQYVBD4VAZUYG35AOZSIM","bundle":"https://pith.science/pith/DGNIBDQYVBD4VAZUYG35AOZSIM/bundle.json","state":"https://pith.science/pith/DGNIBDQYVBD4VAZUYG35AOZSIM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DGNIBDQYVBD4VAZUYG35AOZSIM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:DGNIBDQYVBD4VAZUYG35AOZSIM","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":"fe920004c14494a94e9f772c186668ee099c5b2be1087a22f759b8c4d713bb38","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-07-29T15:47:48Z","title_canon_sha256":"226d317fa82ebbbe8942d325b9faa5f14333c2af8f277bdc7a9dd1efe40e002c"},"schema_version":"1.0","source":{"id":"0907.5165","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.5165","created_at":"2026-05-18T04:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"0907.5165v1","created_at":"2026-05-18T04:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.5165","created_at":"2026-05-18T04:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"DGNIBDQYVBD4","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"DGNIBDQYVBD4VAZU","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"DGNIBDQY","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:d4aa590937db41c78fd26b4e8d8b7bf866f31319682557d0cf9b8b5d8c4e2d79","target":"graph","created_at":"2026-05-18T04:13:47Z","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":"We consider a dense $K$ user Gaussian interference network formed by paired transmitters and receivers placed independently at random in a fixed spatial region. Under natural conditions on the node position distributions and signal attenuation, we prove convergence in probability of the average per-user capacity $\\csum/K$ to $\\half \\ep \\log(1 + 2 \\SNR)$. The achievability result follows directly from results based on an interference alignment scheme presented in recent work of Nazer et al. Our main contribution comes through an upper bound, motivated by ideas of `bottleneck capacity' developed","authors_text":"Matthew Aldridge, Oliver Johnson, Robert Piechocki","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-07-29T15:47:48Z","title":"Interference alignment-based sum capacity bounds for random dense Gaussian interference networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.5165","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:0ad01af44d7a9bf6bffc4ad10ff439bcf54fb8b87488dba633f630f40422664e","target":"record","created_at":"2026-05-18T04:13:47Z","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":"fe920004c14494a94e9f772c186668ee099c5b2be1087a22f759b8c4d713bb38","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-07-29T15:47:48Z","title_canon_sha256":"226d317fa82ebbbe8942d325b9faa5f14333c2af8f277bdc7a9dd1efe40e002c"},"schema_version":"1.0","source":{"id":"0907.5165","kind":"arxiv","version":1}},"canonical_sha256":"199a808e18a847ca8334c1b7d03b324304330c2a5ac3d65c49caadb2db4a9e77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"199a808e18a847ca8334c1b7d03b324304330c2a5ac3d65c49caadb2db4a9e77","first_computed_at":"2026-05-18T04:13:47.265263Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:47.265263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E4HMilu6+5rTCYBlAV4gRNiuQKcTKJRoRebY2ZOsbCmW7yPntNptJ3UDBDW6ZP5keo8KT8uNMTnvm5ToXzC4Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:47.265639Z","signed_message":"canonical_sha256_bytes"},"source_id":"0907.5165","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ad01af44d7a9bf6bffc4ad10ff439bcf54fb8b87488dba633f630f40422664e","sha256:d4aa590937db41c78fd26b4e8d8b7bf866f31319682557d0cf9b8b5d8c4e2d79"],"state_sha256":"08ffbedbb0c102ba2e311ab8850cbc1c776702d8d0034900bf7256868429c9db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"peqmGvJo+dKY7Fjq3VZOPrPIEU9jzYiCjZKLtK6gb3+s2uvk3p470BKSj+hWiGRBB1AK+k9LJV8+Cwr4pEUjCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:28:59.553713Z","bundle_sha256":"609f04eb9d3d12ba17dcf982acc85fd57c51da738bb40dffb0a9919069de9bc3"}}