{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HU7K3RBSVRBJFLWFJDVT7G2GHV","short_pith_number":"pith:HU7K3RBS","schema_version":"1.0","canonical_sha256":"3d3eadc432ac4292aec548eb3f9b463d7c23cf1a6c0febce865677ddc00c0118","source":{"kind":"arxiv","id":"2410.12112","version":3},"attestation_state":"computed","paper":{"title":"Planning Anything with Rigor: General-Purpose Zero-Shot Planning with LLM-based Formalized Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Chuchu Fan, Yang Zhang, Yilun Hao","submitted_at":"2024-10-15T23:20:54Z","abstract_excerpt":"While large language models (LLMs) have recently demonstrated strong potential in solving planning problems, there is a trade-off between flexibility and complexity. LLMs, as zero-shot planners themselves, are still not capable of directly generating valid plans for complex planning problems such as multi-constraint or long-horizon tasks. On the other hand, many frameworks aiming to solve complex planning problems often rely on task-specific preparatory efforts, such as task-specific in-context examples and pre-defined critics/verifiers, which limits their cross-task generalization capability."},"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":"2410.12112","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-10-15T23:20:54Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"42298a4a613b31db51ab090ff180f8dc453aeb6e98a378591b385bddbb8b9d0d","abstract_canon_sha256":"5fc3c21cde9e82063a4eda004bf4e7c48165180f1bff2c9ab6ac75b9d6d86bcc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:34:00.635776Z","signature_b64":"6OF0CtTcUT15U/glmkbrwJKDe+rYXXrDHk3omHTCKLtI4tlqgUFStXkHfzH/1LhJ8XvlskiMpqKPR/4Qx96JAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d3eadc432ac4292aec548eb3f9b463d7c23cf1a6c0febce865677ddc00c0118","last_reissued_at":"2026-07-05T11:34:00.635014Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:34:00.635014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planning Anything with Rigor: General-Purpose Zero-Shot Planning with LLM-based Formalized Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Chuchu Fan, Yang Zhang, Yilun Hao","submitted_at":"2024-10-15T23:20:54Z","abstract_excerpt":"While large language models (LLMs) have recently demonstrated strong potential in solving planning problems, there is a trade-off between flexibility and complexity. LLMs, as zero-shot planners themselves, are still not capable of directly generating valid plans for complex planning problems such as multi-constraint or long-horizon tasks. On the other hand, many frameworks aiming to solve complex planning problems often rely on task-specific preparatory efforts, such as task-specific in-context examples and pre-defined critics/verifiers, which limits their cross-task generalization capability."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.12112","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/2410.12112/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":"2410.12112","created_at":"2026-07-05T11:34:00.635116+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.12112v3","created_at":"2026-07-05T11:34:00.635116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.12112","created_at":"2026-07-05T11:34:00.635116+00:00"},{"alias_kind":"pith_short_12","alias_value":"HU7K3RBSVRBJ","created_at":"2026-07-05T11:34:00.635116+00:00"},{"alias_kind":"pith_short_16","alias_value":"HU7K3RBSVRBJFLWF","created_at":"2026-07-05T11:34:00.635116+00:00"},{"alias_kind":"pith_short_8","alias_value":"HU7K3RBS","created_at":"2026-07-05T11:34:00.635116+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2601.12538","citing_title":"Agentic Reasoning for Large Language Models","ref_index":141,"is_internal_anchor":false},{"citing_arxiv_id":"2602.16708","citing_title":"Formal Policy Enforcement for Real-World Agentic Systems","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HU7K3RBSVRBJFLWFJDVT7G2GHV","json":"https://pith.science/pith/HU7K3RBSVRBJFLWFJDVT7G2GHV.json","graph_json":"https://pith.science/api/pith-number/HU7K3RBSVRBJFLWFJDVT7G2GHV/graph.json","events_json":"https://pith.science/api/pith-number/HU7K3RBSVRBJFLWFJDVT7G2GHV/events.json","paper":"https://pith.science/paper/HU7K3RBS"},"agent_actions":{"view_html":"https://pith.science/pith/HU7K3RBSVRBJFLWFJDVT7G2GHV","download_json":"https://pith.science/pith/HU7K3RBSVRBJFLWFJDVT7G2GHV.json","view_paper":"https://pith.science/paper/HU7K3RBS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.12112&json=true","fetch_graph":"https://pith.science/api/pith-number/HU7K3RBSVRBJFLWFJDVT7G2GHV/graph.json","fetch_events":"https://pith.science/api/pith-number/HU7K3RBSVRBJFLWFJDVT7G2GHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HU7K3RBSVRBJFLWFJDVT7G2GHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HU7K3RBSVRBJFLWFJDVT7G2GHV/action/storage_attestation","attest_author":"https://pith.science/pith/HU7K3RBSVRBJFLWFJDVT7G2GHV/action/author_attestation","sign_citation":"https://pith.science/pith/HU7K3RBSVRBJFLWFJDVT7G2GHV/action/citation_signature","submit_replication":"https://pith.science/pith/HU7K3RBSVRBJFLWFJDVT7G2GHV/action/replication_record"}},"created_at":"2026-07-05T11:34:00.635116+00:00","updated_at":"2026-07-05T11:34:00.635116+00:00"}