{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:NO5HIKN43WF3PYGMFE24NSQER4","short_pith_number":"pith:NO5HIKN4","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"},"canonical_sha256":"6bba7429bcdd8bb7e0cc2935c6ca048f31f82858d2a456b87147dad0ec90d230","source":{"kind":"arxiv","id":"2510.08992","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.08992","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"2510.08992v3","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.08992","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"NO5HIKN43WF3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"NO5HIKN43WF3PYGM","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"NO5HIKN4","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:NO5HIKN43WF3PYGMFE24NSQER4","target":"record","payload":{"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"},"canonical_sha256":"6bba7429bcdd8bb7e0cc2935c6ca048f31f82858d2a456b87147dad0ec90d230","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"},"source_kind":"arxiv","source_id":"2510.08992","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DxqehCTo1DLJq5SrG/+Uv5TiVG4Orwxq915NPYivKhiArQ8Bhyar7eGZwprMoI4c/zcUWmbMYqK8NIfkmnUbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:43:13.330980Z"},"content_sha256":"9f0a6b714e097069464b1cff58967e3950ff69a666ace681a68a755595cbb146","schema_version":"1.0","event_id":"sha256:9f0a6b714e097069464b1cff58967e3950ff69a666ace681a68a755595cbb146"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:NO5HIKN43WF3PYGMFE24NSQER4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NlozYQsiB/Ka+F9kGO0pQVhxXNMJeRrgMdIbOljkwslnDiryfp17XtpT8Y5GNWhvnQYmKMf5EJwSCHHZWL06CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:43:13.331743Z"},"content_sha256":"0635c1fee277ee22b6dc75f5b924bec6597ac062666f3313d22b29ac7da27c6f","schema_version":"1.0","event_id":"sha256:0635c1fee277ee22b6dc75f5b924bec6597ac062666f3313d22b29ac7da27c6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NO5HIKN43WF3PYGMFE24NSQER4/bundle.json","state_url":"https://pith.science/pith/NO5HIKN43WF3PYGMFE24NSQER4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NO5HIKN43WF3PYGMFE24NSQER4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T16:43:13Z","links":{"resolver":"https://pith.science/pith/NO5HIKN43WF3PYGMFE24NSQER4","bundle":"https://pith.science/pith/NO5HIKN43WF3PYGMFE24NSQER4/bundle.json","state":"https://pith.science/pith/NO5HIKN43WF3PYGMFE24NSQER4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NO5HIKN43WF3PYGMFE24NSQER4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NO5HIKN43WF3PYGMFE24NSQER4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ee2b51d07f802cedb3001f922aa19b89dfd585252dfaab583bdb3ac00f6295cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-10-10T04:21:18Z","title_canon_sha256":"9e472a1d35db174e829646bc5c0893d7682a1a2cf9037d14a759723906fce1d0"},"schema_version":"1.0","source":{"id":"2510.08992","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.08992","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"2510.08992v3","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.08992","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"NO5HIKN43WF3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"NO5HIKN43WF3PYGM","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"NO5HIKN4","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:0635c1fee277ee22b6dc75f5b924bec6597ac062666f3313d22b29ac7da27c6f","target":"graph","created_at":"2026-05-18T03:10:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Kamel Alrashedy, Matthew Gombolay, Pradyumna Tambwekar, Ridam Srivastava, Vriksha Srihari, Zulfiqar Zaidi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-10-10T04:21:18Z","title":"Constraints-of-Thought: A Framework for Constrained Reasoning in Language-Model-Guided Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.08992","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9f0a6b714e097069464b1cff58967e3950ff69a666ace681a68a755595cbb146","target":"record","created_at":"2026-05-18T03:10:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ee2b51d07f802cedb3001f922aa19b89dfd585252dfaab583bdb3ac00f6295cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-10-10T04:21:18Z","title_canon_sha256":"9e472a1d35db174e829646bc5c0893d7682a1a2cf9037d14a759723906fce1d0"},"schema_version":"1.0","source":{"id":"2510.08992","kind":"arxiv","version":3}},"canonical_sha256":"6bba7429bcdd8bb7e0cc2935c6ca048f31f82858d2a456b87147dad0ec90d230","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6bba7429bcdd8bb7e0cc2935c6ca048f31f82858d2a456b87147dad0ec90d230","first_computed_at":"2026-05-18T03:10:12.030643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:12.030643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"afhGseIuUH+r0GFdJTQpjIwMZUQiNMDIV2yp+as9fFJ8jDBhOEPiraN+yI09u8omDHbtVi2Ofj51MRUBiFirBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:12.031367Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.08992","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f0a6b714e097069464b1cff58967e3950ff69a666ace681a68a755595cbb146","sha256:0635c1fee277ee22b6dc75f5b924bec6597ac062666f3313d22b29ac7da27c6f"],"state_sha256":"01ece29b5b2a94b996d5a594dfdc5a48212067a082eedf75a59474f481a1a9da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n98vA3ICxQkJwG9jNk/0qbqbIIB4dDEKPslYE1UQOaHVbZOLPP8iz/IiyN0kr1nITsPLtdIVNuGpBuAC8ArKBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T16:43:13.335704Z","bundle_sha256":"f104317c1549efb9d61a0e88feca8ff333588b3a75697e8b5151c81f3b083b50"}}