{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XHBQ2FOTRVKCCSOMN2FSXULFXJ","short_pith_number":"pith:XHBQ2FOT","schema_version":"1.0","canonical_sha256":"b9c30d15d38d542149cc6e8b2bd165ba45785da1a95625a2837fb73b7fe6fe88","source":{"kind":"arxiv","id":"1801.00680","version":3},"attestation_state":"computed","paper":{"title":"Sampling-Based Methods for Factored Task and Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Caelan Reed Garrett, Leslie Pack Kaelbling, Tom\\'as Lozano-P\\'erez","submitted_at":"2018-01-02T15:15:35Z","abstract_excerpt":"This paper presents a general-purpose formulation of a large class of discrete-time planning problems, with hybrid state and control-spaces, as factored transition systems. Factoring allows state transitions to be described as the intersection of several constraints each affecting a subset of the state and control variables. Robotic manipulation problems with many movable objects involve constraints that only affect several variables at a time and therefore exhibit large amounts of factoring. We develop a theoretical framework for solving factored transition systems with sampling-based algorit"},"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":"1801.00680","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-01-02T15:15:35Z","cross_cats_sorted":[],"title_canon_sha256":"bb95dccc35e11f830808312e50b15b70b3ad8bde8afca9a834b8298214c7238e","abstract_canon_sha256":"4e456400e6863283a7abc1f33ebdbd756058049532f41ed49a95a9a9e41e088f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:16.763631Z","signature_b64":"igLgyK1LF5pndmV90TSoqPxauTTJDqeeBl30dmHwG+BWYKGBvY7J6g5ZWJX3/IrZtylSBHwcvZVrlXZ2ArgCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9c30d15d38d542149cc6e8b2bd165ba45785da1a95625a2837fb73b7fe6fe88","last_reissued_at":"2026-05-17T23:54:16.762972Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:16.762972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sampling-Based Methods for Factored Task and Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Caelan Reed Garrett, Leslie Pack Kaelbling, Tom\\'as Lozano-P\\'erez","submitted_at":"2018-01-02T15:15:35Z","abstract_excerpt":"This paper presents a general-purpose formulation of a large class of discrete-time planning problems, with hybrid state and control-spaces, as factored transition systems. Factoring allows state transitions to be described as the intersection of several constraints each affecting a subset of the state and control variables. Robotic manipulation problems with many movable objects involve constraints that only affect several variables at a time and therefore exhibit large amounts of factoring. We develop a theoretical framework for solving factored transition systems with sampling-based algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00680","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.00680","created_at":"2026-05-17T23:54:16.763070+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.00680v3","created_at":"2026-05-17T23:54:16.763070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00680","created_at":"2026-05-17T23:54:16.763070+00:00"},{"alias_kind":"pith_short_12","alias_value":"XHBQ2FOTRVKC","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XHBQ2FOTRVKCCSOM","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XHBQ2FOT","created_at":"2026-05-18T12:33:01.666342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XHBQ2FOTRVKCCSOMN2FSXULFXJ","json":"https://pith.science/pith/XHBQ2FOTRVKCCSOMN2FSXULFXJ.json","graph_json":"https://pith.science/api/pith-number/XHBQ2FOTRVKCCSOMN2FSXULFXJ/graph.json","events_json":"https://pith.science/api/pith-number/XHBQ2FOTRVKCCSOMN2FSXULFXJ/events.json","paper":"https://pith.science/paper/XHBQ2FOT"},"agent_actions":{"view_html":"https://pith.science/pith/XHBQ2FOTRVKCCSOMN2FSXULFXJ","download_json":"https://pith.science/pith/XHBQ2FOTRVKCCSOMN2FSXULFXJ.json","view_paper":"https://pith.science/paper/XHBQ2FOT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.00680&json=true","fetch_graph":"https://pith.science/api/pith-number/XHBQ2FOTRVKCCSOMN2FSXULFXJ/graph.json","fetch_events":"https://pith.science/api/pith-number/XHBQ2FOTRVKCCSOMN2FSXULFXJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XHBQ2FOTRVKCCSOMN2FSXULFXJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XHBQ2FOTRVKCCSOMN2FSXULFXJ/action/storage_attestation","attest_author":"https://pith.science/pith/XHBQ2FOTRVKCCSOMN2FSXULFXJ/action/author_attestation","sign_citation":"https://pith.science/pith/XHBQ2FOTRVKCCSOMN2FSXULFXJ/action/citation_signature","submit_replication":"https://pith.science/pith/XHBQ2FOTRVKCCSOMN2FSXULFXJ/action/replication_record"}},"created_at":"2026-05-17T23:54:16.763070+00:00","updated_at":"2026-05-17T23:54:16.763070+00:00"}