{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XSOLI2U646PSWGOGRVRGQO5XVS","short_pith_number":"pith:XSOLI2U6","schema_version":"1.0","canonical_sha256":"bc9cb46a9ee79f2b19c68d62683bb7acb793cce64db490d772daf9ad2003a6b6","source":{"kind":"arxiv","id":"1809.09422","version":3},"attestation_state":"computed","paper":{"title":"Coded Caching with Shared Caches: Fundamental Limits with Uncoded Prefetching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ay\\c{s}e \\\"Unsal, Emanuele Parrinello, Petros Elia","submitted_at":"2018-09-25T12:00:43Z","abstract_excerpt":"The work identifies the fundamental limits of coded caching when the K receiving users share {\\Lambda}$\\leq$ K helper-caches, each assisting an arbitrary number of different users. The main result is the derivation of the exact optimal worst-case delivery time - under the assumption of uncoded cache placement - for any user-to-cache association profile, where each such profile describes how many users are helped by each cache. This is achieved with a new information-theoretic converse that is based on index coding and which proves that a simple XOR-shrinking-and-removal coded-caching scheme is"},"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":"1809.09422","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-25T12:00:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"314616e41f3b7bc1addfc0d65446b663e1977875d64b7e52635f775a0bd6ac08","abstract_canon_sha256":"84c194a5118be77094278744fbf6b272af969a7996804a4e19393694f70dc2d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:14.766149Z","signature_b64":"KOobLpTHvrkgtBle2LFcTi5uU6WLRBKyubPDiiITAEo+hmmCLWEGFC9vUUBPb79A7u2DKChnHmSZHuNPKdKNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc9cb46a9ee79f2b19c68d62683bb7acb793cce64db490d772daf9ad2003a6b6","last_reissued_at":"2026-05-18T00:03:14.765533Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:14.765533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coded Caching with Shared Caches: Fundamental Limits with Uncoded Prefetching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ay\\c{s}e \\\"Unsal, Emanuele Parrinello, Petros Elia","submitted_at":"2018-09-25T12:00:43Z","abstract_excerpt":"The work identifies the fundamental limits of coded caching when the K receiving users share {\\Lambda}$\\leq$ K helper-caches, each assisting an arbitrary number of different users. The main result is the derivation of the exact optimal worst-case delivery time - under the assumption of uncoded cache placement - for any user-to-cache association profile, where each such profile describes how many users are helped by each cache. This is achieved with a new information-theoretic converse that is based on index coding and which proves that a simple XOR-shrinking-and-removal coded-caching scheme is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09422","kind":"arxiv","version":3},"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":"1809.09422","created_at":"2026-05-18T00:03:14.765617+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.09422v3","created_at":"2026-05-18T00:03:14.765617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09422","created_at":"2026-05-18T00:03:14.765617+00:00"},{"alias_kind":"pith_short_12","alias_value":"XSOLI2U646PS","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XSOLI2U646PSWGOG","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XSOLI2U6","created_at":"2026-05-18T12:33:01.666342+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/XSOLI2U646PSWGOGRVRGQO5XVS","json":"https://pith.science/pith/XSOLI2U646PSWGOGRVRGQO5XVS.json","graph_json":"https://pith.science/api/pith-number/XSOLI2U646PSWGOGRVRGQO5XVS/graph.json","events_json":"https://pith.science/api/pith-number/XSOLI2U646PSWGOGRVRGQO5XVS/events.json","paper":"https://pith.science/paper/XSOLI2U6"},"agent_actions":{"view_html":"https://pith.science/pith/XSOLI2U646PSWGOGRVRGQO5XVS","download_json":"https://pith.science/pith/XSOLI2U646PSWGOGRVRGQO5XVS.json","view_paper":"https://pith.science/paper/XSOLI2U6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.09422&json=true","fetch_graph":"https://pith.science/api/pith-number/XSOLI2U646PSWGOGRVRGQO5XVS/graph.json","fetch_events":"https://pith.science/api/pith-number/XSOLI2U646PSWGOGRVRGQO5XVS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XSOLI2U646PSWGOGRVRGQO5XVS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XSOLI2U646PSWGOGRVRGQO5XVS/action/storage_attestation","attest_author":"https://pith.science/pith/XSOLI2U646PSWGOGRVRGQO5XVS/action/author_attestation","sign_citation":"https://pith.science/pith/XSOLI2U646PSWGOGRVRGQO5XVS/action/citation_signature","submit_replication":"https://pith.science/pith/XSOLI2U646PSWGOGRVRGQO5XVS/action/replication_record"}},"created_at":"2026-05-18T00:03:14.765617+00:00","updated_at":"2026-05-18T00:03:14.765617+00:00"}