{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:YDQR5HK3QE7XYQRYM6RREFBKXP","short_pith_number":"pith:YDQR5HK3","schema_version":"1.0","canonical_sha256":"c0e11e9d5b813f7c423867a312142abbc5742f6ea5c42d99b06d2c144a624949","source":{"kind":"arxiv","id":"2009.06000","version":2},"attestation_state":"computed","paper":{"title":"Key Superposition Simultaneously Achieves Security and Privacy in Cache-Aided Linear Function Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Qifa Yan","submitted_at":"2020-09-13T14:02:18Z","abstract_excerpt":"This work investigates the problem of cache-aided content Secure and demand Private Linear Function Retrieval (SP-LFR), where three constraints are imposed on the system:(a) each user is interested in retrieving an arbitrary linear combination of the files in the server's library;(b) the content of the library must be kept secure from a wiretapper who obtains the signal sent by the server; and (c) no colluding subset of users together obtain information about the demands of the remaining users. A procedure is proposed to derive an SP-LFR scheme from a given Placement Delivery Array (PDA), whic"},"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":"2009.06000","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-09-13T14:02:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e07c86b3df8c39b3cdaff8ad352890cf660769badf55526a64972712365ebf29","abstract_canon_sha256":"979837735956462d1fab39dff9554349784a9a668226f47ab691117b5f20b249"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:07:44.124205Z","signature_b64":"1LQEVa0wlRo5q7CK8//8H60i44zbmxyy4X4a39bmHl3BovTqNZJ1aXA9c/EUB4b5SjD+1QsbevR9b3Wp8GUiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0e11e9d5b813f7c423867a312142abbc5742f6ea5c42d99b06d2c144a624949","last_reissued_at":"2026-07-05T03:07:44.123803Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:07:44.123803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Key Superposition Simultaneously Achieves Security and Privacy in Cache-Aided Linear Function Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Qifa Yan","submitted_at":"2020-09-13T14:02:18Z","abstract_excerpt":"This work investigates the problem of cache-aided content Secure and demand Private Linear Function Retrieval (SP-LFR), where three constraints are imposed on the system:(a) each user is interested in retrieving an arbitrary linear combination of the files in the server's library;(b) the content of the library must be kept secure from a wiretapper who obtains the signal sent by the server; and (c) no colluding subset of users together obtain information about the demands of the remaining users. A procedure is proposed to derive an SP-LFR scheme from a given Placement Delivery Array (PDA), whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.06000","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.06000/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2009.06000","created_at":"2026-07-05T03:07:44.123853+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.06000v2","created_at":"2026-07-05T03:07:44.123853+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.06000","created_at":"2026-07-05T03:07:44.123853+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDQR5HK3QE7X","created_at":"2026-07-05T03:07:44.123853+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDQR5HK3QE7XYQRY","created_at":"2026-07-05T03:07:44.123853+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDQR5HK3","created_at":"2026-07-05T03:07:44.123853+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.05865","citing_title":"A framework of constructing placement delivery arrays for centralized coded caching","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YDQR5HK3QE7XYQRYM6RREFBKXP","json":"https://pith.science/pith/YDQR5HK3QE7XYQRYM6RREFBKXP.json","graph_json":"https://pith.science/api/pith-number/YDQR5HK3QE7XYQRYM6RREFBKXP/graph.json","events_json":"https://pith.science/api/pith-number/YDQR5HK3QE7XYQRYM6RREFBKXP/events.json","paper":"https://pith.science/paper/YDQR5HK3"},"agent_actions":{"view_html":"https://pith.science/pith/YDQR5HK3QE7XYQRYM6RREFBKXP","download_json":"https://pith.science/pith/YDQR5HK3QE7XYQRYM6RREFBKXP.json","view_paper":"https://pith.science/paper/YDQR5HK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.06000&json=true","fetch_graph":"https://pith.science/api/pith-number/YDQR5HK3QE7XYQRYM6RREFBKXP/graph.json","fetch_events":"https://pith.science/api/pith-number/YDQR5HK3QE7XYQRYM6RREFBKXP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDQR5HK3QE7XYQRYM6RREFBKXP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDQR5HK3QE7XYQRYM6RREFBKXP/action/storage_attestation","attest_author":"https://pith.science/pith/YDQR5HK3QE7XYQRYM6RREFBKXP/action/author_attestation","sign_citation":"https://pith.science/pith/YDQR5HK3QE7XYQRYM6RREFBKXP/action/citation_signature","submit_replication":"https://pith.science/pith/YDQR5HK3QE7XYQRYM6RREFBKXP/action/replication_record"}},"created_at":"2026-07-05T03:07:44.123853+00:00","updated_at":"2026-07-05T03:07:44.123853+00:00"}