{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4DGF7253AO3JIREAUGIAU2VTN3","short_pith_number":"pith:4DGF7253","canonical_record":{"source":{"id":"1402.1761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-07T16:11:35Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"52b0b48ffe080572965acda747b09181315d65ab6370026a1fbf7fba776afb1f","abstract_canon_sha256":"923544e24432fb4b95e5e82743912bc50c7e13e8928b983200b7112752c32a17"},"schema_version":"1.0"},"canonical_sha256":"e0cc5febbb03b6944480a1900a6ab36ed56aa6c39fd5ff3f4a5983b92b0243f9","source":{"kind":"arxiv","id":"1402.1761","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1761","created_at":"2026-05-18T00:56:51Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1761v1","created_at":"2026-05-18T00:56:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1761","created_at":"2026-05-18T00:56:51Z"},{"alias_kind":"pith_short_12","alias_value":"4DGF7253AO3J","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4DGF7253AO3JIREA","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4DGF7253","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4DGF7253AO3JIREAUGIAU2VTN3","target":"record","payload":{"canonical_record":{"source":{"id":"1402.1761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-07T16:11:35Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"52b0b48ffe080572965acda747b09181315d65ab6370026a1fbf7fba776afb1f","abstract_canon_sha256":"923544e24432fb4b95e5e82743912bc50c7e13e8928b983200b7112752c32a17"},"schema_version":"1.0"},"canonical_sha256":"e0cc5febbb03b6944480a1900a6ab36ed56aa6c39fd5ff3f4a5983b92b0243f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:51.477572Z","signature_b64":"FapRsANq3A9DYu/LuvhjIgQ4jaiLgbCuCQRqlGtQ7K6QqIF3yP7zYJ25IHawhEOw+LX+LcBCNPJenYjKEC9EAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0cc5febbb03b6944480a1900a6ab36ed56aa6c39fd5ff3f4a5983b92b0243f9","last_reissued_at":"2026-05-18T00:56:51.476904Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:51.476904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.1761","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-18T00:56:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/WrTjyAumoKv0wCsmlHIOHaEPxdZGWK08VSP3zkWH1fmMh/va5GYnSfmYpYLW9edtSReMUzfMxA+7etf7EEXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:04:37.402378Z"},"content_sha256":"ac7e14895a0dbc2343beecfb8b1c02cf5c643618e316a70e556adc5ba1a47857","schema_version":"1.0","event_id":"sha256:ac7e14895a0dbc2343beecfb8b1c02cf5c643618e316a70e556adc5ba1a47857"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4DGF7253AO3JIREAUGIAU2VTN3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Scalability of Wireless Networks: A Practical Primer for Large Scale Cooperation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Linda Zeger, Muriel M\\'edard","submitted_at":"2014-02-07T16:11:35Z","abstract_excerpt":"An intuitive overview of the scalability of a variety of types of wireless networks is presented. Simple heuris- tic arguments are demonstrated here for scaling laws presented in other works, as well as for conditions not previously considered in the literature. Unicast and multicast messages, topology, hierarchy, and effects of reliability protocols are discussed. We show how two key factors, bottlenecks and erasures, can often domi- nate the network scaling behavior. Scaling of through- put or delay with the number of transmitting nodes, the number of receiving nodes, and the file size is de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1761","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-18T00:56:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lov3uSDEuCkO1RzWWuZdMuTH5HXKndPhQWMsmgtaXrN3bW4z1X6fKpN+97w8ErTvoW1QaiZl+CagMDMQ/qc4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:04:37.403047Z"},"content_sha256":"c74b36ccf75fbe286bba4c3582c23a8f2459bc4b2d66bd6f4f4699335b3a0a29","schema_version":"1.0","event_id":"sha256:c74b36ccf75fbe286bba4c3582c23a8f2459bc4b2d66bd6f4f4699335b3a0a29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DGF7253AO3JIREAUGIAU2VTN3/bundle.json","state_url":"https://pith.science/pith/4DGF7253AO3JIREAUGIAU2VTN3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DGF7253AO3JIREAUGIAU2VTN3/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-08T15:04:37Z","links":{"resolver":"https://pith.science/pith/4DGF7253AO3JIREAUGIAU2VTN3","bundle":"https://pith.science/pith/4DGF7253AO3JIREAUGIAU2VTN3/bundle.json","state":"https://pith.science/pith/4DGF7253AO3JIREAUGIAU2VTN3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DGF7253AO3JIREAUGIAU2VTN3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4DGF7253AO3JIREAUGIAU2VTN3","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":"923544e24432fb4b95e5e82743912bc50c7e13e8928b983200b7112752c32a17","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-07T16:11:35Z","title_canon_sha256":"52b0b48ffe080572965acda747b09181315d65ab6370026a1fbf7fba776afb1f"},"schema_version":"1.0","source":{"id":"1402.1761","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1761","created_at":"2026-05-18T00:56:51Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1761v1","created_at":"2026-05-18T00:56:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1761","created_at":"2026-05-18T00:56:51Z"},{"alias_kind":"pith_short_12","alias_value":"4DGF7253AO3J","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4DGF7253AO3JIREA","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4DGF7253","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:c74b36ccf75fbe286bba4c3582c23a8f2459bc4b2d66bd6f4f4699335b3a0a29","target":"graph","created_at":"2026-05-18T00:56:51Z","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":"An intuitive overview of the scalability of a variety of types of wireless networks is presented. Simple heuris- tic arguments are demonstrated here for scaling laws presented in other works, as well as for conditions not previously considered in the literature. Unicast and multicast messages, topology, hierarchy, and effects of reliability protocols are discussed. We show how two key factors, bottlenecks and erasures, can often domi- nate the network scaling behavior. Scaling of through- put or delay with the number of transmitting nodes, the number of receiving nodes, and the file size is de","authors_text":"Linda Zeger, Muriel M\\'edard","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-07T16:11:35Z","title":"On Scalability of Wireless Networks: A Practical Primer for Large Scale Cooperation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1761","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:ac7e14895a0dbc2343beecfb8b1c02cf5c643618e316a70e556adc5ba1a47857","target":"record","created_at":"2026-05-18T00:56:51Z","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":"923544e24432fb4b95e5e82743912bc50c7e13e8928b983200b7112752c32a17","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-07T16:11:35Z","title_canon_sha256":"52b0b48ffe080572965acda747b09181315d65ab6370026a1fbf7fba776afb1f"},"schema_version":"1.0","source":{"id":"1402.1761","kind":"arxiv","version":1}},"canonical_sha256":"e0cc5febbb03b6944480a1900a6ab36ed56aa6c39fd5ff3f4a5983b92b0243f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0cc5febbb03b6944480a1900a6ab36ed56aa6c39fd5ff3f4a5983b92b0243f9","first_computed_at":"2026-05-18T00:56:51.476904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:51.476904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FapRsANq3A9DYu/LuvhjIgQ4jaiLgbCuCQRqlGtQ7K6QqIF3yP7zYJ25IHawhEOw+LX+LcBCNPJenYjKEC9EAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:51.477572Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.1761","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac7e14895a0dbc2343beecfb8b1c02cf5c643618e316a70e556adc5ba1a47857","sha256:c74b36ccf75fbe286bba4c3582c23a8f2459bc4b2d66bd6f4f4699335b3a0a29"],"state_sha256":"6dcdbf3d39b5ba92d37a6d8c92681101c1b1b81ba04fa3384fd7b180a2703529"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YR+OJFPaf6qxzXRh8x5JjRenLrYHEW3wxBan3Lhvoxw3vw8ZtUN1uhZrgifmTbdO02yfgXOfy9ldRI2Lmp/mAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:04:37.407421Z","bundle_sha256":"396b5472815b4e420ff206536666da2885fdc6786e6849375920a1e0692cd7dd"}}