{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YJXZCMY6XG4CC4HZ4FOU77RQO6","short_pith_number":"pith:YJXZCMY6","schema_version":"1.0","canonical_sha256":"c26f91331eb9b82170f9e15d4ffe30779c7977ddfed176d78ad523cf4ed6cb04","source":{"kind":"arxiv","id":"2403.05765","version":1},"attestation_state":"computed","paper":{"title":"Physics-informed Neural Motion Planning on Constraint Manifolds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.RO","authors_text":"Ahmed H. Qureshi, Ruiqi Ni","submitted_at":"2024-03-09T02:24:02Z","abstract_excerpt":"Constrained Motion Planning (CMP) aims to find a collision-free path between the given start and goal configurations on the kinematic constraint manifolds. These problems appear in various scenarios ranging from object manipulation to legged-robot locomotion. However, the zero-volume nature of manifolds makes the CMP problem challenging, and the state-of-the-art methods still take several seconds to find a path and require a computationally expansive path dataset for imitation learning. Recently, physics-informed motion planning methods have emerged that directly solve the Eikonal equation thr"},"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":"2403.05765","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-03-09T02:24:02Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6ce9f7633ca817d447e98a0a593dc4de1a1df4e8ffff35dcece81f8bb8dbe879","abstract_canon_sha256":"673f0aabdd573092f1dc085559b8f2524547a1cae495a4d69a0576192fd0aa2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:54:13.043678Z","signature_b64":"2ZyWUM4wuJi1kNcfZFkHb2tRqUSBVnK31+YHVrtqxTrj+fKovQ+aq251Kx7HCJpgj0MUbCwblxzOH71t3xhwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c26f91331eb9b82170f9e15d4ffe30779c7977ddfed176d78ad523cf4ed6cb04","last_reissued_at":"2026-07-05T07:54:13.043239Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:54:13.043239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Physics-informed Neural Motion Planning on Constraint Manifolds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.RO","authors_text":"Ahmed H. Qureshi, Ruiqi Ni","submitted_at":"2024-03-09T02:24:02Z","abstract_excerpt":"Constrained Motion Planning (CMP) aims to find a collision-free path between the given start and goal configurations on the kinematic constraint manifolds. These problems appear in various scenarios ranging from object manipulation to legged-robot locomotion. However, the zero-volume nature of manifolds makes the CMP problem challenging, and the state-of-the-art methods still take several seconds to find a path and require a computationally expansive path dataset for imitation learning. Recently, physics-informed motion planning methods have emerged that directly solve the Eikonal equation thr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.05765","kind":"arxiv","version":1},"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/2403.05765/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":"2403.05765","created_at":"2026-07-05T07:54:13.043296+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.05765v1","created_at":"2026-07-05T07:54:13.043296+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.05765","created_at":"2026-07-05T07:54:13.043296+00:00"},{"alias_kind":"pith_short_12","alias_value":"YJXZCMY6XG4C","created_at":"2026-07-05T07:54:13.043296+00:00"},{"alias_kind":"pith_short_16","alias_value":"YJXZCMY6XG4CC4HZ","created_at":"2026-07-05T07:54:13.043296+00:00"},{"alias_kind":"pith_short_8","alias_value":"YJXZCMY6","created_at":"2026-07-05T07:54:13.043296+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11214","citing_title":"Enforcing Constraints in Generative Sampling via Adaptive Correction Scheduling","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18277","citing_title":"Dissipative Latent Residual Physics-Informed Neural Networks for Modeling and Identification of Electromechanical Systems","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YJXZCMY6XG4CC4HZ4FOU77RQO6","json":"https://pith.science/pith/YJXZCMY6XG4CC4HZ4FOU77RQO6.json","graph_json":"https://pith.science/api/pith-number/YJXZCMY6XG4CC4HZ4FOU77RQO6/graph.json","events_json":"https://pith.science/api/pith-number/YJXZCMY6XG4CC4HZ4FOU77RQO6/events.json","paper":"https://pith.science/paper/YJXZCMY6"},"agent_actions":{"view_html":"https://pith.science/pith/YJXZCMY6XG4CC4HZ4FOU77RQO6","download_json":"https://pith.science/pith/YJXZCMY6XG4CC4HZ4FOU77RQO6.json","view_paper":"https://pith.science/paper/YJXZCMY6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.05765&json=true","fetch_graph":"https://pith.science/api/pith-number/YJXZCMY6XG4CC4HZ4FOU77RQO6/graph.json","fetch_events":"https://pith.science/api/pith-number/YJXZCMY6XG4CC4HZ4FOU77RQO6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YJXZCMY6XG4CC4HZ4FOU77RQO6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YJXZCMY6XG4CC4HZ4FOU77RQO6/action/storage_attestation","attest_author":"https://pith.science/pith/YJXZCMY6XG4CC4HZ4FOU77RQO6/action/author_attestation","sign_citation":"https://pith.science/pith/YJXZCMY6XG4CC4HZ4FOU77RQO6/action/citation_signature","submit_replication":"https://pith.science/pith/YJXZCMY6XG4CC4HZ4FOU77RQO6/action/replication_record"}},"created_at":"2026-07-05T07:54:13.043296+00:00","updated_at":"2026-07-05T07:54:13.043296+00:00"}