{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DDZCCCYSWZJ7CPK6UP7EEJOOUE","short_pith_number":"pith:DDZCCCYS","schema_version":"1.0","canonical_sha256":"18f2210b12b653f13d5ea3fe4225cea11811652d350cb7422cc4c28965bcc4ce","source":{"kind":"arxiv","id":"1207.0773","version":2},"attestation_state":"computed","paper":{"title":"Playing Mastermind with Many Colors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Benjamin Doerr, Carola Doerr, Henning Thomas, Reto Sp\\\"ohel","submitted_at":"2012-07-03T18:32:08Z","abstract_excerpt":"We analyze the general version of the classic guessing game Mastermind with $n$ positions and $k$ colors. Since the case $k \\le n^{1-\\varepsilon}$, $\\varepsilon>0$ a constant, is well understood, we concentrate on larger numbers of colors. For the most prominent case $k = n$, our results imply that Codebreaker can find the secret code with $O(n \\log \\log n)$ guesses. This bound is valid also when only black answer-pegs are used. It improves the $O(n \\log n)$ bound first proven by Chv\\'atal (Combinatorica 3 (1983), 325--329). We also show that if both black and white answer-pegs are used, then "},"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":"1207.0773","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-03T18:32:08Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7a015eb83dd207b11ec2b6e40c07ba8779da817e64106f688d1784729116813f","abstract_canon_sha256":"7d7092341dc2ba434310335ae359f88022c997552a7e89a2559524bb54078cdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:15.966616Z","signature_b64":"PMYAT7QxmAQXGK/XX3Pn8XsnxKURtjwjaTsiam533S6z+h93YG68eOiGQzh3FNr8IdXV3i26MDMVjygQbrwKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18f2210b12b653f13d5ea3fe4225cea11811652d350cb7422cc4c28965bcc4ce","last_reissued_at":"2026-05-18T03:36:15.965946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:15.965946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Playing Mastermind with Many Colors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Benjamin Doerr, Carola Doerr, Henning Thomas, Reto Sp\\\"ohel","submitted_at":"2012-07-03T18:32:08Z","abstract_excerpt":"We analyze the general version of the classic guessing game Mastermind with $n$ positions and $k$ colors. Since the case $k \\le n^{1-\\varepsilon}$, $\\varepsilon>0$ a constant, is well understood, we concentrate on larger numbers of colors. For the most prominent case $k = n$, our results imply that Codebreaker can find the secret code with $O(n \\log \\log n)$ guesses. This bound is valid also when only black answer-pegs are used. It improves the $O(n \\log n)$ bound first proven by Chv\\'atal (Combinatorica 3 (1983), 325--329). We also show that if both black and white answer-pegs are used, then "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0773","kind":"arxiv","version":2},"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":"1207.0773","created_at":"2026-05-18T03:36:15.966061+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.0773v2","created_at":"2026-05-18T03:36:15.966061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0773","created_at":"2026-05-18T03:36:15.966061+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDZCCCYSWZJ7","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDZCCCYSWZJ7CPK6","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDZCCCYS","created_at":"2026-05-18T12:27:01.376967+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/DDZCCCYSWZJ7CPK6UP7EEJOOUE","json":"https://pith.science/pith/DDZCCCYSWZJ7CPK6UP7EEJOOUE.json","graph_json":"https://pith.science/api/pith-number/DDZCCCYSWZJ7CPK6UP7EEJOOUE/graph.json","events_json":"https://pith.science/api/pith-number/DDZCCCYSWZJ7CPK6UP7EEJOOUE/events.json","paper":"https://pith.science/paper/DDZCCCYS"},"agent_actions":{"view_html":"https://pith.science/pith/DDZCCCYSWZJ7CPK6UP7EEJOOUE","download_json":"https://pith.science/pith/DDZCCCYSWZJ7CPK6UP7EEJOOUE.json","view_paper":"https://pith.science/paper/DDZCCCYS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.0773&json=true","fetch_graph":"https://pith.science/api/pith-number/DDZCCCYSWZJ7CPK6UP7EEJOOUE/graph.json","fetch_events":"https://pith.science/api/pith-number/DDZCCCYSWZJ7CPK6UP7EEJOOUE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDZCCCYSWZJ7CPK6UP7EEJOOUE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDZCCCYSWZJ7CPK6UP7EEJOOUE/action/storage_attestation","attest_author":"https://pith.science/pith/DDZCCCYSWZJ7CPK6UP7EEJOOUE/action/author_attestation","sign_citation":"https://pith.science/pith/DDZCCCYSWZJ7CPK6UP7EEJOOUE/action/citation_signature","submit_replication":"https://pith.science/pith/DDZCCCYSWZJ7CPK6UP7EEJOOUE/action/replication_record"}},"created_at":"2026-05-18T03:36:15.966061+00:00","updated_at":"2026-05-18T03:36:15.966061+00:00"}