{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FYUYGMM4ULVEL3VBNF3ZZMZXYH","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":"435820a180f4d42c112970fef2936e2fc13ee0d662e4ea14f1f4c7ffb5af27ed","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-19T07:40:33Z","title_canon_sha256":"21e1642bc6323eae0d47da88fc65bc506065f52599db7107a44e1ea93cb6eb89"},"schema_version":"1.0","source":{"id":"1402.4576","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4576","created_at":"2026-05-18T02:48:25Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4576v2","created_at":"2026-05-18T02:48:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4576","created_at":"2026-05-18T02:48:25Z"},{"alias_kind":"pith_short_12","alias_value":"FYUYGMM4ULVE","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FYUYGMM4ULVEL3VB","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FYUYGMM4","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:e433d6a8831c4ca59e4ea345ba11ffd5a4a45ca6f001da781b52a25f40493d35","target":"graph","created_at":"2026-05-18T02:48:25Z","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":"For a network with one sender, $n$ receivers (users) and $m$ possible messages (files), caching side information at the users allows to satisfy arbitrary simultaneous demands by sending a common (multicast) coded message. In the worst-case demand setting, explicit deterministic and random caching strategies and explicit linear coding schemes have been shown to be order optimal. In this work, we consider the same scenario where the user demands are random i.i.d., according to a Zipf popularity distribution. In this case, we pose the problem in terms of the minimum average number of equivalent m","authors_text":"Antonia M. Tulino, Giuseppe Caire, Jaime Llorca, Mingyue Ji","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-19T07:40:33Z","title":"On the Average Performance of Caching and Coded Multicasting with Random Demands"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4576","kind":"arxiv","version":2},"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:196645dcf5e19bc1d33ea186d28b5fc59b436c8543c5a39edde05b4cb9b82c9c","target":"record","created_at":"2026-05-18T02:48:25Z","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":"435820a180f4d42c112970fef2936e2fc13ee0d662e4ea14f1f4c7ffb5af27ed","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-19T07:40:33Z","title_canon_sha256":"21e1642bc6323eae0d47da88fc65bc506065f52599db7107a44e1ea93cb6eb89"},"schema_version":"1.0","source":{"id":"1402.4576","kind":"arxiv","version":2}},"canonical_sha256":"2e2983319ca2ea45eea169779cb337c1dfa8df2b8f64c538ef9d9ca020ebdd37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e2983319ca2ea45eea169779cb337c1dfa8df2b8f64c538ef9d9ca020ebdd37","first_computed_at":"2026-05-18T02:48:25.924991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:25.924991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GmJIirzXFjDu7tDU8lSHyio/6l7+06zHjnZibLkzBxa6CoClD6vcBWWdmkhWrs/DdZ48PJIY6iEWZmGDsTmpBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:25.925455Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.4576","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:196645dcf5e19bc1d33ea186d28b5fc59b436c8543c5a39edde05b4cb9b82c9c","sha256:e433d6a8831c4ca59e4ea345ba11ffd5a4a45ca6f001da781b52a25f40493d35"],"state_sha256":"a327f6e2a9813efd6975d5d2f64e123f58f847c93ffe20e99a0f4f4a4c19c4c6"}