{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EIPJE57TRDCMMBH7RHQ6MEH2RI","short_pith_number":"pith:EIPJE57T","schema_version":"1.0","canonical_sha256":"221e9277f388c4c604ff89e1e610fa8a1eacce9a00f453695c167fe811dedb5c","source":{"kind":"arxiv","id":"1901.05732","version":3},"attestation_state":"computed","paper":{"title":"On Coded Caching with Correlated Files","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Giuseppe Caire, Kai Wan, Mingyue Ji","submitted_at":"2019-01-17T11:14:56Z","abstract_excerpt":"This paper studies the fundamental limits of the shared-link coded caching problem with correlated files, where a server with a library of $N$ files communicates with $K$ users who can locally cache $M$ files. Given an integer $r \\in [N]$, correlation is modeled as follows: each r-subset of files contains a unique common block. The tradeoff between the cache size and the average transmitted load is considered. First, a converse bound under the constraint of uncoded cache placement (i.e., each user directly stores a subset of the library bits) is derived. Then, a caching scheme for the case whe"},"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":"1901.05732","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T11:14:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"14ad56a6f696d831f7f6f8a464d1f83a3c576f88f1de7cc1423c70e7560f7578","abstract_canon_sha256":"1ee35ce16d947ed7bddfd181485a919141d6236b56631d8ed8a847d8ce87dea0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:48:31.606251Z","signature_b64":"aF87cyeTAwgsSIgwaqBWJpJYi4692tuxPn66A6HeH5d+Ak7jrOLMZSRgiRPRPg41A3Cgf2yFckCK6uZa+T0rAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"221e9277f388c4c604ff89e1e610fa8a1eacce9a00f453695c167fe811dedb5c","last_reissued_at":"2026-07-05T02:48:31.605823Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:48:31.605823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Coded Caching with Correlated Files","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Giuseppe Caire, Kai Wan, Mingyue Ji","submitted_at":"2019-01-17T11:14:56Z","abstract_excerpt":"This paper studies the fundamental limits of the shared-link coded caching problem with correlated files, where a server with a library of $N$ files communicates with $K$ users who can locally cache $M$ files. Given an integer $r \\in [N]$, correlation is modeled as follows: each r-subset of files contains a unique common block. The tradeoff between the cache size and the average transmitted load is considered. First, a converse bound under the constraint of uncoded cache placement (i.e., each user directly stores a subset of the library bits) is derived. Then, a caching scheme for the case whe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05732","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1901.05732/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1901.05732","created_at":"2026-07-05T02:48:31.605878+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.05732v3","created_at":"2026-07-05T02:48:31.605878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05732","created_at":"2026-07-05T02:48:31.605878+00:00"},{"alias_kind":"pith_short_12","alias_value":"EIPJE57TRDCM","created_at":"2026-07-05T02:48:31.605878+00:00"},{"alias_kind":"pith_short_16","alias_value":"EIPJE57TRDCMMBH7","created_at":"2026-07-05T02:48:31.605878+00:00"},{"alias_kind":"pith_short_8","alias_value":"EIPJE57T","created_at":"2026-07-05T02:48:31.605878+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/EIPJE57TRDCMMBH7RHQ6MEH2RI","json":"https://pith.science/pith/EIPJE57TRDCMMBH7RHQ6MEH2RI.json","graph_json":"https://pith.science/api/pith-number/EIPJE57TRDCMMBH7RHQ6MEH2RI/graph.json","events_json":"https://pith.science/api/pith-number/EIPJE57TRDCMMBH7RHQ6MEH2RI/events.json","paper":"https://pith.science/paper/EIPJE57T"},"agent_actions":{"view_html":"https://pith.science/pith/EIPJE57TRDCMMBH7RHQ6MEH2RI","download_json":"https://pith.science/pith/EIPJE57TRDCMMBH7RHQ6MEH2RI.json","view_paper":"https://pith.science/paper/EIPJE57T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.05732&json=true","fetch_graph":"https://pith.science/api/pith-number/EIPJE57TRDCMMBH7RHQ6MEH2RI/graph.json","fetch_events":"https://pith.science/api/pith-number/EIPJE57TRDCMMBH7RHQ6MEH2RI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EIPJE57TRDCMMBH7RHQ6MEH2RI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EIPJE57TRDCMMBH7RHQ6MEH2RI/action/storage_attestation","attest_author":"https://pith.science/pith/EIPJE57TRDCMMBH7RHQ6MEH2RI/action/author_attestation","sign_citation":"https://pith.science/pith/EIPJE57TRDCMMBH7RHQ6MEH2RI/action/citation_signature","submit_replication":"https://pith.science/pith/EIPJE57TRDCMMBH7RHQ6MEH2RI/action/replication_record"}},"created_at":"2026-07-05T02:48:31.605878+00:00","updated_at":"2026-07-05T02:48:31.605878+00:00"}