{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OYXG2QRZBXUROWPTRUF5QI2FEC","short_pith_number":"pith:OYXG2QRZ","canonical_record":{"source":{"id":"1604.07648","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-26T12:25:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d273d7220fa81c1eee40c5d92455ef007173d843e824e589d8ed8fdd2eb89e7f","abstract_canon_sha256":"4b9e5e809c96a2c9184ccf40856fadee68754af7ca65d97998994c893fc05916"},"schema_version":"1.0"},"canonical_sha256":"762e6d42390de91759f38d0bd823452086dad4fa873b0ab1f0ef1d200250c0b9","source":{"kind":"arxiv","id":"1604.07648","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07648","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07648v2","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07648","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"pith_short_12","alias_value":"OYXG2QRZBXUR","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OYXG2QRZBXUROWPT","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OYXG2QRZ","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OYXG2QRZBXUROWPTRUF5QI2FEC","target":"record","payload":{"canonical_record":{"source":{"id":"1604.07648","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-26T12:25:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d273d7220fa81c1eee40c5d92455ef007173d843e824e589d8ed8fdd2eb89e7f","abstract_canon_sha256":"4b9e5e809c96a2c9184ccf40856fadee68754af7ca65d97998994c893fc05916"},"schema_version":"1.0"},"canonical_sha256":"762e6d42390de91759f38d0bd823452086dad4fa873b0ab1f0ef1d200250c0b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:02.584157Z","signature_b64":"ljv+XLeyZSukt2Ecl4T7ZEVcZMGrmwZs3DzR//FHDEkfD2RFlvqBdi75fSnlickPT99bDBJ+pqx2HW1ocSjJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"762e6d42390de91759f38d0bd823452086dad4fa873b0ab1f0ef1d200250c0b9","last_reissued_at":"2026-05-18T00:53:02.583667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:02.583667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.07648","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-18T00:53:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xY/wTlCs6xCRPleihbuJcTChRQvm41q+gJYVAGhTaS04GdyiHTuKO0OmDkg6oceLLeuoBKXSbM31eSA1VWbQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:43:34.487003Z"},"content_sha256":"fa46780b0113631fc9e7d599bfbe260a0c690706eb94aa10675d892a673c255a","schema_version":"1.0","event_id":"sha256:fa46780b0113631fc9e7d599bfbe260a0c690706eb94aa10675d892a673c255a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OYXG2QRZBXUROWPTRUF5QI2FEC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Order-Optimal Decentralized Coded Caching Schemes with Good Performance in the Finite File Size Regime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Caire, Hui Liu, Sian Jin, Ying Cui","submitted_at":"2016-04-26T12:25:17Z","abstract_excerpt":"A decentralized coded caching scheme based on independent random content placement has been proposed by Maddah-Ali and Niesen, and has been shown to achieve an order-optimal memory-load tradeoff when the file size goes to infinity. It was then successively shown by Shanmugam et al. that in the practical operating regime where the file size is limited such scheme yields much less attractive load gain. In this paper, we propose a decentralized random coded caching scheme and a partially decentralized sequential coded caching scheme with different coordination requirements in the content placemen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07648","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-18T00:53:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ry3/1/728jGvSDUtQVmPXyGG3+AMQ7s5NiLBOXBBbETBjIQuZmF6YOsFBp+Laa3Qk7kPSwdwA2VIHF3LA0LmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:43:34.487703Z"},"content_sha256":"4434e68231fc5bb78ce75f483ce46fdd9ae53c6448799d0fa35263b9fbbd97c3","schema_version":"1.0","event_id":"sha256:4434e68231fc5bb78ce75f483ce46fdd9ae53c6448799d0fa35263b9fbbd97c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OYXG2QRZBXUROWPTRUF5QI2FEC/bundle.json","state_url":"https://pith.science/pith/OYXG2QRZBXUROWPTRUF5QI2FEC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OYXG2QRZBXUROWPTRUF5QI2FEC/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-25T20:43:34Z","links":{"resolver":"https://pith.science/pith/OYXG2QRZBXUROWPTRUF5QI2FEC","bundle":"https://pith.science/pith/OYXG2QRZBXUROWPTRUF5QI2FEC/bundle.json","state":"https://pith.science/pith/OYXG2QRZBXUROWPTRUF5QI2FEC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OYXG2QRZBXUROWPTRUF5QI2FEC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OYXG2QRZBXUROWPTRUF5QI2FEC","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":"4b9e5e809c96a2c9184ccf40856fadee68754af7ca65d97998994c893fc05916","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-26T12:25:17Z","title_canon_sha256":"d273d7220fa81c1eee40c5d92455ef007173d843e824e589d8ed8fdd2eb89e7f"},"schema_version":"1.0","source":{"id":"1604.07648","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07648","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07648v2","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07648","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"pith_short_12","alias_value":"OYXG2QRZBXUR","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OYXG2QRZBXUROWPT","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OYXG2QRZ","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:4434e68231fc5bb78ce75f483ce46fdd9ae53c6448799d0fa35263b9fbbd97c3","target":"graph","created_at":"2026-05-18T00:53:02Z","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":"A decentralized coded caching scheme based on independent random content placement has been proposed by Maddah-Ali and Niesen, and has been shown to achieve an order-optimal memory-load tradeoff when the file size goes to infinity. It was then successively shown by Shanmugam et al. that in the practical operating regime where the file size is limited such scheme yields much less attractive load gain. In this paper, we propose a decentralized random coded caching scheme and a partially decentralized sequential coded caching scheme with different coordination requirements in the content placemen","authors_text":"Giuseppe Caire, Hui Liu, Sian Jin, Ying Cui","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-26T12:25:17Z","title":"New Order-Optimal Decentralized Coded Caching Schemes with Good Performance in the Finite File Size Regime"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07648","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:fa46780b0113631fc9e7d599bfbe260a0c690706eb94aa10675d892a673c255a","target":"record","created_at":"2026-05-18T00:53:02Z","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":"4b9e5e809c96a2c9184ccf40856fadee68754af7ca65d97998994c893fc05916","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-26T12:25:17Z","title_canon_sha256":"d273d7220fa81c1eee40c5d92455ef007173d843e824e589d8ed8fdd2eb89e7f"},"schema_version":"1.0","source":{"id":"1604.07648","kind":"arxiv","version":2}},"canonical_sha256":"762e6d42390de91759f38d0bd823452086dad4fa873b0ab1f0ef1d200250c0b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"762e6d42390de91759f38d0bd823452086dad4fa873b0ab1f0ef1d200250c0b9","first_computed_at":"2026-05-18T00:53:02.583667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:02.583667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ljv+XLeyZSukt2Ecl4T7ZEVcZMGrmwZs3DzR//FHDEkfD2RFlvqBdi75fSnlickPT99bDBJ+pqx2HW1ocSjJCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:02.584157Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.07648","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa46780b0113631fc9e7d599bfbe260a0c690706eb94aa10675d892a673c255a","sha256:4434e68231fc5bb78ce75f483ce46fdd9ae53c6448799d0fa35263b9fbbd97c3"],"state_sha256":"edec082d6521c72f4f987a418758b01f05ec22407c5018a56afcae5669781780"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NeWcDkzT3hzRf21NpfXhfoJjkFe0ntUdgIkX+Igz20RrpDCVAvrY3g8l+AwMFJ1/GHa8lq37dmtfsT4EJiKfCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:43:34.491630Z","bundle_sha256":"f103f0cd89fa6bf06b5fef01c0328daf618b7af9f8de5036f46e087e7bc88930"}}