{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:BZWLOZKAJKKDJTUWGLPDDDIVFD","short_pith_number":"pith:BZWLOZKA","schema_version":"1.0","canonical_sha256":"0e6cb765404a9434ce9632de318d1528ce83cb0616fbaf7b330b9ad5f283cf74","source":{"kind":"arxiv","id":"2205.13722","version":2},"attestation_state":"computed","paper":{"title":"Can Foundation Models Help Us Achieve Perfect Secrecy?","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Christopher R\\'e, Simran Arora","submitted_at":"2022-05-27T02:32:26Z","abstract_excerpt":"A key promise of machine learning is the ability to assist users with personal tasks. Because the personal context required to make accurate predictions is often sensitive, we require systems that protect privacy. A gold standard privacy-preserving system will satisfy perfect secrecy, meaning that interactions with the system provably reveal no private information. However, privacy and quality appear to be in tension in existing systems for personal tasks. Neural models typically require copious amounts of training to perform well, while individual users typically hold a limited scale of data,"},"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":"2205.13722","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-27T02:32:26Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"aa3d6c391960547a18d07c4db9e6b4aabe0d7eceddabf998b17ec8141cfe09e8","abstract_canon_sha256":"4904ef67ffc6bcfd9cfd0b220ec24928d0a51b008116d141a0517562a9f1ea3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:08.570641Z","signature_b64":"OF9thMoyNl0tZLZA2moU15yRYmePD6co53eRNfn4ZpsMOGtuzyWhxszLnuYwQj+3VFLoegn22RTMzE84yY5lDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e6cb765404a9434ce9632de318d1528ce83cb0616fbaf7b330b9ad5f283cf74","last_reissued_at":"2026-07-05T05:38:08.570156Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:08.570156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can Foundation Models Help Us Achieve Perfect Secrecy?","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Christopher R\\'e, Simran Arora","submitted_at":"2022-05-27T02:32:26Z","abstract_excerpt":"A key promise of machine learning is the ability to assist users with personal tasks. Because the personal context required to make accurate predictions is often sensitive, we require systems that protect privacy. A gold standard privacy-preserving system will satisfy perfect secrecy, meaning that interactions with the system provably reveal no private information. However, privacy and quality appear to be in tension in existing systems for personal tasks. Neural models typically require copious amounts of training to perform well, while individual users typically hold a limited scale of data,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.13722","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/2205.13722/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":"2205.13722","created_at":"2026-07-05T05:38:08.570211+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.13722v2","created_at":"2026-07-05T05:38:08.570211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.13722","created_at":"2026-07-05T05:38:08.570211+00:00"},{"alias_kind":"pith_short_12","alias_value":"BZWLOZKAJKKD","created_at":"2026-07-05T05:38:08.570211+00:00"},{"alias_kind":"pith_short_16","alias_value":"BZWLOZKAJKKDJTUW","created_at":"2026-07-05T05:38:08.570211+00:00"},{"alias_kind":"pith_short_8","alias_value":"BZWLOZKA","created_at":"2026-07-05T05:38:08.570211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.05971","citing_title":"Training Transformers for KV Cache Compressibility","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05971","citing_title":"Training Transformers for KV Cache Compressibility","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BZWLOZKAJKKDJTUWGLPDDDIVFD","json":"https://pith.science/pith/BZWLOZKAJKKDJTUWGLPDDDIVFD.json","graph_json":"https://pith.science/api/pith-number/BZWLOZKAJKKDJTUWGLPDDDIVFD/graph.json","events_json":"https://pith.science/api/pith-number/BZWLOZKAJKKDJTUWGLPDDDIVFD/events.json","paper":"https://pith.science/paper/BZWLOZKA"},"agent_actions":{"view_html":"https://pith.science/pith/BZWLOZKAJKKDJTUWGLPDDDIVFD","download_json":"https://pith.science/pith/BZWLOZKAJKKDJTUWGLPDDDIVFD.json","view_paper":"https://pith.science/paper/BZWLOZKA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.13722&json=true","fetch_graph":"https://pith.science/api/pith-number/BZWLOZKAJKKDJTUWGLPDDDIVFD/graph.json","fetch_events":"https://pith.science/api/pith-number/BZWLOZKAJKKDJTUWGLPDDDIVFD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BZWLOZKAJKKDJTUWGLPDDDIVFD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BZWLOZKAJKKDJTUWGLPDDDIVFD/action/storage_attestation","attest_author":"https://pith.science/pith/BZWLOZKAJKKDJTUWGLPDDDIVFD/action/author_attestation","sign_citation":"https://pith.science/pith/BZWLOZKAJKKDJTUWGLPDDDIVFD/action/citation_signature","submit_replication":"https://pith.science/pith/BZWLOZKAJKKDJTUWGLPDDDIVFD/action/replication_record"}},"created_at":"2026-07-05T05:38:08.570211+00:00","updated_at":"2026-07-05T05:38:08.570211+00:00"}