{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:F6VBXTGUSZQ3WX7BGGXUJKBI7M","short_pith_number":"pith:F6VBXTGU","schema_version":"1.0","canonical_sha256":"2faa1bccd49661bb5fe131af44a828fb00535ea9edc0aee7c116f93901a0169e","source":{"kind":"arxiv","id":"1508.05175","version":1},"attestation_state":"computed","paper":{"title":"Finite Length Analysis of Caching-Aided Coded Multicasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Antonia M.Tulino, Jaime Llorca, Karthikeyan Shanmugam, Mingyue Ji","submitted_at":"2015-08-21T04:49:06Z","abstract_excerpt":"In this work, we study a noiseless broadcast link serving $K$ users whose requests arise from a library of $N$ files. Every user is equipped with a cache of size $M$ files each. It has been shown that by splitting all the files into packets and placing individual packets in a random independent manner across all the caches, it requires at most $N/M$ file transmissions for any set of demands from the library. The achievable delivery scheme involves linearly combining packets of different files following a greedy clique cover solution to the underlying index coding problem. This remarkable multi"},"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":"1508.05175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-21T04:49:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"26d30517c9da570b008d076fde9284fdac92af6511f4d1925241b95963bca815","abstract_canon_sha256":"dc294a75ef80753bb861ea051bede03beadd7015f631a33c17f2c451f9460403"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:56.513962Z","signature_b64":"WEqXHIZMx6jiOpLw0EZ8nxph0KZjkQPWxQcE75ST36qnK1AmYbBOblU21AunD/vIOMK9Yrm+eqN4I4OQBAuyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2faa1bccd49661bb5fe131af44a828fb00535ea9edc0aee7c116f93901a0169e","last_reissued_at":"2026-05-18T01:34:56.513233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:56.513233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite Length Analysis of Caching-Aided Coded Multicasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Antonia M.Tulino, Jaime Llorca, Karthikeyan Shanmugam, Mingyue Ji","submitted_at":"2015-08-21T04:49:06Z","abstract_excerpt":"In this work, we study a noiseless broadcast link serving $K$ users whose requests arise from a library of $N$ files. Every user is equipped with a cache of size $M$ files each. It has been shown that by splitting all the files into packets and placing individual packets in a random independent manner across all the caches, it requires at most $N/M$ file transmissions for any set of demands from the library. The achievable delivery scheme involves linearly combining packets of different files following a greedy clique cover solution to the underlying index coding problem. This remarkable multi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05175","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":"1508.05175","created_at":"2026-05-18T01:34:56.513367+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.05175v1","created_at":"2026-05-18T01:34:56.513367+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05175","created_at":"2026-05-18T01:34:56.513367+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6VBXTGUSZQ3","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6VBXTGUSZQ3WX7B","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6VBXTGU","created_at":"2026-05-18T12:29:19.899920+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/F6VBXTGUSZQ3WX7BGGXUJKBI7M","json":"https://pith.science/pith/F6VBXTGUSZQ3WX7BGGXUJKBI7M.json","graph_json":"https://pith.science/api/pith-number/F6VBXTGUSZQ3WX7BGGXUJKBI7M/graph.json","events_json":"https://pith.science/api/pith-number/F6VBXTGUSZQ3WX7BGGXUJKBI7M/events.json","paper":"https://pith.science/paper/F6VBXTGU"},"agent_actions":{"view_html":"https://pith.science/pith/F6VBXTGUSZQ3WX7BGGXUJKBI7M","download_json":"https://pith.science/pith/F6VBXTGUSZQ3WX7BGGXUJKBI7M.json","view_paper":"https://pith.science/paper/F6VBXTGU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.05175&json=true","fetch_graph":"https://pith.science/api/pith-number/F6VBXTGUSZQ3WX7BGGXUJKBI7M/graph.json","fetch_events":"https://pith.science/api/pith-number/F6VBXTGUSZQ3WX7BGGXUJKBI7M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6VBXTGUSZQ3WX7BGGXUJKBI7M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6VBXTGUSZQ3WX7BGGXUJKBI7M/action/storage_attestation","attest_author":"https://pith.science/pith/F6VBXTGUSZQ3WX7BGGXUJKBI7M/action/author_attestation","sign_citation":"https://pith.science/pith/F6VBXTGUSZQ3WX7BGGXUJKBI7M/action/citation_signature","submit_replication":"https://pith.science/pith/F6VBXTGUSZQ3WX7BGGXUJKBI7M/action/replication_record"}},"created_at":"2026-05-18T01:34:56.513367+00:00","updated_at":"2026-05-18T01:34:56.513367+00:00"}