{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NBDWLPF67A2ZTDRR5RCU73BJ76","short_pith_number":"pith:NBDWLPF6","schema_version":"1.0","canonical_sha256":"684765bcbef835998e31ec454fec29ffa7dc07f54bda0f4dab653b7349c70503","source":{"kind":"arxiv","id":"1908.06183","version":1},"attestation_state":"computed","paper":{"title":"Search Algorithms for Mastermind","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anthony D. Rhodes","submitted_at":"2019-08-16T21:26:14Z","abstract_excerpt":"his paper presents two novel approaches to solving the classic board game mastermind, including a variant of simulated annealing (SA) and a technique we term maximum expected reduction in consistency (MERC). In addition, we compare search results for these algorithms to two baseline search methods: a random, uninformed search and the method of minimizing maximum query partition sets as originally developed by both Donald Knuth and Peter Norvig."},"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":"1908.06183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-08-16T21:26:14Z","cross_cats_sorted":[],"title_canon_sha256":"f21730d85657835ac2fa0c8c810ad05d898d4be0635559e0647ca3580d9e43e1","abstract_canon_sha256":"6e9c9f1dbaecfeed3342781aa46e9add89b0ce54922287b4582aca305099f5f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:13.354363Z","signature_b64":"nBH123v/5hfgZRG/o+Z6KLNsubekVVucFMmE+gGeF4hYqkMjhCu1xXRkIlMTuaEVJLMbNHeFxAHxGU0zWVmzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"684765bcbef835998e31ec454fec29ffa7dc07f54bda0f4dab653b7349c70503","last_reissued_at":"2026-07-04T23:58:13.353980Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:13.353980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Search Algorithms for Mastermind","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anthony D. Rhodes","submitted_at":"2019-08-16T21:26:14Z","abstract_excerpt":"his paper presents two novel approaches to solving the classic board game mastermind, including a variant of simulated annealing (SA) and a technique we term maximum expected reduction in consistency (MERC). In addition, we compare search results for these algorithms to two baseline search methods: a random, uninformed search and the method of minimizing maximum query partition sets as originally developed by both Donald Knuth and Peter Norvig."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06183","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06183/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.06183","created_at":"2026-07-04T23:58:13.354034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06183v1","created_at":"2026-07-04T23:58:13.354034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06183","created_at":"2026-07-04T23:58:13.354034+00:00"},{"alias_kind":"pith_short_12","alias_value":"NBDWLPF67A2Z","created_at":"2026-07-04T23:58:13.354034+00:00"},{"alias_kind":"pith_short_16","alias_value":"NBDWLPF67A2ZTDRR","created_at":"2026-07-04T23:58:13.354034+00:00"},{"alias_kind":"pith_short_8","alias_value":"NBDWLPF6","created_at":"2026-07-04T23:58:13.354034+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/NBDWLPF67A2ZTDRR5RCU73BJ76","json":"https://pith.science/pith/NBDWLPF67A2ZTDRR5RCU73BJ76.json","graph_json":"https://pith.science/api/pith-number/NBDWLPF67A2ZTDRR5RCU73BJ76/graph.json","events_json":"https://pith.science/api/pith-number/NBDWLPF67A2ZTDRR5RCU73BJ76/events.json","paper":"https://pith.science/paper/NBDWLPF6"},"agent_actions":{"view_html":"https://pith.science/pith/NBDWLPF67A2ZTDRR5RCU73BJ76","download_json":"https://pith.science/pith/NBDWLPF67A2ZTDRR5RCU73BJ76.json","view_paper":"https://pith.science/paper/NBDWLPF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06183&json=true","fetch_graph":"https://pith.science/api/pith-number/NBDWLPF67A2ZTDRR5RCU73BJ76/graph.json","fetch_events":"https://pith.science/api/pith-number/NBDWLPF67A2ZTDRR5RCU73BJ76/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NBDWLPF67A2ZTDRR5RCU73BJ76/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NBDWLPF67A2ZTDRR5RCU73BJ76/action/storage_attestation","attest_author":"https://pith.science/pith/NBDWLPF67A2ZTDRR5RCU73BJ76/action/author_attestation","sign_citation":"https://pith.science/pith/NBDWLPF67A2ZTDRR5RCU73BJ76/action/citation_signature","submit_replication":"https://pith.science/pith/NBDWLPF67A2ZTDRR5RCU73BJ76/action/replication_record"}},"created_at":"2026-07-04T23:58:13.354034+00:00","updated_at":"2026-07-04T23:58:13.354034+00:00"}