{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BUNCWRZGVWSHETLHEUE6U7VBUM","short_pith_number":"pith:BUNCWRZG","canonical_record":{"source":{"id":"1307.7584","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2013-07-29T13:54:57Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"22a26df7ebe1a5b0e1de2dfe6706ad218da9c93f2176bacfd75403ce6cee9e6d","abstract_canon_sha256":"f4d7493ac1328c68994061e0828eeb2704c525ebc118ac753160f4d86fcbe4c9"},"schema_version":"1.0"},"canonical_sha256":"0d1a2b4726ada4724d672509ea7ea1a32e00a8fedf1358a3aee3a56eab2a5125","source":{"kind":"arxiv","id":"1307.7584","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7584","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7584v2","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7584","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"pith_short_12","alias_value":"BUNCWRZGVWSH","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BUNCWRZGVWSHETLH","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BUNCWRZG","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BUNCWRZGVWSHETLHEUE6U7VBUM","target":"record","payload":{"canonical_record":{"source":{"id":"1307.7584","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2013-07-29T13:54:57Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"22a26df7ebe1a5b0e1de2dfe6706ad218da9c93f2176bacfd75403ce6cee9e6d","abstract_canon_sha256":"f4d7493ac1328c68994061e0828eeb2704c525ebc118ac753160f4d86fcbe4c9"},"schema_version":"1.0"},"canonical_sha256":"0d1a2b4726ada4724d672509ea7ea1a32e00a8fedf1358a3aee3a56eab2a5125","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:59.823853Z","signature_b64":"x2OZF2bBnfSiWgJigU4Xz2eQF7xJeQNJ5EZQyQuBHiTY8OlB5LpUVXv9nCKwD8yr7boqrgfKLc6Z0qWtP9Z+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d1a2b4726ada4724d672509ea7ea1a32e00a8fedf1358a3aee3a56eab2a5125","last_reissued_at":"2026-05-18T03:16:59.823207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:59.823207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.7584","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:16:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jrt7Pk/wj7/FkDlAel5RjBotFvUflpsITlkV9eFcPwn7iyBC5n7+7tqAS/kEoSl9cUDYVf6YtI7lBvqqshOyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:07:15.648336Z"},"content_sha256":"e05c3a784733fa54bcb17ef0f131a8aadb95cd52285e29aa12294da1573dec1f","schema_version":"1.0","event_id":"sha256:e05c3a784733fa54bcb17ef0f131a8aadb95cd52285e29aa12294da1573dec1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BUNCWRZGVWSHETLHEUE6U7VBUM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards a System Theoretic Approach to Wireless Network Capacity in Finite Time and Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.PF","authors_text":"Florin Ciucu, Liu Yang, Ramin Khalili, Yong Cui, Yuming Jiang","submitted_at":"2013-07-29T13:54:57Z","abstract_excerpt":"In asymptotic regimes, both in time and space (network size), the derivation of network capacity results is grossly simplified by brushing aside queueing behavior in non-Jackson networks. This simplifying double-limit model, however, lends itself to conservative numerical results in finite regimes. To properly account for queueing behavior beyond a simple calculus based on average rates, we advocate a system theoretic methodology for the capacity problem in finite time and space regimes. This methodology also accounts for spatial correlations arising in networks with CSMA/CA scheduling and it "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7584","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:16:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zb0Bc9s2jcOEDxN8MmUULDvKYfLaxwP3djRU93PhFSQZDXm66n9/1WmOU/JX9eio7ReIpuiOy0+qI982P7HTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:07:15.648697Z"},"content_sha256":"2760c6f919cb716e3e59ea8b65c08bab34d647a000467f0a2f8ca8d14cd071db","schema_version":"1.0","event_id":"sha256:2760c6f919cb716e3e59ea8b65c08bab34d647a000467f0a2f8ca8d14cd071db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BUNCWRZGVWSHETLHEUE6U7VBUM/bundle.json","state_url":"https://pith.science/pith/BUNCWRZGVWSHETLHEUE6U7VBUM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BUNCWRZGVWSHETLHEUE6U7VBUM/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-01T22:07:15Z","links":{"resolver":"https://pith.science/pith/BUNCWRZGVWSHETLHEUE6U7VBUM","bundle":"https://pith.science/pith/BUNCWRZGVWSHETLHEUE6U7VBUM/bundle.json","state":"https://pith.science/pith/BUNCWRZGVWSHETLHEUE6U7VBUM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BUNCWRZGVWSHETLHEUE6U7VBUM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BUNCWRZGVWSHETLHEUE6U7VBUM","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":"f4d7493ac1328c68994061e0828eeb2704c525ebc118ac753160f4d86fcbe4c9","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2013-07-29T13:54:57Z","title_canon_sha256":"22a26df7ebe1a5b0e1de2dfe6706ad218da9c93f2176bacfd75403ce6cee9e6d"},"schema_version":"1.0","source":{"id":"1307.7584","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7584","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7584v2","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7584","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"pith_short_12","alias_value":"BUNCWRZGVWSH","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BUNCWRZGVWSHETLH","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BUNCWRZG","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:2760c6f919cb716e3e59ea8b65c08bab34d647a000467f0a2f8ca8d14cd071db","target":"graph","created_at":"2026-05-18T03:16:59Z","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":"In asymptotic regimes, both in time and space (network size), the derivation of network capacity results is grossly simplified by brushing aside queueing behavior in non-Jackson networks. This simplifying double-limit model, however, lends itself to conservative numerical results in finite regimes. To properly account for queueing behavior beyond a simple calculus based on average rates, we advocate a system theoretic methodology for the capacity problem in finite time and space regimes. This methodology also accounts for spatial correlations arising in networks with CSMA/CA scheduling and it ","authors_text":"Florin Ciucu, Liu Yang, Ramin Khalili, Yong Cui, Yuming Jiang","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2013-07-29T13:54:57Z","title":"Towards a System Theoretic Approach to Wireless Network Capacity in Finite Time and Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7584","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:e05c3a784733fa54bcb17ef0f131a8aadb95cd52285e29aa12294da1573dec1f","target":"record","created_at":"2026-05-18T03:16:59Z","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":"f4d7493ac1328c68994061e0828eeb2704c525ebc118ac753160f4d86fcbe4c9","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2013-07-29T13:54:57Z","title_canon_sha256":"22a26df7ebe1a5b0e1de2dfe6706ad218da9c93f2176bacfd75403ce6cee9e6d"},"schema_version":"1.0","source":{"id":"1307.7584","kind":"arxiv","version":2}},"canonical_sha256":"0d1a2b4726ada4724d672509ea7ea1a32e00a8fedf1358a3aee3a56eab2a5125","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d1a2b4726ada4724d672509ea7ea1a32e00a8fedf1358a3aee3a56eab2a5125","first_computed_at":"2026-05-18T03:16:59.823207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:59.823207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x2OZF2bBnfSiWgJigU4Xz2eQF7xJeQNJ5EZQyQuBHiTY8OlB5LpUVXv9nCKwD8yr7boqrgfKLc6Z0qWtP9Z+BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:59.823853Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.7584","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e05c3a784733fa54bcb17ef0f131a8aadb95cd52285e29aa12294da1573dec1f","sha256:2760c6f919cb716e3e59ea8b65c08bab34d647a000467f0a2f8ca8d14cd071db"],"state_sha256":"a119918ba0e85481ba362b3c3a19c9c05c49ec371b5fca461572fc06d6bcf536"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZrmxogYp82OuRvAHdVEsPL+hfJZH6rIGVAC7PmxY5SfmT7Mng1acGm05tFwMo+7sdjollK48KyokSMWJhNMHBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:07:15.650669Z","bundle_sha256":"0570ae435da4254e47cf37556dcf2391ea1ca4652b68fd883c09351516c02784"}}