{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UQ5B65WR4PQZQNAEXMYIFWD3JI","short_pith_number":"pith:UQ5B65WR","canonical_record":{"source":{"id":"2504.18978","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-04-26T17:32:53Z","cross_cats_sorted":[],"title_canon_sha256":"369f3023be4c9552b3320f0e2735f0df1e5eef56ade758870b57a05cb543eb65","abstract_canon_sha256":"77925adde7e30d63fa156678667b8dd537c3cede059a88342a94a018005a4a0e"},"schema_version":"1.0"},"canonical_sha256":"a43a1f76d1e3e1983404bb3082d87b4a1108ba210336deca51d58a20f4eb8e94","source":{"kind":"arxiv","id":"2504.18978","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.18978","created_at":"2026-07-05T10:54:49Z"},{"alias_kind":"arxiv_version","alias_value":"2504.18978v1","created_at":"2026-07-05T10:54:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.18978","created_at":"2026-07-05T10:54:49Z"},{"alias_kind":"pith_short_12","alias_value":"UQ5B65WR4PQZ","created_at":"2026-07-05T10:54:49Z"},{"alias_kind":"pith_short_16","alias_value":"UQ5B65WR4PQZQNAE","created_at":"2026-07-05T10:54:49Z"},{"alias_kind":"pith_short_8","alias_value":"UQ5B65WR","created_at":"2026-07-05T10:54:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UQ5B65WR4PQZQNAEXMYIFWD3JI","target":"record","payload":{"canonical_record":{"source":{"id":"2504.18978","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-04-26T17:32:53Z","cross_cats_sorted":[],"title_canon_sha256":"369f3023be4c9552b3320f0e2735f0df1e5eef56ade758870b57a05cb543eb65","abstract_canon_sha256":"77925adde7e30d63fa156678667b8dd537c3cede059a88342a94a018005a4a0e"},"schema_version":"1.0"},"canonical_sha256":"a43a1f76d1e3e1983404bb3082d87b4a1108ba210336deca51d58a20f4eb8e94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:54:49.886843Z","signature_b64":"gBXoYbaqu1IaY1fJIIr0fsCBideXLFu+t49SCGS8JPGsKQN0P41uROC43UqNI+R5/QFa3rpEjoCJFdZb8I2XDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a43a1f76d1e3e1983404bb3082d87b4a1108ba210336deca51d58a20f4eb8e94","last_reissued_at":"2026-07-05T10:54:49.886343Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:54:49.886343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.18978","source_version":1,"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-05T10:54:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9rJtLUyxxKAtI5mR0a8b9jT7sxaD8tNZ+I4JsLlOHXorGnTkmhLSGYYgEO1XRQ3u6aJ2/DOi1h8z+yqeYsOvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T01:57:18.458848Z"},"content_sha256":"b361d7171f817f9fa4a7b987fae6a7ef936aa1641894a9493090a49ab991ef77","schema_version":"1.0","event_id":"sha256:b361d7171f817f9fa4a7b987fae6a7ef936aa1641894a9493090a49ab991ef77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UQ5B65WR4PQZQNAEXMYIFWD3JI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A biconvex method for minimum-time motion planning through sequences of convex sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Andrew D. Marchese, Dongchan Lee, Mathew Halm, Tobia Marcucci, Will Yang","submitted_at":"2025-04-26T17:32:53Z","abstract_excerpt":"We consider the problem of designing a smooth trajectory that traverses a sequence of convex sets in minimum time, while satisfying given velocity and acceleration constraints. This problem is naturally formulated as a nonconvex program. To solve it, we propose a biconvex method that quickly produces an initial trajectory and iteratively refines it by solving two convex subproblems in alternation. This method is guaranteed to converge, returns a feasible trajectory even if stopped early, and does not require the selection of any line-search or trust-region parameter. Exhaustive experiments sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.18978","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/2504.18978/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-05T10:54:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d90FhKYyj/kCsUNcITQwnjWF3NF4m17lzht8tzxPbUVhf9FSZ9hrbR7L97KlvAYLimqMHfJytQW+eQHCCnUnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T01:57:18.459726Z"},"content_sha256":"180ea2f59098ddc9b791aad8899767fd1fd8b1b84e66a0b0b49c982318d9c906","schema_version":"1.0","event_id":"sha256:180ea2f59098ddc9b791aad8899767fd1fd8b1b84e66a0b0b49c982318d9c906"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UQ5B65WR4PQZQNAEXMYIFWD3JI/bundle.json","state_url":"https://pith.science/pith/UQ5B65WR4PQZQNAEXMYIFWD3JI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UQ5B65WR4PQZQNAEXMYIFWD3JI/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-17T01:57:18Z","links":{"resolver":"https://pith.science/pith/UQ5B65WR4PQZQNAEXMYIFWD3JI","bundle":"https://pith.science/pith/UQ5B65WR4PQZQNAEXMYIFWD3JI/bundle.json","state":"https://pith.science/pith/UQ5B65WR4PQZQNAEXMYIFWD3JI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UQ5B65WR4PQZQNAEXMYIFWD3JI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UQ5B65WR4PQZQNAEXMYIFWD3JI","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":"77925adde7e30d63fa156678667b8dd537c3cede059a88342a94a018005a4a0e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-04-26T17:32:53Z","title_canon_sha256":"369f3023be4c9552b3320f0e2735f0df1e5eef56ade758870b57a05cb543eb65"},"schema_version":"1.0","source":{"id":"2504.18978","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.18978","created_at":"2026-07-05T10:54:49Z"},{"alias_kind":"arxiv_version","alias_value":"2504.18978v1","created_at":"2026-07-05T10:54:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.18978","created_at":"2026-07-05T10:54:49Z"},{"alias_kind":"pith_short_12","alias_value":"UQ5B65WR4PQZ","created_at":"2026-07-05T10:54:49Z"},{"alias_kind":"pith_short_16","alias_value":"UQ5B65WR4PQZQNAE","created_at":"2026-07-05T10:54:49Z"},{"alias_kind":"pith_short_8","alias_value":"UQ5B65WR","created_at":"2026-07-05T10:54:49Z"}],"graph_snapshots":[{"event_id":"sha256:180ea2f59098ddc9b791aad8899767fd1fd8b1b84e66a0b0b49c982318d9c906","target":"graph","created_at":"2026-07-05T10:54:49Z","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/2504.18978/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of designing a smooth trajectory that traverses a sequence of convex sets in minimum time, while satisfying given velocity and acceleration constraints. This problem is naturally formulated as a nonconvex program. To solve it, we propose a biconvex method that quickly produces an initial trajectory and iteratively refines it by solving two convex subproblems in alternation. This method is guaranteed to converge, returns a feasible trajectory even if stopped early, and does not require the selection of any line-search or trust-region parameter. Exhaustive experiments sho","authors_text":"Andrew D. Marchese, Dongchan Lee, Mathew Halm, Tobia Marcucci, Will Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.18978","kind":"arxiv","version":1},"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:b361d7171f817f9fa4a7b987fae6a7ef936aa1641894a9493090a49ab991ef77","target":"record","created_at":"2026-07-05T10:54:49Z","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":"77925adde7e30d63fa156678667b8dd537c3cede059a88342a94a018005a4a0e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-04-26T17:32:53Z","title_canon_sha256":"369f3023be4c9552b3320f0e2735f0df1e5eef56ade758870b57a05cb543eb65"},"schema_version":"1.0","source":{"id":"2504.18978","kind":"arxiv","version":1}},"canonical_sha256":"a43a1f76d1e3e1983404bb3082d87b4a1108ba210336deca51d58a20f4eb8e94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a43a1f76d1e3e1983404bb3082d87b4a1108ba210336deca51d58a20f4eb8e94","first_computed_at":"2026-07-05T10:54:49.886343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:54:49.886343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gBXoYbaqu1IaY1fJIIr0fsCBideXLFu+t49SCGS8JPGsKQN0P41uROC43UqNI+R5/QFa3rpEjoCJFdZb8I2XDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:54:49.886843Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.18978","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b361d7171f817f9fa4a7b987fae6a7ef936aa1641894a9493090a49ab991ef77","sha256:180ea2f59098ddc9b791aad8899767fd1fd8b1b84e66a0b0b49c982318d9c906"],"state_sha256":"aeac9eec0186a1108b49fe61d3a65ba5318ed3bc5f52a45d08fbe5351b22a35c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qpugn7C81+xHqeWiiSuk1I5xpncopSbmkkXcSHA+hLvjlH2/uxx3/c2Dg9LKDGKzt1T8zqVa7augNbZyE+ifCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T01:57:18.465635Z","bundle_sha256":"9a561abbbc21a7be2d9e1bbd3f8322f76597fe4574fa8744f04a852f03a791a2"}}