{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TOLL45L2T4W5SLAL4PYQKML3ED","short_pith_number":"pith:TOLL45L2","canonical_record":{"source":{"id":"1903.02408","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-05T09:48:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8013798a425c9b63e5b8fb4bff071fc242ce2d71c3e5d01baaaccd4dacbceca6","abstract_canon_sha256":"f4d07b3ec114aef7b65414fa0f81ef091a42054f0ebe61d487abefbc2971ecbb"},"schema_version":"1.0"},"canonical_sha256":"9b96be757a9f2dd92c0be3f105317b20f46ab80e174eaa278137475149c23ff9","source":{"kind":"arxiv","id":"1903.02408","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02408","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02408v1","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02408","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"pith_short_12","alias_value":"TOLL45L2T4W5","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TOLL45L2T4W5SLAL","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TOLL45L2","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TOLL45L2T4W5SLAL4PYQKML3ED","target":"record","payload":{"canonical_record":{"source":{"id":"1903.02408","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-05T09:48:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8013798a425c9b63e5b8fb4bff071fc242ce2d71c3e5d01baaaccd4dacbceca6","abstract_canon_sha256":"f4d07b3ec114aef7b65414fa0f81ef091a42054f0ebe61d487abefbc2971ecbb"},"schema_version":"1.0"},"canonical_sha256":"9b96be757a9f2dd92c0be3f105317b20f46ab80e174eaa278137475149c23ff9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:55.393337Z","signature_b64":"9NPxHxXhK577+pV6gLJ6WaiCIRGU3rKMGA1rm888wAaHaiGkAUy4xHxlOpYCyITf/NXzjgKm8Ctz39d/lKFvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b96be757a9f2dd92c0be3f105317b20f46ab80e174eaa278137475149c23ff9","last_reissued_at":"2026-05-17T23:51:55.392708Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:55.392708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.02408","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:51:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NB+JmwCLU8ukGWtaA3nelnxaGjA7wik1sinWhFZDPYvThq8kFCugsjUvSqwujBAmtMiebHf7o7wO9+GSL/EsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:35:17.179098Z"},"content_sha256":"05a8a8bfc16f8e6f7e9b2b9b30414f9fe660376a272d83cf718cffe13bdc7bd0","schema_version":"1.0","event_id":"sha256:05a8a8bfc16f8e6f7e9b2b9b30414f9fe660376a272d83cf718cffe13bdc7bd0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TOLL45L2T4W5SLAL4PYQKML3ED","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Optimality of Ali-Niesen Decentralized Coded Caching Scheme With and Without Error Correction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Nujoom Sageer Karat","submitted_at":"2019-03-05T09:48:52Z","abstract_excerpt":"The decentralized coded caching was introduced in [M.~A. Maddah-Ali and U.~Niesen, `Decentralized coded caching attains order-optimal memory-rate tradeoff,' \\emph{IEEE/ACM Trans. Networking}, vol.~23, no.~4, pp. 1029--1040, Aug. 2015] in which no coordination is required for the content placement. In this paper, with $N$ files and $K$ users, first it is shown that the decentralized coded caching scheme of Ali and Niesen is optimal for $N \\geq K$ using techniques from index coding. Next the case when the shared link is error prone is considered. For this case, an optimal error correcting delive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02408","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:51:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bE3xzsA/nwmjDc22udOP64SWqE94Tf6jnubShbuBWtHF1dEc9+DcINJsu0WjEROGYb9g4DtIkNq52CuVIxUCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:35:17.179848Z"},"content_sha256":"96e6908bdb6e7588d849915e58b3bc62d93aaf72d4dde42201c61fe7b9d412cd","schema_version":"1.0","event_id":"sha256:96e6908bdb6e7588d849915e58b3bc62d93aaf72d4dde42201c61fe7b9d412cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TOLL45L2T4W5SLAL4PYQKML3ED/bundle.json","state_url":"https://pith.science/pith/TOLL45L2T4W5SLAL4PYQKML3ED/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TOLL45L2T4W5SLAL4PYQKML3ED/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-05T01:35:17Z","links":{"resolver":"https://pith.science/pith/TOLL45L2T4W5SLAL4PYQKML3ED","bundle":"https://pith.science/pith/TOLL45L2T4W5SLAL4PYQKML3ED/bundle.json","state":"https://pith.science/pith/TOLL45L2T4W5SLAL4PYQKML3ED/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TOLL45L2T4W5SLAL4PYQKML3ED/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TOLL45L2T4W5SLAL4PYQKML3ED","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":"f4d07b3ec114aef7b65414fa0f81ef091a42054f0ebe61d487abefbc2971ecbb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-05T09:48:52Z","title_canon_sha256":"8013798a425c9b63e5b8fb4bff071fc242ce2d71c3e5d01baaaccd4dacbceca6"},"schema_version":"1.0","source":{"id":"1903.02408","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02408","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02408v1","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02408","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"pith_short_12","alias_value":"TOLL45L2T4W5","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TOLL45L2T4W5SLAL","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TOLL45L2","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:96e6908bdb6e7588d849915e58b3bc62d93aaf72d4dde42201c61fe7b9d412cd","target":"graph","created_at":"2026-05-17T23:51:55Z","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":"The decentralized coded caching was introduced in [M.~A. Maddah-Ali and U.~Niesen, `Decentralized coded caching attains order-optimal memory-rate tradeoff,' \\emph{IEEE/ACM Trans. Networking}, vol.~23, no.~4, pp. 1029--1040, Aug. 2015] in which no coordination is required for the content placement. In this paper, with $N$ files and $K$ users, first it is shown that the decentralized coded caching scheme of Ali and Niesen is optimal for $N \\geq K$ using techniques from index coding. Next the case when the shared link is error prone is considered. For this case, an optimal error correcting delive","authors_text":"B. Sundar Rajan, Nujoom Sageer Karat","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-05T09:48:52Z","title":"On the Optimality of Ali-Niesen Decentralized Coded Caching Scheme With and Without Error Correction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02408","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:05a8a8bfc16f8e6f7e9b2b9b30414f9fe660376a272d83cf718cffe13bdc7bd0","target":"record","created_at":"2026-05-17T23:51:55Z","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":"f4d07b3ec114aef7b65414fa0f81ef091a42054f0ebe61d487abefbc2971ecbb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-05T09:48:52Z","title_canon_sha256":"8013798a425c9b63e5b8fb4bff071fc242ce2d71c3e5d01baaaccd4dacbceca6"},"schema_version":"1.0","source":{"id":"1903.02408","kind":"arxiv","version":1}},"canonical_sha256":"9b96be757a9f2dd92c0be3f105317b20f46ab80e174eaa278137475149c23ff9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b96be757a9f2dd92c0be3f105317b20f46ab80e174eaa278137475149c23ff9","first_computed_at":"2026-05-17T23:51:55.392708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:55.392708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9NPxHxXhK577+pV6gLJ6WaiCIRGU3rKMGA1rm888wAaHaiGkAUy4xHxlOpYCyITf/NXzjgKm8Ctz39d/lKFvDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:55.393337Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.02408","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05a8a8bfc16f8e6f7e9b2b9b30414f9fe660376a272d83cf718cffe13bdc7bd0","sha256:96e6908bdb6e7588d849915e58b3bc62d93aaf72d4dde42201c61fe7b9d412cd"],"state_sha256":"c2a05318954eb81da09c358395dceadbbf6f1da6749b2523fc4640b4a312a612"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Js3EQISO6u1CVS2eytxXTCeCUluCEz5oF3YcdUGYcy9veiZZ2FL/FnQZsTAH1AZf2Vadrw5kO5bTb+jX1eICw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:35:17.184083Z","bundle_sha256":"78475fc7444385f22718c2b043e350d782108c1bed4728fc50b5cb9676b7a1c1"}}