{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3VULDIPBN5I4UTCKIKAKBG5PDX","short_pith_number":"pith:3VULDIPB","canonical_record":{"source":{"id":"1504.03754","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-04-15T01:09:11Z","cross_cats_sorted":[],"title_canon_sha256":"1f7a2d72daf04a32fc7aa92cf34666caec13439faf33cad4b75f8fd8c0af1a22","abstract_canon_sha256":"263b35399db64d87199de348e544553e67dd4d731baa533fd197e987f2954fa5"},"schema_version":"1.0"},"canonical_sha256":"dd68b1a1e16f51ca4c4a4280a09baf1dd5a536c2f80148a1ac0c8a6af0747a46","source":{"kind":"arxiv","id":"1504.03754","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03754","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03754v4","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03754","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"pith_short_12","alias_value":"3VULDIPBN5I4","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3VULDIPBN5I4UTCK","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3VULDIPB","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3VULDIPBN5I4UTCKIKAKBG5PDX","target":"record","payload":{"canonical_record":{"source":{"id":"1504.03754","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-04-15T01:09:11Z","cross_cats_sorted":[],"title_canon_sha256":"1f7a2d72daf04a32fc7aa92cf34666caec13439faf33cad4b75f8fd8c0af1a22","abstract_canon_sha256":"263b35399db64d87199de348e544553e67dd4d731baa533fd197e987f2954fa5"},"schema_version":"1.0"},"canonical_sha256":"dd68b1a1e16f51ca4c4a4280a09baf1dd5a536c2f80148a1ac0c8a6af0747a46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:58.976094Z","signature_b64":"J91tVA3pnd4K8E16s5WajmtILKSyyQx6hHR2W0HylMXvMkCQ0JyWYPj1dkEdA3gKws/P/2PLaReEKPyFEKnnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd68b1a1e16f51ca4c4a4280a09baf1dd5a536c2f80148a1ac0c8a6af0747a46","last_reissued_at":"2026-05-18T00:45:58.975642Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:58.975642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.03754","source_version":4,"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:45:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hGK2nWdqSYuns6Dk0VaTyU5uxMwL8iIf+JFWzPXCMbhNMJF3hNfl/OHrbrSmQnzbxHb4MWHlq1J3JmnQqRd3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:42:24.250518Z"},"content_sha256":"cf9f7dcc5fcf824286a704ad2019bf00a76e50dc53a67b82a3c6bcaac50e3eb4","schema_version":"1.0","event_id":"sha256:cf9f7dcc5fcf824286a704ad2019bf00a76e50dc53a67b82a3c6bcaac50e3eb4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3VULDIPBN5I4UTCKIKAKBG5PDX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput and Delay Scaling of Content-Centric Ad Hoc and Heterogeneous Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Edmund Yeh, Milad Mahdian","submitted_at":"2015-04-15T01:09:11Z","abstract_excerpt":"We study the throughput and delay characteristics of wireless caching networks, where users are mainly interested in retrieving content stored in the network, rather than in maintaining source-destination communication. Nodes are assumed to be uniformly distributed in the network area. Each node has a limited-capacity content store, which it uses to cache contents. We propose an achievable caching and transmission scheme whereby requesters retrieve content from the caching point which is closest in Euclidean distance. We establish the throughput and delay scaling of the achievable scheme, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03754","kind":"arxiv","version":4},"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:45:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3os8o+YUiodayxBe+AlchvvBE73Npv/eTbjfKEWEDwjcg/wOPc4j/2bzOGI9tqH3K9bBeUiu6WnTNIT97WoMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:42:24.250871Z"},"content_sha256":"3c57d8602d07f5cec697e4c8775ac475d3fdcc05493bc2625e6fa46446d9a687","schema_version":"1.0","event_id":"sha256:3c57d8602d07f5cec697e4c8775ac475d3fdcc05493bc2625e6fa46446d9a687"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3VULDIPBN5I4UTCKIKAKBG5PDX/bundle.json","state_url":"https://pith.science/pith/3VULDIPBN5I4UTCKIKAKBG5PDX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3VULDIPBN5I4UTCKIKAKBG5PDX/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-02T04:42:24Z","links":{"resolver":"https://pith.science/pith/3VULDIPBN5I4UTCKIKAKBG5PDX","bundle":"https://pith.science/pith/3VULDIPBN5I4UTCKIKAKBG5PDX/bundle.json","state":"https://pith.science/pith/3VULDIPBN5I4UTCKIKAKBG5PDX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3VULDIPBN5I4UTCKIKAKBG5PDX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3VULDIPBN5I4UTCKIKAKBG5PDX","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":"263b35399db64d87199de348e544553e67dd4d731baa533fd197e987f2954fa5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-04-15T01:09:11Z","title_canon_sha256":"1f7a2d72daf04a32fc7aa92cf34666caec13439faf33cad4b75f8fd8c0af1a22"},"schema_version":"1.0","source":{"id":"1504.03754","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03754","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03754v4","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03754","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"pith_short_12","alias_value":"3VULDIPBN5I4","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3VULDIPBN5I4UTCK","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3VULDIPB","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:3c57d8602d07f5cec697e4c8775ac475d3fdcc05493bc2625e6fa46446d9a687","target":"graph","created_at":"2026-05-18T00:45:58Z","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":"We study the throughput and delay characteristics of wireless caching networks, where users are mainly interested in retrieving content stored in the network, rather than in maintaining source-destination communication. Nodes are assumed to be uniformly distributed in the network area. Each node has a limited-capacity content store, which it uses to cache contents. We propose an achievable caching and transmission scheme whereby requesters retrieve content from the caching point which is closest in Euclidean distance. We establish the throughput and delay scaling of the achievable scheme, and ","authors_text":"Edmund Yeh, Milad Mahdian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-04-15T01:09:11Z","title":"Throughput and Delay Scaling of Content-Centric Ad Hoc and Heterogeneous Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03754","kind":"arxiv","version":4},"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:cf9f7dcc5fcf824286a704ad2019bf00a76e50dc53a67b82a3c6bcaac50e3eb4","target":"record","created_at":"2026-05-18T00:45:58Z","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":"263b35399db64d87199de348e544553e67dd4d731baa533fd197e987f2954fa5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-04-15T01:09:11Z","title_canon_sha256":"1f7a2d72daf04a32fc7aa92cf34666caec13439faf33cad4b75f8fd8c0af1a22"},"schema_version":"1.0","source":{"id":"1504.03754","kind":"arxiv","version":4}},"canonical_sha256":"dd68b1a1e16f51ca4c4a4280a09baf1dd5a536c2f80148a1ac0c8a6af0747a46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd68b1a1e16f51ca4c4a4280a09baf1dd5a536c2f80148a1ac0c8a6af0747a46","first_computed_at":"2026-05-18T00:45:58.975642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:58.975642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J91tVA3pnd4K8E16s5WajmtILKSyyQx6hHR2W0HylMXvMkCQ0JyWYPj1dkEdA3gKws/P/2PLaReEKPyFEKnnBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:58.976094Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.03754","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf9f7dcc5fcf824286a704ad2019bf00a76e50dc53a67b82a3c6bcaac50e3eb4","sha256:3c57d8602d07f5cec697e4c8775ac475d3fdcc05493bc2625e6fa46446d9a687"],"state_sha256":"794b4a52a2a0baff36e1a6561b5880883e2dd849a2e6dbe4f8c5ef3dd055227c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CfyOJu+j7ZniXKbH5SugBYFwHSvGWtfOzJSscAQSbQFHFVUlxurnErsD3Yniy/T7iYawPH8nZi6xXnpnJ/NHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:42:24.252848Z","bundle_sha256":"c15010cfecc298fd11c2a35be0d0cc0ab71cd048cb8f50bc9eff8cefc8db26fd"}}