{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DPUIMWQ4KYG6V5CJ4YPQGR4HI5","short_pith_number":"pith:DPUIMWQ4","canonical_record":{"source":{"id":"1308.0178","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-01T12:49:02Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"a76f683539a05e260eb8c35897f8f0af93e91a9381de7fa57f4dbf3b9974f6c0","abstract_canon_sha256":"66effc96c3531a4c386883c8691350a6dd7b81779b3bf3aa8bb9670c78c7a972"},"schema_version":"1.0"},"canonical_sha256":"1be8865a1c560deaf449e61f034787476af7b6a0ef1320a865bd1ea6276cbad9","source":{"kind":"arxiv","id":"1308.0178","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0178","created_at":"2026-05-18T00:41:54Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0178v4","created_at":"2026-05-18T00:41:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0178","created_at":"2026-05-18T00:41:54Z"},{"alias_kind":"pith_short_12","alias_value":"DPUIMWQ4KYG6","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DPUIMWQ4KYG6V5CJ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DPUIMWQ4","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DPUIMWQ4KYG6V5CJ4YPQGR4HI5","target":"record","payload":{"canonical_record":{"source":{"id":"1308.0178","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-01T12:49:02Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"a76f683539a05e260eb8c35897f8f0af93e91a9381de7fa57f4dbf3b9974f6c0","abstract_canon_sha256":"66effc96c3531a4c386883c8691350a6dd7b81779b3bf3aa8bb9670c78c7a972"},"schema_version":"1.0"},"canonical_sha256":"1be8865a1c560deaf449e61f034787476af7b6a0ef1320a865bd1ea6276cbad9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:54.100282Z","signature_b64":"cDOGSyt3uWUviCPJwFU/24iSCiaDDilQJ+AlakvJC2FYZaICV4S8bKZDmJrTvbR8SDxq2uNzJNEHN8MIm63ZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1be8865a1c560deaf449e61f034787476af7b6a0ef1320a865bd1ea6276cbad9","last_reissued_at":"2026-05-18T00:41:54.099608Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:54.099608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.0178","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:41:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tUfaUDf2N6019z2DoG24CvbkvWYLtmXR1+37vbYnpmckDvoa26Tnq1CH8kGTaSqVq9ZK1uV7XOV/9HCVZrlRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:18:10.638362Z"},"content_sha256":"419966bd13562b09e8953aef4a6471d373a0dab6c33f31283866834c677ee6b3","schema_version":"1.0","event_id":"sha256:419966bd13562b09e8953aef4a6471d373a0dab6c33f31283866834c677ee6b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DPUIMWQ4KYG6V5CJ4YPQGR4HI5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coded Caching with Nonuniform Demands","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Mohammad Ali Maddah-Ali, Urs Niesen","submitted_at":"2013-08-01T12:49:02Z","abstract_excerpt":"We consider a network consisting of a file server connected through a shared link to a number of users, each equipped with a cache. Knowing the popularity distribution of the files, the goal is to optimally populate the caches such as to minimize the expected load of the shared link. For a single cache, it is well known that storing the most popular files is optimal in this setting. However, we show here that this is no longer the case for multiple caches. Indeed, caching only the most popular files can be highly suboptimal. Instead, a fundamentally different approach is needed, in which the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0178","kind":"arxiv","version":4},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:41:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xPnyA/5lQCtxaXqP40rF6VP5oAIxFs2C8iPKLzEtf7DDVhi+BdMT8KJk0qEbDaDWdn5e3kQXJIrwqDw33LivBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:18:10.639112Z"},"content_sha256":"5e51959c116d21f0a1435c173b406b08414242bd6725e956597bbb758a5d24c1","schema_version":"1.0","event_id":"sha256:5e51959c116d21f0a1435c173b406b08414242bd6725e956597bbb758a5d24c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DPUIMWQ4KYG6V5CJ4YPQGR4HI5/bundle.json","state_url":"https://pith.science/pith/DPUIMWQ4KYG6V5CJ4YPQGR4HI5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DPUIMWQ4KYG6V5CJ4YPQGR4HI5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T18:18:10Z","links":{"resolver":"https://pith.science/pith/DPUIMWQ4KYG6V5CJ4YPQGR4HI5","bundle":"https://pith.science/pith/DPUIMWQ4KYG6V5CJ4YPQGR4HI5/bundle.json","state":"https://pith.science/pith/DPUIMWQ4KYG6V5CJ4YPQGR4HI5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DPUIMWQ4KYG6V5CJ4YPQGR4HI5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DPUIMWQ4KYG6V5CJ4YPQGR4HI5","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":"66effc96c3531a4c386883c8691350a6dd7b81779b3bf3aa8bb9670c78c7a972","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-01T12:49:02Z","title_canon_sha256":"a76f683539a05e260eb8c35897f8f0af93e91a9381de7fa57f4dbf3b9974f6c0"},"schema_version":"1.0","source":{"id":"1308.0178","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0178","created_at":"2026-05-18T00:41:54Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0178v4","created_at":"2026-05-18T00:41:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0178","created_at":"2026-05-18T00:41:54Z"},{"alias_kind":"pith_short_12","alias_value":"DPUIMWQ4KYG6","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DPUIMWQ4KYG6V5CJ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DPUIMWQ4","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:5e51959c116d21f0a1435c173b406b08414242bd6725e956597bbb758a5d24c1","target":"graph","created_at":"2026-05-18T00:41:54Z","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":"We consider a network consisting of a file server connected through a shared link to a number of users, each equipped with a cache. Knowing the popularity distribution of the files, the goal is to optimally populate the caches such as to minimize the expected load of the shared link. For a single cache, it is well known that storing the most popular files is optimal in this setting. However, we show here that this is no longer the case for multiple caches. Indeed, caching only the most popular files can be highly suboptimal. Instead, a fundamentally different approach is needed, in which the c","authors_text":"Mohammad Ali Maddah-Ali, Urs Niesen","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-01T12:49:02Z","title":"Coded Caching with Nonuniform Demands"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0178","kind":"arxiv","version":4},"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:419966bd13562b09e8953aef4a6471d373a0dab6c33f31283866834c677ee6b3","target":"record","created_at":"2026-05-18T00:41:54Z","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":"66effc96c3531a4c386883c8691350a6dd7b81779b3bf3aa8bb9670c78c7a972","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-01T12:49:02Z","title_canon_sha256":"a76f683539a05e260eb8c35897f8f0af93e91a9381de7fa57f4dbf3b9974f6c0"},"schema_version":"1.0","source":{"id":"1308.0178","kind":"arxiv","version":4}},"canonical_sha256":"1be8865a1c560deaf449e61f034787476af7b6a0ef1320a865bd1ea6276cbad9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1be8865a1c560deaf449e61f034787476af7b6a0ef1320a865bd1ea6276cbad9","first_computed_at":"2026-05-18T00:41:54.099608Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:54.099608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cDOGSyt3uWUviCPJwFU/24iSCiaDDilQJ+AlakvJC2FYZaICV4S8bKZDmJrTvbR8SDxq2uNzJNEHN8MIm63ZBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:54.100282Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.0178","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:419966bd13562b09e8953aef4a6471d373a0dab6c33f31283866834c677ee6b3","sha256:5e51959c116d21f0a1435c173b406b08414242bd6725e956597bbb758a5d24c1"],"state_sha256":"fd5305685a9e97c5fab5335e560070fc9db8aa4ac62d7b49438a04f2eef7ede2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W7+0okb2JduYCxviFWwDiwPZiGvsQpn0CkYVGcvVgcMUkqxLQhA3W91o59bcNAfipSNF6kLEKUvYq+297NEBBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T18:18:10.643202Z","bundle_sha256":"34ba19ad095e95b4401400d0be65e152e3fe5ea947967e6998b04482f92c5065"}}