{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KGA65MEIG6AMCEDPHFGCCK3NOZ","short_pith_number":"pith:KGA65MEI","schema_version":"1.0","canonical_sha256":"5181eeb0883780c1106f394c212b6d7641eca07cae7841a34f8511dfc8191e55","source":{"kind":"arxiv","id":"1605.01348","version":4},"attestation_state":"computed","paper":{"title":"Private Coded Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nikhil Karamchandani, Parthasarathi Panda, Vaishakh Ravindrakumar, Vinod Prabhakaran","submitted_at":"2016-05-04T17:11:06Z","abstract_excerpt":"Recent work by Maddah-Ali and Niesen introduced coded caching which demonstrated the benefits of joint design of storage and transmission policies in content delivery networks. They studied a setup where a server communicates with a set of users, each equipped with a local cache, over a shared error-free link and proposed an order-optimal caching and delivery scheme. In this paper, we introduce the problem of secretive coded caching where we impose the additional constraint that a user should not be able to learn anything, from either the content stored in its cache or the server transmissions"},"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":"1605.01348","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-04T17:11:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fe0689d7bfc31a5f73f1b9153479e15a577c8af709a40cc5d7e62d1a69af3cb9","abstract_canon_sha256":"a9c09fde250c310b613fb7d022e999ac64135f4e72aed642bae6d0d37968399a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:07.234460Z","signature_b64":"woy9n9rf5kDFngefO+YDrZUBpTt6zBbqaxEkURD9JfuuyOo19l6c32GkY6mecA2xaVjbxcKQbu/zb5SwDs5AAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5181eeb0883780c1106f394c212b6d7641eca07cae7841a34f8511dfc8191e55","last_reissued_at":"2026-05-18T00:33:07.233731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:07.233731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Private Coded Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nikhil Karamchandani, Parthasarathi Panda, Vaishakh Ravindrakumar, Vinod Prabhakaran","submitted_at":"2016-05-04T17:11:06Z","abstract_excerpt":"Recent work by Maddah-Ali and Niesen introduced coded caching which demonstrated the benefits of joint design of storage and transmission policies in content delivery networks. They studied a setup where a server communicates with a set of users, each equipped with a local cache, over a shared error-free link and proposed an order-optimal caching and delivery scheme. In this paper, we introduce the problem of secretive coded caching where we impose the additional constraint that a user should not be able to learn anything, from either the content stored in its cache or the server transmissions"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01348","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":"1605.01348","created_at":"2026-05-18T00:33:07.233847+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.01348v4","created_at":"2026-05-18T00:33:07.233847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01348","created_at":"2026-05-18T00:33:07.233847+00:00"},{"alias_kind":"pith_short_12","alias_value":"KGA65MEIG6AM","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KGA65MEIG6AMCEDP","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KGA65MEI","created_at":"2026-05-18T12:30:25.849896+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/KGA65MEIG6AMCEDPHFGCCK3NOZ","json":"https://pith.science/pith/KGA65MEIG6AMCEDPHFGCCK3NOZ.json","graph_json":"https://pith.science/api/pith-number/KGA65MEIG6AMCEDPHFGCCK3NOZ/graph.json","events_json":"https://pith.science/api/pith-number/KGA65MEIG6AMCEDPHFGCCK3NOZ/events.json","paper":"https://pith.science/paper/KGA65MEI"},"agent_actions":{"view_html":"https://pith.science/pith/KGA65MEIG6AMCEDPHFGCCK3NOZ","download_json":"https://pith.science/pith/KGA65MEIG6AMCEDPHFGCCK3NOZ.json","view_paper":"https://pith.science/paper/KGA65MEI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.01348&json=true","fetch_graph":"https://pith.science/api/pith-number/KGA65MEIG6AMCEDPHFGCCK3NOZ/graph.json","fetch_events":"https://pith.science/api/pith-number/KGA65MEIG6AMCEDPHFGCCK3NOZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KGA65MEIG6AMCEDPHFGCCK3NOZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KGA65MEIG6AMCEDPHFGCCK3NOZ/action/storage_attestation","attest_author":"https://pith.science/pith/KGA65MEIG6AMCEDPHFGCCK3NOZ/action/author_attestation","sign_citation":"https://pith.science/pith/KGA65MEIG6AMCEDPHFGCCK3NOZ/action/citation_signature","submit_replication":"https://pith.science/pith/KGA65MEIG6AMCEDPHFGCCK3NOZ/action/replication_record"}},"created_at":"2026-05-18T00:33:07.233847+00:00","updated_at":"2026-05-18T00:33:07.233847+00:00"}