{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:GPAAYKBPLA52ZTC3KPCA57JEXW","short_pith_number":"pith:GPAAYKBP","schema_version":"1.0","canonical_sha256":"33c00c282f583baccc5b53c40efd24bdbfe506b01fdf2833dd862279d27b572b","source":{"kind":"arxiv","id":"1110.3619","version":1},"attestation_state":"computed","paper":{"title":"Playing Mastermind With Constant-Size Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.DS","authors_text":"Benjamin Doerr, Carola Winzen","submitted_at":"2011-10-17T09:44:13Z","abstract_excerpt":"We analyze the classic board game of Mastermind with $n$ holes and a constant number of colors. A result of Chv\\'atal (Combinatorica 3 (1983), 325-329) states that the codebreaker can find the secret code with $\\Theta(n / \\log n)$ questions. We show that this bound remains valid if the codebreaker may only store a constant number of guesses and answers. In addition to an intrinsic interest in this question, our result also disproves a conjecture of Droste, Jansen, and Wegener (Theory of Computing Systems 39 (2006), 525-544) on the memory-restricted black-box complexity of the OneMax function c"},"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":"1110.3619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-17T09:44:13Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"b3d4028a4bcefdb56b9634e12d75ed68226e687a5d1d216b77625d3e7fab203c","abstract_canon_sha256":"d3b75586b418423c7cd68c994fc023fee78238582fb4975428bb91369b1cd13a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:35.262072Z","signature_b64":"MgCNdUlV7yZ7b6j6H8U2jFuy3nDycXiwyAUdEnP939I0eOf2JX2LXY6WVUnoDxHrRaFt9/pWFI1teGKGtvNZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33c00c282f583baccc5b53c40efd24bdbfe506b01fdf2833dd862279d27b572b","last_reissued_at":"2026-05-18T02:21:35.261529Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:35.261529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Playing Mastermind With Constant-Size Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.DS","authors_text":"Benjamin Doerr, Carola Winzen","submitted_at":"2011-10-17T09:44:13Z","abstract_excerpt":"We analyze the classic board game of Mastermind with $n$ holes and a constant number of colors. A result of Chv\\'atal (Combinatorica 3 (1983), 325-329) states that the codebreaker can find the secret code with $\\Theta(n / \\log n)$ questions. We show that this bound remains valid if the codebreaker may only store a constant number of guesses and answers. In addition to an intrinsic interest in this question, our result also disproves a conjecture of Droste, Jansen, and Wegener (Theory of Computing Systems 39 (2006), 525-544) on the memory-restricted black-box complexity of the OneMax function c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3619","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":"1110.3619","created_at":"2026-05-18T02:21:35.261627+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.3619v1","created_at":"2026-05-18T02:21:35.261627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3619","created_at":"2026-05-18T02:21:35.261627+00:00"},{"alias_kind":"pith_short_12","alias_value":"GPAAYKBPLA52","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"GPAAYKBPLA52ZTC3","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"GPAAYKBP","created_at":"2026-05-18T12:26:30.835961+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/GPAAYKBPLA52ZTC3KPCA57JEXW","json":"https://pith.science/pith/GPAAYKBPLA52ZTC3KPCA57JEXW.json","graph_json":"https://pith.science/api/pith-number/GPAAYKBPLA52ZTC3KPCA57JEXW/graph.json","events_json":"https://pith.science/api/pith-number/GPAAYKBPLA52ZTC3KPCA57JEXW/events.json","paper":"https://pith.science/paper/GPAAYKBP"},"agent_actions":{"view_html":"https://pith.science/pith/GPAAYKBPLA52ZTC3KPCA57JEXW","download_json":"https://pith.science/pith/GPAAYKBPLA52ZTC3KPCA57JEXW.json","view_paper":"https://pith.science/paper/GPAAYKBP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.3619&json=true","fetch_graph":"https://pith.science/api/pith-number/GPAAYKBPLA52ZTC3KPCA57JEXW/graph.json","fetch_events":"https://pith.science/api/pith-number/GPAAYKBPLA52ZTC3KPCA57JEXW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GPAAYKBPLA52ZTC3KPCA57JEXW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GPAAYKBPLA52ZTC3KPCA57JEXW/action/storage_attestation","attest_author":"https://pith.science/pith/GPAAYKBPLA52ZTC3KPCA57JEXW/action/author_attestation","sign_citation":"https://pith.science/pith/GPAAYKBPLA52ZTC3KPCA57JEXW/action/citation_signature","submit_replication":"https://pith.science/pith/GPAAYKBPLA52ZTC3KPCA57JEXW/action/replication_record"}},"created_at":"2026-05-18T02:21:35.261627+00:00","updated_at":"2026-05-18T02:21:35.261627+00:00"}