{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:OXXTJVISZZN2BZOIPGBWQ7EKCZ","short_pith_number":"pith:OXXTJVIS","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"},"canonical_sha256":"75ef34d512ce5ba0e5c87983687c8a164fc93616e9bb45e7600cb12aceafcac1","source":{"kind":"arxiv","id":"0809.4019","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0809.4019","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0809.4019v3","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.4019","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"OXXTJVISZZN2","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"OXXTJVISZZN2BZOI","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"OXXTJVIS","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:OXXTJVISZZN2BZOIPGBWQ7EKCZ","target":"record","payload":{"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"},"canonical_sha256":"75ef34d512ce5ba0e5c87983687c8a164fc93616e9bb45e7600cb12aceafcac1","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"},"source_kind":"arxiv","source_id":"0809.4019","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-18T00:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1HufU7DoErnHm4BN2akesJ6FLtls3qoTYKUiyShWyHtZR+ipdsqGscVbBQxBpGd3O6phWy7pAQVkTDr3KPI8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:37:05.516141Z"},"content_sha256":"6db547a4a16746f706d0a7647ef0e93ba2a871fe2a76d72aeef586773d1d0594","schema_version":"1.0","event_id":"sha256:6db547a4a16746f706d0a7647ef0e93ba2a871fe2a76d72aeef586773d1d0594"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:OXXTJVISZZN2BZOIPGBWQ7EKCZ","target":"graph","payload":{"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"},"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-18T00:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"radeYEsTwQMvRZushrcsYA1KtuivMWw/ljK3S68cyaGwY9RodRN+gZtoIoB8IXD6u6ozM7jAuIKnM55xKNMrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:37:05.516520Z"},"content_sha256":"fe1ef16b450841ad648351bb15a4ea428a50c426e374569f690a8a73b4ad72d2","schema_version":"1.0","event_id":"sha256:fe1ef16b450841ad648351bb15a4ea428a50c426e374569f690a8a73b4ad72d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OXXTJVISZZN2BZOIPGBWQ7EKCZ/bundle.json","state_url":"https://pith.science/pith/OXXTJVISZZN2BZOIPGBWQ7EKCZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OXXTJVISZZN2BZOIPGBWQ7EKCZ/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-10T16:37:05Z","links":{"resolver":"https://pith.science/pith/OXXTJVISZZN2BZOIPGBWQ7EKCZ","bundle":"https://pith.science/pith/OXXTJVISZZN2BZOIPGBWQ7EKCZ/bundle.json","state":"https://pith.science/pith/OXXTJVISZZN2BZOIPGBWQ7EKCZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OXXTJVISZZN2BZOIPGBWQ7EKCZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:OXXTJVISZZN2BZOIPGBWQ7EKCZ","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":"d6d7db67ae061111b4c99703628a121da55625b873e7dfee2786e359646f9454","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-23T20:44:30Z","title_canon_sha256":"47823a4688fb8628b632c4395ba365e6934e98ffd9630205e751e108ae6ed481"},"schema_version":"1.0","source":{"id":"0809.4019","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0809.4019","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0809.4019v3","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.4019","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"OXXTJVISZZN2","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"OXXTJVISZZN2BZOI","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"OXXTJVIS","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:fe1ef16b450841ad648351bb15a4ea428a50c426e374569f690a8a73b4ad72d2","target":"graph","created_at":"2026-05-18T00:57:58Z","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":"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","authors_text":"Alexander M. Haimovich, H. Vincent Poor, Oren Somekh, Shengshan Cui, Shlomo Shamai (Shitz)","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-23T20:44:30Z","title":"Throughput Scaling of Wireless Networks With Random Connections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.4019","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:6db547a4a16746f706d0a7647ef0e93ba2a871fe2a76d72aeef586773d1d0594","target":"record","created_at":"2026-05-18T00:57:58Z","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":"d6d7db67ae061111b4c99703628a121da55625b873e7dfee2786e359646f9454","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-23T20:44:30Z","title_canon_sha256":"47823a4688fb8628b632c4395ba365e6934e98ffd9630205e751e108ae6ed481"},"schema_version":"1.0","source":{"id":"0809.4019","kind":"arxiv","version":3}},"canonical_sha256":"75ef34d512ce5ba0e5c87983687c8a164fc93616e9bb45e7600cb12aceafcac1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75ef34d512ce5ba0e5c87983687c8a164fc93616e9bb45e7600cb12aceafcac1","first_computed_at":"2026-05-18T00:57:58.465667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:58.465667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HpiQFBfwO9W7sazWx3DUeVgd2ClUD5OXPpIXrbHjXm59t58ZlFGFIgXtsscG2dTbRUyx1YYTxKJxZSpvLbxNBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:58.466267Z","signed_message":"canonical_sha256_bytes"},"source_id":"0809.4019","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6db547a4a16746f706d0a7647ef0e93ba2a871fe2a76d72aeef586773d1d0594","sha256:fe1ef16b450841ad648351bb15a4ea428a50c426e374569f690a8a73b4ad72d2"],"state_sha256":"fcd20a0e2120c3e86466d5f2451bfab7afe748a0c9c3c1e8b6eec147537f1f07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AHUkBiI0ar11HRv2XlFH8NIX0sZ5bon1y3BI1KgfK4EBBEZJei1srXiuC9y79eUedADou1pEwb2yuDpFbZ2PDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T16:37:05.518480Z","bundle_sha256":"6a10745da2271d33b19e8105c03c78c2b92885c5fe1e24f8f7d38c7f5cdd7c8e"}}