{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZTTKBRXMHZDJEGSI7MIOVJQSKY","short_pith_number":"pith:ZTTKBRXM","canonical_record":{"source":{"id":"1902.07121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-19T16:24:15Z","cross_cats_sorted":[],"title_canon_sha256":"31c0f442d7bed4c5a93aedf8bde10d4560d2d8b9d7a77a4f3ae137e0e2b994ef","abstract_canon_sha256":"6a32bc2bc859b6e721bd2f24a08c8f589f42a1fa12c53c569c7973282724994f"},"schema_version":"1.0"},"canonical_sha256":"cce6a0c6ec3e46921a48fb10eaa6125619ab53ad3fcb9eb3719ee278b31f094e","source":{"kind":"arxiv","id":"1902.07121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07121","created_at":"2026-05-17T23:53:39Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07121v1","created_at":"2026-05-17T23:53:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07121","created_at":"2026-05-17T23:53:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZTTKBRXMHZDJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZTTKBRXMHZDJEGSI","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZTTKBRXM","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZTTKBRXMHZDJEGSI7MIOVJQSKY","target":"record","payload":{"canonical_record":{"source":{"id":"1902.07121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-19T16:24:15Z","cross_cats_sorted":[],"title_canon_sha256":"31c0f442d7bed4c5a93aedf8bde10d4560d2d8b9d7a77a4f3ae137e0e2b994ef","abstract_canon_sha256":"6a32bc2bc859b6e721bd2f24a08c8f589f42a1fa12c53c569c7973282724994f"},"schema_version":"1.0"},"canonical_sha256":"cce6a0c6ec3e46921a48fb10eaa6125619ab53ad3fcb9eb3719ee278b31f094e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:39.848538Z","signature_b64":"OwDVC2EAw44ue8IWON6T/5Ne8gTiDlKCbJrzRpNJvx8uX45kOO/ZSgpN2GLnDyd+Vtqz2Y9bL1Tf5Ko/8xV9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cce6a0c6ec3e46921a48fb10eaa6125619ab53ad3fcb9eb3719ee278b31f094e","last_reissued_at":"2026-05-17T23:53:39.847779Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:39.847779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.07121","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:53:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oYC0sOImzt9T8NHmVWbrBdH4RQKkufqR9dFBgClxMPCtrr+hQQ/uXc4uzc5DpuUbiajYR4w1pvC/GZtosKgpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:39:11.984167Z"},"content_sha256":"3b3ffcec350c9579d301dafe1549f6d15048aaf17c50014ad7a408db71b5cfcd","schema_version":"1.0","event_id":"sha256:3b3ffcec350c9579d301dafe1549f6d15048aaf17c50014ad7a408db71b5cfcd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZTTKBRXMHZDJEGSI7MIOVJQSKY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Network Caching via Dynamic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Alireza Sadeghi, Antonio G. Marques, Georgios B. Giannakis","submitted_at":"2019-02-19T16:24:15Z","abstract_excerpt":"Next-generation communication networks are envisioned to extensively utilize storage-enabled caching units to alleviate unfavorable surges of data traffic by pro-actively storing anticipated highly popular contents across geographically distributed storage devices during off-peak periods. This resource pre-allocation is envisioned not only to improve network efficiency, but also to increase user satisfaction. In this context, the present paper designs optimal caching schemes for \\textit{distributed caching} scenarios. In particular, we look at networks where a central node (base station) commu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07121","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:53:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"exJpMIXqOAaxl3bhgnMqq4Mp3Zk2AJLKZWeVB6iF6baRlaN6p8smLS67PgIhsY8Ar2XcTCvAlIHvpE0Cd7lHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:39:11.984859Z"},"content_sha256":"26535834121d67cfbc1c71bb6b32a89b67d8b44a063ffd07e667ad73cea11a0a","schema_version":"1.0","event_id":"sha256:26535834121d67cfbc1c71bb6b32a89b67d8b44a063ffd07e667ad73cea11a0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTTKBRXMHZDJEGSI7MIOVJQSKY/bundle.json","state_url":"https://pith.science/pith/ZTTKBRXMHZDJEGSI7MIOVJQSKY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTTKBRXMHZDJEGSI7MIOVJQSKY/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-06T21:39:11Z","links":{"resolver":"https://pith.science/pith/ZTTKBRXMHZDJEGSI7MIOVJQSKY","bundle":"https://pith.science/pith/ZTTKBRXMHZDJEGSI7MIOVJQSKY/bundle.json","state":"https://pith.science/pith/ZTTKBRXMHZDJEGSI7MIOVJQSKY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTTKBRXMHZDJEGSI7MIOVJQSKY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZTTKBRXMHZDJEGSI7MIOVJQSKY","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":"6a32bc2bc859b6e721bd2f24a08c8f589f42a1fa12c53c569c7973282724994f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-19T16:24:15Z","title_canon_sha256":"31c0f442d7bed4c5a93aedf8bde10d4560d2d8b9d7a77a4f3ae137e0e2b994ef"},"schema_version":"1.0","source":{"id":"1902.07121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07121","created_at":"2026-05-17T23:53:39Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07121v1","created_at":"2026-05-17T23:53:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07121","created_at":"2026-05-17T23:53:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZTTKBRXMHZDJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZTTKBRXMHZDJEGSI","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZTTKBRXM","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:26535834121d67cfbc1c71bb6b32a89b67d8b44a063ffd07e667ad73cea11a0a","target":"graph","created_at":"2026-05-17T23:53:39Z","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":"Next-generation communication networks are envisioned to extensively utilize storage-enabled caching units to alleviate unfavorable surges of data traffic by pro-actively storing anticipated highly popular contents across geographically distributed storage devices during off-peak periods. This resource pre-allocation is envisioned not only to improve network efficiency, but also to increase user satisfaction. In this context, the present paper designs optimal caching schemes for \\textit{distributed caching} scenarios. In particular, we look at networks where a central node (base station) commu","authors_text":"Alireza Sadeghi, Antonio G. Marques, Georgios B. Giannakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-19T16:24:15Z","title":"Distributed Network Caching via Dynamic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07121","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:3b3ffcec350c9579d301dafe1549f6d15048aaf17c50014ad7a408db71b5cfcd","target":"record","created_at":"2026-05-17T23:53:39Z","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":"6a32bc2bc859b6e721bd2f24a08c8f589f42a1fa12c53c569c7973282724994f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-19T16:24:15Z","title_canon_sha256":"31c0f442d7bed4c5a93aedf8bde10d4560d2d8b9d7a77a4f3ae137e0e2b994ef"},"schema_version":"1.0","source":{"id":"1902.07121","kind":"arxiv","version":1}},"canonical_sha256":"cce6a0c6ec3e46921a48fb10eaa6125619ab53ad3fcb9eb3719ee278b31f094e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cce6a0c6ec3e46921a48fb10eaa6125619ab53ad3fcb9eb3719ee278b31f094e","first_computed_at":"2026-05-17T23:53:39.847779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:39.847779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OwDVC2EAw44ue8IWON6T/5Ne8gTiDlKCbJrzRpNJvx8uX45kOO/ZSgpN2GLnDyd+Vtqz2Y9bL1Tf5Ko/8xV9Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:39.848538Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.07121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b3ffcec350c9579d301dafe1549f6d15048aaf17c50014ad7a408db71b5cfcd","sha256:26535834121d67cfbc1c71bb6b32a89b67d8b44a063ffd07e667ad73cea11a0a"],"state_sha256":"1a75ee65985c788f690b9e82268f36797335ea05f6ca4856fbd0b6a37de70cd7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iNLiOBtu8XZXWEJND7UH11oALyJ0ILMSKzNsAqU1MtQVcdV/M6MVMnVg4tByWUDkZPckF0iuVMtDHRvAzlkaBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:39:11.988292Z","bundle_sha256":"a2d657050b5f6679249f3e7ce88b48c9e22aeba05b527948c489cc3b19c19e8d"}}