{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:NUMC222664QZYEIBGNV3GN7KKD","short_pith_number":"pith:NUMC2226","canonical_record":{"source":{"id":"0908.1916","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-08-13T15:21:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9aa98b4ca6dc7b49f6cb6cec2aa6462ace193953c4b22c0b75f39948fda433c7","abstract_canon_sha256":"2ffa30379dedf7978c22945341511f3b35df7d2212e3a4462b8e2eba0a59f893"},"schema_version":"1.0"},"canonical_sha256":"6d182d6b5ef7219c1101336bb337ea50f2ebb9e70a902b9001642d42a7b6b740","source":{"kind":"arxiv","id":"0908.1916","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.1916","created_at":"2026-05-18T03:44:36Z"},{"alias_kind":"arxiv_version","alias_value":"0908.1916v3","created_at":"2026-05-18T03:44:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.1916","created_at":"2026-05-18T03:44:36Z"},{"alias_kind":"pith_short_12","alias_value":"NUMC222664QZ","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"NUMC222664QZYEIB","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"NUMC2226","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:NUMC222664QZYEIBGNV3GN7KKD","target":"record","payload":{"canonical_record":{"source":{"id":"0908.1916","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-08-13T15:21:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9aa98b4ca6dc7b49f6cb6cec2aa6462ace193953c4b22c0b75f39948fda433c7","abstract_canon_sha256":"2ffa30379dedf7978c22945341511f3b35df7d2212e3a4462b8e2eba0a59f893"},"schema_version":"1.0"},"canonical_sha256":"6d182d6b5ef7219c1101336bb337ea50f2ebb9e70a902b9001642d42a7b6b740","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:36.564466Z","signature_b64":"Gm1JTq5556n2ZWUmmc5ufvutS5wOd/r8t+NUPf+I11IMptGVjgEYP5OWZXIAXelqr8dKBQ9Eyhd35yo84j9oCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d182d6b5ef7219c1101336bb337ea50f2ebb9e70a902b9001642d42a7b6b740","last_reissued_at":"2026-05-18T03:44:36.563844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:36.563844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0908.1916","source_version":3,"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:44:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mho+vvXTN6DWaJkIVFiaR00DidrOWl9YMjinXUbuV/mzM59wbSpU52H70P+3+TKeA9KIdACDfS1dndLq4u22Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:52:31.017777Z"},"content_sha256":"b96c862c18406c419f487c1610c78f9712c18ff1ac362ac2f1a8d164d001a84d","schema_version":"1.0","event_id":"sha256:b96c862c18406c419f487c1610c78f9712c18ff1ac362ac2f1a8d164d001a84d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:NUMC222664QZYEIBGNV3GN7KKD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Caching in Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Devavrat Shah, Gregory Wornell, Urs Niesen","submitted_at":"2009-08-13T15:21:28Z","abstract_excerpt":"We consider the problem of delivering content cached in a wireless network of n nodes randomly located on a square of area n. The network performance is described by the n2^n-dimensional caching capacity region of the wireless network. We provide an inner bound on this caching capacity region, and, in the high path-loss regime, a matching (in the scaling sense) outer bound. For large path-loss exponent, this provides an information-theoretic scaling characterization of the entire caching capacity region. The proposed communication scheme achieving the inner bound shows that the problems of cac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.1916","kind":"arxiv","version":3},"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:44:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jMdcIV1py6QYaFVij36FDiimrqEHp0RTMfuVhwBBFSR/g5iE8OEyxU7+IcIHCCzYwCRgrkn/9tkYfaV8n7UTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:52:31.018127Z"},"content_sha256":"0d50b7f399821d17911f77cc05d2bc416189c4e4cf73b01adaa7570eb207992f","schema_version":"1.0","event_id":"sha256:0d50b7f399821d17911f77cc05d2bc416189c4e4cf73b01adaa7570eb207992f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NUMC222664QZYEIBGNV3GN7KKD/bundle.json","state_url":"https://pith.science/pith/NUMC222664QZYEIBGNV3GN7KKD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NUMC222664QZYEIBGNV3GN7KKD/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-05T09:52:31Z","links":{"resolver":"https://pith.science/pith/NUMC222664QZYEIBGNV3GN7KKD","bundle":"https://pith.science/pith/NUMC222664QZYEIBGNV3GN7KKD/bundle.json","state":"https://pith.science/pith/NUMC222664QZYEIBGNV3GN7KKD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NUMC222664QZYEIBGNV3GN7KKD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:NUMC222664QZYEIBGNV3GN7KKD","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":"2ffa30379dedf7978c22945341511f3b35df7d2212e3a4462b8e2eba0a59f893","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-08-13T15:21:28Z","title_canon_sha256":"9aa98b4ca6dc7b49f6cb6cec2aa6462ace193953c4b22c0b75f39948fda433c7"},"schema_version":"1.0","source":{"id":"0908.1916","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.1916","created_at":"2026-05-18T03:44:36Z"},{"alias_kind":"arxiv_version","alias_value":"0908.1916v3","created_at":"2026-05-18T03:44:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.1916","created_at":"2026-05-18T03:44:36Z"},{"alias_kind":"pith_short_12","alias_value":"NUMC222664QZ","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"NUMC222664QZYEIB","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"NUMC2226","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:0d50b7f399821d17911f77cc05d2bc416189c4e4cf73b01adaa7570eb207992f","target":"graph","created_at":"2026-05-18T03:44:36Z","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 consider the problem of delivering content cached in a wireless network of n nodes randomly located on a square of area n. The network performance is described by the n2^n-dimensional caching capacity region of the wireless network. We provide an inner bound on this caching capacity region, and, in the high path-loss regime, a matching (in the scaling sense) outer bound. For large path-loss exponent, this provides an information-theoretic scaling characterization of the entire caching capacity region. The proposed communication scheme achieving the inner bound shows that the problems of cac","authors_text":"Devavrat Shah, Gregory Wornell, Urs Niesen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-08-13T15:21:28Z","title":"Caching in Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.1916","kind":"arxiv","version":3},"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:b96c862c18406c419f487c1610c78f9712c18ff1ac362ac2f1a8d164d001a84d","target":"record","created_at":"2026-05-18T03:44:36Z","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":"2ffa30379dedf7978c22945341511f3b35df7d2212e3a4462b8e2eba0a59f893","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-08-13T15:21:28Z","title_canon_sha256":"9aa98b4ca6dc7b49f6cb6cec2aa6462ace193953c4b22c0b75f39948fda433c7"},"schema_version":"1.0","source":{"id":"0908.1916","kind":"arxiv","version":3}},"canonical_sha256":"6d182d6b5ef7219c1101336bb337ea50f2ebb9e70a902b9001642d42a7b6b740","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d182d6b5ef7219c1101336bb337ea50f2ebb9e70a902b9001642d42a7b6b740","first_computed_at":"2026-05-18T03:44:36.563844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:36.563844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gm1JTq5556n2ZWUmmc5ufvutS5wOd/r8t+NUPf+I11IMptGVjgEYP5OWZXIAXelqr8dKBQ9Eyhd35yo84j9oCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:36.564466Z","signed_message":"canonical_sha256_bytes"},"source_id":"0908.1916","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b96c862c18406c419f487c1610c78f9712c18ff1ac362ac2f1a8d164d001a84d","sha256:0d50b7f399821d17911f77cc05d2bc416189c4e4cf73b01adaa7570eb207992f"],"state_sha256":"8596018b99a5e06ecec6001608cd1fa9ca675add75fe29a589123a3f0d59fc3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9fkxvIf87tpb/q+1kaOugcbMrqpjnVUQRezpDzDmmw3sIIH5sxh+hBdaGkWwmzhXv73ZdfkH1T/yc/kh7S/gAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:52:31.020061Z","bundle_sha256":"4b6a25b1d14a1dd97bfd5568c9cd2668e4041da7266b0ed40e873babcacdfe9c"}}