{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EIPJE57TRDCMMBH7RHQ6MEH2RI","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":"1ee35ce16d947ed7bddfd181485a919141d6236b56631d8ed8a847d8ce87dea0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T11:14:56Z","title_canon_sha256":"14ad56a6f696d831f7f6f8a464d1f83a3c576f88f1de7cc1423c70e7560f7578"},"schema_version":"1.0","source":{"id":"1901.05732","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05732","created_at":"2026-07-05T02:48:31Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05732v3","created_at":"2026-07-05T02:48:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05732","created_at":"2026-07-05T02:48:31Z"},{"alias_kind":"pith_short_12","alias_value":"EIPJE57TRDCM","created_at":"2026-07-05T02:48:31Z"},{"alias_kind":"pith_short_16","alias_value":"EIPJE57TRDCMMBH7","created_at":"2026-07-05T02:48:31Z"},{"alias_kind":"pith_short_8","alias_value":"EIPJE57T","created_at":"2026-07-05T02:48:31Z"}],"graph_snapshots":[{"event_id":"sha256:f2ce464dc4b612ccaf2d3b2ada0f34c5b66759994e13e0ef02384cf74f471959","target":"graph","created_at":"2026-07-05T02:48:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1901.05732/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Daniela Tuninetti, Giuseppe Caire, Kai Wan, Mingyue Ji","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T11:14:56Z","title":"On Coded Caching with Correlated Files"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05732","kind":"arxiv","version":3},"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:b38e71230d2ce267d0220d8dbaaa820303109c9938281fd2db6067368d5bf90e","target":"record","created_at":"2026-07-05T02:48:31Z","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":"1ee35ce16d947ed7bddfd181485a919141d6236b56631d8ed8a847d8ce87dea0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T11:14:56Z","title_canon_sha256":"14ad56a6f696d831f7f6f8a464d1f83a3c576f88f1de7cc1423c70e7560f7578"},"schema_version":"1.0","source":{"id":"1901.05732","kind":"arxiv","version":3}},"canonical_sha256":"221e9277f388c4c604ff89e1e610fa8a1eacce9a00f453695c167fe811dedb5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"221e9277f388c4c604ff89e1e610fa8a1eacce9a00f453695c167fe811dedb5c","first_computed_at":"2026-07-05T02:48:31.605823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:48:31.605823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aF87cyeTAwgsSIgwaqBWJpJYi4692tuxPn66A6HeH5d+Ak7jrOLMZSRgiRPRPg41A3Cgf2yFckCK6uZa+T0rAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:48:31.606251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.05732","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b38e71230d2ce267d0220d8dbaaa820303109c9938281fd2db6067368d5bf90e","sha256:f2ce464dc4b612ccaf2d3b2ada0f34c5b66759994e13e0ef02384cf74f471959"],"state_sha256":"2f3b59dcadf97dbdaac4ee60f3ebf96a4b7445eef93fd3dd536930a9d514ef05"}