{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CS2YTRLZ5EB3MZR452ZVXCMFBF","short_pith_number":"pith:CS2YTRLZ","schema_version":"1.0","canonical_sha256":"14b589c579e903b6663ceeb35b8985094b92b5ce9f54decfb61a437101fddbd8","source":{"kind":"arxiv","id":"2407.06169","version":1},"attestation_state":"computed","paper":{"title":"Potential Based Diffusion Motion Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"cs.RO","authors_text":"Chen Sun, Joshua B. Tenenbaum, Yilun Du, Yunhao Luo","submitted_at":"2024-07-08T17:48:39Z","abstract_excerpt":"Effective motion planning in high dimensional spaces is a long-standing open problem in robotics. One class of traditional motion planning algorithms corresponds to potential-based motion planning. An advantage of potential based motion planning is composability -- different motion constraints can be easily combined by adding corresponding potentials. However, constructing motion paths from potentials requires solving a global optimization across configuration space potential landscape, which is often prone to local minima. We propose a new approach towards learning potential based motion plan"},"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":"2407.06169","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-07-08T17:48:39Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"02b789712a8b0e160382b599f62053029d3205ef591cd5b4657041e1b601b893","abstract_canon_sha256":"ca4657b3a2df36ee15661053fadf6be7427f21e0fc5ee55c6b8fe592fdc3371c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:41:24.581398Z","signature_b64":"ERvSzv80Zf4Sx06X3WoXGejfXM2wKRHjCd2gg2VhX/U2HZpgCM6r7kANsXj+FT13rHC8s27a+i6f+cWUABolDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14b589c579e903b6663ceeb35b8985094b92b5ce9f54decfb61a437101fddbd8","last_reissued_at":"2026-07-05T08:41:24.580983Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:41:24.580983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Potential Based Diffusion Motion Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"cs.RO","authors_text":"Chen Sun, Joshua B. Tenenbaum, Yilun Du, Yunhao Luo","submitted_at":"2024-07-08T17:48:39Z","abstract_excerpt":"Effective motion planning in high dimensional spaces is a long-standing open problem in robotics. One class of traditional motion planning algorithms corresponds to potential-based motion planning. An advantage of potential based motion planning is composability -- different motion constraints can be easily combined by adding corresponding potentials. However, constructing motion paths from potentials requires solving a global optimization across configuration space potential landscape, which is often prone to local minima. We propose a new approach towards learning potential based motion plan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.06169","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/2407.06169/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":"2407.06169","created_at":"2026-07-05T08:41:24.581038+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.06169v1","created_at":"2026-07-05T08:41:24.581038+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.06169","created_at":"2026-07-05T08:41:24.581038+00:00"},{"alias_kind":"pith_short_12","alias_value":"CS2YTRLZ5EB3","created_at":"2026-07-05T08:41:24.581038+00:00"},{"alias_kind":"pith_short_16","alias_value":"CS2YTRLZ5EB3MZR4","created_at":"2026-07-05T08:41:24.581038+00:00"},{"alias_kind":"pith_short_8","alias_value":"CS2YTRLZ","created_at":"2026-07-05T08:41:24.581038+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24208","citing_title":"Grounding Generative Policies in Physics: Optimization-Guided Diffusion for Robot Control","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28813","citing_title":"Human2Any: Human-to-Robot Transfer via Constraint-Aware Compositional Planning","ref_index":65,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27697","citing_title":"Simulation-Informed Diffusion for Decentralized Multi-robot Motion Planning","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2509.17244","citing_title":"Scalable Multi Agent Diffusion Policies for Coverage Control","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09999","citing_title":"Muninn: Your Trajectory Diffusion Model But Faster","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CS2YTRLZ5EB3MZR452ZVXCMFBF","json":"https://pith.science/pith/CS2YTRLZ5EB3MZR452ZVXCMFBF.json","graph_json":"https://pith.science/api/pith-number/CS2YTRLZ5EB3MZR452ZVXCMFBF/graph.json","events_json":"https://pith.science/api/pith-number/CS2YTRLZ5EB3MZR452ZVXCMFBF/events.json","paper":"https://pith.science/paper/CS2YTRLZ"},"agent_actions":{"view_html":"https://pith.science/pith/CS2YTRLZ5EB3MZR452ZVXCMFBF","download_json":"https://pith.science/pith/CS2YTRLZ5EB3MZR452ZVXCMFBF.json","view_paper":"https://pith.science/paper/CS2YTRLZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.06169&json=true","fetch_graph":"https://pith.science/api/pith-number/CS2YTRLZ5EB3MZR452ZVXCMFBF/graph.json","fetch_events":"https://pith.science/api/pith-number/CS2YTRLZ5EB3MZR452ZVXCMFBF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CS2YTRLZ5EB3MZR452ZVXCMFBF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CS2YTRLZ5EB3MZR452ZVXCMFBF/action/storage_attestation","attest_author":"https://pith.science/pith/CS2YTRLZ5EB3MZR452ZVXCMFBF/action/author_attestation","sign_citation":"https://pith.science/pith/CS2YTRLZ5EB3MZR452ZVXCMFBF/action/citation_signature","submit_replication":"https://pith.science/pith/CS2YTRLZ5EB3MZR452ZVXCMFBF/action/replication_record"}},"created_at":"2026-07-05T08:41:24.581038+00:00","updated_at":"2026-07-05T08:41:24.581038+00:00"}