{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3DQ7VVZKPGHUVLP3TWS5YTHZFV","short_pith_number":"pith:3DQ7VVZK","schema_version":"1.0","canonical_sha256":"d8e1fad72a798f4aadfb9da5dc4cf92d4b7f8cc66db87468e9e950856b50aea8","source":{"kind":"arxiv","id":"2405.08572","version":1},"attestation_state":"computed","paper":{"title":"COAST: Constraints and Streams for Task and Motion Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Brandon Vu, Jeannette Bohg, Toki Migimatsu","submitted_at":"2024-05-14T13:10:34Z","abstract_excerpt":"Task and Motion Planning (TAMP) algorithms solve long-horizon robotics tasks by integrating task planning with motion planning; the task planner proposes a sequence of actions towards a goal state and the motion planner verifies whether this action sequence is geometrically feasible for the robot. However, state-of-the-art TAMP algorithms do not scale well with the difficulty of the task and require an impractical amount of time to solve relatively small problems. We propose Constraints and Streams for Task and Motion Planning (COAST), a probabilistically-complete, sampling-based TAMP algorith"},"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":"2405.08572","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-05-14T13:10:34Z","cross_cats_sorted":[],"title_canon_sha256":"edab03acb4975e96c124ab819425893cc0e473593502bb9d15cdcff6c1bc1323","abstract_canon_sha256":"c467809d3343dbe2bb1b227ce0a911b6d97b039c15ed2519bc72db1b89f1cb5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:19:02.308722Z","signature_b64":"DTtTJpV17/HXIPG7/Z1OvCFSPZJI7kOCaEdGJLjYe1kzVgWAf53CgHt8/R9ik/inHBM9dydorVSfwrP1AvjCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8e1fad72a798f4aadfb9da5dc4cf92d4b7f8cc66db87468e9e950856b50aea8","last_reissued_at":"2026-07-05T08:19:02.308248Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:19:02.308248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"COAST: Constraints and Streams for Task and Motion Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Brandon Vu, Jeannette Bohg, Toki Migimatsu","submitted_at":"2024-05-14T13:10:34Z","abstract_excerpt":"Task and Motion Planning (TAMP) algorithms solve long-horizon robotics tasks by integrating task planning with motion planning; the task planner proposes a sequence of actions towards a goal state and the motion planner verifies whether this action sequence is geometrically feasible for the robot. However, state-of-the-art TAMP algorithms do not scale well with the difficulty of the task and require an impractical amount of time to solve relatively small problems. We propose Constraints and Streams for Task and Motion Planning (COAST), a probabilistically-complete, sampling-based TAMP algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.08572","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/2405.08572/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":"2405.08572","created_at":"2026-07-05T08:19:02.308304+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.08572v1","created_at":"2026-07-05T08:19:02.308304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.08572","created_at":"2026-07-05T08:19:02.308304+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DQ7VVZKPGHU","created_at":"2026-07-05T08:19:02.308304+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DQ7VVZKPGHUVLP3","created_at":"2026-07-05T08:19:02.308304+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DQ7VVZK","created_at":"2026-07-05T08:19:02.308304+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2409.01652","citing_title":"ReKep: Spatio-Temporal Reasoning of Relational Keypoint Constraints for Robotic Manipulation","ref_index":80,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3DQ7VVZKPGHUVLP3TWS5YTHZFV","json":"https://pith.science/pith/3DQ7VVZKPGHUVLP3TWS5YTHZFV.json","graph_json":"https://pith.science/api/pith-number/3DQ7VVZKPGHUVLP3TWS5YTHZFV/graph.json","events_json":"https://pith.science/api/pith-number/3DQ7VVZKPGHUVLP3TWS5YTHZFV/events.json","paper":"https://pith.science/paper/3DQ7VVZK"},"agent_actions":{"view_html":"https://pith.science/pith/3DQ7VVZKPGHUVLP3TWS5YTHZFV","download_json":"https://pith.science/pith/3DQ7VVZKPGHUVLP3TWS5YTHZFV.json","view_paper":"https://pith.science/paper/3DQ7VVZK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.08572&json=true","fetch_graph":"https://pith.science/api/pith-number/3DQ7VVZKPGHUVLP3TWS5YTHZFV/graph.json","fetch_events":"https://pith.science/api/pith-number/3DQ7VVZKPGHUVLP3TWS5YTHZFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DQ7VVZKPGHUVLP3TWS5YTHZFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DQ7VVZKPGHUVLP3TWS5YTHZFV/action/storage_attestation","attest_author":"https://pith.science/pith/3DQ7VVZKPGHUVLP3TWS5YTHZFV/action/author_attestation","sign_citation":"https://pith.science/pith/3DQ7VVZKPGHUVLP3TWS5YTHZFV/action/citation_signature","submit_replication":"https://pith.science/pith/3DQ7VVZKPGHUVLP3TWS5YTHZFV/action/replication_record"}},"created_at":"2026-07-05T08:19:02.308304+00:00","updated_at":"2026-07-05T08:19:02.308304+00:00"}