{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:34XKLASETSUAQGGUVCMILGYH6I","short_pith_number":"pith:34XKLASE","schema_version":"1.0","canonical_sha256":"df2ea582449ca80818d4a898859b07f23540bfbe0a833f8d15b38981a33889c4","source":{"kind":"arxiv","id":"1812.08480","version":1},"attestation_state":"computed","paper":{"title":"The Query Complexity of a Permutation-Based Variant of Mastermind","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.DS","authors_text":"Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn, Manindra Agrawal, Peyman Afshani","submitted_at":"2018-12-20T11:00:59Z","abstract_excerpt":"We study the query complexity of a permutation-based variant of the guessing game Mastermind. In this variant, the secret is a pair $(z,\\pi)$ which consists of a binary string $z \\in \\{0,1\\}^n$ and a permutation $\\pi$ of $[n]$. The secret must be unveiled by asking queries of the form $x \\in \\{0,1\\}^n$. For each such query, we are returned the score \\[ f_{z,\\pi}(x):= \\max \\{ i \\in [0..n]\\mid \\forall j \\leq i: z_{\\pi(j)} = x_{\\pi(j)}\\}\\,;\\] i.e., the score of $x$ is the length of the longest common prefix of $x$ and $z$ with respect to the order imposed by $\\pi$. The goal is to minimize the num"},"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":"1812.08480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-20T11:00:59Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"e1d95e221ccf1c8f8e46f0efbad767674b2b615845de876fc9641723d11a1dc5","abstract_canon_sha256":"25010a68cb189df13a27f74936c6573c0805a53ab274bdb7d162929c724dbe9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:49.861411Z","signature_b64":"KlW/VpjMzKEJwkEx3XEyQB/KRZfjOIm0+SLSnc3PsfRxhOU1A4qR/XtJhMQ6Hp7Qb7hWkA2AocGGRMA6qVYcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df2ea582449ca80818d4a898859b07f23540bfbe0a833f8d15b38981a33889c4","last_reissued_at":"2026-05-17T23:57:49.860724Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:49.860724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Query Complexity of a Permutation-Based Variant of Mastermind","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.DS","authors_text":"Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn, Manindra Agrawal, Peyman Afshani","submitted_at":"2018-12-20T11:00:59Z","abstract_excerpt":"We study the query complexity of a permutation-based variant of the guessing game Mastermind. In this variant, the secret is a pair $(z,\\pi)$ which consists of a binary string $z \\in \\{0,1\\}^n$ and a permutation $\\pi$ of $[n]$. The secret must be unveiled by asking queries of the form $x \\in \\{0,1\\}^n$. For each such query, we are returned the score \\[ f_{z,\\pi}(x):= \\max \\{ i \\in [0..n]\\mid \\forall j \\leq i: z_{\\pi(j)} = x_{\\pi(j)}\\}\\,;\\] i.e., the score of $x$ is the length of the longest common prefix of $x$ and $z$ with respect to the order imposed by $\\pi$. The goal is to minimize the num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08480","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":"1812.08480","created_at":"2026-05-17T23:57:49.860809+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.08480v1","created_at":"2026-05-17T23:57:49.860809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08480","created_at":"2026-05-17T23:57:49.860809+00:00"},{"alias_kind":"pith_short_12","alias_value":"34XKLASETSUA","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"34XKLASETSUAQGGU","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"34XKLASE","created_at":"2026-05-18T12:32:02.567920+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/34XKLASETSUAQGGUVCMILGYH6I","json":"https://pith.science/pith/34XKLASETSUAQGGUVCMILGYH6I.json","graph_json":"https://pith.science/api/pith-number/34XKLASETSUAQGGUVCMILGYH6I/graph.json","events_json":"https://pith.science/api/pith-number/34XKLASETSUAQGGUVCMILGYH6I/events.json","paper":"https://pith.science/paper/34XKLASE"},"agent_actions":{"view_html":"https://pith.science/pith/34XKLASETSUAQGGUVCMILGYH6I","download_json":"https://pith.science/pith/34XKLASETSUAQGGUVCMILGYH6I.json","view_paper":"https://pith.science/paper/34XKLASE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.08480&json=true","fetch_graph":"https://pith.science/api/pith-number/34XKLASETSUAQGGUVCMILGYH6I/graph.json","fetch_events":"https://pith.science/api/pith-number/34XKLASETSUAQGGUVCMILGYH6I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/34XKLASETSUAQGGUVCMILGYH6I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/34XKLASETSUAQGGUVCMILGYH6I/action/storage_attestation","attest_author":"https://pith.science/pith/34XKLASETSUAQGGUVCMILGYH6I/action/author_attestation","sign_citation":"https://pith.science/pith/34XKLASETSUAQGGUVCMILGYH6I/action/citation_signature","submit_replication":"https://pith.science/pith/34XKLASETSUAQGGUVCMILGYH6I/action/replication_record"}},"created_at":"2026-05-17T23:57:49.860809+00:00","updated_at":"2026-05-17T23:57:49.860809+00:00"}