{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ILNC6ZDVB5BLA6L7264RGJM3MZ","short_pith_number":"pith:ILNC6ZDV","schema_version":"1.0","canonical_sha256":"42da2f64750f42b0797fd7b913259b6661b5d71d6436602746933a3cf14992c1","source":{"kind":"arxiv","id":"2502.16111","version":1},"attestation_state":"computed","paper":{"title":"PlanGEN: A Multi-Agent Framework for Generating Planning and Reasoning Trajectories for Complex Problem Solving","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Chen-Yu Lee, Chitta Baral, Hamid Palangi, Hootan Nakhost, Hossein Mobahi, Jindong Gu, Long Le, Mihir Parmar, Palash Goyal, Swaroop Mishra, Tomas Pfister, Xin Liu, Yanfei Chen, Zifeng Wang","submitted_at":"2025-02-22T06:21:56Z","abstract_excerpt":"Recent agent frameworks and inference-time algorithms often struggle with complex planning problems due to limitations in verifying generated plans or reasoning and varying complexity of instances within a single task. Many existing methods for these tasks either perform task-level verification without considering constraints or apply inference-time algorithms without adapting to instance-level complexity. To address these limitations, we propose PlanGEN, a model-agnostic and easily scalable agent framework with three key components: constraint, verification, and selection agents. Specifically"},"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":"2502.16111","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-02-22T06:21:56Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"d734fe28c156ef24179974394e629dccfabcfd6c7400f22f6d778e0a0e638e9e","abstract_canon_sha256":"326b1f861784ec82a63a02a267141777ab1fbd7d3f456417269234cfe0108f45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:18:21.360326Z","signature_b64":"tDAixDXM9aiD/rcfrvPt5I374x/9sb+PYggXD5F8YlOFQNaw7n25EU6IyXGuHjXzwkyrPQ8nbw1e9LdjlS3fCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42da2f64750f42b0797fd7b913259b6661b5d71d6436602746933a3cf14992c1","last_reissued_at":"2026-07-05T10:18:21.359807Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:18:21.359807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PlanGEN: A Multi-Agent Framework for Generating Planning and Reasoning Trajectories for Complex Problem Solving","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Chen-Yu Lee, Chitta Baral, Hamid Palangi, Hootan Nakhost, Hossein Mobahi, Jindong Gu, Long Le, Mihir Parmar, Palash Goyal, Swaroop Mishra, Tomas Pfister, Xin Liu, Yanfei Chen, Zifeng Wang","submitted_at":"2025-02-22T06:21:56Z","abstract_excerpt":"Recent agent frameworks and inference-time algorithms often struggle with complex planning problems due to limitations in verifying generated plans or reasoning and varying complexity of instances within a single task. Many existing methods for these tasks either perform task-level verification without considering constraints or apply inference-time algorithms without adapting to instance-level complexity. To address these limitations, we propose PlanGEN, a model-agnostic and easily scalable agent framework with three key components: constraint, verification, and selection agents. Specifically"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.16111","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.16111/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":"2502.16111","created_at":"2026-07-05T10:18:21.359869+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.16111v1","created_at":"2026-07-05T10:18:21.359869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.16111","created_at":"2026-07-05T10:18:21.359869+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILNC6ZDVB5BL","created_at":"2026-07-05T10:18:21.359869+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILNC6ZDVB5BLA6L7","created_at":"2026-07-05T10:18:21.359869+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILNC6ZDV","created_at":"2026-07-05T10:18:21.359869+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.13126","citing_title":"Iterative Formalization and Planning in Partially Observable Environments","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ILNC6ZDVB5BLA6L7264RGJM3MZ","json":"https://pith.science/pith/ILNC6ZDVB5BLA6L7264RGJM3MZ.json","graph_json":"https://pith.science/api/pith-number/ILNC6ZDVB5BLA6L7264RGJM3MZ/graph.json","events_json":"https://pith.science/api/pith-number/ILNC6ZDVB5BLA6L7264RGJM3MZ/events.json","paper":"https://pith.science/paper/ILNC6ZDV"},"agent_actions":{"view_html":"https://pith.science/pith/ILNC6ZDVB5BLA6L7264RGJM3MZ","download_json":"https://pith.science/pith/ILNC6ZDVB5BLA6L7264RGJM3MZ.json","view_paper":"https://pith.science/paper/ILNC6ZDV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.16111&json=true","fetch_graph":"https://pith.science/api/pith-number/ILNC6ZDVB5BLA6L7264RGJM3MZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ILNC6ZDVB5BLA6L7264RGJM3MZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILNC6ZDVB5BLA6L7264RGJM3MZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILNC6ZDVB5BLA6L7264RGJM3MZ/action/storage_attestation","attest_author":"https://pith.science/pith/ILNC6ZDVB5BLA6L7264RGJM3MZ/action/author_attestation","sign_citation":"https://pith.science/pith/ILNC6ZDVB5BLA6L7264RGJM3MZ/action/citation_signature","submit_replication":"https://pith.science/pith/ILNC6ZDVB5BLA6L7264RGJM3MZ/action/replication_record"}},"created_at":"2026-07-05T10:18:21.359869+00:00","updated_at":"2026-07-05T10:18:21.359869+00:00"}