{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CYGBJTGG5YY2WSAOAR2P5RFKHN","short_pith_number":"pith:CYGBJTGG","schema_version":"1.0","canonical_sha256":"160c14ccc6ee31ab480e0474fec4aa3b587f637f1f60d9b2bdc9ae18b327e9cf","source":{"kind":"arxiv","id":"1603.08037","version":1},"attestation_state":"computed","paper":{"title":"On the Detection of Mixture Distributions with applications to the Most Biased Coin Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ben Recht, Daniel Haas, Kevin Jamieson","submitted_at":"2016-03-25T21:22:59Z","abstract_excerpt":"This paper studies the trade-off between two different kinds of pure exploration: breadth versus depth. The most biased coin problem asks how many total coin flips are required to identify a \"heavy\" coin from an infinite bag containing both \"heavy\" coins with mean $\\theta_1 \\in (0,1)$, and \"light\" coins with mean $\\theta_0 \\in (0,\\theta_1)$, where heavy coins are drawn from the bag with probability $\\alpha \\in (0,1/2)$. The key difficulty of this problem lies in distinguishing whether the two kinds of coins have very similar means, or whether heavy coins are just extremely rare. This problem h"},"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":"1603.08037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-25T21:22:59Z","cross_cats_sorted":[],"title_canon_sha256":"ec60ebed12a8d2c3e6bb5af259be70e897593742834534c23c649b5c52f47a75","abstract_canon_sha256":"5ef7aa993b3aefa712632fc752e8b3e4f4b5b4eec9a37e64d14a10658be5a080"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:13.496942Z","signature_b64":"yHNwDjfcel3Q9X+nB9Ih3jWmRLi2KIBaP4urTG+7MFR/N4uestl+5ApArVK7Ys11l5CNBYBwdrF83S19HpplBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"160c14ccc6ee31ab480e0474fec4aa3b587f637f1f60d9b2bdc9ae18b327e9cf","last_reissued_at":"2026-05-18T01:18:13.496347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:13.496347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Detection of Mixture Distributions with applications to the Most Biased Coin Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ben Recht, Daniel Haas, Kevin Jamieson","submitted_at":"2016-03-25T21:22:59Z","abstract_excerpt":"This paper studies the trade-off between two different kinds of pure exploration: breadth versus depth. The most biased coin problem asks how many total coin flips are required to identify a \"heavy\" coin from an infinite bag containing both \"heavy\" coins with mean $\\theta_1 \\in (0,1)$, and \"light\" coins with mean $\\theta_0 \\in (0,\\theta_1)$, where heavy coins are drawn from the bag with probability $\\alpha \\in (0,1/2)$. The key difficulty of this problem lies in distinguishing whether the two kinds of coins have very similar means, or whether heavy coins are just extremely rare. This problem h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08037","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":""},"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":"1603.08037","created_at":"2026-05-18T01:18:13.496432+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.08037v1","created_at":"2026-05-18T01:18:13.496432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08037","created_at":"2026-05-18T01:18:13.496432+00:00"},{"alias_kind":"pith_short_12","alias_value":"CYGBJTGG5YY2","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CYGBJTGG5YY2WSAO","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CYGBJTGG","created_at":"2026-05-18T12:30:09.641336+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/CYGBJTGG5YY2WSAOAR2P5RFKHN","json":"https://pith.science/pith/CYGBJTGG5YY2WSAOAR2P5RFKHN.json","graph_json":"https://pith.science/api/pith-number/CYGBJTGG5YY2WSAOAR2P5RFKHN/graph.json","events_json":"https://pith.science/api/pith-number/CYGBJTGG5YY2WSAOAR2P5RFKHN/events.json","paper":"https://pith.science/paper/CYGBJTGG"},"agent_actions":{"view_html":"https://pith.science/pith/CYGBJTGG5YY2WSAOAR2P5RFKHN","download_json":"https://pith.science/pith/CYGBJTGG5YY2WSAOAR2P5RFKHN.json","view_paper":"https://pith.science/paper/CYGBJTGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.08037&json=true","fetch_graph":"https://pith.science/api/pith-number/CYGBJTGG5YY2WSAOAR2P5RFKHN/graph.json","fetch_events":"https://pith.science/api/pith-number/CYGBJTGG5YY2WSAOAR2P5RFKHN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CYGBJTGG5YY2WSAOAR2P5RFKHN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CYGBJTGG5YY2WSAOAR2P5RFKHN/action/storage_attestation","attest_author":"https://pith.science/pith/CYGBJTGG5YY2WSAOAR2P5RFKHN/action/author_attestation","sign_citation":"https://pith.science/pith/CYGBJTGG5YY2WSAOAR2P5RFKHN/action/citation_signature","submit_replication":"https://pith.science/pith/CYGBJTGG5YY2WSAOAR2P5RFKHN/action/replication_record"}},"created_at":"2026-05-18T01:18:13.496432+00:00","updated_at":"2026-05-18T01:18:13.496432+00:00"}