{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BQDLCQ7FWLEFZR2JA33DE3E7SU","short_pith_number":"pith:BQDLCQ7F","canonical_record":{"source":{"id":"1905.02178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-06T17:52:03Z","cross_cats_sorted":["cs.NI","eess.SP","math.IT"],"title_canon_sha256":"5a6a855626b9d8b033a4db5f2b541c567fcec9770e22567f56068c50496ce8b8","abstract_canon_sha256":"446fa9505a9f30d589e74c7b9c5761c7a54f1ad6f5a40c02e45f6c85eae50854"},"schema_version":"1.0"},"canonical_sha256":"0c06b143e5b2c85cc74906f6326c9f950586309b35b7c69523feea9b72569fd9","source":{"kind":"arxiv","id":"1905.02178","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02178","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02178v1","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02178","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"pith_short_12","alias_value":"BQDLCQ7FWLEF","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BQDLCQ7FWLEFZR2J","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BQDLCQ7F","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BQDLCQ7FWLEFZR2JA33DE3E7SU","target":"record","payload":{"canonical_record":{"source":{"id":"1905.02178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-06T17:52:03Z","cross_cats_sorted":["cs.NI","eess.SP","math.IT"],"title_canon_sha256":"5a6a855626b9d8b033a4db5f2b541c567fcec9770e22567f56068c50496ce8b8","abstract_canon_sha256":"446fa9505a9f30d589e74c7b9c5761c7a54f1ad6f5a40c02e45f6c85eae50854"},"schema_version":"1.0"},"canonical_sha256":"0c06b143e5b2c85cc74906f6326c9f950586309b35b7c69523feea9b72569fd9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:56.177849Z","signature_b64":"wVxIWjy9dIdf8Zmvoa3sV87BZ2Wn/J5g8F3CCxHI2ECccD0QYiMc4iFHl5WYpX6tCahNwkDeVty6ubhlS9XiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c06b143e5b2c85cc74906f6326c9f950586309b35b7c69523feea9b72569fd9","last_reissued_at":"2026-05-17T23:46:56.177359Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:56.177359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.02178","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-17T23:46:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OXNJYqW1KLc22Xtr32J6gyTmqlAZ5FOXT3lbNqAdbH8fPiAuLzFH19+BIOqDiGR+mPPdDUWtaB9zf4q+HBSRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:29:05.540871Z"},"content_sha256":"fc7ebe615efd0fa7ee5a683f4e522c60b27bf055b7865c81de0645746b603509","schema_version":"1.0","event_id":"sha256:fc7ebe615efd0fa7ee5a683f4e522c60b27bf055b7865c81de0645746b603509"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BQDLCQ7FWLEFZR2JA33DE3E7SU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Age of Information Scaling in Large Networks with Hierarchical Cooperation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Alkan Soysal, Baturalp Buyukates, Sennur Ulukus","submitted_at":"2019-05-06T17:52:03Z","abstract_excerpt":"Given $n$ randomly located source-destination (S-D) pairs on a fixed area network that want to communicate with each other, we study the age of information with a particular focus on its scaling as the network size $n$ grows. We propose a three-phase transmission scheme that utilizes \\textit{hierarchical cooperation} between users along with \\textit{mega update packets} and show that an average age scaling of $O(n^{\\alpha(h)}\\log n)$ per-user is achievable where $h$ denotes the number of hierarchy levels and $\\alpha(h) = \\frac{1}{3\\cdot2^h+1}$ which tends to $0$ as $h$ increases such that asym"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02178","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-17T23:46:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rb7sFL66Q5MGkFM+GzHaNjagrdyn7tRF99MtHVWBWQ+/HWtzPB8sxyDxQfV3FnrxUGkrmNURM2Yx1UxwjqOABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:29:05.541388Z"},"content_sha256":"c5640cf673ab9300fec8dea934dcae53b7efcbfa60ee99ef7a14169f4a5a0141","schema_version":"1.0","event_id":"sha256:c5640cf673ab9300fec8dea934dcae53b7efcbfa60ee99ef7a14169f4a5a0141"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQDLCQ7FWLEFZR2JA33DE3E7SU/bundle.json","state_url":"https://pith.science/pith/BQDLCQ7FWLEFZR2JA33DE3E7SU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQDLCQ7FWLEFZR2JA33DE3E7SU/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-05-27T09:29:05Z","links":{"resolver":"https://pith.science/pith/BQDLCQ7FWLEFZR2JA33DE3E7SU","bundle":"https://pith.science/pith/BQDLCQ7FWLEFZR2JA33DE3E7SU/bundle.json","state":"https://pith.science/pith/BQDLCQ7FWLEFZR2JA33DE3E7SU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQDLCQ7FWLEFZR2JA33DE3E7SU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BQDLCQ7FWLEFZR2JA33DE3E7SU","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":"446fa9505a9f30d589e74c7b9c5761c7a54f1ad6f5a40c02e45f6c85eae50854","cross_cats_sorted":["cs.NI","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-06T17:52:03Z","title_canon_sha256":"5a6a855626b9d8b033a4db5f2b541c567fcec9770e22567f56068c50496ce8b8"},"schema_version":"1.0","source":{"id":"1905.02178","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02178","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02178v1","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02178","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"pith_short_12","alias_value":"BQDLCQ7FWLEF","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BQDLCQ7FWLEFZR2J","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BQDLCQ7F","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:c5640cf673ab9300fec8dea934dcae53b7efcbfa60ee99ef7a14169f4a5a0141","target":"graph","created_at":"2026-05-17T23:46:56Z","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":"Given $n$ randomly located source-destination (S-D) pairs on a fixed area network that want to communicate with each other, we study the age of information with a particular focus on its scaling as the network size $n$ grows. We propose a three-phase transmission scheme that utilizes \\textit{hierarchical cooperation} between users along with \\textit{mega update packets} and show that an average age scaling of $O(n^{\\alpha(h)}\\log n)$ per-user is achievable where $h$ denotes the number of hierarchy levels and $\\alpha(h) = \\frac{1}{3\\cdot2^h+1}$ which tends to $0$ as $h$ increases such that asym","authors_text":"Alkan Soysal, Baturalp Buyukates, Sennur Ulukus","cross_cats":["cs.NI","eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-06T17:52:03Z","title":"Age of Information Scaling in Large Networks with Hierarchical Cooperation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02178","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:fc7ebe615efd0fa7ee5a683f4e522c60b27bf055b7865c81de0645746b603509","target":"record","created_at":"2026-05-17T23:46:56Z","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":"446fa9505a9f30d589e74c7b9c5761c7a54f1ad6f5a40c02e45f6c85eae50854","cross_cats_sorted":["cs.NI","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-06T17:52:03Z","title_canon_sha256":"5a6a855626b9d8b033a4db5f2b541c567fcec9770e22567f56068c50496ce8b8"},"schema_version":"1.0","source":{"id":"1905.02178","kind":"arxiv","version":1}},"canonical_sha256":"0c06b143e5b2c85cc74906f6326c9f950586309b35b7c69523feea9b72569fd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c06b143e5b2c85cc74906f6326c9f950586309b35b7c69523feea9b72569fd9","first_computed_at":"2026-05-17T23:46:56.177359Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:56.177359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wVxIWjy9dIdf8Zmvoa3sV87BZ2Wn/J5g8F3CCxHI2ECccD0QYiMc4iFHl5WYpX6tCahNwkDeVty6ubhlS9XiCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:56.177849Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.02178","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc7ebe615efd0fa7ee5a683f4e522c60b27bf055b7865c81de0645746b603509","sha256:c5640cf673ab9300fec8dea934dcae53b7efcbfa60ee99ef7a14169f4a5a0141"],"state_sha256":"9ac769a4398d2db5763b8e163fae1495a49cfbf25e9849940065dfe4a6ad34f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VUzFKYkNfLnu+BvOEMN+jds9hPuTj2AWjgBjtrILKMNZuoVSQ3SZ5gfqelv0l4X5ddXG2xZsqHQyxxIXbbKhDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:29:05.544502Z","bundle_sha256":"880feee0778e1db29846b8b3e5a87548e15f00a7a4c00b777c3e5d3128d5e335"}}