{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DESIFDRSNNU52CEPWRAK27SFJB","short_pith_number":"pith:DESIFDRS","schema_version":"1.0","canonical_sha256":"1924828e326b69dd088fb440ad7e4548421709541c09cfcfc8696eb5f0e6d7a9","source":{"kind":"arxiv","id":"2408.06983","version":1},"attestation_state":"computed","paper":{"title":"Optimization-Based Model Checking and Trace Synthesis for Complex STL Specifications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Ichiro Hasuo, Jie An, Sota Sato, Zhenya Zhang","submitted_at":"2024-08-13T15:41:32Z","abstract_excerpt":"We present a bounded model checking algorithm for signal temporal logic (STL) that exploits mixed-integer linear programming (MILP). A key technical element is our novel MILP encoding of the STL semantics; it follows the idea of stable partitioning from the recent work on SMT-based STL model checking. Assuming that our (continuous-time) system models can be encoded to MILP -- typical examples are rectangular hybrid automata (precisely) and hybrid dynamics with closed-form solutions (approximately) -- our MILP encoding yields an optimization-based model checking algorithm that is scalable, is a"},"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":"2408.06983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2024-08-13T15:41:32Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"868946e02dc21be7311c0d4dd59dc8e494526f0b281ff6d1420fbda615a11d0f","abstract_canon_sha256":"c9866aeff47541c19bf8aeafbfade8b4d8c9bf890498c62c0c9eabe6e08204bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:55:04.582963Z","signature_b64":"5vN/q7zh/UqNS5aMEmy5vO5R8+JZhiPlwF1oOZI1NpfM3hHQVdzXfmRAwVNem6AhiUB9qTc9rVp2cSG3M6rvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1924828e326b69dd088fb440ad7e4548421709541c09cfcfc8696eb5f0e6d7a9","last_reissued_at":"2026-07-05T08:55:04.582554Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:55:04.582554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization-Based Model Checking and Trace Synthesis for Complex STL Specifications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Ichiro Hasuo, Jie An, Sota Sato, Zhenya Zhang","submitted_at":"2024-08-13T15:41:32Z","abstract_excerpt":"We present a bounded model checking algorithm for signal temporal logic (STL) that exploits mixed-integer linear programming (MILP). A key technical element is our novel MILP encoding of the STL semantics; it follows the idea of stable partitioning from the recent work on SMT-based STL model checking. Assuming that our (continuous-time) system models can be encoded to MILP -- typical examples are rectangular hybrid automata (precisely) and hybrid dynamics with closed-form solutions (approximately) -- our MILP encoding yields an optimization-based model checking algorithm that is scalable, is a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.06983","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/2408.06983/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":"2408.06983","created_at":"2026-07-05T08:55:04.582612+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.06983v1","created_at":"2026-07-05T08:55:04.582612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.06983","created_at":"2026-07-05T08:55:04.582612+00:00"},{"alias_kind":"pith_short_12","alias_value":"DESIFDRSNNU5","created_at":"2026-07-05T08:55:04.582612+00:00"},{"alias_kind":"pith_short_16","alias_value":"DESIFDRSNNU52CEP","created_at":"2026-07-05T08:55:04.582612+00:00"},{"alias_kind":"pith_short_8","alias_value":"DESIFDRS","created_at":"2026-07-05T08:55:04.582612+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/DESIFDRSNNU52CEPWRAK27SFJB","json":"https://pith.science/pith/DESIFDRSNNU52CEPWRAK27SFJB.json","graph_json":"https://pith.science/api/pith-number/DESIFDRSNNU52CEPWRAK27SFJB/graph.json","events_json":"https://pith.science/api/pith-number/DESIFDRSNNU52CEPWRAK27SFJB/events.json","paper":"https://pith.science/paper/DESIFDRS"},"agent_actions":{"view_html":"https://pith.science/pith/DESIFDRSNNU52CEPWRAK27SFJB","download_json":"https://pith.science/pith/DESIFDRSNNU52CEPWRAK27SFJB.json","view_paper":"https://pith.science/paper/DESIFDRS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.06983&json=true","fetch_graph":"https://pith.science/api/pith-number/DESIFDRSNNU52CEPWRAK27SFJB/graph.json","fetch_events":"https://pith.science/api/pith-number/DESIFDRSNNU52CEPWRAK27SFJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DESIFDRSNNU52CEPWRAK27SFJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DESIFDRSNNU52CEPWRAK27SFJB/action/storage_attestation","attest_author":"https://pith.science/pith/DESIFDRSNNU52CEPWRAK27SFJB/action/author_attestation","sign_citation":"https://pith.science/pith/DESIFDRSNNU52CEPWRAK27SFJB/action/citation_signature","submit_replication":"https://pith.science/pith/DESIFDRSNNU52CEPWRAK27SFJB/action/replication_record"}},"created_at":"2026-07-05T08:55:04.582612+00:00","updated_at":"2026-07-05T08:55:04.582612+00:00"}