{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WN4L3YKNOTVXIFVZ5TYBN2XCXM","short_pith_number":"pith:WN4L3YKN","schema_version":"1.0","canonical_sha256":"b378bde14d74eb7416b9ecf016eae2bb27694c7ad98f23b375de00bbe757849a","source":{"kind":"arxiv","id":"2305.04701","version":2},"attestation_state":"computed","paper":{"title":"Differentially Private Attention Computation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Xin Yang, Yeqi Gao, Yufa Zhou, Zhao Song","submitted_at":"2023-05-08T13:32:41Z","abstract_excerpt":"Large language models (LLMs), especially those based on the Transformer architecture, have had a profound impact on various aspects of daily life, such as natural language processing, content generation, research methodologies, and more. Nevertheless, a crucial concern regarding the inference results of large language models is the issue of security and privacy. Given that large language models can generate results that may leak sensitive confidential or copyright information in many scenarios, it is crucial to compute the attention matrix with provable privacy guarantees, as attention is all "},"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":"2305.04701","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-05-08T13:32:41Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"25936a1271c9590ac2fa448e5d1a142e8ae38eb88880fd19e99f99b59ac55f2a","abstract_canon_sha256":"e07f9fe141b316865697044345442d2d0d5a3dd1573596d75360f02ee8edad17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:19:51.033453Z","signature_b64":"FpyJYKUEnvlQf/i+Wy05oxc5FxK0etRVVyCJ2eQCMUEzD5labLiO1pHSzxCdCBoYQpalAwk5GhykSnlo+5nVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b378bde14d74eb7416b9ecf016eae2bb27694c7ad98f23b375de00bbe757849a","last_reissued_at":"2026-07-05T09:19:51.032941Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:19:51.032941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentially Private Attention Computation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Xin Yang, Yeqi Gao, Yufa Zhou, Zhao Song","submitted_at":"2023-05-08T13:32:41Z","abstract_excerpt":"Large language models (LLMs), especially those based on the Transformer architecture, have had a profound impact on various aspects of daily life, such as natural language processing, content generation, research methodologies, and more. Nevertheless, a crucial concern regarding the inference results of large language models is the issue of security and privacy. Given that large language models can generate results that may leak sensitive confidential or copyright information in many scenarios, it is crucial to compute the attention matrix with provable privacy guarantees, as attention is all "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.04701","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/2305.04701/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":"2305.04701","created_at":"2026-07-05T09:19:51.033008+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.04701v2","created_at":"2026-07-05T09:19:51.033008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.04701","created_at":"2026-07-05T09:19:51.033008+00:00"},{"alias_kind":"pith_short_12","alias_value":"WN4L3YKNOTVX","created_at":"2026-07-05T09:19:51.033008+00:00"},{"alias_kind":"pith_short_16","alias_value":"WN4L3YKNOTVXIFVZ","created_at":"2026-07-05T09:19:51.033008+00:00"},{"alias_kind":"pith_short_8","alias_value":"WN4L3YKN","created_at":"2026-07-05T09:19:51.033008+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2306.14048","citing_title":"H$_2$O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models","ref_index":101,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WN4L3YKNOTVXIFVZ5TYBN2XCXM","json":"https://pith.science/pith/WN4L3YKNOTVXIFVZ5TYBN2XCXM.json","graph_json":"https://pith.science/api/pith-number/WN4L3YKNOTVXIFVZ5TYBN2XCXM/graph.json","events_json":"https://pith.science/api/pith-number/WN4L3YKNOTVXIFVZ5TYBN2XCXM/events.json","paper":"https://pith.science/paper/WN4L3YKN"},"agent_actions":{"view_html":"https://pith.science/pith/WN4L3YKNOTVXIFVZ5TYBN2XCXM","download_json":"https://pith.science/pith/WN4L3YKNOTVXIFVZ5TYBN2XCXM.json","view_paper":"https://pith.science/paper/WN4L3YKN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.04701&json=true","fetch_graph":"https://pith.science/api/pith-number/WN4L3YKNOTVXIFVZ5TYBN2XCXM/graph.json","fetch_events":"https://pith.science/api/pith-number/WN4L3YKNOTVXIFVZ5TYBN2XCXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WN4L3YKNOTVXIFVZ5TYBN2XCXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WN4L3YKNOTVXIFVZ5TYBN2XCXM/action/storage_attestation","attest_author":"https://pith.science/pith/WN4L3YKNOTVXIFVZ5TYBN2XCXM/action/author_attestation","sign_citation":"https://pith.science/pith/WN4L3YKNOTVXIFVZ5TYBN2XCXM/action/citation_signature","submit_replication":"https://pith.science/pith/WN4L3YKNOTVXIFVZ5TYBN2XCXM/action/replication_record"}},"created_at":"2026-07-05T09:19:51.033008+00:00","updated_at":"2026-07-05T09:19:51.033008+00:00"}