{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JHK2HKZF65LLJ3R25VHSJJ2X6G","short_pith_number":"pith:JHK2HKZF","schema_version":"1.0","canonical_sha256":"49d5a3ab25f756b4ee3aed4f24a757f19ef61aceda26d158736e48b7679a0903","source":{"kind":"arxiv","id":"1807.11580","version":1},"attestation_state":"computed","paper":{"title":"Enumerating Cryptarithms Using Deterministic Finite Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.FL","authors_text":"Ayumi Shinohara, Diptarama Hendrian, Ryo Yoshinaka, Takashi Horiyama, Yuki Nozaki","submitted_at":"2018-07-27T01:37:45Z","abstract_excerpt":"A cryptarithm is a mathematical puzzle where given an arithmetic equation written with letters rather than numerals, a player must discover an assignment of numerals on letters that makes the equation hold true. In this paper, we propose a method to construct a DFA that accepts cryptarithms that admit (unique) solutions for each base. We implemented the method and constructed a DFA for bases $k \\le 7$. Those DFAs can be used as complete catalogues of cryptarithms,whose applications include enumeration of and counting the exact numbers $G_k(n)$ of cryptarithm instances with $n$ digits that admi"},"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":"1807.11580","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-07-27T01:37:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6ffedf8ecca079098367d1ae9aab1c283bd9c0b2138e0f7c76649f982d3a467c","abstract_canon_sha256":"d8a81d2d0abac8ba302e3669f4d62b5a06d5b7b440275005ef4d2cf6cf75b6ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:21.740092Z","signature_b64":"M+y+LS10WfQs7N9zBUOSNWd/lPw4Bc+/o2s6rvC+aURfWZuEPqJtKWDH2vOxCjYYkG/39aaW56cKZHXR/SATCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49d5a3ab25f756b4ee3aed4f24a757f19ef61aceda26d158736e48b7679a0903","last_reissued_at":"2026-05-18T00:09:21.739467Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:21.739467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumerating Cryptarithms Using Deterministic Finite Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.FL","authors_text":"Ayumi Shinohara, Diptarama Hendrian, Ryo Yoshinaka, Takashi Horiyama, Yuki Nozaki","submitted_at":"2018-07-27T01:37:45Z","abstract_excerpt":"A cryptarithm is a mathematical puzzle where given an arithmetic equation written with letters rather than numerals, a player must discover an assignment of numerals on letters that makes the equation hold true. In this paper, we propose a method to construct a DFA that accepts cryptarithms that admit (unique) solutions for each base. We implemented the method and constructed a DFA for bases $k \\le 7$. Those DFAs can be used as complete catalogues of cryptarithms,whose applications include enumeration of and counting the exact numbers $G_k(n)$ of cryptarithm instances with $n$ digits that admi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11580","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":"1807.11580","created_at":"2026-05-18T00:09:21.739555+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.11580v1","created_at":"2026-05-18T00:09:21.739555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11580","created_at":"2026-05-18T00:09:21.739555+00:00"},{"alias_kind":"pith_short_12","alias_value":"JHK2HKZF65LL","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JHK2HKZF65LLJ3R2","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JHK2HKZF","created_at":"2026-05-18T12:32:31.084164+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/JHK2HKZF65LLJ3R25VHSJJ2X6G","json":"https://pith.science/pith/JHK2HKZF65LLJ3R25VHSJJ2X6G.json","graph_json":"https://pith.science/api/pith-number/JHK2HKZF65LLJ3R25VHSJJ2X6G/graph.json","events_json":"https://pith.science/api/pith-number/JHK2HKZF65LLJ3R25VHSJJ2X6G/events.json","paper":"https://pith.science/paper/JHK2HKZF"},"agent_actions":{"view_html":"https://pith.science/pith/JHK2HKZF65LLJ3R25VHSJJ2X6G","download_json":"https://pith.science/pith/JHK2HKZF65LLJ3R25VHSJJ2X6G.json","view_paper":"https://pith.science/paper/JHK2HKZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.11580&json=true","fetch_graph":"https://pith.science/api/pith-number/JHK2HKZF65LLJ3R25VHSJJ2X6G/graph.json","fetch_events":"https://pith.science/api/pith-number/JHK2HKZF65LLJ3R25VHSJJ2X6G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JHK2HKZF65LLJ3R25VHSJJ2X6G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JHK2HKZF65LLJ3R25VHSJJ2X6G/action/storage_attestation","attest_author":"https://pith.science/pith/JHK2HKZF65LLJ3R25VHSJJ2X6G/action/author_attestation","sign_citation":"https://pith.science/pith/JHK2HKZF65LLJ3R25VHSJJ2X6G/action/citation_signature","submit_replication":"https://pith.science/pith/JHK2HKZF65LLJ3R25VHSJJ2X6G/action/replication_record"}},"created_at":"2026-05-18T00:09:21.739555+00:00","updated_at":"2026-05-18T00:09:21.739555+00:00"}