{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:SIXGYGGDHMQ7PIEEJNZ2XH36EF","short_pith_number":"pith:SIXGYGGD","canonical_record":{"source":{"id":"1111.1827","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-08T08:42:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"51b8d65dff9c023a7f08c6ea323e36cb38ef4abba6e5184c17b4e80e17586a97","abstract_canon_sha256":"3465a278b4a6bcc8526a2df47546b9e06a857cf1086bce6b8da71202cf695c88"},"schema_version":"1.0"},"canonical_sha256":"922e6c18c33b21f7a0844b73ab9f7e21650f8544135e9983c20c4116ae966e53","source":{"kind":"arxiv","id":"1111.1827","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1827","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1827v1","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1827","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"pith_short_12","alias_value":"SIXGYGGDHMQ7","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SIXGYGGDHMQ7PIEE","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SIXGYGGD","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:SIXGYGGDHMQ7PIEEJNZ2XH36EF","target":"record","payload":{"canonical_record":{"source":{"id":"1111.1827","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-08T08:42:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"51b8d65dff9c023a7f08c6ea323e36cb38ef4abba6e5184c17b4e80e17586a97","abstract_canon_sha256":"3465a278b4a6bcc8526a2df47546b9e06a857cf1086bce6b8da71202cf695c88"},"schema_version":"1.0"},"canonical_sha256":"922e6c18c33b21f7a0844b73ab9f7e21650f8544135e9983c20c4116ae966e53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:18.635724Z","signature_b64":"11Mrv4N9nAv2TNyzNm9TEMeQnkwqhU8s8vy6IYVpL4ABJKpOvuPhYalLdt/ze39xpAUVuV63h985sPabjGcBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"922e6c18c33b21f7a0844b73ab9f7e21650f8544135e9983c20c4116ae966e53","last_reissued_at":"2026-05-18T00:58:18.634917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:18.634917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.1827","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-18T00:58:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hxxvMJ3NPpqN1/NMi6j5kkC2Qtw6AxcDzVYaG84oKHuxxhjQviMxU+DYD7jV/VF73ckcEoYhRois1qi0GhBNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:39:26.474915Z"},"content_sha256":"c5e996921d71f5a757cb5b31953b892c1ec2f3c6bc1f3eb720cc0617cb60110b","schema_version":"1.0","event_id":"sha256:c5e996921d71f5a757cb5b31953b892c1ec2f3c6bc1f3eb720cc0617cb60110b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:SIXGYGGDHMQ7PIEEJNZ2XH36EF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"One-Hop Throughput 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":"Babak Hossein Khalaj, Hamed Shah-mansouri, Kasra Alishahi, Seyed Pooya Shariatpanahi","submitted_at":"2011-11-08T08:42:40Z","abstract_excerpt":"We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. An scheme achieving the throughput scaling of order $n^{1/3-\\delta}$, for any $\\delta>0$, is proposed, where $n$ is the number of nodes. Such achievable throughput, along with the order $n^{1/3}$ upper bound derived by Cui et al., characterizes the throughput capacity of one-hop schemes for the class of connection models with finite mean and variance."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1827","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-18T00:58:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RVb0zMmcn0w5E15KyctDJcac9vNAV+UDvjb/aDBBziV6e2IQZRnegyb43qAwh7bkTbP8pRZR4pgSg5MQWz8FCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:39:26.475611Z"},"content_sha256":"4ebf7e43e50e8841dd98d7b3e4f2898aaad40aad796424ab85cf752cb3c28ca4","schema_version":"1.0","event_id":"sha256:4ebf7e43e50e8841dd98d7b3e4f2898aaad40aad796424ab85cf752cb3c28ca4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SIXGYGGDHMQ7PIEEJNZ2XH36EF/bundle.json","state_url":"https://pith.science/pith/SIXGYGGDHMQ7PIEEJNZ2XH36EF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SIXGYGGDHMQ7PIEEJNZ2XH36EF/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-05-29T14:39:26Z","links":{"resolver":"https://pith.science/pith/SIXGYGGDHMQ7PIEEJNZ2XH36EF","bundle":"https://pith.science/pith/SIXGYGGDHMQ7PIEEJNZ2XH36EF/bundle.json","state":"https://pith.science/pith/SIXGYGGDHMQ7PIEEJNZ2XH36EF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SIXGYGGDHMQ7PIEEJNZ2XH36EF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SIXGYGGDHMQ7PIEEJNZ2XH36EF","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":"3465a278b4a6bcc8526a2df47546b9e06a857cf1086bce6b8da71202cf695c88","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-08T08:42:40Z","title_canon_sha256":"51b8d65dff9c023a7f08c6ea323e36cb38ef4abba6e5184c17b4e80e17586a97"},"schema_version":"1.0","source":{"id":"1111.1827","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1827","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1827v1","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1827","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"pith_short_12","alias_value":"SIXGYGGDHMQ7","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SIXGYGGDHMQ7PIEE","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SIXGYGGD","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:4ebf7e43e50e8841dd98d7b3e4f2898aaad40aad796424ab85cf752cb3c28ca4","target":"graph","created_at":"2026-05-18T00:58:18Z","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 one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. An scheme achieving the throughput scaling of order $n^{1/3-\\delta}$, for any $\\delta>0$, is proposed, where $n$ is the number of nodes. Such achievable throughput, along with the order $n^{1/3}$ upper bound derived by Cui et al., characterizes the throughput capacity of one-hop schemes for the class of connection models with finite mean and variance.","authors_text":"Babak Hossein Khalaj, Hamed Shah-mansouri, Kasra Alishahi, Seyed Pooya Shariatpanahi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-08T08:42:40Z","title":"One-Hop Throughput of Wireless Networks with Random Connections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1827","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:c5e996921d71f5a757cb5b31953b892c1ec2f3c6bc1f3eb720cc0617cb60110b","target":"record","created_at":"2026-05-18T00:58:18Z","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":"3465a278b4a6bcc8526a2df47546b9e06a857cf1086bce6b8da71202cf695c88","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-08T08:42:40Z","title_canon_sha256":"51b8d65dff9c023a7f08c6ea323e36cb38ef4abba6e5184c17b4e80e17586a97"},"schema_version":"1.0","source":{"id":"1111.1827","kind":"arxiv","version":1}},"canonical_sha256":"922e6c18c33b21f7a0844b73ab9f7e21650f8544135e9983c20c4116ae966e53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"922e6c18c33b21f7a0844b73ab9f7e21650f8544135e9983c20c4116ae966e53","first_computed_at":"2026-05-18T00:58:18.634917Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:18.634917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"11Mrv4N9nAv2TNyzNm9TEMeQnkwqhU8s8vy6IYVpL4ABJKpOvuPhYalLdt/ze39xpAUVuV63h985sPabjGcBAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:18.635724Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.1827","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5e996921d71f5a757cb5b31953b892c1ec2f3c6bc1f3eb720cc0617cb60110b","sha256:4ebf7e43e50e8841dd98d7b3e4f2898aaad40aad796424ab85cf752cb3c28ca4"],"state_sha256":"48e2378047f71765314b23ee4e114db9a994b55a6b91f820f6125272d94d4fa5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ocLD8ul1uKv73n9SycAHaD7uKSWJ6KMB1vR2HkMgOXbRtoJRS42lRt3/gzKrQYV11KSaPdmPcTgE5h1qhCpbAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:39:26.479372Z","bundle_sha256":"9017d022d9b3e96491fb3afca15a7dd11e45f27a69a878f0344c67ea21c46601"}}