{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XSOLI2U646PSWGOGRVRGQO5XVS","short_pith_number":"pith:XSOLI2U6","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"},"canonical_sha256":"bc9cb46a9ee79f2b19c68d62683bb7acb793cce64db490d772daf9ad2003a6b6","source":{"kind":"arxiv","id":"1809.09422","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09422","created_at":"2026-05-18T00:03:14Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09422v3","created_at":"2026-05-18T00:03:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09422","created_at":"2026-05-18T00:03:14Z"},{"alias_kind":"pith_short_12","alias_value":"XSOLI2U646PS","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XSOLI2U646PSWGOG","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XSOLI2U6","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XSOLI2U646PSWGOGRVRGQO5XVS","target":"record","payload":{"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"},"canonical_sha256":"bc9cb46a9ee79f2b19c68d62683bb7acb793cce64db490d772daf9ad2003a6b6","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"},"source_kind":"arxiv","source_id":"1809.09422","source_version":3,"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:03:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yg+9ZgNwpJlk51i/Tu6/Gj5OU9tw+E4Om1i4TahYj37klZLJcqcX2Z4QsyzYXX6chyJoBS9Qn1nF6alDMy8OBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:52:38.499051Z"},"content_sha256":"166473e35e132facf44f76e424337d7abe1d89d54f05f9c85047483391221bd3","schema_version":"1.0","event_id":"sha256:166473e35e132facf44f76e424337d7abe1d89d54f05f9c85047483391221bd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XSOLI2U646PSWGOGRVRGQO5XVS","target":"graph","payload":{"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"},"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:03:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xO3J+6yC668/6STYwZrXq+1WHo9wdTL73yH4OSvxtNIASG9z/IRnsKfHMzpFvrbyEWm8mwepvWTqsL43JBJSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:52:38.499705Z"},"content_sha256":"70bd58f4b6604e9f4d976cc34fdcb84b5f0913ab476590d58436ee5ff172e224","schema_version":"1.0","event_id":"sha256:70bd58f4b6604e9f4d976cc34fdcb84b5f0913ab476590d58436ee5ff172e224"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XSOLI2U646PSWGOGRVRGQO5XVS/bundle.json","state_url":"https://pith.science/pith/XSOLI2U646PSWGOGRVRGQO5XVS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XSOLI2U646PSWGOGRVRGQO5XVS/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-05-26T11:52:38Z","links":{"resolver":"https://pith.science/pith/XSOLI2U646PSWGOGRVRGQO5XVS","bundle":"https://pith.science/pith/XSOLI2U646PSWGOGRVRGQO5XVS/bundle.json","state":"https://pith.science/pith/XSOLI2U646PSWGOGRVRGQO5XVS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XSOLI2U646PSWGOGRVRGQO5XVS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XSOLI2U646PSWGOGRVRGQO5XVS","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":"84c194a5118be77094278744fbf6b272af969a7996804a4e19393694f70dc2d3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-25T12:00:43Z","title_canon_sha256":"314616e41f3b7bc1addfc0d65446b663e1977875d64b7e52635f775a0bd6ac08"},"schema_version":"1.0","source":{"id":"1809.09422","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09422","created_at":"2026-05-18T00:03:14Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09422v3","created_at":"2026-05-18T00:03:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09422","created_at":"2026-05-18T00:03:14Z"},{"alias_kind":"pith_short_12","alias_value":"XSOLI2U646PS","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XSOLI2U646PSWGOG","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XSOLI2U6","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:70bd58f4b6604e9f4d976cc34fdcb84b5f0913ab476590d58436ee5ff172e224","target":"graph","created_at":"2026-05-18T00:03:14Z","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":"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","authors_text":"Ay\\c{s}e \\\"Unsal, Emanuele Parrinello, Petros Elia","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-25T12:00:43Z","title":"Coded Caching with Shared Caches: Fundamental Limits with Uncoded Prefetching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09422","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:166473e35e132facf44f76e424337d7abe1d89d54f05f9c85047483391221bd3","target":"record","created_at":"2026-05-18T00:03:14Z","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":"84c194a5118be77094278744fbf6b272af969a7996804a4e19393694f70dc2d3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-25T12:00:43Z","title_canon_sha256":"314616e41f3b7bc1addfc0d65446b663e1977875d64b7e52635f775a0bd6ac08"},"schema_version":"1.0","source":{"id":"1809.09422","kind":"arxiv","version":3}},"canonical_sha256":"bc9cb46a9ee79f2b19c68d62683bb7acb793cce64db490d772daf9ad2003a6b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc9cb46a9ee79f2b19c68d62683bb7acb793cce64db490d772daf9ad2003a6b6","first_computed_at":"2026-05-18T00:03:14.765533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:14.765533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KOobLpTHvrkgtBle2LFcTi5uU6WLRBKyubPDiiITAEo+hmmCLWEGFC9vUUBPb79A7u2DKChnHmSZHuNPKdKNDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:14.766149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.09422","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:166473e35e132facf44f76e424337d7abe1d89d54f05f9c85047483391221bd3","sha256:70bd58f4b6604e9f4d976cc34fdcb84b5f0913ab476590d58436ee5ff172e224"],"state_sha256":"0202e60d06fca3912b240bb15dc75e22aea8ae9c453f0dc85959322c51f61abd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pBuhvlriuS2C6Ucc2v/QlbhF6sWMxOLFtCjEPd/UWWSxTmBtHZHajqh29J7TFp/rMsFz6AcMFT8LxtH0y2UQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:52:38.503012Z","bundle_sha256":"d704397e5a80a51fbeb86724bbf558e75106a3d3716edef9c7984f785dae55a0"}}