{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FD5MA4QCHO5UEWQ23OQR5EBAGS","short_pith_number":"pith:FD5MA4QC","schema_version":"1.0","canonical_sha256":"28fac072023bbb425a1adba11e90203493c02ab5792540564fe1e1f980116f08","source":{"kind":"arxiv","id":"2307.04733","version":1},"attestation_state":"computed","paper":{"title":"A unifying framework for differentially private quantum algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","cs.LG","math.IT"],"primary_cat":"quant-ph","authors_text":"Armando Angrisani, Elham Kashefi, Mina Doosti","submitted_at":"2023-07-10T17:44:03Z","abstract_excerpt":"Differential privacy is a widely used notion of security that enables the processing of sensitive information. In short, differentially private algorithms map \"neighbouring\" inputs to close output distributions. Prior work proposed several quantum extensions of differential privacy, each of them built on substantially different notions of neighbouring quantum states. In this paper, we propose a novel and general definition of neighbouring quantum states. We demonstrate that this definition captures the underlying structure of quantum encodings and can be used to provide exponentially tighter p"},"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":"2307.04733","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-10T17:44:03Z","cross_cats_sorted":["cs.CR","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"740d47dfe2717b4abbb89e44083d665050f091a701129574a5802d5a602b8db3","abstract_canon_sha256":"d48703e04e4a02d64fdf7efaacd8fd318a11d6e6a9f855c14797c3c24b937830"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:29:16.719276Z","signature_b64":"UZjTCt19Mo79nhwJbUrJxcpTAqAZ/R6+Dd/bBJhzVePuTAHDJkiweGi6udZFKWodFgat/k3odL6IeYLYVLoZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28fac072023bbb425a1adba11e90203493c02ab5792540564fe1e1f980116f08","last_reissued_at":"2026-07-05T06:29:16.718905Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:29:16.718905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A unifying framework for differentially private quantum algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","cs.LG","math.IT"],"primary_cat":"quant-ph","authors_text":"Armando Angrisani, Elham Kashefi, Mina Doosti","submitted_at":"2023-07-10T17:44:03Z","abstract_excerpt":"Differential privacy is a widely used notion of security that enables the processing of sensitive information. In short, differentially private algorithms map \"neighbouring\" inputs to close output distributions. Prior work proposed several quantum extensions of differential privacy, each of them built on substantially different notions of neighbouring quantum states. In this paper, we propose a novel and general definition of neighbouring quantum states. We demonstrate that this definition captures the underlying structure of quantum encodings and can be used to provide exponentially tighter p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.04733","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.04733/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":"2307.04733","created_at":"2026-07-05T06:29:16.718958+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.04733v1","created_at":"2026-07-05T06:29:16.718958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.04733","created_at":"2026-07-05T06:29:16.718958+00:00"},{"alias_kind":"pith_short_12","alias_value":"FD5MA4QCHO5U","created_at":"2026-07-05T06:29:16.718958+00:00"},{"alias_kind":"pith_short_16","alias_value":"FD5MA4QCHO5UEWQ2","created_at":"2026-07-05T06:29:16.718958+00:00"},{"alias_kind":"pith_short_8","alias_value":"FD5MA4QC","created_at":"2026-07-05T06:29:16.718958+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06521","citing_title":"Differentially private quantum sensor networks","ref_index":52,"is_internal_anchor":true},{"citing_arxiv_id":"2606.29293","citing_title":"Private training in quantum machine learning","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07639","citing_title":"Exponential quantum advantage in processing massive classical data","ref_index":172,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FD5MA4QCHO5UEWQ23OQR5EBAGS","json":"https://pith.science/pith/FD5MA4QCHO5UEWQ23OQR5EBAGS.json","graph_json":"https://pith.science/api/pith-number/FD5MA4QCHO5UEWQ23OQR5EBAGS/graph.json","events_json":"https://pith.science/api/pith-number/FD5MA4QCHO5UEWQ23OQR5EBAGS/events.json","paper":"https://pith.science/paper/FD5MA4QC"},"agent_actions":{"view_html":"https://pith.science/pith/FD5MA4QCHO5UEWQ23OQR5EBAGS","download_json":"https://pith.science/pith/FD5MA4QCHO5UEWQ23OQR5EBAGS.json","view_paper":"https://pith.science/paper/FD5MA4QC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.04733&json=true","fetch_graph":"https://pith.science/api/pith-number/FD5MA4QCHO5UEWQ23OQR5EBAGS/graph.json","fetch_events":"https://pith.science/api/pith-number/FD5MA4QCHO5UEWQ23OQR5EBAGS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FD5MA4QCHO5UEWQ23OQR5EBAGS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FD5MA4QCHO5UEWQ23OQR5EBAGS/action/storage_attestation","attest_author":"https://pith.science/pith/FD5MA4QCHO5UEWQ23OQR5EBAGS/action/author_attestation","sign_citation":"https://pith.science/pith/FD5MA4QCHO5UEWQ23OQR5EBAGS/action/citation_signature","submit_replication":"https://pith.science/pith/FD5MA4QCHO5UEWQ23OQR5EBAGS/action/replication_record"}},"created_at":"2026-07-05T06:29:16.718958+00:00","updated_at":"2026-07-05T06:29:16.718958+00:00"}