{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:LMCCH43RUFZTST7NRUQ3C2S4LU","short_pith_number":"pith:LMCCH43R","canonical_record":{"source":{"id":"0807.2859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-07-17T19:48:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"47938a7d89bb7056d4b186bd13eee5c54024142c56e48c484b22c53958684ee0","abstract_canon_sha256":"f08eae56ad96d2b383733d088f0e847eec672b2b5c970541f598b34ee31d7073"},"schema_version":"1.0"},"canonical_sha256":"5b0423f371a173394fed8d21b16a5c5d0e427157d16f759d06f5133dbc76a074","source":{"kind":"arxiv","id":"0807.2859","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0807.2859","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"arxiv_version","alias_value":"0807.2859v1","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.2859","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"pith_short_12","alias_value":"LMCCH43RUFZT","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"LMCCH43RUFZTST7N","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"LMCCH43R","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:LMCCH43RUFZTST7NRUQ3C2S4LU","target":"record","payload":{"canonical_record":{"source":{"id":"0807.2859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-07-17T19:48:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"47938a7d89bb7056d4b186bd13eee5c54024142c56e48c484b22c53958684ee0","abstract_canon_sha256":"f08eae56ad96d2b383733d088f0e847eec672b2b5c970541f598b34ee31d7073"},"schema_version":"1.0"},"canonical_sha256":"5b0423f371a173394fed8d21b16a5c5d0e427157d16f759d06f5133dbc76a074","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:40.638338Z","signature_b64":"LdNJyu4Ok0aLXq2FAG2Ckrlt70ZwxsE1AEu1EYHgQevzUbzw+CUppr64ZrcCYZja8yHo2soDAqM3PxqSQG4LCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b0423f371a173394fed8d21b16a5c5d0e427157d16f759d06f5133dbc76a074","last_reissued_at":"2026-05-18T04:39:40.637725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:40.637725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0807.2859","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:39:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GDrwg+vagnpO35erAPVqC0O70TOSUdnijaxZl1hPhx2faepCZdjgLsT7SCy/LUpVy7LQK8vQb+erXtW0v1ujCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:16:12.022285Z"},"content_sha256":"f0f62f2daa716d4927cb516d29106cec9ba4156115e73fda3bc4a17120660d33","schema_version":"1.0","event_id":"sha256:f0f62f2daa716d4927cb516d29106cec9ba4156115e73fda3bc4a17120660d33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:LMCCH43RUFZTST7NRUQ3C2S4LU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Transport Capacity of a Wireless Network is a Subadditive Euclidean Functional","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Martin Haenggi, Radha Krishna Ganti","submitted_at":"2008-07-17T19:48:16Z","abstract_excerpt":"The transport capacity of a dense ad hoc network with n nodes scales like \\sqrt(n). We show that the transport capacity divided by \\sqrt(n) approaches a non-random limit with probability one when the nodes are i.i.d. distributed on the unit square. We prove that the transport capacity under the protocol model is a subadditive Euclidean functional and use the machinery of subadditive functions in the spirit of Steele to show the existence of the limit."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.2859","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:39:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N4gSMvLgtMXJ99gPldvH9racy36BPfMTDRvxejjuTzNJnuR0q6Tro77/OgPymXJ7q/wGlM13dIf3ZgBsptsODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:16:12.022965Z"},"content_sha256":"f1798a8620954d2f2b35a82971a0a8654329b0907dc7a3a50a30644850292db0","schema_version":"1.0","event_id":"sha256:f1798a8620954d2f2b35a82971a0a8654329b0907dc7a3a50a30644850292db0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LMCCH43RUFZTST7NRUQ3C2S4LU/bundle.json","state_url":"https://pith.science/pith/LMCCH43RUFZTST7NRUQ3C2S4LU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LMCCH43RUFZTST7NRUQ3C2S4LU/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-28T16:16:12Z","links":{"resolver":"https://pith.science/pith/LMCCH43RUFZTST7NRUQ3C2S4LU","bundle":"https://pith.science/pith/LMCCH43RUFZTST7NRUQ3C2S4LU/bundle.json","state":"https://pith.science/pith/LMCCH43RUFZTST7NRUQ3C2S4LU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LMCCH43RUFZTST7NRUQ3C2S4LU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:LMCCH43RUFZTST7NRUQ3C2S4LU","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":"f08eae56ad96d2b383733d088f0e847eec672b2b5c970541f598b34ee31d7073","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-07-17T19:48:16Z","title_canon_sha256":"47938a7d89bb7056d4b186bd13eee5c54024142c56e48c484b22c53958684ee0"},"schema_version":"1.0","source":{"id":"0807.2859","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0807.2859","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"arxiv_version","alias_value":"0807.2859v1","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.2859","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"pith_short_12","alias_value":"LMCCH43RUFZT","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"LMCCH43RUFZTST7N","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"LMCCH43R","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:f1798a8620954d2f2b35a82971a0a8654329b0907dc7a3a50a30644850292db0","target":"graph","created_at":"2026-05-18T04:39:40Z","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":"The transport capacity of a dense ad hoc network with n nodes scales like \\sqrt(n). We show that the transport capacity divided by \\sqrt(n) approaches a non-random limit with probability one when the nodes are i.i.d. distributed on the unit square. We prove that the transport capacity under the protocol model is a subadditive Euclidean functional and use the machinery of subadditive functions in the spirit of Steele to show the existence of the limit.","authors_text":"Martin Haenggi, Radha Krishna Ganti","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-07-17T19:48:16Z","title":"The Transport Capacity of a Wireless Network is a Subadditive Euclidean Functional"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.2859","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:f0f62f2daa716d4927cb516d29106cec9ba4156115e73fda3bc4a17120660d33","target":"record","created_at":"2026-05-18T04:39:40Z","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":"f08eae56ad96d2b383733d088f0e847eec672b2b5c970541f598b34ee31d7073","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-07-17T19:48:16Z","title_canon_sha256":"47938a7d89bb7056d4b186bd13eee5c54024142c56e48c484b22c53958684ee0"},"schema_version":"1.0","source":{"id":"0807.2859","kind":"arxiv","version":1}},"canonical_sha256":"5b0423f371a173394fed8d21b16a5c5d0e427157d16f759d06f5133dbc76a074","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b0423f371a173394fed8d21b16a5c5d0e427157d16f759d06f5133dbc76a074","first_computed_at":"2026-05-18T04:39:40.637725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:40.637725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LdNJyu4Ok0aLXq2FAG2Ckrlt70ZwxsE1AEu1EYHgQevzUbzw+CUppr64ZrcCYZja8yHo2soDAqM3PxqSQG4LCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:40.638338Z","signed_message":"canonical_sha256_bytes"},"source_id":"0807.2859","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0f62f2daa716d4927cb516d29106cec9ba4156115e73fda3bc4a17120660d33","sha256:f1798a8620954d2f2b35a82971a0a8654329b0907dc7a3a50a30644850292db0"],"state_sha256":"50ea44e150311ce85a1294c1ba00a058545e8b557088a1287028c0dad4a5c8e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CFVOxnEQB1aPBO2FbRLSw9zs3bLfxPg0ZbxnG8PH/OiZbkr8lOPTfT0P+X1zKjV4rXdoL48tDpqg5+2Dz3DkAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:16:12.026492Z","bundle_sha256":"ae1c6045058420134744e3c42208138cdacea508348134ffd570ba6b8d854721"}}