{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5MHNS2R2ESW6SE5WVKIC3XEI7L","short_pith_number":"pith:5MHNS2R2","schema_version":"1.0","canonical_sha256":"eb0ed96a3a24ade913b6aa902ddc88fac496c24b758caaa737c29d4bcd06d13a","source":{"kind":"arxiv","id":"2602.11454","version":3},"attestation_state":"computed","paper":{"title":"Adaptive Power Iteration Method for Differentially Private PCA","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Alina Ene, Huy Le Nguyen, Ta Duy Nguyen","submitted_at":"2026-02-12T00:07:05Z","abstract_excerpt":"We study $\\left(\\epsilon,\\delta\\right)$-differentially private algorithms for the problem of approximately computing the top singular vector of a matrix $A\\in\\mathbb{R}^{n\\times d}$ where each row of $A$ is a data point in $\\mathbb{R}^{d}$. Following Dwork-Talwar-Thakurta-Zhang (STOC 2014), we consider the privacy model where neighboring inputs differ by one single row. We give a novel algorithm that achieves beyond-worst-case guarantees for input matrices with low coherence, which is a structural property of matrices in many applications, including but not limited to i.i.d. data. Our algorith"},"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":"2602.11454","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-02-12T00:07:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"45658dee39b71d533f44d89aa7ac8c8b4354ff3a3171e18b44561ed6233e15fb","abstract_canon_sha256":"4bb695c3dafe5bb1c2cc9864e94242155e9f9506273eccb08e8659bfed3dc6cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:08.846032Z","signature_b64":"UGV85M7s0P7BvN+Xf9L9hgLST92tdwfEtvcH/sAOdUyIMNr441zEokbTKaZTAIqg/ZRh430u3QkILjURDvRZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb0ed96a3a24ade913b6aa902ddc88fac496c24b758caaa737c29d4bcd06d13a","last_reissued_at":"2026-05-20T01:05:08.845088Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:08.845088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Power Iteration Method for Differentially Private PCA","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Alina Ene, Huy Le Nguyen, Ta Duy Nguyen","submitted_at":"2026-02-12T00:07:05Z","abstract_excerpt":"We study $\\left(\\epsilon,\\delta\\right)$-differentially private algorithms for the problem of approximately computing the top singular vector of a matrix $A\\in\\mathbb{R}^{n\\times d}$ where each row of $A$ is a data point in $\\mathbb{R}^{d}$. Following Dwork-Talwar-Thakurta-Zhang (STOC 2014), we consider the privacy model where neighboring inputs differ by one single row. We give a novel algorithm that achieves beyond-worst-case guarantees for input matrices with low coherence, which is a structural property of matrices in many applications, including but not limited to i.i.d. data. Our algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.11454","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/2602.11454/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":"2602.11454","created_at":"2026-05-20T01:05:08.845239+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.11454v3","created_at":"2026-05-20T01:05:08.845239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.11454","created_at":"2026-05-20T01:05:08.845239+00:00"},{"alias_kind":"pith_short_12","alias_value":"5MHNS2R2ESW6","created_at":"2026-05-20T01:05:08.845239+00:00"},{"alias_kind":"pith_short_16","alias_value":"5MHNS2R2ESW6SE5W","created_at":"2026-05-20T01:05:08.845239+00:00"},{"alias_kind":"pith_short_8","alias_value":"5MHNS2R2","created_at":"2026-05-20T01:05:08.845239+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5MHNS2R2ESW6SE5WVKIC3XEI7L","json":"https://pith.science/pith/5MHNS2R2ESW6SE5WVKIC3XEI7L.json","graph_json":"https://pith.science/api/pith-number/5MHNS2R2ESW6SE5WVKIC3XEI7L/graph.json","events_json":"https://pith.science/api/pith-number/5MHNS2R2ESW6SE5WVKIC3XEI7L/events.json","paper":"https://pith.science/paper/5MHNS2R2"},"agent_actions":{"view_html":"https://pith.science/pith/5MHNS2R2ESW6SE5WVKIC3XEI7L","download_json":"https://pith.science/pith/5MHNS2R2ESW6SE5WVKIC3XEI7L.json","view_paper":"https://pith.science/paper/5MHNS2R2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.11454&json=true","fetch_graph":"https://pith.science/api/pith-number/5MHNS2R2ESW6SE5WVKIC3XEI7L/graph.json","fetch_events":"https://pith.science/api/pith-number/5MHNS2R2ESW6SE5WVKIC3XEI7L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5MHNS2R2ESW6SE5WVKIC3XEI7L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5MHNS2R2ESW6SE5WVKIC3XEI7L/action/storage_attestation","attest_author":"https://pith.science/pith/5MHNS2R2ESW6SE5WVKIC3XEI7L/action/author_attestation","sign_citation":"https://pith.science/pith/5MHNS2R2ESW6SE5WVKIC3XEI7L/action/citation_signature","submit_replication":"https://pith.science/pith/5MHNS2R2ESW6SE5WVKIC3XEI7L/action/replication_record"}},"created_at":"2026-05-20T01:05:08.845239+00:00","updated_at":"2026-05-20T01:05:08.845239+00:00"}