{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:SVLTXGELWAXGMUBM6R5OQYKOZ3","short_pith_number":"pith:SVLTXGEL","canonical_record":{"source":{"id":"2408.06843","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-08-13T12:06:28Z","cross_cats_sorted":[],"title_canon_sha256":"b5188da2c203da7ece1b72fe8f32ccdc4442e01849e4f45c6709abaef316309c","abstract_canon_sha256":"0efd87684dc53830da7e7dc7ade7c24935f7a52984c3d6c7bec7bdf81af7ea8e"},"schema_version":"1.0"},"canonical_sha256":"95573b988bb02e66502cf47ae8614ececcb135c434bd638564a69119407a3f43","source":{"kind":"arxiv","id":"2408.06843","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.06843","created_at":"2026-05-20T02:05:32Z"},{"alias_kind":"arxiv_version","alias_value":"2408.06843v5","created_at":"2026-05-20T02:05:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.06843","created_at":"2026-05-20T02:05:32Z"},{"alias_kind":"pith_short_12","alias_value":"SVLTXGELWAXG","created_at":"2026-05-20T02:05:32Z"},{"alias_kind":"pith_short_16","alias_value":"SVLTXGELWAXGMUBM","created_at":"2026-05-20T02:05:32Z"},{"alias_kind":"pith_short_8","alias_value":"SVLTXGEL","created_at":"2026-05-20T02:05:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:SVLTXGELWAXGMUBM6R5OQYKOZ3","target":"record","payload":{"canonical_record":{"source":{"id":"2408.06843","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-08-13T12:06:28Z","cross_cats_sorted":[],"title_canon_sha256":"b5188da2c203da7ece1b72fe8f32ccdc4442e01849e4f45c6709abaef316309c","abstract_canon_sha256":"0efd87684dc53830da7e7dc7ade7c24935f7a52984c3d6c7bec7bdf81af7ea8e"},"schema_version":"1.0"},"canonical_sha256":"95573b988bb02e66502cf47ae8614ececcb135c434bd638564a69119407a3f43","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T02:05:32.188640Z","signature_b64":"tL4X6tgE34oFuOoWhcu04T7hYN9Y1aIFAvVH4PqI38hCutB3pjQ/QVCA3w0Ksr26LY4zG6f09uh+i/OOEAUNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95573b988bb02e66502cf47ae8614ececcb135c434bd638564a69119407a3f43","last_reissued_at":"2026-05-20T02:05:32.188066Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T02:05:32.188066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.06843","source_version":5,"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-20T02:05:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ddVLVo+OHtYmkQ41ro3E3bffPyTNyatlrW22azkpo4CC4kYb+/p1JBC0vJteeJN3T6lL2ZV+S9p5Y2zyaaW4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:41:22.240964Z"},"content_sha256":"a1521737c65a67044d31e21b4b9244f38d29b669d9af295ef0611173105361d5","schema_version":"1.0","event_id":"sha256:a1521737c65a67044d31e21b4b9244f38d29b669d9af295ef0611173105361d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:SVLTXGELWAXGMUBM6R5OQYKOZ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learn2Decompose: Learning Problem Decomposition for Efficient Sequential Multi-object Manipulation 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, Yan Zhang","submitted_at":"2024-08-13T12:06:28Z","abstract_excerpt":"We present an efficient task and motion replanning approach for sequential multi-object manipulation in dynamic environments. Conventional Task And Motion Planning (TAMP) solvers experience an exponential increase in planning time as the planning horizon and number of objects grow, limiting their applicability in real-world scenarios. To address this, we propose learning problem decompositions from demonstrations to accelerate TAMP solvers. Our approach consists of three key components: goal decomposition learning, computational distance learning, and object reduction. Goal decomposition ident"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.06843","kind":"arxiv","version":5},"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/2408.06843/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-05-20T02:05:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M4PcKAnCAMa/p5Gh8EcrU71RJvAyw/KTZECt+uJZsSaphi3gZehboXOlOiFI9lR93CYRrMtmvNx05BYzyKu4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:41:22.241359Z"},"content_sha256":"9a48e91df4326ce670fc6f0770ef8ac14319447310f088d2d71c43f05eb78312","schema_version":"1.0","event_id":"sha256:9a48e91df4326ce670fc6f0770ef8ac14319447310f088d2d71c43f05eb78312"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SVLTXGELWAXGMUBM6R5OQYKOZ3/bundle.json","state_url":"https://pith.science/pith/SVLTXGELWAXGMUBM6R5OQYKOZ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SVLTXGELWAXGMUBM6R5OQYKOZ3/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-02T10:41:22Z","links":{"resolver":"https://pith.science/pith/SVLTXGELWAXGMUBM6R5OQYKOZ3","bundle":"https://pith.science/pith/SVLTXGELWAXGMUBM6R5OQYKOZ3/bundle.json","state":"https://pith.science/pith/SVLTXGELWAXGMUBM6R5OQYKOZ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SVLTXGELWAXGMUBM6R5OQYKOZ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SVLTXGELWAXGMUBM6R5OQYKOZ3","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":"0efd87684dc53830da7e7dc7ade7c24935f7a52984c3d6c7bec7bdf81af7ea8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-08-13T12:06:28Z","title_canon_sha256":"b5188da2c203da7ece1b72fe8f32ccdc4442e01849e4f45c6709abaef316309c"},"schema_version":"1.0","source":{"id":"2408.06843","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.06843","created_at":"2026-05-20T02:05:32Z"},{"alias_kind":"arxiv_version","alias_value":"2408.06843v5","created_at":"2026-05-20T02:05:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.06843","created_at":"2026-05-20T02:05:32Z"},{"alias_kind":"pith_short_12","alias_value":"SVLTXGELWAXG","created_at":"2026-05-20T02:05:32Z"},{"alias_kind":"pith_short_16","alias_value":"SVLTXGELWAXGMUBM","created_at":"2026-05-20T02:05:32Z"},{"alias_kind":"pith_short_8","alias_value":"SVLTXGEL","created_at":"2026-05-20T02:05:32Z"}],"graph_snapshots":[{"event_id":"sha256:9a48e91df4326ce670fc6f0770ef8ac14319447310f088d2d71c43f05eb78312","target":"graph","created_at":"2026-05-20T02:05:32Z","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/2408.06843/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present an efficient task and motion replanning approach for sequential multi-object manipulation in dynamic environments. Conventional Task And Motion Planning (TAMP) solvers experience an exponential increase in planning time as the planning horizon and number of objects grow, limiting their applicability in real-world scenarios. To address this, we propose learning problem decompositions from demonstrations to accelerate TAMP solvers. Our approach consists of three key components: goal decomposition learning, computational distance learning, and object reduction. Goal decomposition ident","authors_text":"Amirreza Razmjoo, Sylvain Calinon, Teng Xue, Yan Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-08-13T12:06:28Z","title":"Learn2Decompose: Learning Problem Decomposition for Efficient Sequential Multi-object Manipulation Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.06843","kind":"arxiv","version":5},"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:a1521737c65a67044d31e21b4b9244f38d29b669d9af295ef0611173105361d5","target":"record","created_at":"2026-05-20T02:05:32Z","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":"0efd87684dc53830da7e7dc7ade7c24935f7a52984c3d6c7bec7bdf81af7ea8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-08-13T12:06:28Z","title_canon_sha256":"b5188da2c203da7ece1b72fe8f32ccdc4442e01849e4f45c6709abaef316309c"},"schema_version":"1.0","source":{"id":"2408.06843","kind":"arxiv","version":5}},"canonical_sha256":"95573b988bb02e66502cf47ae8614ececcb135c434bd638564a69119407a3f43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95573b988bb02e66502cf47ae8614ececcb135c434bd638564a69119407a3f43","first_computed_at":"2026-05-20T02:05:32.188066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T02:05:32.188066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tL4X6tgE34oFuOoWhcu04T7hYN9Y1aIFAvVH4PqI38hCutB3pjQ/QVCA3w0Ksr26LY4zG6f09uh+i/OOEAUNCA==","signature_status":"signed_v1","signed_at":"2026-05-20T02:05:32.188640Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.06843","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1521737c65a67044d31e21b4b9244f38d29b669d9af295ef0611173105361d5","sha256:9a48e91df4326ce670fc6f0770ef8ac14319447310f088d2d71c43f05eb78312"],"state_sha256":"fc27a1c468070e73884387a6e83ebf7ef232223a6816b2b5b388fc17c6e17128"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b8GoDYgVWryOMFd8j2DKsMyzXHmkOvhjtJ25Fv2Px0L4kKFM1TDPJZUCCP5kkmhrjRAJpxQgN4rLRjtdG+92CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:41:22.243398Z","bundle_sha256":"74cae07a7e399b232e17cd7ce05020d1ad92645932e8149334ac4e27f8a9794a"}}