{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2JDQQVA2IMUTC3GNW4JUQX2GY5","short_pith_number":"pith:2JDQQVA2","schema_version":"1.0","canonical_sha256":"d24708541a4329316ccdb713485f46c7402e14d111df30303a561f769099a6f7","source":{"kind":"arxiv","id":"2504.13170","version":1},"attestation_state":"computed","paper":{"title":"A New Semidefinite Relaxation for Linear and Piecewise-Affine Optimal Control with Time Scaling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY","math.OC"],"primary_cat":"cs.RO","authors_text":"Lujie Yang, Pablo A. Parrilo, Russ Tedrake, Tobia Marcucci","submitted_at":"2025-04-17T17:59:23Z","abstract_excerpt":"We introduce a semidefinite relaxation for optimal control of linear systems with time scaling. These problems are inherently nonconvex, since the system dynamics involves bilinear products between the discretization time step and the system state and controls. The proposed relaxation is closely related to the standard second-order semidefinite relaxation for quadratic constraints, but we carefully select a subset of the possible bilinear terms and apply a change of variables to achieve empirically tight relaxations while keeping the computational load light. We further extend our method to ha"},"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":"2504.13170","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-04-17T17:59:23Z","cross_cats_sorted":["cs.SY","eess.SY","math.OC"],"title_canon_sha256":"ddb2402740cae4aea09475b679d69025bb036ce35499448d37b7e93c33a14347","abstract_canon_sha256":"841067a7e501430f7ec0247751d3f9b755925ac3d9a98092034aa5b88b602738"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:50:38.830103Z","signature_b64":"GbBDBj7tTzwCl0cB9nnFEgtSfRn2Dfqqz5yxiB8QRkY78CG8gunnLgIIRnGnjn3NAtFrGX2VU4PbiRilRo7XBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d24708541a4329316ccdb713485f46c7402e14d111df30303a561f769099a6f7","last_reissued_at":"2026-07-05T10:50:38.829620Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:50:38.829620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Semidefinite Relaxation for Linear and Piecewise-Affine Optimal Control with Time Scaling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY","math.OC"],"primary_cat":"cs.RO","authors_text":"Lujie Yang, Pablo A. Parrilo, Russ Tedrake, Tobia Marcucci","submitted_at":"2025-04-17T17:59:23Z","abstract_excerpt":"We introduce a semidefinite relaxation for optimal control of linear systems with time scaling. These problems are inherently nonconvex, since the system dynamics involves bilinear products between the discretization time step and the system state and controls. The proposed relaxation is closely related to the standard second-order semidefinite relaxation for quadratic constraints, but we carefully select a subset of the possible bilinear terms and apply a change of variables to achieve empirically tight relaxations while keeping the computational load light. We further extend our method to ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.13170","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.13170/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":"2504.13170","created_at":"2026-07-05T10:50:38.829686+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.13170v1","created_at":"2026-07-05T10:50:38.829686+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.13170","created_at":"2026-07-05T10:50:38.829686+00:00"},{"alias_kind":"pith_short_12","alias_value":"2JDQQVA2IMUT","created_at":"2026-07-05T10:50:38.829686+00:00"},{"alias_kind":"pith_short_16","alias_value":"2JDQQVA2IMUTC3GN","created_at":"2026-07-05T10:50:38.829686+00:00"},{"alias_kind":"pith_short_8","alias_value":"2JDQQVA2","created_at":"2026-07-05T10:50:38.829686+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.18978","citing_title":"A biconvex method for minimum-time motion planning through sequences of convex sets","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2JDQQVA2IMUTC3GNW4JUQX2GY5","json":"https://pith.science/pith/2JDQQVA2IMUTC3GNW4JUQX2GY5.json","graph_json":"https://pith.science/api/pith-number/2JDQQVA2IMUTC3GNW4JUQX2GY5/graph.json","events_json":"https://pith.science/api/pith-number/2JDQQVA2IMUTC3GNW4JUQX2GY5/events.json","paper":"https://pith.science/paper/2JDQQVA2"},"agent_actions":{"view_html":"https://pith.science/pith/2JDQQVA2IMUTC3GNW4JUQX2GY5","download_json":"https://pith.science/pith/2JDQQVA2IMUTC3GNW4JUQX2GY5.json","view_paper":"https://pith.science/paper/2JDQQVA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.13170&json=true","fetch_graph":"https://pith.science/api/pith-number/2JDQQVA2IMUTC3GNW4JUQX2GY5/graph.json","fetch_events":"https://pith.science/api/pith-number/2JDQQVA2IMUTC3GNW4JUQX2GY5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2JDQQVA2IMUTC3GNW4JUQX2GY5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2JDQQVA2IMUTC3GNW4JUQX2GY5/action/storage_attestation","attest_author":"https://pith.science/pith/2JDQQVA2IMUTC3GNW4JUQX2GY5/action/author_attestation","sign_citation":"https://pith.science/pith/2JDQQVA2IMUTC3GNW4JUQX2GY5/action/citation_signature","submit_replication":"https://pith.science/pith/2JDQQVA2IMUTC3GNW4JUQX2GY5/action/replication_record"}},"created_at":"2026-07-05T10:50:38.829686+00:00","updated_at":"2026-07-05T10:50:38.829686+00:00"}