{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:LMCCH43RUFZTST7NRUQ3C2S4LU","short_pith_number":"pith:LMCCH43R","schema_version":"1.0","canonical_sha256":"5b0423f371a173394fed8d21b16a5c5d0e427157d16f759d06f5133dbc76a074","source":{"kind":"arxiv","id":"0807.2859","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0807.2859","created_at":"2026-05-18T04:39:40.637794+00:00"},{"alias_kind":"arxiv_version","alias_value":"0807.2859v1","created_at":"2026-05-18T04:39:40.637794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.2859","created_at":"2026-05-18T04:39:40.637794+00:00"},{"alias_kind":"pith_short_12","alias_value":"LMCCH43RUFZT","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"LMCCH43RUFZTST7N","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"LMCCH43R","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/LMCCH43RUFZTST7NRUQ3C2S4LU","json":"https://pith.science/pith/LMCCH43RUFZTST7NRUQ3C2S4LU.json","graph_json":"https://pith.science/api/pith-number/LMCCH43RUFZTST7NRUQ3C2S4LU/graph.json","events_json":"https://pith.science/api/pith-number/LMCCH43RUFZTST7NRUQ3C2S4LU/events.json","paper":"https://pith.science/paper/LMCCH43R"},"agent_actions":{"view_html":"https://pith.science/pith/LMCCH43RUFZTST7NRUQ3C2S4LU","download_json":"https://pith.science/pith/LMCCH43RUFZTST7NRUQ3C2S4LU.json","view_paper":"https://pith.science/paper/LMCCH43R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0807.2859&json=true","fetch_graph":"https://pith.science/api/pith-number/LMCCH43RUFZTST7NRUQ3C2S4LU/graph.json","fetch_events":"https://pith.science/api/pith-number/LMCCH43RUFZTST7NRUQ3C2S4LU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LMCCH43RUFZTST7NRUQ3C2S4LU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LMCCH43RUFZTST7NRUQ3C2S4LU/action/storage_attestation","attest_author":"https://pith.science/pith/LMCCH43RUFZTST7NRUQ3C2S4LU/action/author_attestation","sign_citation":"https://pith.science/pith/LMCCH43RUFZTST7NRUQ3C2S4LU/action/citation_signature","submit_replication":"https://pith.science/pith/LMCCH43RUFZTST7NRUQ3C2S4LU/action/replication_record"}},"created_at":"2026-05-18T04:39:40.637794+00:00","updated_at":"2026-05-18T04:39:40.637794+00:00"}