{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GJWWOJDW2TFCARQN3MGDCQI3FT","short_pith_number":"pith:GJWWOJDW","schema_version":"1.0","canonical_sha256":"326d672476d4ca20460ddb0c31411b2ccedf77f2a4fa2f15d608b8f88abfdfc5","source":{"kind":"arxiv","id":"2503.01700","version":2},"attestation_state":"computed","paper":{"title":"Code-as-Symbolic-Planner: Foundation Model-Based Robot Planning via Symbolic Code Generation","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.RO","authors_text":"Chuchu Fan, Yang Zhang, Yilun Hao, Yongchao Chen","submitted_at":"2025-03-03T16:13:41Z","abstract_excerpt":"Recent works have shown great potentials of Large Language Models (LLMs) in robot task and motion planning (TAMP). Current LLM approaches generate text- or code-based reasoning chains with sub-goals and action plans. However, they do not fully leverage LLMs' symbolic computing and code generation capabilities. Many robot TAMP tasks involve complex optimization under multiple constraints, where pure textual reasoning is insufficient. While augmenting LLMs with predefined solvers and planners improves performance, it lacks generalization across tasks. Given LLMs' growing coding proficiency, we e"},"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":"2503.01700","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.RO","submitted_at":"2025-03-03T16:13:41Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"9d1d72f838c883ea31f633e8fbe7eeff3bf8e2970a8c98c287b3a7c2e36debf8","abstract_canon_sha256":"8716357cc471dd7c7ba0b9d7cb2a743b5b7c6c6453281215e9a03f5fe627d55f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:50:33.690969Z","signature_b64":"FyPUw8cx3qclUPfmBBY9/EotUXHmUCSNg6Td8wx0xVLk2RUZhA+XLG/5yBDqgKuG+FWzbpb5BUbikmUEHPAwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"326d672476d4ca20460ddb0c31411b2ccedf77f2a4fa2f15d608b8f88abfdfc5","last_reissued_at":"2026-07-05T11:50:33.690292Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:50:33.690292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Code-as-Symbolic-Planner: Foundation Model-Based Robot Planning via Symbolic Code Generation","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.RO","authors_text":"Chuchu Fan, Yang Zhang, Yilun Hao, Yongchao Chen","submitted_at":"2025-03-03T16:13:41Z","abstract_excerpt":"Recent works have shown great potentials of Large Language Models (LLMs) in robot task and motion planning (TAMP). Current LLM approaches generate text- or code-based reasoning chains with sub-goals and action plans. However, they do not fully leverage LLMs' symbolic computing and code generation capabilities. Many robot TAMP tasks involve complex optimization under multiple constraints, where pure textual reasoning is insufficient. While augmenting LLMs with predefined solvers and planners improves performance, it lacks generalization across tasks. Given LLMs' growing coding proficiency, we e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.01700","kind":"arxiv","version":2},"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/2503.01700/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":"2503.01700","created_at":"2026-07-05T11:50:33.690377+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.01700v2","created_at":"2026-07-05T11:50:33.690377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.01700","created_at":"2026-07-05T11:50:33.690377+00:00"},{"alias_kind":"pith_short_12","alias_value":"GJWWOJDW2TFC","created_at":"2026-07-05T11:50:33.690377+00:00"},{"alias_kind":"pith_short_16","alias_value":"GJWWOJDW2TFCARQN","created_at":"2026-07-05T11:50:33.690377+00:00"},{"alias_kind":"pith_short_8","alias_value":"GJWWOJDW","created_at":"2026-07-05T11:50:33.690377+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.21138","citing_title":"Navigating the Clutter: Waypoint-Based Bi-Level Planning for Multi-Robot Systems","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GJWWOJDW2TFCARQN3MGDCQI3FT","json":"https://pith.science/pith/GJWWOJDW2TFCARQN3MGDCQI3FT.json","graph_json":"https://pith.science/api/pith-number/GJWWOJDW2TFCARQN3MGDCQI3FT/graph.json","events_json":"https://pith.science/api/pith-number/GJWWOJDW2TFCARQN3MGDCQI3FT/events.json","paper":"https://pith.science/paper/GJWWOJDW"},"agent_actions":{"view_html":"https://pith.science/pith/GJWWOJDW2TFCARQN3MGDCQI3FT","download_json":"https://pith.science/pith/GJWWOJDW2TFCARQN3MGDCQI3FT.json","view_paper":"https://pith.science/paper/GJWWOJDW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.01700&json=true","fetch_graph":"https://pith.science/api/pith-number/GJWWOJDW2TFCARQN3MGDCQI3FT/graph.json","fetch_events":"https://pith.science/api/pith-number/GJWWOJDW2TFCARQN3MGDCQI3FT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GJWWOJDW2TFCARQN3MGDCQI3FT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GJWWOJDW2TFCARQN3MGDCQI3FT/action/storage_attestation","attest_author":"https://pith.science/pith/GJWWOJDW2TFCARQN3MGDCQI3FT/action/author_attestation","sign_citation":"https://pith.science/pith/GJWWOJDW2TFCARQN3MGDCQI3FT/action/citation_signature","submit_replication":"https://pith.science/pith/GJWWOJDW2TFCARQN3MGDCQI3FT/action/replication_record"}},"created_at":"2026-07-05T11:50:33.690377+00:00","updated_at":"2026-07-05T11:50:33.690377+00:00"}