{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3PEOJ62LJ5FVUUOHKCVA64B75P","short_pith_number":"pith:3PEOJ62L","schema_version":"1.0","canonical_sha256":"dbc8e4fb4b4f4b5a51c750aa0f703febff0b37fb98c53597f6e6eb03d2fc37df","source":{"kind":"arxiv","id":"2507.10290","version":2},"attestation_state":"computed","paper":{"title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Chao Xu, Fei Gao, Guodong Liu, Jiajun Yu, Nanhe Chen, Yanjun Cao","submitted_at":"2025-07-14T13:56:59Z","abstract_excerpt":"Optimization has been widely used to generate smooth trajectories for motion planning. However, existing trajectory optimization methods show weakness when dealing with large-scale long trajectories. Recent advances in parallel computing have accelerated optimization in some fields, but how to efficiently solve trajectory optimization via parallelism remains an open question. In this paper, we propose a novel trajectory optimization framework based on the Consensus Alternating Direction Method of Multipliers (CADMM) algorithm, which decomposes the trajectory into multiple segments and solves t"},"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":"2507.10290","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-07-14T13:56:59Z","cross_cats_sorted":[],"title_canon_sha256":"0e953460ba855cb692abf105251b1cd05973c318bfd7b420438f676a7b2b5dd7","abstract_canon_sha256":"512fe581e8eb59801d9b7dd3a208d0c378df3356392d22eb8354d9e445febaf1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:31.794497Z","signature_b64":"p1iy1F1Rrb+O1EVFWYLmZzFdCCDu2sNDHnvVAuOCwVAYkAbnqKaNSB86k3z65KB3L2l2xdrxxCI8nk6jrENkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbc8e4fb4b4f4b5a51c750aa0f703febff0b37fb98c53597f6e6eb03d2fc37df","last_reissued_at":"2026-07-05T11:38:31.794026Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:31.794026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Chao Xu, Fei Gao, Guodong Liu, Jiajun Yu, Nanhe Chen, Yanjun Cao","submitted_at":"2025-07-14T13:56:59Z","abstract_excerpt":"Optimization has been widely used to generate smooth trajectories for motion planning. However, existing trajectory optimization methods show weakness when dealing with large-scale long trajectories. Recent advances in parallel computing have accelerated optimization in some fields, but how to efficiently solve trajectory optimization via parallelism remains an open question. In this paper, we propose a novel trajectory optimization framework based on the Consensus Alternating Direction Method of Multipliers (CADMM) algorithm, which decomposes the trajectory into multiple segments and solves t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.10290","kind":"arxiv","version":2},"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/2507.10290/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":"2507.10290","created_at":"2026-07-05T11:38:31.794084+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.10290v2","created_at":"2026-07-05T11:38:31.794084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.10290","created_at":"2026-07-05T11:38:31.794084+00:00"},{"alias_kind":"pith_short_12","alias_value":"3PEOJ62LJ5FV","created_at":"2026-07-05T11:38:31.794084+00:00"},{"alias_kind":"pith_short_16","alias_value":"3PEOJ62LJ5FVUUOH","created_at":"2026-07-05T11:38:31.794084+00:00"},{"alias_kind":"pith_short_8","alias_value":"3PEOJ62L","created_at":"2026-07-05T11:38:31.794084+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3PEOJ62LJ5FVUUOHKCVA64B75P","json":"https://pith.science/pith/3PEOJ62LJ5FVUUOHKCVA64B75P.json","graph_json":"https://pith.science/api/pith-number/3PEOJ62LJ5FVUUOHKCVA64B75P/graph.json","events_json":"https://pith.science/api/pith-number/3PEOJ62LJ5FVUUOHKCVA64B75P/events.json","paper":"https://pith.science/paper/3PEOJ62L"},"agent_actions":{"view_html":"https://pith.science/pith/3PEOJ62LJ5FVUUOHKCVA64B75P","download_json":"https://pith.science/pith/3PEOJ62LJ5FVUUOHKCVA64B75P.json","view_paper":"https://pith.science/paper/3PEOJ62L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.10290&json=true","fetch_graph":"https://pith.science/api/pith-number/3PEOJ62LJ5FVUUOHKCVA64B75P/graph.json","fetch_events":"https://pith.science/api/pith-number/3PEOJ62LJ5FVUUOHKCVA64B75P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3PEOJ62LJ5FVUUOHKCVA64B75P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3PEOJ62LJ5FVUUOHKCVA64B75P/action/storage_attestation","attest_author":"https://pith.science/pith/3PEOJ62LJ5FVUUOHKCVA64B75P/action/author_attestation","sign_citation":"https://pith.science/pith/3PEOJ62LJ5FVUUOHKCVA64B75P/action/citation_signature","submit_replication":"https://pith.science/pith/3PEOJ62LJ5FVUUOHKCVA64B75P/action/replication_record"}},"created_at":"2026-07-05T11:38:31.794084+00:00","updated_at":"2026-07-05T11:38:31.794084+00:00"}