{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:4JYWO6N3WLQSD7VW2ZAMUSOKFB","short_pith_number":"pith:4JYWO6N3","schema_version":"1.0","canonical_sha256":"e2716779bbb2e121feb6d640ca49ca287545e9cc7debab9ac261d7944a2649d6","source":{"kind":"arxiv","id":"2202.10717","version":3},"attestation_state":"computed","paper":{"title":"Quantum Differential Privacy: An Information Theory Perspective","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":"Cambyse Rouz\\'e, Christoph Hirche, Daniel Stilck Fran\\c{c}a","submitted_at":"2022-02-22T08:12:50Z","abstract_excerpt":"Differential privacy has been an exceptionally successful concept when it comes to providing provable security guarantees for classical computations. More recently, the concept was generalized to quantum computations. While classical computations are essentially noiseless and differential privacy is often achieved by artificially adding noise, near-term quantum computers are inherently noisy and it was observed that this leads to natural differential privacy as a feature.\n  In this work we discuss quantum differential privacy in an information theoretic framework by casting it as a quantum div"},"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":"2202.10717","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-02-22T08:12:50Z","cross_cats_sorted":["cs.CR","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"b612291f3fed28f1304154fc59f1f20a0b18241bd618eb61ac33951b36d15e58","abstract_canon_sha256":"45ca39dbc009a9ba4151ef6b32c4607b119dba66b4e90f0015cc606537a95c33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:58:37.962165Z","signature_b64":"nw6AoNn1drr8mqUOWSSqNVJmRung3ou+REy9k3Jobspz+LtLB9TbeE39Aof9UI7s5Tfq/WkdQplWTWOueG/IBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2716779bbb2e121feb6d640ca49ca287545e9cc7debab9ac261d7944a2649d6","last_reissued_at":"2026-07-05T05:58:37.961670Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:58:37.961670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Differential Privacy: An Information Theory Perspective","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":"Cambyse Rouz\\'e, Christoph Hirche, Daniel Stilck Fran\\c{c}a","submitted_at":"2022-02-22T08:12:50Z","abstract_excerpt":"Differential privacy has been an exceptionally successful concept when it comes to providing provable security guarantees for classical computations. More recently, the concept was generalized to quantum computations. While classical computations are essentially noiseless and differential privacy is often achieved by artificially adding noise, near-term quantum computers are inherently noisy and it was observed that this leads to natural differential privacy as a feature.\n  In this work we discuss quantum differential privacy in an information theoretic framework by casting it as a quantum div"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.10717","kind":"arxiv","version":3},"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/2202.10717/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":"2202.10717","created_at":"2026-07-05T05:58:37.961730+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.10717v3","created_at":"2026-07-05T05:58:37.961730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.10717","created_at":"2026-07-05T05:58:37.961730+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JYWO6N3WLQS","created_at":"2026-07-05T05:58:37.961730+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JYWO6N3WLQSD7VW","created_at":"2026-07-05T05:58:37.961730+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JYWO6N3","created_at":"2026-07-05T05:58:37.961730+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05195","citing_title":"Integral representations of $f$-divergences for general von Neumann algebras","ref_index":30,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18726","citing_title":"Quantum Shannon theory made robust: a tale of three protocols for almost i.i.d. sources","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15114","citing_title":"New approaches to almost i.i.d. information theory","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18726","citing_title":"Quantum Shannon theory made robust: a tale of three protocols for almost i.i.d. sources","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08380","citing_title":"Sufficiency and Petz recovery for positive maps","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05694","citing_title":"Foundations of Future Communication Systems: Innovations in Communication - A Report","ref_index":86,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08380","citing_title":"Sufficiency and Petz recovery for positive maps","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4JYWO6N3WLQSD7VW2ZAMUSOKFB","json":"https://pith.science/pith/4JYWO6N3WLQSD7VW2ZAMUSOKFB.json","graph_json":"https://pith.science/api/pith-number/4JYWO6N3WLQSD7VW2ZAMUSOKFB/graph.json","events_json":"https://pith.science/api/pith-number/4JYWO6N3WLQSD7VW2ZAMUSOKFB/events.json","paper":"https://pith.science/paper/4JYWO6N3"},"agent_actions":{"view_html":"https://pith.science/pith/4JYWO6N3WLQSD7VW2ZAMUSOKFB","download_json":"https://pith.science/pith/4JYWO6N3WLQSD7VW2ZAMUSOKFB.json","view_paper":"https://pith.science/paper/4JYWO6N3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.10717&json=true","fetch_graph":"https://pith.science/api/pith-number/4JYWO6N3WLQSD7VW2ZAMUSOKFB/graph.json","fetch_events":"https://pith.science/api/pith-number/4JYWO6N3WLQSD7VW2ZAMUSOKFB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JYWO6N3WLQSD7VW2ZAMUSOKFB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JYWO6N3WLQSD7VW2ZAMUSOKFB/action/storage_attestation","attest_author":"https://pith.science/pith/4JYWO6N3WLQSD7VW2ZAMUSOKFB/action/author_attestation","sign_citation":"https://pith.science/pith/4JYWO6N3WLQSD7VW2ZAMUSOKFB/action/citation_signature","submit_replication":"https://pith.science/pith/4JYWO6N3WLQSD7VW2ZAMUSOKFB/action/replication_record"}},"created_at":"2026-07-05T05:58:37.961730+00:00","updated_at":"2026-07-05T05:58:37.961730+00:00"}