{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XHBQ2FOTRVKCCSOMN2FSXULFXJ","short_pith_number":"pith:XHBQ2FOT","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"},"canonical_sha256":"b9c30d15d38d542149cc6e8b2bd165ba45785da1a95625a2837fb73b7fe6fe88","source":{"kind":"arxiv","id":"1801.00680","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00680","created_at":"2026-05-17T23:54:16Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00680v3","created_at":"2026-05-17T23:54:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00680","created_at":"2026-05-17T23:54:16Z"},{"alias_kind":"pith_short_12","alias_value":"XHBQ2FOTRVKC","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XHBQ2FOTRVKCCSOM","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XHBQ2FOT","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XHBQ2FOTRVKCCSOMN2FSXULFXJ","target":"record","payload":{"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"},"canonical_sha256":"b9c30d15d38d542149cc6e8b2bd165ba45785da1a95625a2837fb73b7fe6fe88","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"},"source_kind":"arxiv","source_id":"1801.00680","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4xQQK4io4CiII+pZT9EQVcCrWotb5Wa6Wr0Nq5nQUt/cyfNDnGCJoGeF2qjBAfwFiyz8jkl+8unqEqIK8vwIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:53:58.562760Z"},"content_sha256":"c27e6deae156adda81253e14c9ba04c5a5c019b382151ec4f77ddfae55aab4d0","schema_version":"1.0","event_id":"sha256:c27e6deae156adda81253e14c9ba04c5a5c019b382151ec4f77ddfae55aab4d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XHBQ2FOTRVKCCSOMN2FSXULFXJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hufZHDGgQxeD9aG8e9pa9nS+knaVE9RSeNLAqSlNX4DE8I9t16BgOc+nHRs6mnWPV38kEl5Tpj+jaWkJv+OuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:53:58.563102Z"},"content_sha256":"ca45fdac1f324959e2909a4542d63b4aa924b402fa4bcc3d0964ae307353d43b","schema_version":"1.0","event_id":"sha256:ca45fdac1f324959e2909a4542d63b4aa924b402fa4bcc3d0964ae307353d43b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XHBQ2FOTRVKCCSOMN2FSXULFXJ/bundle.json","state_url":"https://pith.science/pith/XHBQ2FOTRVKCCSOMN2FSXULFXJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XHBQ2FOTRVKCCSOMN2FSXULFXJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T16:53:58Z","links":{"resolver":"https://pith.science/pith/XHBQ2FOTRVKCCSOMN2FSXULFXJ","bundle":"https://pith.science/pith/XHBQ2FOTRVKCCSOMN2FSXULFXJ/bundle.json","state":"https://pith.science/pith/XHBQ2FOTRVKCCSOMN2FSXULFXJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XHBQ2FOTRVKCCSOMN2FSXULFXJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XHBQ2FOTRVKCCSOMN2FSXULFXJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4e456400e6863283a7abc1f33ebdbd756058049532f41ed49a95a9a9e41e088f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-01-02T15:15:35Z","title_canon_sha256":"bb95dccc35e11f830808312e50b15b70b3ad8bde8afca9a834b8298214c7238e"},"schema_version":"1.0","source":{"id":"1801.00680","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00680","created_at":"2026-05-17T23:54:16Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00680v3","created_at":"2026-05-17T23:54:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00680","created_at":"2026-05-17T23:54:16Z"},{"alias_kind":"pith_short_12","alias_value":"XHBQ2FOTRVKC","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XHBQ2FOTRVKCCSOM","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XHBQ2FOT","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:ca45fdac1f324959e2909a4542d63b4aa924b402fa4bcc3d0964ae307353d43b","target":"graph","created_at":"2026-05-17T23:54:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Caelan Reed Garrett, Leslie Pack Kaelbling, Tom\\'as Lozano-P\\'erez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-01-02T15:15:35Z","title":"Sampling-Based Methods for Factored Task and Motion Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00680","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c27e6deae156adda81253e14c9ba04c5a5c019b382151ec4f77ddfae55aab4d0","target":"record","created_at":"2026-05-17T23:54:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4e456400e6863283a7abc1f33ebdbd756058049532f41ed49a95a9a9e41e088f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-01-02T15:15:35Z","title_canon_sha256":"bb95dccc35e11f830808312e50b15b70b3ad8bde8afca9a834b8298214c7238e"},"schema_version":"1.0","source":{"id":"1801.00680","kind":"arxiv","version":3}},"canonical_sha256":"b9c30d15d38d542149cc6e8b2bd165ba45785da1a95625a2837fb73b7fe6fe88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9c30d15d38d542149cc6e8b2bd165ba45785da1a95625a2837fb73b7fe6fe88","first_computed_at":"2026-05-17T23:54:16.762972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:16.762972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"igLgyK1LF5pndmV90TSoqPxauTTJDqeeBl30dmHwG+BWYKGBvY7J6g5ZWJX3/IrZtylSBHwcvZVrlXZ2ArgCBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:16.763631Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.00680","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c27e6deae156adda81253e14c9ba04c5a5c019b382151ec4f77ddfae55aab4d0","sha256:ca45fdac1f324959e2909a4542d63b4aa924b402fa4bcc3d0964ae307353d43b"],"state_sha256":"20282ba6733303261c0979d43821a40fde4cf075c3d6f09f5b274246e83a9b0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ETJj52XoTgx2jOCVWg4JEfVvhJZKkpQI6SZxKGdc+RY1hiUUJc5ZxMyKvtBXKlSm+u8sdLRaOlWI36PHZMlBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:53:58.565111Z","bundle_sha256":"7b3eba970943a71e74e1feef9e4bb11adda0240ca93949bf5abe3e481938be33"}}