{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MWB57U3FONZ7BFVER6QJ5LUW33","short_pith_number":"pith:MWB57U3F","schema_version":"1.0","canonical_sha256":"6583dfd3657373f096a48fa09eae96dee4c1e5ff23f04f7e2c013b232a239da9","source":{"kind":"arxiv","id":"2406.09043","version":3},"attestation_state":"computed","paper":{"title":"Language Models are Crossword Solvers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Saptarshi Saha, Soumadeep Saha, Sutanoya Chakraborty, Utpal Garain","submitted_at":"2024-06-13T12:29:27Z","abstract_excerpt":"Crosswords are a form of word puzzle that require a solver to demonstrate a high degree of proficiency in natural language understanding, wordplay, reasoning, and world knowledge, along with adherence to character and length constraints. In this paper we tackle the challenge of solving crosswords with large language models (LLMs). We demonstrate that the current generation of language models shows significant competence at deciphering cryptic crossword clues and outperforms previously reported state-of-the-art (SoTA) results by a factor of 2-3 in relevant benchmarks. We also develop a search a"},"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":"2406.09043","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-06-13T12:29:27Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5d0ff7ca4dde9a9e53b5bc23016febce09d70850c0ca509c510c059cc682fc30","abstract_canon_sha256":"98f0e1fa288c2610880c7424be965dedbb58fae83392375fd2dd5e3c8edee3af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:33.396709Z","signature_b64":"MxRYMiX14eAbfCVBHwm1hLVckXY7pn5CeIw4r5yu9oUDuSO4IvSjRLj1xqFj9zoFwm9Ia0/6hdnR/mBP2inRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6583dfd3657373f096a48fa09eae96dee4c1e5ff23f04f7e2c013b232a239da9","last_reissued_at":"2026-07-05T11:17:33.396272Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:33.396272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Language Models are Crossword Solvers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Saptarshi Saha, Soumadeep Saha, Sutanoya Chakraborty, Utpal Garain","submitted_at":"2024-06-13T12:29:27Z","abstract_excerpt":"Crosswords are a form of word puzzle that require a solver to demonstrate a high degree of proficiency in natural language understanding, wordplay, reasoning, and world knowledge, along with adherence to character and length constraints. In this paper we tackle the challenge of solving crosswords with large language models (LLMs). We demonstrate that the current generation of language models shows significant competence at deciphering cryptic crossword clues and outperforms previously reported state-of-the-art (SoTA) results by a factor of 2-3 in relevant benchmarks. We also develop a search a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.09043","kind":"arxiv","version":3},"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/2406.09043/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":"2406.09043","created_at":"2026-07-05T11:17:33.396333+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.09043v3","created_at":"2026-07-05T11:17:33.396333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.09043","created_at":"2026-07-05T11:17:33.396333+00:00"},{"alias_kind":"pith_short_12","alias_value":"MWB57U3FONZ7","created_at":"2026-07-05T11:17:33.396333+00:00"},{"alias_kind":"pith_short_16","alias_value":"MWB57U3FONZ7BFVE","created_at":"2026-07-05T11:17:33.396333+00:00"},{"alias_kind":"pith_short_8","alias_value":"MWB57U3F","created_at":"2026-07-05T11:17:33.396333+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04824","citing_title":"A Reasoning-Based Approach to Cryptic Crossword Clue Solving","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MWB57U3FONZ7BFVER6QJ5LUW33","json":"https://pith.science/pith/MWB57U3FONZ7BFVER6QJ5LUW33.json","graph_json":"https://pith.science/api/pith-number/MWB57U3FONZ7BFVER6QJ5LUW33/graph.json","events_json":"https://pith.science/api/pith-number/MWB57U3FONZ7BFVER6QJ5LUW33/events.json","paper":"https://pith.science/paper/MWB57U3F"},"agent_actions":{"view_html":"https://pith.science/pith/MWB57U3FONZ7BFVER6QJ5LUW33","download_json":"https://pith.science/pith/MWB57U3FONZ7BFVER6QJ5LUW33.json","view_paper":"https://pith.science/paper/MWB57U3F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.09043&json=true","fetch_graph":"https://pith.science/api/pith-number/MWB57U3FONZ7BFVER6QJ5LUW33/graph.json","fetch_events":"https://pith.science/api/pith-number/MWB57U3FONZ7BFVER6QJ5LUW33/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MWB57U3FONZ7BFVER6QJ5LUW33/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MWB57U3FONZ7BFVER6QJ5LUW33/action/storage_attestation","attest_author":"https://pith.science/pith/MWB57U3FONZ7BFVER6QJ5LUW33/action/author_attestation","sign_citation":"https://pith.science/pith/MWB57U3FONZ7BFVER6QJ5LUW33/action/citation_signature","submit_replication":"https://pith.science/pith/MWB57U3FONZ7BFVER6QJ5LUW33/action/replication_record"}},"created_at":"2026-07-05T11:17:33.396333+00:00","updated_at":"2026-07-05T11:17:33.396333+00:00"}