{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:6LY45XQY7ZPYYVPV4JJOFGXHPB","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":"05d6a20a111b4b37b824ed3a6f1a4936c2ed5405a6c1e36a776de52a73185907","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-12-28T12:29:58Z","title_canon_sha256":"9cb13509153670d4e81fb3d026556d7d54f3e6c154f1204a74d36f13d4d9840c"},"schema_version":"1.0","source":{"id":"2112.14114","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.14114","created_at":"2026-07-05T03:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"2112.14114v1","created_at":"2026-07-05T03:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.14114","created_at":"2026-07-05T03:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"6LY45XQY7ZPY","created_at":"2026-07-05T03:44:18Z"},{"alias_kind":"pith_short_16","alias_value":"6LY45XQY7ZPYYVPV","created_at":"2026-07-05T03:44:18Z"},{"alias_kind":"pith_short_8","alias_value":"6LY45XQY","created_at":"2026-07-05T03:44:18Z"}],"graph_snapshots":[{"event_id":"sha256:d72fc5cd4f477a77c507920ebd6ba3a30eab70fbedd4d058b06da302ca09900a","target":"graph","created_at":"2026-07-05T03:44:18Z","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/2112.14114/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work studies the $K$-user broadcast channel with $\\Lambda$ caches, when the association between users and caches is random, i.e., for the scenario where each user can appear within the coverage area of -- and subsequently is assisted by -- a specific cache based on a given probability distribution. Caches are subject to a cumulative memory constraint that is equal to $t$ times the size of the library. We provide a scheme that consists of three phases: the storage allocation phase, the content placement phase, and the delivery phase, and show that an optimized storage allocation across the","authors_text":"Adeel Malik, Berksan Serbetci, Petros Elia","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-12-28T12:29:58Z","title":"Stochastic Coded Caching with Optimized Shared-Cache Sizes and Reduced Subpacketization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.14114","kind":"arxiv","version":1},"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:ef538cd56294aa06b8b51ede493bbe7d9cea76e3a22d262ccf5ca3b7c597fc6c","target":"record","created_at":"2026-07-05T03:44:18Z","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":"05d6a20a111b4b37b824ed3a6f1a4936c2ed5405a6c1e36a776de52a73185907","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-12-28T12:29:58Z","title_canon_sha256":"9cb13509153670d4e81fb3d026556d7d54f3e6c154f1204a74d36f13d4d9840c"},"schema_version":"1.0","source":{"id":"2112.14114","kind":"arxiv","version":1}},"canonical_sha256":"f2f1cede18fe5f8c55f5e252e29ae778459b4f769a3a2b0e2a8867f6ba8a6f83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2f1cede18fe5f8c55f5e252e29ae778459b4f769a3a2b0e2a8867f6ba8a6f83","first_computed_at":"2026-07-05T03:44:18.731765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:44:18.731765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V6a6dRD1YGz7zH7LldfR1hqfU/6Y30WFyd5HiHeIkDUiBfSKw450lfiHNHZvslF+knfnyTJhdIiuwy7ShDkaAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:44:18.732174Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.14114","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef538cd56294aa06b8b51ede493bbe7d9cea76e3a22d262ccf5ca3b7c597fc6c","sha256:d72fc5cd4f477a77c507920ebd6ba3a30eab70fbedd4d058b06da302ca09900a"],"state_sha256":"f3b71d31fab5fddd6550274e7e1fc6e3198c68f143c5f3a267a190a430f51cbf"}