{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:MKKAWPE5UV6AHDT4UTVNK5XAEX","short_pith_number":"pith:MKKAWPE5","canonical_record":{"source":{"id":"2005.13847","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-05-28T08:55:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b838eea510126b29782bd7f466aafde84be3f4866b1fd083b124a469a6982a0a","abstract_canon_sha256":"770b9d166cfd43c23625ce1838addd1d222cde3d1e6f576c6715d43931d533ed"},"schema_version":"1.0"},"canonical_sha256":"62940b3c9da57c038e7ca4ead576e025e5d575508fb445a471ecb788dad2ea64","source":{"kind":"arxiv","id":"2005.13847","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.13847","created_at":"2026-07-05T02:05:40Z"},{"alias_kind":"arxiv_version","alias_value":"2005.13847v3","created_at":"2026-07-05T02:05:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.13847","created_at":"2026-07-05T02:05:40Z"},{"alias_kind":"pith_short_12","alias_value":"MKKAWPE5UV6A","created_at":"2026-07-05T02:05:40Z"},{"alias_kind":"pith_short_16","alias_value":"MKKAWPE5UV6AHDT4","created_at":"2026-07-05T02:05:40Z"},{"alias_kind":"pith_short_8","alias_value":"MKKAWPE5","created_at":"2026-07-05T02:05:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:MKKAWPE5UV6AHDT4UTVNK5XAEX","target":"record","payload":{"canonical_record":{"source":{"id":"2005.13847","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-05-28T08:55:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b838eea510126b29782bd7f466aafde84be3f4866b1fd083b124a469a6982a0a","abstract_canon_sha256":"770b9d166cfd43c23625ce1838addd1d222cde3d1e6f576c6715d43931d533ed"},"schema_version":"1.0"},"canonical_sha256":"62940b3c9da57c038e7ca4ead576e025e5d575508fb445a471ecb788dad2ea64","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:05:40.655134Z","signature_b64":"8KEtfdbbSjqkxcwT/YSjSwMzRnY6+su7kSGUMk6Wcfl3f1KQcJ65DuEbSewHtgkV/bj5OfVsW0eW6vGH8U5oAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62940b3c9da57c038e7ca4ead576e025e5d575508fb445a471ecb788dad2ea64","last_reissued_at":"2026-07-05T02:05:40.654666Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:05:40.654666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.13847","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-07-05T02:05:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MM7StipPP+7ax0rGCikZuH7jB14I1lsGIX1J4XXTEmyDPQwSvsf1f3uHMWJDKIR8uNQ+GBz9mDC1aUgi5rjfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:36:16.984934Z"},"content_sha256":"31a268068591a42498105fc35c5db77972e0ba922f98c8522d5566418ecedb79","schema_version":"1.0","event_id":"sha256:31a268068591a42498105fc35c5db77972e0ba922f98c8522d5566418ecedb79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:MKKAWPE5UV6AHDT4UTVNK5XAEX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fundamental Limits of Stochastic Shared Caches Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adeel Malik, Berksan Serbetci, Emanuele Parrinello, Petros Elia","submitted_at":"2020-05-28T08:55:48Z","abstract_excerpt":"The work establishes the exact performance limits of stochastic coded caching when users share a bounded number of cache states, and when the association between users and caches, is random. Under the premise that more balanced user-to-cache associations perform better than unbalanced ones, our work provides a statistical analysis of the average performance of such networks, identifying in closed form, the exact optimal average delivery time. To insightfully capture this delay, we derive easy to compute closed-form analytical bounds that prove tight in the limit of a large number $\\Lambda$ of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.13847","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/2005.13847/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"},"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-07-05T02:05:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xj/KWVDqaJcu6Y1Pt4aYh4XAWBfM0QWOFlrmK1/igUlES8qu/1cIDNEuBY6NE5DBB+cF6K+sAW1BEC4ddEYGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:36:16.985725Z"},"content_sha256":"52bce5436f297f2e3434a874a802a91fba2e9f30fd5b01b8921040d6523999c0","schema_version":"1.0","event_id":"sha256:52bce5436f297f2e3434a874a802a91fba2e9f30fd5b01b8921040d6523999c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MKKAWPE5UV6AHDT4UTVNK5XAEX/bundle.json","state_url":"https://pith.science/pith/MKKAWPE5UV6AHDT4UTVNK5XAEX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MKKAWPE5UV6AHDT4UTVNK5XAEX/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-07-07T06:36:16Z","links":{"resolver":"https://pith.science/pith/MKKAWPE5UV6AHDT4UTVNK5XAEX","bundle":"https://pith.science/pith/MKKAWPE5UV6AHDT4UTVNK5XAEX/bundle.json","state":"https://pith.science/pith/MKKAWPE5UV6AHDT4UTVNK5XAEX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MKKAWPE5UV6AHDT4UTVNK5XAEX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:MKKAWPE5UV6AHDT4UTVNK5XAEX","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":"770b9d166cfd43c23625ce1838addd1d222cde3d1e6f576c6715d43931d533ed","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-05-28T08:55:48Z","title_canon_sha256":"b838eea510126b29782bd7f466aafde84be3f4866b1fd083b124a469a6982a0a"},"schema_version":"1.0","source":{"id":"2005.13847","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.13847","created_at":"2026-07-05T02:05:40Z"},{"alias_kind":"arxiv_version","alias_value":"2005.13847v3","created_at":"2026-07-05T02:05:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.13847","created_at":"2026-07-05T02:05:40Z"},{"alias_kind":"pith_short_12","alias_value":"MKKAWPE5UV6A","created_at":"2026-07-05T02:05:40Z"},{"alias_kind":"pith_short_16","alias_value":"MKKAWPE5UV6AHDT4","created_at":"2026-07-05T02:05:40Z"},{"alias_kind":"pith_short_8","alias_value":"MKKAWPE5","created_at":"2026-07-05T02:05:40Z"}],"graph_snapshots":[{"event_id":"sha256:52bce5436f297f2e3434a874a802a91fba2e9f30fd5b01b8921040d6523999c0","target":"graph","created_at":"2026-07-05T02:05:40Z","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/2005.13847/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The work establishes the exact performance limits of stochastic coded caching when users share a bounded number of cache states, and when the association between users and caches, is random. Under the premise that more balanced user-to-cache associations perform better than unbalanced ones, our work provides a statistical analysis of the average performance of such networks, identifying in closed form, the exact optimal average delivery time. To insightfully capture this delay, we derive easy to compute closed-form analytical bounds that prove tight in the limit of a large number $\\Lambda$ of ","authors_text":"Adeel Malik, Berksan Serbetci, Emanuele Parrinello, Petros Elia","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-05-28T08:55:48Z","title":"Fundamental Limits of Stochastic Shared Caches Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.13847","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:31a268068591a42498105fc35c5db77972e0ba922f98c8522d5566418ecedb79","target":"record","created_at":"2026-07-05T02:05:40Z","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":"770b9d166cfd43c23625ce1838addd1d222cde3d1e6f576c6715d43931d533ed","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-05-28T08:55:48Z","title_canon_sha256":"b838eea510126b29782bd7f466aafde84be3f4866b1fd083b124a469a6982a0a"},"schema_version":"1.0","source":{"id":"2005.13847","kind":"arxiv","version":3}},"canonical_sha256":"62940b3c9da57c038e7ca4ead576e025e5d575508fb445a471ecb788dad2ea64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62940b3c9da57c038e7ca4ead576e025e5d575508fb445a471ecb788dad2ea64","first_computed_at":"2026-07-05T02:05:40.654666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:05:40.654666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8KEtfdbbSjqkxcwT/YSjSwMzRnY6+su7kSGUMk6Wcfl3f1KQcJ65DuEbSewHtgkV/bj5OfVsW0eW6vGH8U5oAw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:05:40.655134Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.13847","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31a268068591a42498105fc35c5db77972e0ba922f98c8522d5566418ecedb79","sha256:52bce5436f297f2e3434a874a802a91fba2e9f30fd5b01b8921040d6523999c0"],"state_sha256":"ff2d3e0087ea9efc189225022ef193036b36abc565d03783a3c9da25567550b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VVSjZuRwatM3IiqsP4SwXKAyi/K8v+/HQzFDWE8GlxhxzXj5rWEMLkZhlP45Q/KKdRkWYR20oEkaEk147VLGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T06:36:16.989184Z","bundle_sha256":"6cda7a416ce8f6e16c7cebbba7802feab2ca8a946b5aac96382f0e3876c8135a"}}