{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4W2HFISDQPNJC6JYGXQTRTVQHR","short_pith_number":"pith:4W2HFISD","schema_version":"1.0","canonical_sha256":"e5b472a24383da91793835e138ceb03c50bb035dc70155d01c90e2a953c30ce1","source":{"kind":"arxiv","id":"1607.04597","version":2},"attestation_state":"computed","paper":{"title":"Query Complexity of Mastermind Variants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Aaron Berger, Christopher Chute, Matthew Stone","submitted_at":"2016-07-15T17:53:09Z","abstract_excerpt":"We study variants of Mastermind, a popular board game in which the objective is sequence reconstruction. In this two-player game, the so-called \\textit{codemaker} constructs a hidden sequence $H = (h_1, h_2, \\ldots, h_n)$ of colors selected from an alphabet $\\mathcal{A} = \\{1,2,\\ldots, k\\}$ (\\textit{i.e.,} $h_i\\in\\mathcal{A}$ for all $i\\in\\{1,2,\\ldots, n\\}$). The game then proceeds in turns, each of which consists of two parts: in turn $t$, the second player (the \\textit{codebreaker}) first submits a query sequence $Q_t = (q_1, q_2, \\ldots, q_n)$ with $q_i\\in \\mathcal{A}$ for all $i$, and seco"},"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":"1607.04597","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-15T17:53:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"78951d77b61da8af921e7ce20ce11e26878d65c27a387267812a27699ce9592e","abstract_canon_sha256":"8fe59fdab5b9cf97da700bdf4fa40209a61c8b0d644955f6398624f17cbb5dca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:23.164238Z","signature_b64":"+gGHcB9lysktqEOxPLqrwLQ/ZhTurrQMeWMtaHtu+qVPRIqtHm3K4G/7iuAnTmIu+3snKHMKXQCoBDr9DnJWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5b472a24383da91793835e138ceb03c50bb035dc70155d01c90e2a953c30ce1","last_reissued_at":"2026-05-18T00:34:23.163844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:23.163844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Query Complexity of Mastermind Variants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Aaron Berger, Christopher Chute, Matthew Stone","submitted_at":"2016-07-15T17:53:09Z","abstract_excerpt":"We study variants of Mastermind, a popular board game in which the objective is sequence reconstruction. In this two-player game, the so-called \\textit{codemaker} constructs a hidden sequence $H = (h_1, h_2, \\ldots, h_n)$ of colors selected from an alphabet $\\mathcal{A} = \\{1,2,\\ldots, k\\}$ (\\textit{i.e.,} $h_i\\in\\mathcal{A}$ for all $i\\in\\{1,2,\\ldots, n\\}$). The game then proceeds in turns, each of which consists of two parts: in turn $t$, the second player (the \\textit{codebreaker}) first submits a query sequence $Q_t = (q_1, q_2, \\ldots, q_n)$ with $q_i\\in \\mathcal{A}$ for all $i$, and seco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04597","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":"1607.04597","created_at":"2026-05-18T00:34:23.163903+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04597v2","created_at":"2026-05-18T00:34:23.163903+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04597","created_at":"2026-05-18T00:34:23.163903+00:00"},{"alias_kind":"pith_short_12","alias_value":"4W2HFISDQPNJ","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4W2HFISDQPNJC6JY","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4W2HFISD","created_at":"2026-05-18T12:29:58.707656+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/4W2HFISDQPNJC6JYGXQTRTVQHR","json":"https://pith.science/pith/4W2HFISDQPNJC6JYGXQTRTVQHR.json","graph_json":"https://pith.science/api/pith-number/4W2HFISDQPNJC6JYGXQTRTVQHR/graph.json","events_json":"https://pith.science/api/pith-number/4W2HFISDQPNJC6JYGXQTRTVQHR/events.json","paper":"https://pith.science/paper/4W2HFISD"},"agent_actions":{"view_html":"https://pith.science/pith/4W2HFISDQPNJC6JYGXQTRTVQHR","download_json":"https://pith.science/pith/4W2HFISDQPNJC6JYGXQTRTVQHR.json","view_paper":"https://pith.science/paper/4W2HFISD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04597&json=true","fetch_graph":"https://pith.science/api/pith-number/4W2HFISDQPNJC6JYGXQTRTVQHR/graph.json","fetch_events":"https://pith.science/api/pith-number/4W2HFISDQPNJC6JYGXQTRTVQHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4W2HFISDQPNJC6JYGXQTRTVQHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4W2HFISDQPNJC6JYGXQTRTVQHR/action/storage_attestation","attest_author":"https://pith.science/pith/4W2HFISDQPNJC6JYGXQTRTVQHR/action/author_attestation","sign_citation":"https://pith.science/pith/4W2HFISDQPNJC6JYGXQTRTVQHR/action/citation_signature","submit_replication":"https://pith.science/pith/4W2HFISDQPNJC6JYGXQTRTVQHR/action/replication_record"}},"created_at":"2026-05-18T00:34:23.163903+00:00","updated_at":"2026-05-18T00:34:23.163903+00:00"}