{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:K5LHCMTPN5IOHIP4RONPYDESY7","short_pith_number":"pith:K5LHCMTP","schema_version":"1.0","canonical_sha256":"575671326f6f50e3a1fc8b9afc0c92c7eb98e13c65ee2366a77691abd967d412","source":{"kind":"arxiv","id":"2412.09584","version":3},"attestation_state":"computed","paper":{"title":"BaB-ND: Long-Horizon Motion Planning with Branch-and-Bound and Neural Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Huan Zhang, Jiangwei Yu, Jose Barreiros, Keyi Shen, Yunzhu Li","submitted_at":"2024-12-12T18:55:14Z","abstract_excerpt":"Neural-network-based dynamics models learned from observational data have shown strong predictive capabilities for scene dynamics in robotic manipulation tasks. However, their inherent non-linearity presents significant challenges for effective planning. Current planning methods, often dependent on extensive sampling or local gradient descent, struggle with long-horizon motion planning tasks involving complex contact events. In this paper, we present a GPU-accelerated branch-and-bound (BaB) framework for motion planning in manipulation tasks that require trajectory optimization over neural dyn"},"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":"2412.09584","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-12-12T18:55:14Z","cross_cats_sorted":[],"title_canon_sha256":"f7f243650994f18764066f83ddafb8692947925e56485e0240af5382fa0322f9","abstract_canon_sha256":"4cbb986cdcb9599d2e2d395deaa6403cb7f21fc49820052b5025468921721908"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:31:51.680581Z","signature_b64":"Hor99Vc0rwObzJuApvR/CyqekiP3RZLSNA6q8W9xyBChltS3uHYcphO0Ifykrses01f2RJkIAMrPJ4Wzs1U+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"575671326f6f50e3a1fc8b9afc0c92c7eb98e13c65ee2366a77691abd967d412","last_reissued_at":"2026-07-05T10:31:51.680103Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:31:51.680103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BaB-ND: Long-Horizon Motion Planning with Branch-and-Bound and Neural Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Huan Zhang, Jiangwei Yu, Jose Barreiros, Keyi Shen, Yunzhu Li","submitted_at":"2024-12-12T18:55:14Z","abstract_excerpt":"Neural-network-based dynamics models learned from observational data have shown strong predictive capabilities for scene dynamics in robotic manipulation tasks. However, their inherent non-linearity presents significant challenges for effective planning. Current planning methods, often dependent on extensive sampling or local gradient descent, struggle with long-horizon motion planning tasks involving complex contact events. In this paper, we present a GPU-accelerated branch-and-bound (BaB) framework for motion planning in manipulation tasks that require trajectory optimization over neural dyn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.09584","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/2412.09584/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":"2412.09584","created_at":"2026-07-05T10:31:51.680164+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.09584v3","created_at":"2026-07-05T10:31:51.680164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.09584","created_at":"2026-07-05T10:31:51.680164+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5LHCMTPN5IO","created_at":"2026-07-05T10:31:51.680164+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5LHCMTPN5IOHIP4","created_at":"2026-07-05T10:31:51.680164+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5LHCMTP","created_at":"2026-07-05T10:31:51.680164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.25346","citing_title":"Parallel Differentiable Reachability for Learning and Planning with Certified Neural Dynamics and Controllers","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2605.26577","citing_title":"Bridging Control with Neural Network Verifier alpha-beta-CROWN: A Tutorial","ref_index":85,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K5LHCMTPN5IOHIP4RONPYDESY7","json":"https://pith.science/pith/K5LHCMTPN5IOHIP4RONPYDESY7.json","graph_json":"https://pith.science/api/pith-number/K5LHCMTPN5IOHIP4RONPYDESY7/graph.json","events_json":"https://pith.science/api/pith-number/K5LHCMTPN5IOHIP4RONPYDESY7/events.json","paper":"https://pith.science/paper/K5LHCMTP"},"agent_actions":{"view_html":"https://pith.science/pith/K5LHCMTPN5IOHIP4RONPYDESY7","download_json":"https://pith.science/pith/K5LHCMTPN5IOHIP4RONPYDESY7.json","view_paper":"https://pith.science/paper/K5LHCMTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.09584&json=true","fetch_graph":"https://pith.science/api/pith-number/K5LHCMTPN5IOHIP4RONPYDESY7/graph.json","fetch_events":"https://pith.science/api/pith-number/K5LHCMTPN5IOHIP4RONPYDESY7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5LHCMTPN5IOHIP4RONPYDESY7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5LHCMTPN5IOHIP4RONPYDESY7/action/storage_attestation","attest_author":"https://pith.science/pith/K5LHCMTPN5IOHIP4RONPYDESY7/action/author_attestation","sign_citation":"https://pith.science/pith/K5LHCMTPN5IOHIP4RONPYDESY7/action/citation_signature","submit_replication":"https://pith.science/pith/K5LHCMTPN5IOHIP4RONPYDESY7/action/replication_record"}},"created_at":"2026-07-05T10:31:51.680164+00:00","updated_at":"2026-07-05T10:31:51.680164+00:00"}