{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HUTRQQGS7VWAPSR2H7HVI3BP3N","short_pith_number":"pith:HUTRQQGS","schema_version":"1.0","canonical_sha256":"3d271840d2fd6c07ca3a3fcf546c2fdb5ff86d446f5f9777d3107b6e7c96d349","source":{"kind":"arxiv","id":"1601.05690","version":1},"attestation_state":"computed","paper":{"title":"A New Converse Bound for Coded Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chien-Yi Wang, Michael Gastpar, Sung Hoon Lim","submitted_at":"2016-01-21T16:02:58Z","abstract_excerpt":"An information-theoretic lower bound is developed for the caching system studied by Maddah-Ali and Niesen. By comparing the proposed lower bound with the decentralized coded caching scheme of Maddah-Ali and Niesen, the optimal memory--rate tradeoff is characterized to within a multiplicative gap of $4.7$ for the worst case, improving the previous analytical gap of $12$. Furthermore, for the case when users' requests follow the uniform distribution, the multiplicative gap is tightened to $4.7$, improving the previous analytical gap of $72$. As an independent result of interest, for the single-u"},"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":"1601.05690","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-21T16:02:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"89555e80d4cdde6c80d7104a18e37ba8bd9b0c3e7d7bb73ff65102eeec267736","abstract_canon_sha256":"14e486968ffdb7926e34cd9ba3453be4c5413f8816c43bd97693a9120f6b6e91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:13.222148Z","signature_b64":"cX6c79Six8wVp/TLyXTQa18RyjugBd1Zl9+4U/X/vjtVivMSFOOe9OBgnqWv3Ce/p8ysF8VqwKx/hVBQBBj/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d271840d2fd6c07ca3a3fcf546c2fdb5ff86d446f5f9777d3107b6e7c96d349","last_reissued_at":"2026-05-18T01:22:13.221588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:13.221588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Converse Bound for Coded Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chien-Yi Wang, Michael Gastpar, Sung Hoon Lim","submitted_at":"2016-01-21T16:02:58Z","abstract_excerpt":"An information-theoretic lower bound is developed for the caching system studied by Maddah-Ali and Niesen. By comparing the proposed lower bound with the decentralized coded caching scheme of Maddah-Ali and Niesen, the optimal memory--rate tradeoff is characterized to within a multiplicative gap of $4.7$ for the worst case, improving the previous analytical gap of $12$. Furthermore, for the case when users' requests follow the uniform distribution, the multiplicative gap is tightened to $4.7$, improving the previous analytical gap of $72$. As an independent result of interest, for the single-u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05690","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":""},"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":"1601.05690","created_at":"2026-05-18T01:22:13.221660+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.05690v1","created_at":"2026-05-18T01:22:13.221660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05690","created_at":"2026-05-18T01:22:13.221660+00:00"},{"alias_kind":"pith_short_12","alias_value":"HUTRQQGS7VWA","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"HUTRQQGS7VWAPSR2","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"HUTRQQGS","created_at":"2026-05-18T12:30:22.444734+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/HUTRQQGS7VWAPSR2H7HVI3BP3N","json":"https://pith.science/pith/HUTRQQGS7VWAPSR2H7HVI3BP3N.json","graph_json":"https://pith.science/api/pith-number/HUTRQQGS7VWAPSR2H7HVI3BP3N/graph.json","events_json":"https://pith.science/api/pith-number/HUTRQQGS7VWAPSR2H7HVI3BP3N/events.json","paper":"https://pith.science/paper/HUTRQQGS"},"agent_actions":{"view_html":"https://pith.science/pith/HUTRQQGS7VWAPSR2H7HVI3BP3N","download_json":"https://pith.science/pith/HUTRQQGS7VWAPSR2H7HVI3BP3N.json","view_paper":"https://pith.science/paper/HUTRQQGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.05690&json=true","fetch_graph":"https://pith.science/api/pith-number/HUTRQQGS7VWAPSR2H7HVI3BP3N/graph.json","fetch_events":"https://pith.science/api/pith-number/HUTRQQGS7VWAPSR2H7HVI3BP3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HUTRQQGS7VWAPSR2H7HVI3BP3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HUTRQQGS7VWAPSR2H7HVI3BP3N/action/storage_attestation","attest_author":"https://pith.science/pith/HUTRQQGS7VWAPSR2H7HVI3BP3N/action/author_attestation","sign_citation":"https://pith.science/pith/HUTRQQGS7VWAPSR2H7HVI3BP3N/action/citation_signature","submit_replication":"https://pith.science/pith/HUTRQQGS7VWAPSR2H7HVI3BP3N/action/replication_record"}},"created_at":"2026-05-18T01:22:13.221660+00:00","updated_at":"2026-05-18T01:22:13.221660+00:00"}