{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MVYBH3L3MNQZXUBNSXOEV3EWW4","short_pith_number":"pith:MVYBH3L3","schema_version":"1.0","canonical_sha256":"657013ed7b63619bd02d95dc4aec96b70f7b3e6e5556708fbaf9e8791be42395","source":{"kind":"arxiv","id":"2504.13804","version":1},"attestation_state":"computed","paper":{"title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Robert Busa-Fekete, Umar Syed","submitted_at":"2025-04-18T17:12:15Z","abstract_excerpt":"We present new algorithms for estimating and testing \\emph{collision probability}, a fundamental measure of the spread of a discrete distribution that is widely used in many scientific fields. We describe an algorithm that satisfies $(\\alpha, \\beta)$-local differential privacy and estimates collision probability with error at most $\\epsilon$ using $\\tilde{O}\\left(\\frac{\\log(1/\\beta)}{\\alpha^2 \\epsilon^2}\\right)$ samples for $\\alpha \\le 1$, which improves over previous work by a factor of $\\frac{1}{\\alpha^2}$. We also present a sequential testing algorithm for collision probability, which can d"},"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":"2504.13804","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-04-18T17:12:15Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"c7ff7748b10211f81030eeb9ebeaf8e58e1a18ac5c15f7225dadb05e05305319","abstract_canon_sha256":"2dd403c0f08c154814bb3cc48ac2eb03ceab027fc13f0ec8669a1a99c638242d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:51:02.392085Z","signature_b64":"zK1rkUgQMS3z4laDlUj5V7cohN7E6Elx3cKmOXzN4dWdQZovu5iyTPuw76KS/MksOe8fHzpy1ok1GpJ8SaJuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"657013ed7b63619bd02d95dc4aec96b70f7b3e6e5556708fbaf9e8791be42395","last_reissued_at":"2026-07-05T10:51:02.391595Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:51:02.391595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Robert Busa-Fekete, Umar Syed","submitted_at":"2025-04-18T17:12:15Z","abstract_excerpt":"We present new algorithms for estimating and testing \\emph{collision probability}, a fundamental measure of the spread of a discrete distribution that is widely used in many scientific fields. We describe an algorithm that satisfies $(\\alpha, \\beta)$-local differential privacy and estimates collision probability with error at most $\\epsilon$ using $\\tilde{O}\\left(\\frac{\\log(1/\\beta)}{\\alpha^2 \\epsilon^2}\\right)$ samples for $\\alpha \\le 1$, which improves over previous work by a factor of $\\frac{1}{\\alpha^2}$. We also present a sequential testing algorithm for collision probability, which can d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.13804","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/2504.13804/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":"2504.13804","created_at":"2026-07-05T10:51:02.391651+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.13804v1","created_at":"2026-07-05T10:51:02.391651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.13804","created_at":"2026-07-05T10:51:02.391651+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVYBH3L3MNQZ","created_at":"2026-07-05T10:51:02.391651+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVYBH3L3MNQZXUBN","created_at":"2026-07-05T10:51:02.391651+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVYBH3L3","created_at":"2026-07-05T10:51:02.391651+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/MVYBH3L3MNQZXUBNSXOEV3EWW4","json":"https://pith.science/pith/MVYBH3L3MNQZXUBNSXOEV3EWW4.json","graph_json":"https://pith.science/api/pith-number/MVYBH3L3MNQZXUBNSXOEV3EWW4/graph.json","events_json":"https://pith.science/api/pith-number/MVYBH3L3MNQZXUBNSXOEV3EWW4/events.json","paper":"https://pith.science/paper/MVYBH3L3"},"agent_actions":{"view_html":"https://pith.science/pith/MVYBH3L3MNQZXUBNSXOEV3EWW4","download_json":"https://pith.science/pith/MVYBH3L3MNQZXUBNSXOEV3EWW4.json","view_paper":"https://pith.science/paper/MVYBH3L3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.13804&json=true","fetch_graph":"https://pith.science/api/pith-number/MVYBH3L3MNQZXUBNSXOEV3EWW4/graph.json","fetch_events":"https://pith.science/api/pith-number/MVYBH3L3MNQZXUBNSXOEV3EWW4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVYBH3L3MNQZXUBNSXOEV3EWW4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVYBH3L3MNQZXUBNSXOEV3EWW4/action/storage_attestation","attest_author":"https://pith.science/pith/MVYBH3L3MNQZXUBNSXOEV3EWW4/action/author_attestation","sign_citation":"https://pith.science/pith/MVYBH3L3MNQZXUBNSXOEV3EWW4/action/citation_signature","submit_replication":"https://pith.science/pith/MVYBH3L3MNQZXUBNSXOEV3EWW4/action/replication_record"}},"created_at":"2026-07-05T10:51:02.391651+00:00","updated_at":"2026-07-05T10:51:02.391651+00:00"}