{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NO5HIKN43WF3PYGMFE24NSQER4","short_pith_number":"pith:NO5HIKN4","schema_version":"1.0","canonical_sha256":"6bba7429bcdd8bb7e0cc2935c6ca048f31f82858d2a456b87147dad0ec90d230","source":{"kind":"arxiv","id":"2510.08992","version":3},"attestation_state":"computed","paper":{"title":"Constraints-of-Thought: A Framework for Constrained Reasoning in Language-Model-Guided Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Kamel Alrashedy, Matthew Gombolay, Pradyumna Tambwekar, Ridam Srivastava, Vriksha Srihari, Zulfiqar Zaidi","submitted_at":"2025-10-10T04:21:18Z","abstract_excerpt":"While researchers have made significant progress in enabling large language models (LLMs) to perform multi-step planning, LLMs struggle to ensure that those plans align with high-level user intent and satisfy symbolic constraints, especially in complex, multi-step domains. Existing reasoning approaches such as Chain-of-Thought (CoT), Tree-of-Thought (ToT), and verifier-augmented methods, expand the search space but often yield infeasible actions or hallucinated steps. To overcome these limitations, we propose Constraints-of-Thought (Const-o-T), a framework that provides a structured prior that"},"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":"2510.08992","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-10-10T04:21:18Z","cross_cats_sorted":[],"title_canon_sha256":"9e472a1d35db174e829646bc5c0893d7682a1a2cf9037d14a759723906fce1d0","abstract_canon_sha256":"ee2b51d07f802cedb3001f922aa19b89dfd585252dfaab583bdb3ac00f6295cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:12.031367Z","signature_b64":"afhGseIuUH+r0GFdJTQpjIwMZUQiNMDIV2yp+as9fFJ8jDBhOEPiraN+yI09u8omDHbtVi2Ofj51MRUBiFirBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bba7429bcdd8bb7e0cc2935c6ca048f31f82858d2a456b87147dad0ec90d230","last_reissued_at":"2026-05-18T03:10:12.030643Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:12.030643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constraints-of-Thought: A Framework for Constrained Reasoning in Language-Model-Guided Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Kamel Alrashedy, Matthew Gombolay, Pradyumna Tambwekar, Ridam Srivastava, Vriksha Srihari, Zulfiqar Zaidi","submitted_at":"2025-10-10T04:21:18Z","abstract_excerpt":"While researchers have made significant progress in enabling large language models (LLMs) to perform multi-step planning, LLMs struggle to ensure that those plans align with high-level user intent and satisfy symbolic constraints, especially in complex, multi-step domains. Existing reasoning approaches such as Chain-of-Thought (CoT), Tree-of-Thought (ToT), and verifier-augmented methods, expand the search space but often yield infeasible actions or hallucinated steps. To overcome these limitations, we propose Constraints-of-Thought (Const-o-T), a framework that provides a structured prior that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.08992","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":""},"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":"2510.08992","created_at":"2026-05-18T03:10:12.030710+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.08992v3","created_at":"2026-05-18T03:10:12.030710+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.08992","created_at":"2026-05-18T03:10:12.030710+00:00"},{"alias_kind":"pith_short_12","alias_value":"NO5HIKN43WF3","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"NO5HIKN43WF3PYGM","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"NO5HIKN4","created_at":"2026-05-18T12:33:37.589309+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/NO5HIKN43WF3PYGMFE24NSQER4","json":"https://pith.science/pith/NO5HIKN43WF3PYGMFE24NSQER4.json","graph_json":"https://pith.science/api/pith-number/NO5HIKN43WF3PYGMFE24NSQER4/graph.json","events_json":"https://pith.science/api/pith-number/NO5HIKN43WF3PYGMFE24NSQER4/events.json","paper":"https://pith.science/paper/NO5HIKN4"},"agent_actions":{"view_html":"https://pith.science/pith/NO5HIKN43WF3PYGMFE24NSQER4","download_json":"https://pith.science/pith/NO5HIKN43WF3PYGMFE24NSQER4.json","view_paper":"https://pith.science/paper/NO5HIKN4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.08992&json=true","fetch_graph":"https://pith.science/api/pith-number/NO5HIKN43WF3PYGMFE24NSQER4/graph.json","fetch_events":"https://pith.science/api/pith-number/NO5HIKN43WF3PYGMFE24NSQER4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NO5HIKN43WF3PYGMFE24NSQER4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NO5HIKN43WF3PYGMFE24NSQER4/action/storage_attestation","attest_author":"https://pith.science/pith/NO5HIKN43WF3PYGMFE24NSQER4/action/author_attestation","sign_citation":"https://pith.science/pith/NO5HIKN43WF3PYGMFE24NSQER4/action/citation_signature","submit_replication":"https://pith.science/pith/NO5HIKN43WF3PYGMFE24NSQER4/action/replication_record"}},"created_at":"2026-05-18T03:10:12.030710+00:00","updated_at":"2026-05-18T03:10:12.030710+00:00"}