{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YZOOWSWN55FUNJFAHPALM2GC3P","short_pith_number":"pith:YZOOWSWN","canonical_record":{"source":{"id":"1801.10563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-31T17:27:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0f4f43e2245da0bda4dc3e5ee3d848f59a79739bb3f6dea3e7310d65ac3ad7ef","abstract_canon_sha256":"14ad68eabb554f55f34d9bb94c2efe1a9a5a17b53b179c134c7c696784640bd5"},"schema_version":"1.0"},"canonical_sha256":"c65ceb4acdef4b46a4a03bc0b668c2dbd4cd6458955777c46b9794f4f3157f76","source":{"kind":"arxiv","id":"1801.10563","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.10563","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"arxiv_version","alias_value":"1801.10563v1","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10563","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"pith_short_12","alias_value":"YZOOWSWN55FU","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YZOOWSWN55FUNJFA","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YZOOWSWN","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YZOOWSWN55FUNJFAHPALM2GC3P","target":"record","payload":{"canonical_record":{"source":{"id":"1801.10563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-31T17:27:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0f4f43e2245da0bda4dc3e5ee3d848f59a79739bb3f6dea3e7310d65ac3ad7ef","abstract_canon_sha256":"14ad68eabb554f55f34d9bb94c2efe1a9a5a17b53b179c134c7c696784640bd5"},"schema_version":"1.0"},"canonical_sha256":"c65ceb4acdef4b46a4a03bc0b668c2dbd4cd6458955777c46b9794f4f3157f76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:40.499666Z","signature_b64":"VEca22nkGTJ43cXi70Ycvuob7A2BTEAoOee2wvd51kBe59KtAk83O7M+1T4308LbIBaUfgQr3Tx6NdXmNPVxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c65ceb4acdef4b46a4a03bc0b668c2dbd4cd6458955777c46b9794f4f3157f76","last_reissued_at":"2026-05-18T00:24:40.499024Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:40.499024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.10563","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-18T00:24:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IV1Vwtv4Eto3tq30I0rg2FeCijvrSmgzXlq6HHinWAovN5azGzEbgCbBgwa/ZUrblDYb9Q6lR6WuRnp00fTvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:49:18.966649Z"},"content_sha256":"e3361da6abc13b7bf7171eb57c1901cd357b8f780ae3cadbb43e65bb7bb300cb","schema_version":"1.0","event_id":"sha256:e3361da6abc13b7bf7171eb57c1901cd357b8f780ae3cadbb43e65bb7bb300cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YZOOWSWN55FUNJFAHPALM2GC3P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Centralized Strategy for Coded Caching with Non-uniform Demands","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michael Gastpar, Pierre Quinton, Saeid Sahraei","submitted_at":"2018-01-31T17:27:41Z","abstract_excerpt":"Despite significant progress in the caching literature concerning the worst case and uniform average case regimes, the algorithms for caching with nonuniform demands are still at a basic stage and mostly rely on simple grouping and memory-sharing techniques. In this work we introduce a novel centralized caching strategy for caching with nonuniform file popularities. Our scheme allows for assigning more cache to the files which are more likely to be requested, while maintaining the same sub-packetization for all the files. As a result, in the delivery phase it is possible to perform linear code"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.10563","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-18T00:24:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qR54A9cK7YISDyvcMbvTyrtQB9ZQqISRt+rlYBhfxoVnHaeorp78aJm+xzVZsnDHGo+sAa4V8GMQgqfYlCOkCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:49:18.967199Z"},"content_sha256":"2192558e618fcddeb78e57ea54c2570e47a644488b0ff5f99f04656a5771bfdc","schema_version":"1.0","event_id":"sha256:2192558e618fcddeb78e57ea54c2570e47a644488b0ff5f99f04656a5771bfdc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZOOWSWN55FUNJFAHPALM2GC3P/bundle.json","state_url":"https://pith.science/pith/YZOOWSWN55FUNJFAHPALM2GC3P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZOOWSWN55FUNJFAHPALM2GC3P/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-04T16:49:18Z","links":{"resolver":"https://pith.science/pith/YZOOWSWN55FUNJFAHPALM2GC3P","bundle":"https://pith.science/pith/YZOOWSWN55FUNJFAHPALM2GC3P/bundle.json","state":"https://pith.science/pith/YZOOWSWN55FUNJFAHPALM2GC3P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZOOWSWN55FUNJFAHPALM2GC3P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YZOOWSWN55FUNJFAHPALM2GC3P","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":"14ad68eabb554f55f34d9bb94c2efe1a9a5a17b53b179c134c7c696784640bd5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-31T17:27:41Z","title_canon_sha256":"0f4f43e2245da0bda4dc3e5ee3d848f59a79739bb3f6dea3e7310d65ac3ad7ef"},"schema_version":"1.0","source":{"id":"1801.10563","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.10563","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"arxiv_version","alias_value":"1801.10563v1","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10563","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"pith_short_12","alias_value":"YZOOWSWN55FU","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YZOOWSWN55FUNJFA","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YZOOWSWN","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:2192558e618fcddeb78e57ea54c2570e47a644488b0ff5f99f04656a5771bfdc","target":"graph","created_at":"2026-05-18T00:24:40Z","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":"Despite significant progress in the caching literature concerning the worst case and uniform average case regimes, the algorithms for caching with nonuniform demands are still at a basic stage and mostly rely on simple grouping and memory-sharing techniques. In this work we introduce a novel centralized caching strategy for caching with nonuniform file popularities. Our scheme allows for assigning more cache to the files which are more likely to be requested, while maintaining the same sub-packetization for all the files. As a result, in the delivery phase it is possible to perform linear code","authors_text":"Michael Gastpar, Pierre Quinton, Saeid Sahraei","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-31T17:27:41Z","title":"A Novel Centralized Strategy for Coded Caching with Non-uniform Demands"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.10563","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:e3361da6abc13b7bf7171eb57c1901cd357b8f780ae3cadbb43e65bb7bb300cb","target":"record","created_at":"2026-05-18T00:24:40Z","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":"14ad68eabb554f55f34d9bb94c2efe1a9a5a17b53b179c134c7c696784640bd5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-31T17:27:41Z","title_canon_sha256":"0f4f43e2245da0bda4dc3e5ee3d848f59a79739bb3f6dea3e7310d65ac3ad7ef"},"schema_version":"1.0","source":{"id":"1801.10563","kind":"arxiv","version":1}},"canonical_sha256":"c65ceb4acdef4b46a4a03bc0b668c2dbd4cd6458955777c46b9794f4f3157f76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c65ceb4acdef4b46a4a03bc0b668c2dbd4cd6458955777c46b9794f4f3157f76","first_computed_at":"2026-05-18T00:24:40.499024Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:40.499024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VEca22nkGTJ43cXi70Ycvuob7A2BTEAoOee2wvd51kBe59KtAk83O7M+1T4308LbIBaUfgQr3Tx6NdXmNPVxAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:40.499666Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.10563","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3361da6abc13b7bf7171eb57c1901cd357b8f780ae3cadbb43e65bb7bb300cb","sha256:2192558e618fcddeb78e57ea54c2570e47a644488b0ff5f99f04656a5771bfdc"],"state_sha256":"eca050793a2a033237cda5247c5a8fca7ec69fb943076e24cfb439729ad76a5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6RY9Q9GwbpCv/e6Fwzqv76XlS+89IWg+S0S3rts6rdsgVCBY6kcP5mI7fr6J4/1w656gjXTWs9N1xWNAO2eXAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T16:49:18.969860Z","bundle_sha256":"b35c92e564bc59dc7e31fab5f576e50fbfbd81012aa3ee8baf66d117a9d3658a"}}