{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PW2WXAGKN3HPRXCOBDKE5EJ5B2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"99891808142a17667271bd46488eca34b5f67bc06717a7a9f62fe9913cddac8f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-05T01:31:56Z","title_canon_sha256":"56a1c325f62746359c4e21accee691ca12889c71cb6b57d15781c9bb0d585d9e"},"schema_version":"1.0","source":{"id":"2605.03264","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.03264","created_at":"2026-07-02T00:18:29Z"},{"alias_kind":"arxiv_version","alias_value":"2605.03264v2","created_at":"2026-07-02T00:18:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.03264","created_at":"2026-07-02T00:18:29Z"},{"alias_kind":"pith_short_12","alias_value":"PW2WXAGKN3HP","created_at":"2026-07-02T00:18:29Z"},{"alias_kind":"pith_short_16","alias_value":"PW2WXAGKN3HPRXCO","created_at":"2026-07-02T00:18:29Z"},{"alias_kind":"pith_short_8","alias_value":"PW2WXAGK","created_at":"2026-07-02T00:18:29Z"}],"graph_snapshots":[{"event_id":"sha256:fda7c51d3759dde30f7a191d4f836cafef51fc0cc38cf9da257d9684ed27654f","target":"graph","created_at":"2026-07-02T00:18:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We introduce efficient PTR (ePTR), which replaces the exact insensitive set with a simpler subset and the exact Hellinger distance with a Lipschitz-based lower bound. This flexibility enables substantially simpler DP mechanisms that achieve rate-optimal accuracy in many settings."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the chosen simpler insensitive subset and the Lipschitz lower bound on Hellinger distance are tight enough to preserve both the differential privacy guarantee and the claimed minimax optimality for the three concrete estimators studied."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Efficient PTR replaces exact insensitive sets and Hellinger distances with simpler subsets and Lipschitz lower bounds to achieve minimax-optimal accuracy for DP Bayes classification, linear regression, and nonparametric regression."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Efficient PTR replaces the exact insensitive set with a simpler subset and the exact Hellinger distance with a Lipschitz lower bound, yielding tractable DP mechanisms that attain minimax rates for classification and regression."}],"snapshot_sha256":"1da80de63d72d6ad2a5e13ff9bfbe8ec1b78101ffeb0541e51e01732639e05d2"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T14:34:44.432326Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-20T01:31:21.671730Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T15:33:07.269101Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.03264/integrity.json","findings":[],"snapshot_sha256":"9d6106f2e584101ae02759a3f3bda1c645c735315fe9a727ea7dfab6e1af34fc","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Differential privacy (DP) is a rigorous framework that protects the participation of individuals in a dataset by controlling information leakage through released estimators. It brings a challenge for statisticians: DP uniformly considers all possible datasets, whereas statistical practice often downweights atypical or rare outcomes. The conceptual challenge is especially pronounced in sensitivity analysis, where atypical datasets introduces markedly high sensitivity, even for a basic estimator such as ordinary least square. Standard DP recipe adds a noise governed by this large overall sensiti","authors_text":"Tao Shen, Wanjie Wang, Xin T. Tong","cross_cats":[],"headline":"Efficient PTR replaces the exact insensitive set with a simpler subset and the exact Hellinger distance with a Lipschitz lower bound, yielding tractable DP mechanisms that attain minimax rates for classification and regression.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-05T01:31:56Z","title":"Efficient Propose-Test-Release for Optimal Differentially Private Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.03264","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-07T14:57:56.540752Z","id":"8cf10fa8-e8ba-4018-820f-24cf5c4e2424","model_set":{"reader":"grok-4.3"},"one_line_summary":"Efficient PTR replaces exact insensitive sets and Hellinger distances with simpler subsets and Lipschitz lower bounds to achieve minimax-optimal accuracy for DP Bayes classification, linear regression, and nonparametric regression.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Efficient PTR replaces the exact insensitive set with a simpler subset and the exact Hellinger distance with a Lipschitz lower bound, yielding tractable DP mechanisms that attain minimax rates for classification and regression.","strongest_claim":"We introduce efficient PTR (ePTR), which replaces the exact insensitive set with a simpler subset and the exact Hellinger distance with a Lipschitz-based lower bound. This flexibility enables substantially simpler DP mechanisms that achieve rate-optimal accuracy in many settings.","weakest_assumption":"That the chosen simpler insensitive subset and the Lipschitz lower bound on Hellinger distance are tight enough to preserve both the differential privacy guarantee and the claimed minimax optimality for the three concrete estimators studied."}},"verdict_id":"8cf10fa8-e8ba-4018-820f-24cf5c4e2424"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c14d793dcff3aed071b25013ba442794943e64ec845ce247c2a0389b25960167","target":"record","created_at":"2026-07-02T00:18:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"99891808142a17667271bd46488eca34b5f67bc06717a7a9f62fe9913cddac8f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-05T01:31:56Z","title_canon_sha256":"56a1c325f62746359c4e21accee691ca12889c71cb6b57d15781c9bb0d585d9e"},"schema_version":"1.0","source":{"id":"2605.03264","kind":"arxiv","version":2}},"canonical_sha256":"7db56b80ca6ecef8dc4e08d44e913d0e9eb15e0cf44d9b331bf6905a376cd0d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7db56b80ca6ecef8dc4e08d44e913d0e9eb15e0cf44d9b331bf6905a376cd0d2","first_computed_at":"2026-07-02T00:18:29.443744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T00:18:29.443744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W1X37SFtYSadSJ0Z41xzk5gmV4CwI6TxJbHbLVn/DB2NWYDRbk1cBw9T2ezstVKW2yRKyOfMSZ5Z2YcUrfQ8Aw==","signature_status":"signed_v1","signed_at":"2026-07-02T00:18:29.444203Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.03264","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c14d793dcff3aed071b25013ba442794943e64ec845ce247c2a0389b25960167","sha256:fda7c51d3759dde30f7a191d4f836cafef51fc0cc38cf9da257d9684ed27654f"],"state_sha256":"d0e6a2e3e529c5a6a08bd7705d498eac4b2291ed28c8b54c360e4b368e149e97"}