{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OSJXVLIXXPECX7YIT6DHVYYR37","short_pith_number":"pith:OSJXVLIX","schema_version":"1.0","canonical_sha256":"74937aad17bbc82bff089f867ae311dfff41ee24701b8b28e19e814b82f7ed54","source":{"kind":"arxiv","id":"1301.6587","version":2},"attestation_state":"computed","paper":{"title":"Information Theoretic Cut-set Bounds on the Capacity of Poisson Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Georgios Rodolakis","submitted_at":"2013-01-28T16:06:26Z","abstract_excerpt":"This paper presents a stochastic geometry model for the investigation of fundamental information theoretic limitations in wireless networks. We derive a new unified multi-parameter cut-set bound on the capacity of networks of arbitrary Poisson node density, size, power and bandwidth, under fast fading in a rich scattering environment. In other words, we upper-bound the optimal performance in terms of total communication rate, under any scheme, that can be achieved between a subset of network nodes (defined by the cut) with all the remaining nodes. Additionally, we identify four different opera"},"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":"1301.6587","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T16:06:26Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"bb897513adda030ee75ef38e2e88e74b0471366d8f635ec278245afd660f8065","abstract_canon_sha256":"a3b7acdc1a99735634188d8698919f42446fa674a13046f2de7ca2c88616f648"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:42.568574Z","signature_b64":"qKXTmgBr5bn031Tz1y4IuVKYjO1d3TRM7vlR5sOOJtofWrJ1yiupHeyq2ZS4WP0EEwtbkIz0ULIborL/Et9XAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74937aad17bbc82bff089f867ae311dfff41ee24701b8b28e19e814b82f7ed54","last_reissued_at":"2026-05-18T03:26:42.567722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:42.567722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information Theoretic Cut-set Bounds on the Capacity of Poisson Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Georgios Rodolakis","submitted_at":"2013-01-28T16:06:26Z","abstract_excerpt":"This paper presents a stochastic geometry model for the investigation of fundamental information theoretic limitations in wireless networks. We derive a new unified multi-parameter cut-set bound on the capacity of networks of arbitrary Poisson node density, size, power and bandwidth, under fast fading in a rich scattering environment. In other words, we upper-bound the optimal performance in terms of total communication rate, under any scheme, that can be achieved between a subset of network nodes (defined by the cut) with all the remaining nodes. Additionally, we identify four different opera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6587","kind":"arxiv","version":2},"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":"1301.6587","created_at":"2026-05-18T03:26:42.567870+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.6587v2","created_at":"2026-05-18T03:26:42.567870+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6587","created_at":"2026-05-18T03:26:42.567870+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSJXVLIXXPEC","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSJXVLIXXPECX7YI","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSJXVLIX","created_at":"2026-05-18T12:27:54.935989+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/OSJXVLIXXPECX7YIT6DHVYYR37","json":"https://pith.science/pith/OSJXVLIXXPECX7YIT6DHVYYR37.json","graph_json":"https://pith.science/api/pith-number/OSJXVLIXXPECX7YIT6DHVYYR37/graph.json","events_json":"https://pith.science/api/pith-number/OSJXVLIXXPECX7YIT6DHVYYR37/events.json","paper":"https://pith.science/paper/OSJXVLIX"},"agent_actions":{"view_html":"https://pith.science/pith/OSJXVLIXXPECX7YIT6DHVYYR37","download_json":"https://pith.science/pith/OSJXVLIXXPECX7YIT6DHVYYR37.json","view_paper":"https://pith.science/paper/OSJXVLIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.6587&json=true","fetch_graph":"https://pith.science/api/pith-number/OSJXVLIXXPECX7YIT6DHVYYR37/graph.json","fetch_events":"https://pith.science/api/pith-number/OSJXVLIXXPECX7YIT6DHVYYR37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSJXVLIXXPECX7YIT6DHVYYR37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSJXVLIXXPECX7YIT6DHVYYR37/action/storage_attestation","attest_author":"https://pith.science/pith/OSJXVLIXXPECX7YIT6DHVYYR37/action/author_attestation","sign_citation":"https://pith.science/pith/OSJXVLIXXPECX7YIT6DHVYYR37/action/citation_signature","submit_replication":"https://pith.science/pith/OSJXVLIXXPECX7YIT6DHVYYR37/action/replication_record"}},"created_at":"2026-05-18T03:26:42.567870+00:00","updated_at":"2026-05-18T03:26:42.567870+00:00"}