{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EIOPPT2MTBLNEMWQGY2ABHSUTW","short_pith_number":"pith:EIOPPT2M","schema_version":"1.0","canonical_sha256":"221cf7cf4c9856d232d03634009e549d9f11e91b1aaf2d61a23be9ffd05a6961","source":{"kind":"arxiv","id":"2509.03734","version":3},"attestation_state":"computed","paper":{"title":"How fast can you find a good hypothesis?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Anders Aamand, Justin Y. Chen, Maryam Aliakbarpour, Sandeep Silwal","submitted_at":"2025-09-03T21:44:48Z","abstract_excerpt":"In the hypothesis selection problem, we are given sample and query access to finite set of candidate distributions (hypotheses), $\\mathcal{H} = \\{H_1, \\ldots, H_n\\}$, and samples from an unknown distribution $P$, both over a domain $\\mathcal{X}$. The goal is to output a distribution $Q$ whose distance to $P$ is comparable to that of the nearest hypothesis in $\\mathcal{H}$. Specifically, if the minimum distance is $\\mathsf{OPT}$, we aim to output $Q$ such that, with probability at least $1-\\delta$, its total variation distance to $P$ is at most $C \\cdot \\mathsf{OPT} + \\varepsilon$. The optimal "},"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":"2509.03734","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-09-03T21:44:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9b385616d6b3fe44c2a83b91365fa80affbe2ac4665a983fb93752107f5f3559","abstract_canon_sha256":"222fcb279a66208fa4596d81ea53ba60b86253b39d147e393ea6fffd62c07314"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:04.162388Z","signature_b64":"DEauqXkf3x9fAfNctUXS7BwjsOAa/PRQSyJTFC8TGBhnSTO3JWbPDlSn7azaK8zt2nF+hy2Y/rc5e3zs+kLbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"221cf7cf4c9856d232d03634009e549d9f11e91b1aaf2d61a23be9ffd05a6961","last_reissued_at":"2026-06-19T16:12:04.161977Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:04.161977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How fast can you find a good hypothesis?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Anders Aamand, Justin Y. Chen, Maryam Aliakbarpour, Sandeep Silwal","submitted_at":"2025-09-03T21:44:48Z","abstract_excerpt":"In the hypothesis selection problem, we are given sample and query access to finite set of candidate distributions (hypotheses), $\\mathcal{H} = \\{H_1, \\ldots, H_n\\}$, and samples from an unknown distribution $P$, both over a domain $\\mathcal{X}$. The goal is to output a distribution $Q$ whose distance to $P$ is comparable to that of the nearest hypothesis in $\\mathcal{H}$. Specifically, if the minimum distance is $\\mathsf{OPT}$, we aim to output $Q$ such that, with probability at least $1-\\delta$, its total variation distance to $P$ is at most $C \\cdot \\mathsf{OPT} + \\varepsilon$. The optimal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.03734","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/2509.03734/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":"2509.03734","created_at":"2026-06-19T16:12:04.162035+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.03734v3","created_at":"2026-06-19T16:12:04.162035+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.03734","created_at":"2026-06-19T16:12:04.162035+00:00"},{"alias_kind":"pith_short_12","alias_value":"EIOPPT2MTBLN","created_at":"2026-06-19T16:12:04.162035+00:00"},{"alias_kind":"pith_short_16","alias_value":"EIOPPT2MTBLNEMWQ","created_at":"2026-06-19T16:12:04.162035+00:00"},{"alias_kind":"pith_short_8","alias_value":"EIOPPT2M","created_at":"2026-06-19T16:12:04.162035+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/EIOPPT2MTBLNEMWQGY2ABHSUTW","json":"https://pith.science/pith/EIOPPT2MTBLNEMWQGY2ABHSUTW.json","graph_json":"https://pith.science/api/pith-number/EIOPPT2MTBLNEMWQGY2ABHSUTW/graph.json","events_json":"https://pith.science/api/pith-number/EIOPPT2MTBLNEMWQGY2ABHSUTW/events.json","paper":"https://pith.science/paper/EIOPPT2M"},"agent_actions":{"view_html":"https://pith.science/pith/EIOPPT2MTBLNEMWQGY2ABHSUTW","download_json":"https://pith.science/pith/EIOPPT2MTBLNEMWQGY2ABHSUTW.json","view_paper":"https://pith.science/paper/EIOPPT2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.03734&json=true","fetch_graph":"https://pith.science/api/pith-number/EIOPPT2MTBLNEMWQGY2ABHSUTW/graph.json","fetch_events":"https://pith.science/api/pith-number/EIOPPT2MTBLNEMWQGY2ABHSUTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EIOPPT2MTBLNEMWQGY2ABHSUTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EIOPPT2MTBLNEMWQGY2ABHSUTW/action/storage_attestation","attest_author":"https://pith.science/pith/EIOPPT2MTBLNEMWQGY2ABHSUTW/action/author_attestation","sign_citation":"https://pith.science/pith/EIOPPT2MTBLNEMWQGY2ABHSUTW/action/citation_signature","submit_replication":"https://pith.science/pith/EIOPPT2MTBLNEMWQGY2ABHSUTW/action/replication_record"}},"created_at":"2026-06-19T16:12:04.162035+00:00","updated_at":"2026-06-19T16:12:04.162035+00:00"}