{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KUZXICPCCCDPHJ7PVWNCQWG2QG","short_pith_number":"pith:KUZXICPC","canonical_record":{"source":{"id":"1801.07734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-23T19:17:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c1f98ba953e3c3b81382315da95feb9f5affaa55da56ea4e79a9c69eee61f754","abstract_canon_sha256":"2d87feff4cead95a5f71f934b12a74ade4bac7255380821c53dfc49966b73c1c"},"schema_version":"1.0"},"canonical_sha256":"55337409e21086f3a7efad9a2858da81a86818e95a18f37265523fbe30af685a","source":{"kind":"arxiv","id":"1801.07734","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07734","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07734v1","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07734","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"KUZXICPCCCDP","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KUZXICPCCCDPHJ7P","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KUZXICPC","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KUZXICPCCCDPHJ7PVWNCQWG2QG","target":"record","payload":{"canonical_record":{"source":{"id":"1801.07734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-23T19:17:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c1f98ba953e3c3b81382315da95feb9f5affaa55da56ea4e79a9c69eee61f754","abstract_canon_sha256":"2d87feff4cead95a5f71f934b12a74ade4bac7255380821c53dfc49966b73c1c"},"schema_version":"1.0"},"canonical_sha256":"55337409e21086f3a7efad9a2858da81a86818e95a18f37265523fbe30af685a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:11.031590Z","signature_b64":"Hxj4kUMYb23ssb7jx80Q7n9YICm1fWQsEgcYiisyxtna6XNLEQbE7kefbfE9hdEM5czSXgOU5vRQ8bBH3gePAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55337409e21086f3a7efad9a2858da81a86818e95a18f37265523fbe30af685a","last_reissued_at":"2026-05-18T00:25:11.030949Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:11.030949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.07734","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:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4zf7WlXIUlJzTd+agbKEGXNkYFuGo45fMTdQlpoAsEljRwAaUMgnQEKvLXbqhrv/DsFDyxZK82Y6Hz7hDljyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:38:40.334349Z"},"content_sha256":"c52ee7ca1d8a7163312425e2cb2baaae5381af2bf2ee02978fb9376262e11d77","schema_version":"1.0","event_id":"sha256:c52ee7ca1d8a7163312425e2cb2baaae5381af2bf2ee02978fb9376262e11d77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KUZXICPCCCDPHJ7PVWNCQWG2QG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From Centralized to Decentralized Coded Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Karthikeyan Shanmugam, Yitao Chen","submitted_at":"2018-01-23T19:17:34Z","abstract_excerpt":"We consider the problem of designing decentralized schemes for coded caching. In this problem there are $K$ users each caching $M$ files out of a library of $N$ total files. The question is to minimize $R$, the number of broadcast transmissions to satisfy all the user demands. Decentralized schemes allow the creation of each cache independently, allowing users to join or leave without dependencies. Previous work showed that to achieve a coding gain $g$, i.e. $R \\leq K (1-M/N)/g$ transmissions, each file has to be divided into number of subpackets that is exponential in $g$.\n  In this work we p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07734","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:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D+GhZI8/hn+r08vcIrM5BRacOkVSpoOUQG+4+5GPLR2iH8+0lmyZzmUS4sEZn9Yhq3VFj/fXOL/PY8OE2FPVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:38:40.334703Z"},"content_sha256":"be9b8ce7102d349cc40a2e6d5886fd263ba56ab796f9c3f5fa1a0237ba857e51","schema_version":"1.0","event_id":"sha256:be9b8ce7102d349cc40a2e6d5886fd263ba56ab796f9c3f5fa1a0237ba857e51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KUZXICPCCCDPHJ7PVWNCQWG2QG/bundle.json","state_url":"https://pith.science/pith/KUZXICPCCCDPHJ7PVWNCQWG2QG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KUZXICPCCCDPHJ7PVWNCQWG2QG/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-19T19:38:40Z","links":{"resolver":"https://pith.science/pith/KUZXICPCCCDPHJ7PVWNCQWG2QG","bundle":"https://pith.science/pith/KUZXICPCCCDPHJ7PVWNCQWG2QG/bundle.json","state":"https://pith.science/pith/KUZXICPCCCDPHJ7PVWNCQWG2QG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KUZXICPCCCDPHJ7PVWNCQWG2QG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KUZXICPCCCDPHJ7PVWNCQWG2QG","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":"2d87feff4cead95a5f71f934b12a74ade4bac7255380821c53dfc49966b73c1c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-23T19:17:34Z","title_canon_sha256":"c1f98ba953e3c3b81382315da95feb9f5affaa55da56ea4e79a9c69eee61f754"},"schema_version":"1.0","source":{"id":"1801.07734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07734","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07734v1","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07734","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"KUZXICPCCCDP","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KUZXICPCCCDPHJ7P","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KUZXICPC","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:be9b8ce7102d349cc40a2e6d5886fd263ba56ab796f9c3f5fa1a0237ba857e51","target":"graph","created_at":"2026-05-18T00:25:11Z","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 the problem of designing decentralized schemes for coded caching. In this problem there are $K$ users each caching $M$ files out of a library of $N$ total files. The question is to minimize $R$, the number of broadcast transmissions to satisfy all the user demands. Decentralized schemes allow the creation of each cache independently, allowing users to join or leave without dependencies. Previous work showed that to achieve a coding gain $g$, i.e. $R \\leq K (1-M/N)/g$ transmissions, each file has to be divided into number of subpackets that is exponential in $g$.\n  In this work we p","authors_text":"Alexandros G. Dimakis, Karthikeyan Shanmugam, Yitao Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-23T19:17:34Z","title":"From Centralized to Decentralized Coded Caching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07734","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:c52ee7ca1d8a7163312425e2cb2baaae5381af2bf2ee02978fb9376262e11d77","target":"record","created_at":"2026-05-18T00:25:11Z","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":"2d87feff4cead95a5f71f934b12a74ade4bac7255380821c53dfc49966b73c1c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-23T19:17:34Z","title_canon_sha256":"c1f98ba953e3c3b81382315da95feb9f5affaa55da56ea4e79a9c69eee61f754"},"schema_version":"1.0","source":{"id":"1801.07734","kind":"arxiv","version":1}},"canonical_sha256":"55337409e21086f3a7efad9a2858da81a86818e95a18f37265523fbe30af685a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55337409e21086f3a7efad9a2858da81a86818e95a18f37265523fbe30af685a","first_computed_at":"2026-05-18T00:25:11.030949Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:11.030949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hxj4kUMYb23ssb7jx80Q7n9YICm1fWQsEgcYiisyxtna6XNLEQbE7kefbfE9hdEM5czSXgOU5vRQ8bBH3gePAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:11.031590Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c52ee7ca1d8a7163312425e2cb2baaae5381af2bf2ee02978fb9376262e11d77","sha256:be9b8ce7102d349cc40a2e6d5886fd263ba56ab796f9c3f5fa1a0237ba857e51"],"state_sha256":"cfc711ffdf1196f28ae3af4c41aa73b9f607cfe6c4f89de75793a63a0f5bae4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K+3Ib15wbTwhFnCITErQGfjVRFiGcG+XCqyDqCNLJTcNWNpw8vdvlwD+fTqob7yL2oUL4671C5280g/wtZ5ODg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T19:38:40.336753Z","bundle_sha256":"fad8997ba0022f5ecec3c2ee8ddc7b652f6382236afe02d4ed51f6281a1178fc"}}