{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:TLENU5P6VNC3KADYKE54FEBVVC","short_pith_number":"pith:TLENU5P6","schema_version":"1.0","canonical_sha256":"9ac8da75feab45b50078513bc29035a88f5279dca90be4f0c72aebddca5bbec4","source":{"kind":"arxiv","id":"2201.10250","version":1},"attestation_state":"computed","paper":{"title":"Coded Caching in Networks with Heterogeneous User Activity","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":"2022-01-25T11:44:10Z","abstract_excerpt":"This work elevates coded caching networks from their purely information-theoretic framework to a stochastic setting, by exploring the effect of random user activity and by exploiting correlations in the activity patterns of different users. In particular, the work studies the $K$-user cache-aided broadcast channel with a limited number of cache states, and explores the effect of cache state association strategies in the presence of arbitrary user activity levels; a combination that strikes at the very core of the coded caching problem and its crippling subpacketization bottleneck. We first pre"},"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":"2201.10250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-01-25T11:44:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"702d873aa1d51e7a0410ee67bd787b6d54ac6dda09b36670745354db7fead177","abstract_canon_sha256":"810c76ca3f4c72f087d3d02c00bb59e5b815d0892511bb5f96ce9cdcfb4f6895"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:51:17.174924Z","signature_b64":"jQ3QON8hzJEW4Kkb0nuFKaTYm72IqDCENiyQJ5W0gPTy4XCrtKTi7yFecU14ir9sj+TnxGywY4eThVTWEifcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ac8da75feab45b50078513bc29035a88f5279dca90be4f0c72aebddca5bbec4","last_reissued_at":"2026-07-05T03:51:17.174503Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:51:17.174503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coded Caching in Networks with Heterogeneous User Activity","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":"2022-01-25T11:44:10Z","abstract_excerpt":"This work elevates coded caching networks from their purely information-theoretic framework to a stochastic setting, by exploring the effect of random user activity and by exploiting correlations in the activity patterns of different users. In particular, the work studies the $K$-user cache-aided broadcast channel with a limited number of cache states, and explores the effect of cache state association strategies in the presence of arbitrary user activity levels; a combination that strikes at the very core of the coded caching problem and its crippling subpacketization bottleneck. We first pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.10250","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/2201.10250/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":"2201.10250","created_at":"2026-07-05T03:51:17.174560+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.10250v1","created_at":"2026-07-05T03:51:17.174560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.10250","created_at":"2026-07-05T03:51:17.174560+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLENU5P6VNC3","created_at":"2026-07-05T03:51:17.174560+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLENU5P6VNC3KADY","created_at":"2026-07-05T03:51:17.174560+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLENU5P6","created_at":"2026-07-05T03:51:17.174560+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/TLENU5P6VNC3KADYKE54FEBVVC","json":"https://pith.science/pith/TLENU5P6VNC3KADYKE54FEBVVC.json","graph_json":"https://pith.science/api/pith-number/TLENU5P6VNC3KADYKE54FEBVVC/graph.json","events_json":"https://pith.science/api/pith-number/TLENU5P6VNC3KADYKE54FEBVVC/events.json","paper":"https://pith.science/paper/TLENU5P6"},"agent_actions":{"view_html":"https://pith.science/pith/TLENU5P6VNC3KADYKE54FEBVVC","download_json":"https://pith.science/pith/TLENU5P6VNC3KADYKE54FEBVVC.json","view_paper":"https://pith.science/paper/TLENU5P6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.10250&json=true","fetch_graph":"https://pith.science/api/pith-number/TLENU5P6VNC3KADYKE54FEBVVC/graph.json","fetch_events":"https://pith.science/api/pith-number/TLENU5P6VNC3KADYKE54FEBVVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLENU5P6VNC3KADYKE54FEBVVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLENU5P6VNC3KADYKE54FEBVVC/action/storage_attestation","attest_author":"https://pith.science/pith/TLENU5P6VNC3KADYKE54FEBVVC/action/author_attestation","sign_citation":"https://pith.science/pith/TLENU5P6VNC3KADYKE54FEBVVC/action/citation_signature","submit_replication":"https://pith.science/pith/TLENU5P6VNC3KADYKE54FEBVVC/action/replication_record"}},"created_at":"2026-07-05T03:51:17.174560+00:00","updated_at":"2026-07-05T03:51:17.174560+00:00"}