{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BE2TORRDHBI3JFWQ2EDVMZULHI","short_pith_number":"pith:BE2TORRD","canonical_record":{"source":{"id":"1708.07493","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-24T17:01:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c24130424a0ce607b8214b6bcdccb921b2daa72d106fec6584cd3efe0f47aaeb","abstract_canon_sha256":"ee2f43ae63d1b9f2df7fbbd9245291c8479be4a48dbd62146228d1b3487d8de5"},"schema_version":"1.0"},"canonical_sha256":"09353746233851b496d0d10756668b3a0019793ddbb366f0fa35241362b8efe4","source":{"kind":"arxiv","id":"1708.07493","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07493","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07493v2","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07493","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"BE2TORRDHBI3","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BE2TORRDHBI3JFWQ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BE2TORRD","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BE2TORRDHBI3JFWQ2EDVMZULHI","target":"record","payload":{"canonical_record":{"source":{"id":"1708.07493","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-24T17:01:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c24130424a0ce607b8214b6bcdccb921b2daa72d106fec6584cd3efe0f47aaeb","abstract_canon_sha256":"ee2f43ae63d1b9f2df7fbbd9245291c8479be4a48dbd62146228d1b3487d8de5"},"schema_version":"1.0"},"canonical_sha256":"09353746233851b496d0d10756668b3a0019793ddbb366f0fa35241362b8efe4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:48.702434Z","signature_b64":"4Gs+r1GvRF5ZOTkXgSAAqM8u7f9EqVp2hzP0NgWX6VRHfzokteIaTAAWIRhLzcjntLNV7cSZeaBrEKpY/h0/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09353746233851b496d0d10756668b3a0019793ddbb366f0fa35241362b8efe4","last_reissued_at":"2026-05-17T23:54:48.702008Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:48.702008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.07493","source_version":2,"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:54:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v+7W15ZEqgX0F6zDzESa6OUPrDHahFHxi8bONeRNZFIjbFOtkDrwP+V2VazPOyK5ZKzgDanXXhCdgkl7cmE/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T12:52:24.999179Z"},"content_sha256":"156f8a194b51af049cd8aff6063ad5e13197622387476a03a65ffe043576fd83","schema_version":"1.0","event_id":"sha256:156f8a194b51af049cd8aff6063ad5e13197622387476a03a65ffe043576fd83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BE2TORRDHBI3JFWQ2EDVMZULHI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decentralized Coded Caching Without File Splitting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ian Blake, Lutz Lampe, Seyed Ali Saberali","submitted_at":"2017-08-24T17:01:04Z","abstract_excerpt":"Coded caching is an effective technique to reduce the redundant traffic in wireless networks. The existing coded caching schemes require the splitting of files into a possibly large number of subfiles, i.e., they perform coded subfile caching. Keeping the files intact during the caching process would actually be appealing, broadly speaking because of its simpler implementation. However, little is known about the effectiveness of this coded file caching in reducing the data delivery rate. In this paper, we propose such a file caching scheme which uses a decentralized algorithm for content place"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07493","kind":"arxiv","version":2},"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:54:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hTryAJFTwdXiU2nj9UdGAho/3DmcklhRaF9e8oGlmJMZeCwh22owsjj3RtlV4Z06YJtINRcxMfJdsVCe3Mo/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T12:52:24.999544Z"},"content_sha256":"74102d85f04d133e276cf9bd72b690bb840611a23c9243c0487537f62552fd0a","schema_version":"1.0","event_id":"sha256:74102d85f04d133e276cf9bd72b690bb840611a23c9243c0487537f62552fd0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BE2TORRDHBI3JFWQ2EDVMZULHI/bundle.json","state_url":"https://pith.science/pith/BE2TORRDHBI3JFWQ2EDVMZULHI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BE2TORRDHBI3JFWQ2EDVMZULHI/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-24T12:52:25Z","links":{"resolver":"https://pith.science/pith/BE2TORRDHBI3JFWQ2EDVMZULHI","bundle":"https://pith.science/pith/BE2TORRDHBI3JFWQ2EDVMZULHI/bundle.json","state":"https://pith.science/pith/BE2TORRDHBI3JFWQ2EDVMZULHI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BE2TORRDHBI3JFWQ2EDVMZULHI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BE2TORRDHBI3JFWQ2EDVMZULHI","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":"ee2f43ae63d1b9f2df7fbbd9245291c8479be4a48dbd62146228d1b3487d8de5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-24T17:01:04Z","title_canon_sha256":"c24130424a0ce607b8214b6bcdccb921b2daa72d106fec6584cd3efe0f47aaeb"},"schema_version":"1.0","source":{"id":"1708.07493","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07493","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07493v2","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07493","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"BE2TORRDHBI3","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BE2TORRDHBI3JFWQ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BE2TORRD","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:74102d85f04d133e276cf9bd72b690bb840611a23c9243c0487537f62552fd0a","target":"graph","created_at":"2026-05-17T23:54:48Z","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":"Coded caching is an effective technique to reduce the redundant traffic in wireless networks. The existing coded caching schemes require the splitting of files into a possibly large number of subfiles, i.e., they perform coded subfile caching. Keeping the files intact during the caching process would actually be appealing, broadly speaking because of its simpler implementation. However, little is known about the effectiveness of this coded file caching in reducing the data delivery rate. In this paper, we propose such a file caching scheme which uses a decentralized algorithm for content place","authors_text":"Ian Blake, Lutz Lampe, Seyed Ali Saberali","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-24T17:01:04Z","title":"Decentralized Coded Caching Without File Splitting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07493","kind":"arxiv","version":2},"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:156f8a194b51af049cd8aff6063ad5e13197622387476a03a65ffe043576fd83","target":"record","created_at":"2026-05-17T23:54:48Z","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":"ee2f43ae63d1b9f2df7fbbd9245291c8479be4a48dbd62146228d1b3487d8de5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-24T17:01:04Z","title_canon_sha256":"c24130424a0ce607b8214b6bcdccb921b2daa72d106fec6584cd3efe0f47aaeb"},"schema_version":"1.0","source":{"id":"1708.07493","kind":"arxiv","version":2}},"canonical_sha256":"09353746233851b496d0d10756668b3a0019793ddbb366f0fa35241362b8efe4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09353746233851b496d0d10756668b3a0019793ddbb366f0fa35241362b8efe4","first_computed_at":"2026-05-17T23:54:48.702008Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:48.702008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Gs+r1GvRF5ZOTkXgSAAqM8u7f9EqVp2hzP0NgWX6VRHfzokteIaTAAWIRhLzcjntLNV7cSZeaBrEKpY/h0/Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:48.702434Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07493","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:156f8a194b51af049cd8aff6063ad5e13197622387476a03a65ffe043576fd83","sha256:74102d85f04d133e276cf9bd72b690bb840611a23c9243c0487537f62552fd0a"],"state_sha256":"799ebdd2d031c98592c912e4075d7005a143a0803cf2f26aa70a5ef95e86ac4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aAGxv66xLp6xxGCeIwM5izIfnOdo+n4vCtkgdeGdvSF1Jtxuf+VGSoOq7AsMECq7+ndT68CnHGi4dQN9AhplCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T12:52:25.001507Z","bundle_sha256":"090c6698013058fdb689a65cfe6d3acd7e403b6e1d7a97408ae2c2e8782ea9f5"}}