{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IGBFIW5MXWO3RGJWGKCIRXGVHG","short_pith_number":"pith:IGBFIW5M","canonical_record":{"source":{"id":"1405.5336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-21T08:55:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7b1fe38585bdc1d630d76a7acaea69a3818d3c64133424063698497be4474856","abstract_canon_sha256":"0450be6f1c98cc213f6622be6436ffabcaaec8d496601c8c97c62c6564844d1b"},"schema_version":"1.0"},"canonical_sha256":"4182545bacbd9db89936328488dcd5398c5c30ad3ef262342ee2160a925a742f","source":{"kind":"arxiv","id":"1405.5336","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5336","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5336v1","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5336","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"IGBFIW5MXWO3","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IGBFIW5MXWO3RGJW","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IGBFIW5M","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IGBFIW5MXWO3RGJWGKCIRXGVHG","target":"record","payload":{"canonical_record":{"source":{"id":"1405.5336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-21T08:55:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7b1fe38585bdc1d630d76a7acaea69a3818d3c64133424063698497be4474856","abstract_canon_sha256":"0450be6f1c98cc213f6622be6436ffabcaaec8d496601c8c97c62c6564844d1b"},"schema_version":"1.0"},"canonical_sha256":"4182545bacbd9db89936328488dcd5398c5c30ad3ef262342ee2160a925a742f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:24.470127Z","signature_b64":"VOJEqNtq04F6qlkqQ0sdN4xkwDZyhVHbmV4Z3QZZImrcFzHOBZXL9nqDxCbCB8hdSGFFPZ2zglU7mOcU4+knCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4182545bacbd9db89936328488dcd5398c5c30ad3ef262342ee2160a925a742f","last_reissued_at":"2026-05-18T02:51:24.469546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:24.469546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.5336","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-18T02:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/E6YWBPJLSRVbqcyqq20EkBXWZjygLNyv6+59vagOLeLYaWGWl371U6+HE7rBTq8qswhkas+9j1ht9zpi4UKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:36:18.581361Z"},"content_sha256":"3b121149a7959385b4a89c1ef1c50f3f80ec52fec063ed9cd0435514f82905e4","schema_version":"1.0","event_id":"sha256:3b121149a7959385b4a89c1ef1c50f3f80ec52fec063ed9cd0435514f82905e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IGBFIW5MXWO3RGJWGKCIRXGVHG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fundamental Limits of Caching in Wireless D2D Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andreas F. Molisch, Giuseppe Caire, Mingyue Ji","submitted_at":"2014-05-21T08:55:05Z","abstract_excerpt":"We consider a wireless Device-to-Device (D2D) network where communication is restricted to be single-hop. Users make arbitrary requests from a finite library of files and have pre-cached information on their devices, subject to a per-node storage capacity constraint. A similar problem has already been considered in an ``infrastructure'' setting, where all users receive a common multicast (coded) message from a single omniscient server (e.g., a base station having all the files in the library) through a shared bottleneck link. In this work, we consider a D2D ``infrastructure-less'' version of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5336","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-18T02:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yDk90EqSUeKRvEA75Lgpj39pZuw8GtqG617vxSmbIUzZUwZDEIgJorz/X4/abjJQSfN7bhrFQxFQmcF5vgasDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:36:18.581771Z"},"content_sha256":"61589069d90408cab730169d19c03efab5c097f689afab83c3090c5e6b800f2e","schema_version":"1.0","event_id":"sha256:61589069d90408cab730169d19c03efab5c097f689afab83c3090c5e6b800f2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IGBFIW5MXWO3RGJWGKCIRXGVHG/bundle.json","state_url":"https://pith.science/pith/IGBFIW5MXWO3RGJWGKCIRXGVHG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IGBFIW5MXWO3RGJWGKCIRXGVHG/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-30T21:36:18Z","links":{"resolver":"https://pith.science/pith/IGBFIW5MXWO3RGJWGKCIRXGVHG","bundle":"https://pith.science/pith/IGBFIW5MXWO3RGJWGKCIRXGVHG/bundle.json","state":"https://pith.science/pith/IGBFIW5MXWO3RGJWGKCIRXGVHG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IGBFIW5MXWO3RGJWGKCIRXGVHG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IGBFIW5MXWO3RGJWGKCIRXGVHG","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":"0450be6f1c98cc213f6622be6436ffabcaaec8d496601c8c97c62c6564844d1b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-21T08:55:05Z","title_canon_sha256":"7b1fe38585bdc1d630d76a7acaea69a3818d3c64133424063698497be4474856"},"schema_version":"1.0","source":{"id":"1405.5336","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5336","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5336v1","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5336","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"IGBFIW5MXWO3","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IGBFIW5MXWO3RGJW","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IGBFIW5M","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:61589069d90408cab730169d19c03efab5c097f689afab83c3090c5e6b800f2e","target":"graph","created_at":"2026-05-18T02:51:24Z","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 a wireless Device-to-Device (D2D) network where communication is restricted to be single-hop. Users make arbitrary requests from a finite library of files and have pre-cached information on their devices, subject to a per-node storage capacity constraint. A similar problem has already been considered in an ``infrastructure'' setting, where all users receive a common multicast (coded) message from a single omniscient server (e.g., a base station having all the files in the library) through a shared bottleneck link. In this work, we consider a D2D ``infrastructure-less'' version of t","authors_text":"Andreas F. Molisch, Giuseppe Caire, Mingyue Ji","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-21T08:55:05Z","title":"Fundamental Limits of Caching in Wireless D2D Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5336","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:3b121149a7959385b4a89c1ef1c50f3f80ec52fec063ed9cd0435514f82905e4","target":"record","created_at":"2026-05-18T02:51:24Z","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":"0450be6f1c98cc213f6622be6436ffabcaaec8d496601c8c97c62c6564844d1b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-21T08:55:05Z","title_canon_sha256":"7b1fe38585bdc1d630d76a7acaea69a3818d3c64133424063698497be4474856"},"schema_version":"1.0","source":{"id":"1405.5336","kind":"arxiv","version":1}},"canonical_sha256":"4182545bacbd9db89936328488dcd5398c5c30ad3ef262342ee2160a925a742f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4182545bacbd9db89936328488dcd5398c5c30ad3ef262342ee2160a925a742f","first_computed_at":"2026-05-18T02:51:24.469546Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:24.469546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VOJEqNtq04F6qlkqQ0sdN4xkwDZyhVHbmV4Z3QZZImrcFzHOBZXL9nqDxCbCB8hdSGFFPZ2zglU7mOcU4+knCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:24.470127Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.5336","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b121149a7959385b4a89c1ef1c50f3f80ec52fec063ed9cd0435514f82905e4","sha256:61589069d90408cab730169d19c03efab5c097f689afab83c3090c5e6b800f2e"],"state_sha256":"13f165d3cd46b808988ff647ffb87af21702c33b67745daf12b068075ecdb29c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ptc7c7NQeYHBPO7rgiEO4xs7l26gouFrHlmQdCvjaBEiNMw61uC2Rk/oszDqI2fjYTqYj1Mxu+97DHJ5NjIMBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:36:18.584298Z","bundle_sha256":"79d90e6e2ab392223f6c06690a22317a286309db8a6602e18c39c602395987e2"}}