{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DL5OCMEMVSJNL7QXIYGXJEUTX4","short_pith_number":"pith:DL5OCMEM","canonical_record":{"source":{"id":"2406.05846","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-09T16:34:03Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"a8fc559a5e5db6d4d10098a2fd5590f422b9d5fc57e678ad8efb1c0437502759","abstract_canon_sha256":"0822c206a4076ecc48ab065b7f45cf8c493342b7dcf2413fe14191b0b74e29c9"},"schema_version":"1.0"},"canonical_sha256":"1afae1308cac92d5fe17460d749293bf18207b3502760fad1f8e6af66f339a1c","source":{"kind":"arxiv","id":"2406.05846","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.05846","created_at":"2026-07-05T09:02:21Z"},{"alias_kind":"arxiv_version","alias_value":"2406.05846v3","created_at":"2026-07-05T09:02:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.05846","created_at":"2026-07-05T09:02:21Z"},{"alias_kind":"pith_short_12","alias_value":"DL5OCMEMVSJN","created_at":"2026-07-05T09:02:21Z"},{"alias_kind":"pith_short_16","alias_value":"DL5OCMEMVSJNL7QX","created_at":"2026-07-05T09:02:21Z"},{"alias_kind":"pith_short_8","alias_value":"DL5OCMEM","created_at":"2026-07-05T09:02:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DL5OCMEMVSJNL7QXIYGXJEUTX4","target":"record","payload":{"canonical_record":{"source":{"id":"2406.05846","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-09T16:34:03Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"a8fc559a5e5db6d4d10098a2fd5590f422b9d5fc57e678ad8efb1c0437502759","abstract_canon_sha256":"0822c206a4076ecc48ab065b7f45cf8c493342b7dcf2413fe14191b0b74e29c9"},"schema_version":"1.0"},"canonical_sha256":"1afae1308cac92d5fe17460d749293bf18207b3502760fad1f8e6af66f339a1c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:02:21.027141Z","signature_b64":"r2N7ElnSOnXPkKOxNMHwxRketxlywd0TsYvOoliOh9FrC/dhj+IVjr2QnfY0eUCqNnCPkcLgmVyZmTNoJLjGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1afae1308cac92d5fe17460d749293bf18207b3502760fad1f8e6af66f339a1c","last_reissued_at":"2026-07-05T09:02:21.026680Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:02:21.026680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.05846","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:02:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vdl0YYXPJQJ+N9hDeMm3GDc/3WmIspjpEECPHARPCWON143xjZMm1dkMvJawZ9AxNhRa80kTfDihx7fC2aMGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T22:17:08.923125Z"},"content_sha256":"cfc2b6901292975517377c79e524f861eabf45a9deab0d055096b8c8851764f9","schema_version":"1.0","event_id":"sha256:cfc2b6901292975517377c79e524f861eabf45a9deab0d055096b8c8851764f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DL5OCMEMVSJNL7QXIYGXJEUTX4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and Certifiable Trajectory Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"math.OC","authors_text":"Heng Yang, Jay Sarva, Ling Liang, Shucheng Kang, Xiaoyang Xu","submitted_at":"2024-06-09T16:34:03Z","abstract_excerpt":"We propose semidefinite trajectory optimization (STROM), a framework that computes fast and certifiably optimal solutions for nonconvex trajectory optimization problems defined by polynomial objectives and constraints. STROM employs sparse second-order Lasserre's hierarchy to generate semidefinite program (SDP) relaxations of trajectory optimization. Different from existing tools (e.g., YALMIP and SOSTOOLS in Matlab), STROM generates chain-like multiple-block SDPs with only positive semidefinite (PSD) variables. Moreover, STROM does so two orders of magnitude faster. Underpinning STROM is cuAD"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.05846","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/2406.05846/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:02:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DMf+mby6Yqr1fXyqsphcKvtVJI2bQ8/uMTqCu4MPxVbhlRrCqU0jRTHA7+IzRypBPNehjnSf8K3HhzCYIIV6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T22:17:08.923593Z"},"content_sha256":"6b06e76faa6c32d9e71ccd0d16509328a0c75f6dd3a0c807a8370953b80d92eb","schema_version":"1.0","event_id":"sha256:6b06e76faa6c32d9e71ccd0d16509328a0c75f6dd3a0c807a8370953b80d92eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DL5OCMEMVSJNL7QXIYGXJEUTX4/bundle.json","state_url":"https://pith.science/pith/DL5OCMEMVSJNL7QXIYGXJEUTX4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DL5OCMEMVSJNL7QXIYGXJEUTX4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-10T22:17:08Z","links":{"resolver":"https://pith.science/pith/DL5OCMEMVSJNL7QXIYGXJEUTX4","bundle":"https://pith.science/pith/DL5OCMEMVSJNL7QXIYGXJEUTX4/bundle.json","state":"https://pith.science/pith/DL5OCMEMVSJNL7QXIYGXJEUTX4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DL5OCMEMVSJNL7QXIYGXJEUTX4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DL5OCMEMVSJNL7QXIYGXJEUTX4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0822c206a4076ecc48ab065b7f45cf8c493342b7dcf2413fe14191b0b74e29c9","cross_cats_sorted":["cs.RO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-09T16:34:03Z","title_canon_sha256":"a8fc559a5e5db6d4d10098a2fd5590f422b9d5fc57e678ad8efb1c0437502759"},"schema_version":"1.0","source":{"id":"2406.05846","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.05846","created_at":"2026-07-05T09:02:21Z"},{"alias_kind":"arxiv_version","alias_value":"2406.05846v3","created_at":"2026-07-05T09:02:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.05846","created_at":"2026-07-05T09:02:21Z"},{"alias_kind":"pith_short_12","alias_value":"DL5OCMEMVSJN","created_at":"2026-07-05T09:02:21Z"},{"alias_kind":"pith_short_16","alias_value":"DL5OCMEMVSJNL7QX","created_at":"2026-07-05T09:02:21Z"},{"alias_kind":"pith_short_8","alias_value":"DL5OCMEM","created_at":"2026-07-05T09:02:21Z"}],"graph_snapshots":[{"event_id":"sha256:6b06e76faa6c32d9e71ccd0d16509328a0c75f6dd3a0c807a8370953b80d92eb","target":"graph","created_at":"2026-07-05T09:02:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2406.05846/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose semidefinite trajectory optimization (STROM), a framework that computes fast and certifiably optimal solutions for nonconvex trajectory optimization problems defined by polynomial objectives and constraints. STROM employs sparse second-order Lasserre's hierarchy to generate semidefinite program (SDP) relaxations of trajectory optimization. Different from existing tools (e.g., YALMIP and SOSTOOLS in Matlab), STROM generates chain-like multiple-block SDPs with only positive semidefinite (PSD) variables. Moreover, STROM does so two orders of magnitude faster. Underpinning STROM is cuAD","authors_text":"Heng Yang, Jay Sarva, Ling Liang, Shucheng Kang, Xiaoyang Xu","cross_cats":["cs.RO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-09T16:34:03Z","title":"Fast and Certifiable Trajectory Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.05846","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cfc2b6901292975517377c79e524f861eabf45a9deab0d055096b8c8851764f9","target":"record","created_at":"2026-07-05T09:02:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0822c206a4076ecc48ab065b7f45cf8c493342b7dcf2413fe14191b0b74e29c9","cross_cats_sorted":["cs.RO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-09T16:34:03Z","title_canon_sha256":"a8fc559a5e5db6d4d10098a2fd5590f422b9d5fc57e678ad8efb1c0437502759"},"schema_version":"1.0","source":{"id":"2406.05846","kind":"arxiv","version":3}},"canonical_sha256":"1afae1308cac92d5fe17460d749293bf18207b3502760fad1f8e6af66f339a1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1afae1308cac92d5fe17460d749293bf18207b3502760fad1f8e6af66f339a1c","first_computed_at":"2026-07-05T09:02:21.026680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:02:21.026680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r2N7ElnSOnXPkKOxNMHwxRketxlywd0TsYvOoliOh9FrC/dhj+IVjr2QnfY0eUCqNnCPkcLgmVyZmTNoJLjGCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:02:21.027141Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.05846","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cfc2b6901292975517377c79e524f861eabf45a9deab0d055096b8c8851764f9","sha256:6b06e76faa6c32d9e71ccd0d16509328a0c75f6dd3a0c807a8370953b80d92eb"],"state_sha256":"fe066d4e7f6bd32e23d0bdf192edc92644ddcc35a768ce0fd8da502a44fe75f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zniNJcTrx3O90AOq1NzVOB8nKrD/JS6Oeq/vZEe5iJs/uNO1jeltCLv5rIna5kKagjPK8orfPZ5V6fpFjMBCDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T22:17:08.928203Z","bundle_sha256":"1abb6ce04a6f41377ef0eccdef383e51072ba0a9514a164c28047656babefc2d"}}