{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5T6TUWNHVPFK3MUJ4SVAHR76XG","short_pith_number":"pith:5T6TUWNH","schema_version":"1.0","canonical_sha256":"ecfd3a59a7abcaadb289e4aa03c7feb9b841e17988bd9cba2a5a391a24cdc4e2","source":{"kind":"arxiv","id":"1905.03051","version":1},"attestation_state":"computed","paper":{"title":"Bayesian Optimization for Polynomial Time Probabilistically Complete STL Trajectory Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.RO","authors_text":"Hai Lin, Vince Kurtz","submitted_at":"2019-05-08T13:07:57Z","abstract_excerpt":"In recent years, Signal Temporal Logic (STL) has gained traction as a practical and expressive means of encoding control objectives for robotic and cyber-physical systems. The state-of-the-art in STL trajectory synthesis is to formulate the problem as a Mixed Integer Linear Program (MILP). The MILP approach is sound and complete for bounded specifications, but such strong correctness guarantees come at the price of exponential complexity in the number of predicates and the time bound of the specification. In this work, we propose an alternative synthesis paradigm that relies on Bayesian optimi"},"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":"1905.03051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-08T13:07:57Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"7976b68e82948cab4274fb2a9a7c61b8cceca9baed4e76e9e6dbf750d43012fb","abstract_canon_sha256":"28cff73803ee030f45a29978386bbdeb2d7327f52e8271031d11191f89914f20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:43.020812Z","signature_b64":"xwFqbpuoHELtH0d6iaPD5xV9wA0XxkTBxx4YuxKLjiaO0UPryN4x2BNZtBaKQsjLFLsSe009UpHtRbS4R8R6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecfd3a59a7abcaadb289e4aa03c7feb9b841e17988bd9cba2a5a391a24cdc4e2","last_reissued_at":"2026-05-17T23:46:43.020173Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:43.020173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Optimization for Polynomial Time Probabilistically Complete STL Trajectory Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.RO","authors_text":"Hai Lin, Vince Kurtz","submitted_at":"2019-05-08T13:07:57Z","abstract_excerpt":"In recent years, Signal Temporal Logic (STL) has gained traction as a practical and expressive means of encoding control objectives for robotic and cyber-physical systems. The state-of-the-art in STL trajectory synthesis is to formulate the problem as a Mixed Integer Linear Program (MILP). The MILP approach is sound and complete for bounded specifications, but such strong correctness guarantees come at the price of exponential complexity in the number of predicates and the time bound of the specification. In this work, we propose an alternative synthesis paradigm that relies on Bayesian optimi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03051","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":""},"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":"1905.03051","created_at":"2026-05-17T23:46:43.020266+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.03051v1","created_at":"2026-05-17T23:46:43.020266+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03051","created_at":"2026-05-17T23:46:43.020266+00:00"},{"alias_kind":"pith_short_12","alias_value":"5T6TUWNHVPFK","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5T6TUWNHVPFK3MUJ","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5T6TUWNH","created_at":"2026-05-18T12:33:10.108867+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/5T6TUWNHVPFK3MUJ4SVAHR76XG","json":"https://pith.science/pith/5T6TUWNHVPFK3MUJ4SVAHR76XG.json","graph_json":"https://pith.science/api/pith-number/5T6TUWNHVPFK3MUJ4SVAHR76XG/graph.json","events_json":"https://pith.science/api/pith-number/5T6TUWNHVPFK3MUJ4SVAHR76XG/events.json","paper":"https://pith.science/paper/5T6TUWNH"},"agent_actions":{"view_html":"https://pith.science/pith/5T6TUWNHVPFK3MUJ4SVAHR76XG","download_json":"https://pith.science/pith/5T6TUWNHVPFK3MUJ4SVAHR76XG.json","view_paper":"https://pith.science/paper/5T6TUWNH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.03051&json=true","fetch_graph":"https://pith.science/api/pith-number/5T6TUWNHVPFK3MUJ4SVAHR76XG/graph.json","fetch_events":"https://pith.science/api/pith-number/5T6TUWNHVPFK3MUJ4SVAHR76XG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5T6TUWNHVPFK3MUJ4SVAHR76XG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5T6TUWNHVPFK3MUJ4SVAHR76XG/action/storage_attestation","attest_author":"https://pith.science/pith/5T6TUWNHVPFK3MUJ4SVAHR76XG/action/author_attestation","sign_citation":"https://pith.science/pith/5T6TUWNHVPFK3MUJ4SVAHR76XG/action/citation_signature","submit_replication":"https://pith.science/pith/5T6TUWNHVPFK3MUJ4SVAHR76XG/action/replication_record"}},"created_at":"2026-05-17T23:46:43.020266+00:00","updated_at":"2026-05-17T23:46:43.020266+00:00"}