{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OSJXVLIXXPECX7YIT6DHVYYR37","short_pith_number":"pith:OSJXVLIX","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"},"canonical_sha256":"74937aad17bbc82bff089f867ae311dfff41ee24701b8b28e19e814b82f7ed54","source":{"kind":"arxiv","id":"1301.6587","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6587","created_at":"2026-05-18T03:26:42Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6587v2","created_at":"2026-05-18T03:26:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6587","created_at":"2026-05-18T03:26:42Z"},{"alias_kind":"pith_short_12","alias_value":"OSJXVLIXXPEC","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OSJXVLIXXPECX7YI","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OSJXVLIX","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OSJXVLIXXPECX7YIT6DHVYYR37","target":"record","payload":{"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"},"canonical_sha256":"74937aad17bbc82bff089f867ae311dfff41ee24701b8b28e19e814b82f7ed54","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"},"source_kind":"arxiv","source_id":"1301.6587","source_version":2,"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-18T03:26:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OTIMbuls/r3LMri6MMN5qVcLcrgL8oM7ZUfOuBhhXXbVLrPONvJAk3HEkcu/QLv/umU9jaPsU6yWRJnkNZJKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:47:04.354011Z"},"content_sha256":"e3c2aac8890f23ab925f71c4ad98fad2cfc3650ae0594c50fb1c2152e3a9ce80","schema_version":"1.0","event_id":"sha256:e3c2aac8890f23ab925f71c4ad98fad2cfc3650ae0594c50fb1c2152e3a9ce80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OSJXVLIXXPECX7YIT6DHVYYR37","target":"graph","payload":{"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"},"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-18T03:26:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O1MUMhP9hgVB8SF3ZpdudfaBFZJsqhK46As9/qCdT8+IuMwarSbXhanb/HojkJolqd6cNw5DbnbOGpK+jcDbCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:47:04.354384Z"},"content_sha256":"dbc0e2fa3f35ebd98fda2637c2132004f67b68c25e91738f5ada8c7d91e23eec","schema_version":"1.0","event_id":"sha256:dbc0e2fa3f35ebd98fda2637c2132004f67b68c25e91738f5ada8c7d91e23eec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OSJXVLIXXPECX7YIT6DHVYYR37/bundle.json","state_url":"https://pith.science/pith/OSJXVLIXXPECX7YIT6DHVYYR37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OSJXVLIXXPECX7YIT6DHVYYR37/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-21T23:47:04Z","links":{"resolver":"https://pith.science/pith/OSJXVLIXXPECX7YIT6DHVYYR37","bundle":"https://pith.science/pith/OSJXVLIXXPECX7YIT6DHVYYR37/bundle.json","state":"https://pith.science/pith/OSJXVLIXXPECX7YIT6DHVYYR37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OSJXVLIXXPECX7YIT6DHVYYR37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OSJXVLIXXPECX7YIT6DHVYYR37","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":"a3b7acdc1a99735634188d8698919f42446fa674a13046f2de7ca2c88616f648","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T16:06:26Z","title_canon_sha256":"bb897513adda030ee75ef38e2e88e74b0471366d8f635ec278245afd660f8065"},"schema_version":"1.0","source":{"id":"1301.6587","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6587","created_at":"2026-05-18T03:26:42Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6587v2","created_at":"2026-05-18T03:26:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6587","created_at":"2026-05-18T03:26:42Z"},{"alias_kind":"pith_short_12","alias_value":"OSJXVLIXXPEC","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OSJXVLIXXPECX7YI","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OSJXVLIX","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:dbc0e2fa3f35ebd98fda2637c2132004f67b68c25e91738f5ada8c7d91e23eec","target":"graph","created_at":"2026-05-18T03:26:42Z","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 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","authors_text":"Georgios Rodolakis","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T16:06:26Z","title":"Information Theoretic Cut-set Bounds on the Capacity of Poisson Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6587","kind":"arxiv","version":2},"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:e3c2aac8890f23ab925f71c4ad98fad2cfc3650ae0594c50fb1c2152e3a9ce80","target":"record","created_at":"2026-05-18T03:26:42Z","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":"a3b7acdc1a99735634188d8698919f42446fa674a13046f2de7ca2c88616f648","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T16:06:26Z","title_canon_sha256":"bb897513adda030ee75ef38e2e88e74b0471366d8f635ec278245afd660f8065"},"schema_version":"1.0","source":{"id":"1301.6587","kind":"arxiv","version":2}},"canonical_sha256":"74937aad17bbc82bff089f867ae311dfff41ee24701b8b28e19e814b82f7ed54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74937aad17bbc82bff089f867ae311dfff41ee24701b8b28e19e814b82f7ed54","first_computed_at":"2026-05-18T03:26:42.567722Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:42.567722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qKXTmgBr5bn031Tz1y4IuVKYjO1d3TRM7vlR5sOOJtofWrJ1yiupHeyq2ZS4WP0EEwtbkIz0ULIborL/Et9XAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:42.568574Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6587","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3c2aac8890f23ab925f71c4ad98fad2cfc3650ae0594c50fb1c2152e3a9ce80","sha256:dbc0e2fa3f35ebd98fda2637c2132004f67b68c25e91738f5ada8c7d91e23eec"],"state_sha256":"5d6c7b24b5067bb168e0c6e9b974cc9cba3d3ca3b4d7282cd5eacd4d1edb9706"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qdp5LReEwVerDy24xS0AnMmFpnhkEKJWnHXJ0+MtowM1liwyXHkGxbuWkNimsC0XOb2uYPk3FVJQDjzoUlVnDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T23:47:04.356433Z","bundle_sha256":"fe56b67d933614864953809f4c06b86975416b2e697908462faf20011fc52b8c"}}