{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TOLL45L2T4W5SLAL4PYQKML3ED","short_pith_number":"pith:TOLL45L2","schema_version":"1.0","canonical_sha256":"9b96be757a9f2dd92c0be3f105317b20f46ab80e174eaa278137475149c23ff9","source":{"kind":"arxiv","id":"1903.02408","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.02408","created_at":"2026-05-17T23:51:55.392823+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.02408v1","created_at":"2026-05-17T23:51:55.392823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02408","created_at":"2026-05-17T23:51:55.392823+00:00"},{"alias_kind":"pith_short_12","alias_value":"TOLL45L2T4W5","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TOLL45L2T4W5SLAL","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TOLL45L2","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TOLL45L2T4W5SLAL4PYQKML3ED","json":"https://pith.science/pith/TOLL45L2T4W5SLAL4PYQKML3ED.json","graph_json":"https://pith.science/api/pith-number/TOLL45L2T4W5SLAL4PYQKML3ED/graph.json","events_json":"https://pith.science/api/pith-number/TOLL45L2T4W5SLAL4PYQKML3ED/events.json","paper":"https://pith.science/paper/TOLL45L2"},"agent_actions":{"view_html":"https://pith.science/pith/TOLL45L2T4W5SLAL4PYQKML3ED","download_json":"https://pith.science/pith/TOLL45L2T4W5SLAL4PYQKML3ED.json","view_paper":"https://pith.science/paper/TOLL45L2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.02408&json=true","fetch_graph":"https://pith.science/api/pith-number/TOLL45L2T4W5SLAL4PYQKML3ED/graph.json","fetch_events":"https://pith.science/api/pith-number/TOLL45L2T4W5SLAL4PYQKML3ED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TOLL45L2T4W5SLAL4PYQKML3ED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TOLL45L2T4W5SLAL4PYQKML3ED/action/storage_attestation","attest_author":"https://pith.science/pith/TOLL45L2T4W5SLAL4PYQKML3ED/action/author_attestation","sign_citation":"https://pith.science/pith/TOLL45L2T4W5SLAL4PYQKML3ED/action/citation_signature","submit_replication":"https://pith.science/pith/TOLL45L2T4W5SLAL4PYQKML3ED/action/replication_record"}},"created_at":"2026-05-17T23:51:55.392823+00:00","updated_at":"2026-05-17T23:51:55.392823+00:00"}