{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NK2CBGF6ZJNKL63LEV6YZLI7KK","short_pith_number":"pith:NK2CBGF6","schema_version":"1.0","canonical_sha256":"6ab42098beca5aa5fb6b257d8cad1f52a8b50d0c28ca75db51c5cf182f5d66b8","source":{"kind":"arxiv","id":"1701.07115","version":1},"attestation_state":"computed","paper":{"title":"Coded Caching with Linear Subpacketization is Possible using Ruzsa-Szem\\'eredi Graphs","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, Karthikeyan Shanmugam","submitted_at":"2017-01-25T00:32:24Z","abstract_excerpt":"Coded caching is a problem where encoded broadcasts are used to satisfy users requesting popular files and having caching capabilities. Recent work by Maddah-Ali and Niesen showed that it is possible to satisfy a scaling number of users with only a constant number of broadcast transmissions by exploiting coding and caching. Unfortunately, all previous schemes required the splitting of files into an exponential number of packets before the significant coding gains of caching appeared. The question of what can be achieved with polynomial subpacketization (in the number of users) has been a centr"},"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":"1701.07115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T00:32:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4786c4f81cd4163da3fee2dd5ff3c05dbdba96809ec74f900eea7765d47101b8","abstract_canon_sha256":"b4e7b6ff1eaef0139992da9ad5dff52bafd9ce8184557168f73e7cb195340a30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:07.458591Z","signature_b64":"/8le2tWCeBTT3nS2dIPhlZZyDiE64Kk2h5Z2XnuCu67MYlNcC5x66rLI6SxM3w98zQVnu3roC8WZfOJeEA2CAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ab42098beca5aa5fb6b257d8cad1f52a8b50d0c28ca75db51c5cf182f5d66b8","last_reissued_at":"2026-05-18T00:52:07.458161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:07.458161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coded Caching with Linear Subpacketization is Possible using Ruzsa-Szem\\'eredi Graphs","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, Karthikeyan Shanmugam","submitted_at":"2017-01-25T00:32:24Z","abstract_excerpt":"Coded caching is a problem where encoded broadcasts are used to satisfy users requesting popular files and having caching capabilities. Recent work by Maddah-Ali and Niesen showed that it is possible to satisfy a scaling number of users with only a constant number of broadcast transmissions by exploiting coding and caching. Unfortunately, all previous schemes required the splitting of files into an exponential number of packets before the significant coding gains of caching appeared. The question of what can be achieved with polynomial subpacketization (in the number of users) has been a centr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07115","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":"1701.07115","created_at":"2026-05-18T00:52:07.458231+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07115v1","created_at":"2026-05-18T00:52:07.458231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07115","created_at":"2026-05-18T00:52:07.458231+00:00"},{"alias_kind":"pith_short_12","alias_value":"NK2CBGF6ZJNK","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NK2CBGF6ZJNKL63L","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NK2CBGF6","created_at":"2026-05-18T12:31:31.346846+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/NK2CBGF6ZJNKL63LEV6YZLI7KK","json":"https://pith.science/pith/NK2CBGF6ZJNKL63LEV6YZLI7KK.json","graph_json":"https://pith.science/api/pith-number/NK2CBGF6ZJNKL63LEV6YZLI7KK/graph.json","events_json":"https://pith.science/api/pith-number/NK2CBGF6ZJNKL63LEV6YZLI7KK/events.json","paper":"https://pith.science/paper/NK2CBGF6"},"agent_actions":{"view_html":"https://pith.science/pith/NK2CBGF6ZJNKL63LEV6YZLI7KK","download_json":"https://pith.science/pith/NK2CBGF6ZJNKL63LEV6YZLI7KK.json","view_paper":"https://pith.science/paper/NK2CBGF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07115&json=true","fetch_graph":"https://pith.science/api/pith-number/NK2CBGF6ZJNKL63LEV6YZLI7KK/graph.json","fetch_events":"https://pith.science/api/pith-number/NK2CBGF6ZJNKL63LEV6YZLI7KK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NK2CBGF6ZJNKL63LEV6YZLI7KK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NK2CBGF6ZJNKL63LEV6YZLI7KK/action/storage_attestation","attest_author":"https://pith.science/pith/NK2CBGF6ZJNKL63LEV6YZLI7KK/action/author_attestation","sign_citation":"https://pith.science/pith/NK2CBGF6ZJNKL63LEV6YZLI7KK/action/citation_signature","submit_replication":"https://pith.science/pith/NK2CBGF6ZJNKL63LEV6YZLI7KK/action/replication_record"}},"created_at":"2026-05-18T00:52:07.458231+00:00","updated_at":"2026-05-18T00:52:07.458231+00:00"}