{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:DGNIBDQYVBD4VAZUYG35AOZSIM","short_pith_number":"pith:DGNIBDQY","schema_version":"1.0","canonical_sha256":"199a808e18a847ca8334c1b7d03b324304330c2a5ac3d65c49caadb2db4a9e77","source":{"kind":"arxiv","id":"0907.5165","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0907.5165","created_at":"2026-05-18T04:13:47.265322+00:00"},{"alias_kind":"arxiv_version","alias_value":"0907.5165v1","created_at":"2026-05-18T04:13:47.265322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.5165","created_at":"2026-05-18T04:13:47.265322+00:00"},{"alias_kind":"pith_short_12","alias_value":"DGNIBDQYVBD4","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"DGNIBDQYVBD4VAZU","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"DGNIBDQY","created_at":"2026-05-18T12:25:59.703012+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DGNIBDQYVBD4VAZUYG35AOZSIM","json":"https://pith.science/pith/DGNIBDQYVBD4VAZUYG35AOZSIM.json","graph_json":"https://pith.science/api/pith-number/DGNIBDQYVBD4VAZUYG35AOZSIM/graph.json","events_json":"https://pith.science/api/pith-number/DGNIBDQYVBD4VAZUYG35AOZSIM/events.json","paper":"https://pith.science/paper/DGNIBDQY"},"agent_actions":{"view_html":"https://pith.science/pith/DGNIBDQYVBD4VAZUYG35AOZSIM","download_json":"https://pith.science/pith/DGNIBDQYVBD4VAZUYG35AOZSIM.json","view_paper":"https://pith.science/paper/DGNIBDQY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0907.5165&json=true","fetch_graph":"https://pith.science/api/pith-number/DGNIBDQYVBD4VAZUYG35AOZSIM/graph.json","fetch_events":"https://pith.science/api/pith-number/DGNIBDQYVBD4VAZUYG35AOZSIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DGNIBDQYVBD4VAZUYG35AOZSIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DGNIBDQYVBD4VAZUYG35AOZSIM/action/storage_attestation","attest_author":"https://pith.science/pith/DGNIBDQYVBD4VAZUYG35AOZSIM/action/author_attestation","sign_citation":"https://pith.science/pith/DGNIBDQYVBD4VAZUYG35AOZSIM/action/citation_signature","submit_replication":"https://pith.science/pith/DGNIBDQYVBD4VAZUYG35AOZSIM/action/replication_record"}},"created_at":"2026-05-18T04:13:47.265322+00:00","updated_at":"2026-05-18T04:13:47.265322+00:00"}