{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BIMEWRN5C3DSSR3TIF2QML2NPD","short_pith_number":"pith:BIMEWRN5","schema_version":"1.0","canonical_sha256":"0a184b45bd16c72947734175062f4d78e13320001746747810e11e16907b4dc3","source":{"kind":"arxiv","id":"2403.05571","version":4},"attestation_state":"computed","paper":{"title":"DiffuSolve: Diffusion-based Solver for Non-convex Trajectory Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.RO","authors_text":"Adji Bousso Dieng, Anjian Li, Ryne Beeson, Zihan Ding","submitted_at":"2024-02-22T03:52:17Z","abstract_excerpt":"Optimal trajectory design is computationally expensive for nonlinear and high-dimensional dynamical systems. The challenge arises from the non-convex nature of the optimization problem with multiple local optima, which usually requires a global search. Traditional numerical solvers struggle to find diverse solutions efficiently without appropriate initial guesses. In this paper, we introduce DiffuSolve, a general diffusion model-based solver for non-convex trajectory optimization. An expressive diffusion model is trained on pre-collected locally optimal solutions and efficiently samples initia"},"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.05571","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-02-22T03:52:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4f7e7c2b5ecad7ff25eab560272a16713b5220ae3dad86d8298e1d626ef42e60","abstract_canon_sha256":"a26f18acdd116252e100dc8372157b0c9031e2d885bad7f0154d5a346c657d8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:30.518131Z","signature_b64":"ArjARdFM9bsZF10bNjC6FOVP2nJxs2py6odGjji2YLc+zgq67pitxPDyFtKWDqTZ7oy222ctzt3zSaWCJS0VAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a184b45bd16c72947734175062f4d78e13320001746747810e11e16907b4dc3","last_reissued_at":"2026-07-05T09:15:30.517639Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:30.517639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DiffuSolve: Diffusion-based Solver for Non-convex Trajectory Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.RO","authors_text":"Adji Bousso Dieng, Anjian Li, Ryne Beeson, Zihan Ding","submitted_at":"2024-02-22T03:52:17Z","abstract_excerpt":"Optimal trajectory design is computationally expensive for nonlinear and high-dimensional dynamical systems. The challenge arises from the non-convex nature of the optimization problem with multiple local optima, which usually requires a global search. Traditional numerical solvers struggle to find diverse solutions efficiently without appropriate initial guesses. In this paper, we introduce DiffuSolve, a general diffusion model-based solver for non-convex trajectory optimization. An expressive diffusion model is trained on pre-collected locally optimal solutions and efficiently samples initia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.05571","kind":"arxiv","version":4},"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.05571/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.05571","created_at":"2026-07-05T09:15:30.517698+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.05571v4","created_at":"2026-07-05T09:15:30.517698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.05571","created_at":"2026-07-05T09:15:30.517698+00:00"},{"alias_kind":"pith_short_12","alias_value":"BIMEWRN5C3DS","created_at":"2026-07-05T09:15:30.517698+00:00"},{"alias_kind":"pith_short_16","alias_value":"BIMEWRN5C3DSSR3T","created_at":"2026-07-05T09:15:30.517698+00:00"},{"alias_kind":"pith_short_8","alias_value":"BIMEWRN5","created_at":"2026-07-05T09:15:30.517698+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":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19011","citing_title":"Accelerating trajectory optimization with Sobolev-trained diffusion policies","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BIMEWRN5C3DSSR3TIF2QML2NPD","json":"https://pith.science/pith/BIMEWRN5C3DSSR3TIF2QML2NPD.json","graph_json":"https://pith.science/api/pith-number/BIMEWRN5C3DSSR3TIF2QML2NPD/graph.json","events_json":"https://pith.science/api/pith-number/BIMEWRN5C3DSSR3TIF2QML2NPD/events.json","paper":"https://pith.science/paper/BIMEWRN5"},"agent_actions":{"view_html":"https://pith.science/pith/BIMEWRN5C3DSSR3TIF2QML2NPD","download_json":"https://pith.science/pith/BIMEWRN5C3DSSR3TIF2QML2NPD.json","view_paper":"https://pith.science/paper/BIMEWRN5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.05571&json=true","fetch_graph":"https://pith.science/api/pith-number/BIMEWRN5C3DSSR3TIF2QML2NPD/graph.json","fetch_events":"https://pith.science/api/pith-number/BIMEWRN5C3DSSR3TIF2QML2NPD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BIMEWRN5C3DSSR3TIF2QML2NPD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BIMEWRN5C3DSSR3TIF2QML2NPD/action/storage_attestation","attest_author":"https://pith.science/pith/BIMEWRN5C3DSSR3TIF2QML2NPD/action/author_attestation","sign_citation":"https://pith.science/pith/BIMEWRN5C3DSSR3TIF2QML2NPD/action/citation_signature","submit_replication":"https://pith.science/pith/BIMEWRN5C3DSSR3TIF2QML2NPD/action/replication_record"}},"created_at":"2026-07-05T09:15:30.517698+00:00","updated_at":"2026-07-05T09:15:30.517698+00:00"}