{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3DOORTLQ253NTNLB7U3653DDON","short_pith_number":"pith:3DOORTLQ","schema_version":"1.0","canonical_sha256":"d8dce8cd70d776d9b561fd37eeec6373486bc9f2b689b0dd03b3e7f115345ad3","source":{"kind":"arxiv","id":"1612.09071","version":4},"attestation_state":"computed","paper":{"title":"Fundamental Limits of Caching: Improved Bounds with Coded Prefetching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jes\\'us G\\'omez-Vilardeb\\'o","submitted_at":"2016-12-29T08:37:41Z","abstract_excerpt":"We consider a cache network in which a single server is connected to multiple users via a shared error free link. The server has access to a database with $N$ files of equal length $F$, and serves $K$ users each with a cache memory of $MF$ bits. A novel centralized coded caching scheme is proposed for scenarios with more users than files $N\\leq K$ and cache capacities satisfying $\\frac{1}{K}\\leq M\\leq\\frac{N}{K}$. The proposed scheme outperforms the best rate-memory region known in the literature if $N\\leq K\\leq\\frac{N^{2}+1}{2}$."},"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":"1612.09071","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-29T08:37:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"68de6bb2cf17cc986797cbea5977f40c6a247f4f0080e28dd5c444349eaf42c4","abstract_canon_sha256":"ee7d5e17c9dc15d314b145cd2c3fa6964fa95a9c21a4734c71da02fee96d8891"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:55.977075Z","signature_b64":"s2BI5C76ZyvAVNAWrraeHoLpS8SAnydlPlPuqQq17mFyhSafE7d0E3IrqDc1ilWhTy9fbN3u4FMoI9hZqmcsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8dce8cd70d776d9b561fd37eeec6373486bc9f2b689b0dd03b3e7f115345ad3","last_reissued_at":"2026-05-18T00:43:55.976486Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:55.976486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fundamental Limits of Caching: Improved Bounds with Coded Prefetching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jes\\'us G\\'omez-Vilardeb\\'o","submitted_at":"2016-12-29T08:37:41Z","abstract_excerpt":"We consider a cache network in which a single server is connected to multiple users via a shared error free link. The server has access to a database with $N$ files of equal length $F$, and serves $K$ users each with a cache memory of $MF$ bits. A novel centralized coded caching scheme is proposed for scenarios with more users than files $N\\leq K$ and cache capacities satisfying $\\frac{1}{K}\\leq M\\leq\\frac{N}{K}$. The proposed scheme outperforms the best rate-memory region known in the literature if $N\\leq K\\leq\\frac{N^{2}+1}{2}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.09071","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.09071","created_at":"2026-05-18T00:43:55.976596+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.09071v4","created_at":"2026-05-18T00:43:55.976596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.09071","created_at":"2026-05-18T00:43:55.976596+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DOORTLQ253N","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DOORTLQ253NTNLB","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DOORTLQ","created_at":"2026-05-18T12:29:55.572404+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/3DOORTLQ253NTNLB7U3653DDON","json":"https://pith.science/pith/3DOORTLQ253NTNLB7U3653DDON.json","graph_json":"https://pith.science/api/pith-number/3DOORTLQ253NTNLB7U3653DDON/graph.json","events_json":"https://pith.science/api/pith-number/3DOORTLQ253NTNLB7U3653DDON/events.json","paper":"https://pith.science/paper/3DOORTLQ"},"agent_actions":{"view_html":"https://pith.science/pith/3DOORTLQ253NTNLB7U3653DDON","download_json":"https://pith.science/pith/3DOORTLQ253NTNLB7U3653DDON.json","view_paper":"https://pith.science/paper/3DOORTLQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.09071&json=true","fetch_graph":"https://pith.science/api/pith-number/3DOORTLQ253NTNLB7U3653DDON/graph.json","fetch_events":"https://pith.science/api/pith-number/3DOORTLQ253NTNLB7U3653DDON/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DOORTLQ253NTNLB7U3653DDON/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DOORTLQ253NTNLB7U3653DDON/action/storage_attestation","attest_author":"https://pith.science/pith/3DOORTLQ253NTNLB7U3653DDON/action/author_attestation","sign_citation":"https://pith.science/pith/3DOORTLQ253NTNLB7U3653DDON/action/citation_signature","submit_replication":"https://pith.science/pith/3DOORTLQ253NTNLB7U3653DDON/action/replication_record"}},"created_at":"2026-05-18T00:43:55.976596+00:00","updated_at":"2026-05-18T00:43:55.976596+00:00"}