{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:IGC62P2UDDB2UUQFBYKY3BYQV6","short_pith_number":"pith:IGC62P2U","canonical_record":{"source":{"id":"2312.02731","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-12-05T12:49:11Z","cross_cats_sorted":[],"title_canon_sha256":"f679b3379fe1995962286a599cdc292bc70490525d4a665cff2519c033b17c91","abstract_canon_sha256":"265c1d793b4b48dbe54a9e0f580b0ab1cbdbf673b5cccd3110fa18efe32fb19c"},"schema_version":"1.0"},"canonical_sha256":"4185ed3f5418c3aa52050e158d8710af8ef5e2e7f67f8155354eb2eecb76ebef","source":{"kind":"arxiv","id":"2312.02731","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.02731","created_at":"2026-07-05T08:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"2312.02731v3","created_at":"2026-07-05T08:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.02731","created_at":"2026-07-05T08:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"IGC62P2UDDB2","created_at":"2026-07-05T08:13:10Z"},{"alias_kind":"pith_short_16","alias_value":"IGC62P2UDDB2UUQF","created_at":"2026-07-05T08:13:10Z"},{"alias_kind":"pith_short_8","alias_value":"IGC62P2U","created_at":"2026-07-05T08:13:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:IGC62P2UDDB2UUQFBYKY3BYQV6","target":"record","payload":{"canonical_record":{"source":{"id":"2312.02731","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-12-05T12:49:11Z","cross_cats_sorted":[],"title_canon_sha256":"f679b3379fe1995962286a599cdc292bc70490525d4a665cff2519c033b17c91","abstract_canon_sha256":"265c1d793b4b48dbe54a9e0f580b0ab1cbdbf673b5cccd3110fa18efe32fb19c"},"schema_version":"1.0"},"canonical_sha256":"4185ed3f5418c3aa52050e158d8710af8ef5e2e7f67f8155354eb2eecb76ebef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:13:10.501095Z","signature_b64":"OiVjxs9rmViLpQG/jZi4Dryu07wufQ+Tb1F01pdiHJH7TEqSjUzkt6Z7HwSkzy9qYFam16kYM1N2g7tPqdkuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4185ed3f5418c3aa52050e158d8710af8ef5e2e7f67f8155354eb2eecb76ebef","last_reissued_at":"2026-07-05T08:13:10.500669Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:13:10.500669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.02731","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-07-05T08:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LgPnD7/n/FgnHdSiTg2amTmj06pjyn/RfYaWB5CMocygWagzASq9EBTqEI71p3J3omAWKyAFhKL6LG/T09ezCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T04:04:16.076616Z"},"content_sha256":"1bc1d967976e43358a4c32ae363911dc62fdb86bbd46f750844360ddb489c246","schema_version":"1.0","event_id":"sha256:1bc1d967976e43358a4c32ae363911dc62fdb86bbd46f750844360ddb489c246"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:IGC62P2UDDB2UUQFBYKY3BYQV6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"D-LGP: Dynamic Logic-Geometric Program for Reactive Task and Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Amirreza Razmjoo, Sylvain Calinon, Teng Xue","submitted_at":"2023-12-05T12:49:11Z","abstract_excerpt":"Many real-world sequential manipulation tasks involve a combination of discrete symbolic search and continuous motion planning, collectively known as combined task and motion planning (TAMP). However, prevailing methods often struggle with the computational burden and intricate combinatorial challenges, limiting their applications for online replanning in the real world. To address this, we propose Dynamic Logic-Geometric Program (D-LGP), a novel approach integrating Dynamic Tree Search and global optimization for efficient hybrid planning. Through empirical evaluation on three benchmarks, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.02731","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.02731/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"},"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-07-05T08:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nwNUfAGUcfEvWqyBfPwpypIFPUG1yz02JMN5gsaBkN/lOfknzq37m43NgFVTqSJDFN5RZGT2GkImwckL+kU/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T04:04:16.077009Z"},"content_sha256":"c7694b1b07efe75386269800724ffc04b4d801c95534b3cc5ba2e1c1be341113","schema_version":"1.0","event_id":"sha256:c7694b1b07efe75386269800724ffc04b4d801c95534b3cc5ba2e1c1be341113"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IGC62P2UDDB2UUQFBYKY3BYQV6/bundle.json","state_url":"https://pith.science/pith/IGC62P2UDDB2UUQFBYKY3BYQV6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IGC62P2UDDB2UUQFBYKY3BYQV6/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-07-19T04:04:16Z","links":{"resolver":"https://pith.science/pith/IGC62P2UDDB2UUQFBYKY3BYQV6","bundle":"https://pith.science/pith/IGC62P2UDDB2UUQFBYKY3BYQV6/bundle.json","state":"https://pith.science/pith/IGC62P2UDDB2UUQFBYKY3BYQV6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IGC62P2UDDB2UUQFBYKY3BYQV6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:IGC62P2UDDB2UUQFBYKY3BYQV6","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":"265c1d793b4b48dbe54a9e0f580b0ab1cbdbf673b5cccd3110fa18efe32fb19c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-12-05T12:49:11Z","title_canon_sha256":"f679b3379fe1995962286a599cdc292bc70490525d4a665cff2519c033b17c91"},"schema_version":"1.0","source":{"id":"2312.02731","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.02731","created_at":"2026-07-05T08:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"2312.02731v3","created_at":"2026-07-05T08:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.02731","created_at":"2026-07-05T08:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"IGC62P2UDDB2","created_at":"2026-07-05T08:13:10Z"},{"alias_kind":"pith_short_16","alias_value":"IGC62P2UDDB2UUQF","created_at":"2026-07-05T08:13:10Z"},{"alias_kind":"pith_short_8","alias_value":"IGC62P2U","created_at":"2026-07-05T08:13:10Z"}],"graph_snapshots":[{"event_id":"sha256:c7694b1b07efe75386269800724ffc04b4d801c95534b3cc5ba2e1c1be341113","target":"graph","created_at":"2026-07-05T08:13:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.02731/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many real-world sequential manipulation tasks involve a combination of discrete symbolic search and continuous motion planning, collectively known as combined task and motion planning (TAMP). However, prevailing methods often struggle with the computational burden and intricate combinatorial challenges, limiting their applications for online replanning in the real world. To address this, we propose Dynamic Logic-Geometric Program (D-LGP), a novel approach integrating Dynamic Tree Search and global optimization for efficient hybrid planning. Through empirical evaluation on three benchmarks, we ","authors_text":"Amirreza Razmjoo, Sylvain Calinon, Teng Xue","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-12-05T12:49:11Z","title":"D-LGP: Dynamic Logic-Geometric Program for Reactive Task and Motion Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.02731","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:1bc1d967976e43358a4c32ae363911dc62fdb86bbd46f750844360ddb489c246","target":"record","created_at":"2026-07-05T08:13:10Z","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":"265c1d793b4b48dbe54a9e0f580b0ab1cbdbf673b5cccd3110fa18efe32fb19c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-12-05T12:49:11Z","title_canon_sha256":"f679b3379fe1995962286a599cdc292bc70490525d4a665cff2519c033b17c91"},"schema_version":"1.0","source":{"id":"2312.02731","kind":"arxiv","version":3}},"canonical_sha256":"4185ed3f5418c3aa52050e158d8710af8ef5e2e7f67f8155354eb2eecb76ebef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4185ed3f5418c3aa52050e158d8710af8ef5e2e7f67f8155354eb2eecb76ebef","first_computed_at":"2026-07-05T08:13:10.500669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:13:10.500669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OiVjxs9rmViLpQG/jZi4Dryu07wufQ+Tb1F01pdiHJH7TEqSjUzkt6Z7HwSkzy9qYFam16kYM1N2g7tPqdkuCA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:13:10.501095Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.02731","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bc1d967976e43358a4c32ae363911dc62fdb86bbd46f750844360ddb489c246","sha256:c7694b1b07efe75386269800724ffc04b4d801c95534b3cc5ba2e1c1be341113"],"state_sha256":"f9f013e9042b22662f2da6443b783063b665ed03812f3910baa7e73239e68aea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ocak/qLd22lPhGKn5kjRqjcHb8sGaQsDs0cWTggDTNXx86EEJCQvqtlU8YSwUsSJREBLT1cJRApdXhG5eu4wDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-19T04:04:16.079562Z","bundle_sha256":"ead6e3b834b4ebb73532ac5c93e0a2bae1c9b2e3a07c0b180cd5a741eaae3c2b"}}