{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QOYTVPLP4TNTA5WTP55UTXYEJP","short_pith_number":"pith:QOYTVPLP","schema_version":"1.0","canonical_sha256":"83b13abd6fe4db3076d37f7b49df044bf643b66f2668db986398ca1dc67a5038","source":{"kind":"arxiv","id":"1207.1315","version":1},"attestation_state":"computed","paper":{"title":"An experimental study of exhaustive solutions for the Mastermind puzzle","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NE","authors_text":"Antonio M. Mora, Carlos Cotta, J. J. Merelo, Thomas P. Runarsson","submitted_at":"2012-07-05T18:09:59Z","abstract_excerpt":"Mastermind is in essence a search problem in which a string of symbols that is kept secret must be found by sequentially playing strings that use the same alphabet, and using the responses that indicate how close are those other strings to the secret one as hints. Although it is commercialized as a game, it is a combinatorial problem of high complexity, with applications on fields that range from computer security to genomics. As such a kind of problem, there are no exact solutions; even exhaustive search methods rely on heuristics to choose, at every step, strings to get the best possible hin"},"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.1315","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.NE","submitted_at":"2012-07-05T18:09:59Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"22ef414987ec19cbb095d729dba4e7194cc0a59dc939ebdd0336faa1e1021cdb","abstract_canon_sha256":"594d1bc4228b9ea63f38e32ba1a6973f1127a1952a7b7fc1a42b4365579cc061"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:46.373130Z","signature_b64":"t9ux1MRoHhm5kQZjsbq4+VxP1dP3SIOyIRs9E3Pp6VEAUZOAj2RFpQ2saBT/uVDMvGj7QPqKJEvZ6UuAKOCZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83b13abd6fe4db3076d37f7b49df044bf643b66f2668db986398ca1dc67a5038","last_reissued_at":"2026-05-18T03:51:46.372468Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:46.372468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An experimental study of exhaustive solutions for the Mastermind puzzle","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NE","authors_text":"Antonio M. Mora, Carlos Cotta, J. J. Merelo, Thomas P. Runarsson","submitted_at":"2012-07-05T18:09:59Z","abstract_excerpt":"Mastermind is in essence a search problem in which a string of symbols that is kept secret must be found by sequentially playing strings that use the same alphabet, and using the responses that indicate how close are those other strings to the secret one as hints. Although it is commercialized as a game, it is a combinatorial problem of high complexity, with applications on fields that range from computer security to genomics. As such a kind of problem, there are no exact solutions; even exhaustive search methods rely on heuristics to choose, at every step, strings to get the best possible hin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1315","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":"1207.1315","created_at":"2026-05-18T03:51:46.372589+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.1315v1","created_at":"2026-05-18T03:51:46.372589+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1315","created_at":"2026-05-18T03:51:46.372589+00:00"},{"alias_kind":"pith_short_12","alias_value":"QOYTVPLP4TNT","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QOYTVPLP4TNTA5WT","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QOYTVPLP","created_at":"2026-05-18T12:27:18.751474+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/QOYTVPLP4TNTA5WTP55UTXYEJP","json":"https://pith.science/pith/QOYTVPLP4TNTA5WTP55UTXYEJP.json","graph_json":"https://pith.science/api/pith-number/QOYTVPLP4TNTA5WTP55UTXYEJP/graph.json","events_json":"https://pith.science/api/pith-number/QOYTVPLP4TNTA5WTP55UTXYEJP/events.json","paper":"https://pith.science/paper/QOYTVPLP"},"agent_actions":{"view_html":"https://pith.science/pith/QOYTVPLP4TNTA5WTP55UTXYEJP","download_json":"https://pith.science/pith/QOYTVPLP4TNTA5WTP55UTXYEJP.json","view_paper":"https://pith.science/paper/QOYTVPLP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.1315&json=true","fetch_graph":"https://pith.science/api/pith-number/QOYTVPLP4TNTA5WTP55UTXYEJP/graph.json","fetch_events":"https://pith.science/api/pith-number/QOYTVPLP4TNTA5WTP55UTXYEJP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QOYTVPLP4TNTA5WTP55UTXYEJP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QOYTVPLP4TNTA5WTP55UTXYEJP/action/storage_attestation","attest_author":"https://pith.science/pith/QOYTVPLP4TNTA5WTP55UTXYEJP/action/author_attestation","sign_citation":"https://pith.science/pith/QOYTVPLP4TNTA5WTP55UTXYEJP/action/citation_signature","submit_replication":"https://pith.science/pith/QOYTVPLP4TNTA5WTP55UTXYEJP/action/replication_record"}},"created_at":"2026-05-18T03:51:46.372589+00:00","updated_at":"2026-05-18T03:51:46.372589+00:00"}