{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:6LY45XQY7ZPYYVPV4JJOFGXHPB","short_pith_number":"pith:6LY45XQY","schema_version":"1.0","canonical_sha256":"f2f1cede18fe5f8c55f5e252e29ae778459b4f769a3a2b0e2a8867f6ba8a6f83","source":{"kind":"arxiv","id":"2112.14114","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Coded Caching with Optimized Shared-Cache Sizes and Reduced Subpacketization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adeel Malik, Berksan Serbetci, Petros Elia","submitted_at":"2021-12-28T12:29:58Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2112.14114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-12-28T12:29:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9cb13509153670d4e81fb3d026556d7d54f3e6c154f1204a74d36f13d4d9840c","abstract_canon_sha256":"05d6a20a111b4b37b824ed3a6f1a4936c2ed5405a6c1e36a776de52a73185907"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:44:18.732174Z","signature_b64":"V6a6dRD1YGz7zH7LldfR1hqfU/6Y30WFyd5HiHeIkDUiBfSKw450lfiHNHZvslF+knfnyTJhdIiuwy7ShDkaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2f1cede18fe5f8c55f5e252e29ae778459b4f769a3a2b0e2a8867f6ba8a6f83","last_reissued_at":"2026-07-05T03:44:18.731765Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:44:18.731765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Coded Caching with Optimized Shared-Cache Sizes and Reduced Subpacketization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adeel Malik, Berksan Serbetci, Petros Elia","submitted_at":"2021-12-28T12:29:58Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.14114","kind":"arxiv","version":1},"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/2112.14114/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2112.14114","created_at":"2026-07-05T03:44:18.731823+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.14114v1","created_at":"2026-07-05T03:44:18.731823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.14114","created_at":"2026-07-05T03:44:18.731823+00:00"},{"alias_kind":"pith_short_12","alias_value":"6LY45XQY7ZPY","created_at":"2026-07-05T03:44:18.731823+00:00"},{"alias_kind":"pith_short_16","alias_value":"6LY45XQY7ZPYYVPV","created_at":"2026-07-05T03:44:18.731823+00:00"},{"alias_kind":"pith_short_8","alias_value":"6LY45XQY","created_at":"2026-07-05T03:44:18.731823+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6LY45XQY7ZPYYVPV4JJOFGXHPB","json":"https://pith.science/pith/6LY45XQY7ZPYYVPV4JJOFGXHPB.json","graph_json":"https://pith.science/api/pith-number/6LY45XQY7ZPYYVPV4JJOFGXHPB/graph.json","events_json":"https://pith.science/api/pith-number/6LY45XQY7ZPYYVPV4JJOFGXHPB/events.json","paper":"https://pith.science/paper/6LY45XQY"},"agent_actions":{"view_html":"https://pith.science/pith/6LY45XQY7ZPYYVPV4JJOFGXHPB","download_json":"https://pith.science/pith/6LY45XQY7ZPYYVPV4JJOFGXHPB.json","view_paper":"https://pith.science/paper/6LY45XQY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.14114&json=true","fetch_graph":"https://pith.science/api/pith-number/6LY45XQY7ZPYYVPV4JJOFGXHPB/graph.json","fetch_events":"https://pith.science/api/pith-number/6LY45XQY7ZPYYVPV4JJOFGXHPB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6LY45XQY7ZPYYVPV4JJOFGXHPB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6LY45XQY7ZPYYVPV4JJOFGXHPB/action/storage_attestation","attest_author":"https://pith.science/pith/6LY45XQY7ZPYYVPV4JJOFGXHPB/action/author_attestation","sign_citation":"https://pith.science/pith/6LY45XQY7ZPYYVPV4JJOFGXHPB/action/citation_signature","submit_replication":"https://pith.science/pith/6LY45XQY7ZPYYVPV4JJOFGXHPB/action/replication_record"}},"created_at":"2026-07-05T03:44:18.731823+00:00","updated_at":"2026-07-05T03:44:18.731823+00:00"}