{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:OXXTJVISZZN2BZOIPGBWQ7EKCZ","short_pith_number":"pith:OXXTJVIS","schema_version":"1.0","canonical_sha256":"75ef34d512ce5ba0e5c87983687c8a164fc93616e9bb45e7600cb12aceafcac1","source":{"kind":"arxiv","id":"0809.4019","version":3},"attestation_state":"computed","paper":{"title":"Throughput Scaling of Wireless Networks With Random Connections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander M. Haimovich, H. Vincent Poor, Oren Somekh, Shengshan Cui, Shlomo Shamai (Shitz)","submitted_at":"2008-09-23T20:44:30Z","abstract_excerpt":"This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a common distribution. Transmitting nodes are subject to an on-off strategy, and receiving nodes employ conventional single-user decoding. The following results are proven:\n  1) For a class of connection models with finite mean and variance, the throughput scaling is upper-bounded by $O(n^{1/3})$ for single-hop schemes, and $O(n^{1/2})$ for two-hop (and multihop) s"},"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":"0809.4019","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-23T20:44:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"47823a4688fb8628b632c4395ba365e6934e98ffd9630205e751e108ae6ed481","abstract_canon_sha256":"d6d7db67ae061111b4c99703628a121da55625b873e7dfee2786e359646f9454"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.466267Z","signature_b64":"HpiQFBfwO9W7sazWx3DUeVgd2ClUD5OXPpIXrbHjXm59t58ZlFGFIgXtsscG2dTbRUyx1YYTxKJxZSpvLbxNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75ef34d512ce5ba0e5c87983687c8a164fc93616e9bb45e7600cb12aceafcac1","last_reissued_at":"2026-05-18T00:57:58.465667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.465667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Throughput Scaling of Wireless Networks With Random Connections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander M. Haimovich, H. Vincent Poor, Oren Somekh, Shengshan Cui, Shlomo Shamai (Shitz)","submitted_at":"2008-09-23T20:44:30Z","abstract_excerpt":"This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a common distribution. Transmitting nodes are subject to an on-off strategy, and receiving nodes employ conventional single-user decoding. The following results are proven:\n  1) For a class of connection models with finite mean and variance, the throughput scaling is upper-bounded by $O(n^{1/3})$ for single-hop schemes, and $O(n^{1/2})$ for two-hop (and multihop) s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.4019","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0809.4019","created_at":"2026-05-18T00:57:58.465756+00:00"},{"alias_kind":"arxiv_version","alias_value":"0809.4019v3","created_at":"2026-05-18T00:57:58.465756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.4019","created_at":"2026-05-18T00:57:58.465756+00:00"},{"alias_kind":"pith_short_12","alias_value":"OXXTJVISZZN2","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"OXXTJVISZZN2BZOI","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"OXXTJVIS","created_at":"2026-05-18T12:25:57.157939+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/OXXTJVISZZN2BZOIPGBWQ7EKCZ","json":"https://pith.science/pith/OXXTJVISZZN2BZOIPGBWQ7EKCZ.json","graph_json":"https://pith.science/api/pith-number/OXXTJVISZZN2BZOIPGBWQ7EKCZ/graph.json","events_json":"https://pith.science/api/pith-number/OXXTJVISZZN2BZOIPGBWQ7EKCZ/events.json","paper":"https://pith.science/paper/OXXTJVIS"},"agent_actions":{"view_html":"https://pith.science/pith/OXXTJVISZZN2BZOIPGBWQ7EKCZ","download_json":"https://pith.science/pith/OXXTJVISZZN2BZOIPGBWQ7EKCZ.json","view_paper":"https://pith.science/paper/OXXTJVIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0809.4019&json=true","fetch_graph":"https://pith.science/api/pith-number/OXXTJVISZZN2BZOIPGBWQ7EKCZ/graph.json","fetch_events":"https://pith.science/api/pith-number/OXXTJVISZZN2BZOIPGBWQ7EKCZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OXXTJVISZZN2BZOIPGBWQ7EKCZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OXXTJVISZZN2BZOIPGBWQ7EKCZ/action/storage_attestation","attest_author":"https://pith.science/pith/OXXTJVISZZN2BZOIPGBWQ7EKCZ/action/author_attestation","sign_citation":"https://pith.science/pith/OXXTJVISZZN2BZOIPGBWQ7EKCZ/action/citation_signature","submit_replication":"https://pith.science/pith/OXXTJVISZZN2BZOIPGBWQ7EKCZ/action/replication_record"}},"created_at":"2026-05-18T00:57:58.465756+00:00","updated_at":"2026-05-18T00:57:58.465756+00:00"}