{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QH65FCM56NXZNGWKA4KO2FF3B3","short_pith_number":"pith:QH65FCM5","schema_version":"1.0","canonical_sha256":"81fdd2899df36f969aca0714ed14bb0efd3c6070383da03a2fa22edce78e1b45","source":{"kind":"arxiv","id":"1105.1733","version":4},"attestation_state":"computed","paper":{"title":"Linear Hybrid System Falsification With Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Georgios Fainekos, Houssam Abbas","submitted_at":"2011-05-09T17:16:26Z","abstract_excerpt":"In this paper, we address the problem of local search for the falsification of hybrid automata with affine dynamics. Namely, if we are given a sequence of locations and a maximum simulation time, we return the trajectory that comes the closest to the unsafe set. In order to solve this problem, we formulate it as a differentiable optimization problem which we solve using Sequential Quadratic Programming. The purpose of developing such a local search method is to combine it with high level stochastic optimization algorithms in order to falsify hybrid systems with complex discrete dynamics and hi"},"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":"1105.1733","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-05-09T17:16:26Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"10e35fac99bedc246acb4ac042daadf50c739feea05b6b2094c7b04efc978e9e","abstract_canon_sha256":"7ff0d1fd1598c804620d2ad2d5f433c39154f095891672958d0630ae7de1e8c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:00.493461Z","signature_b64":"zcZ5Im+6IFn4I7QMuMoVJIXtFdLf2ECDNmFpev3bIBTWFMGDXNlNgdMlV7n2+jEjzRWb50c5maMDC7RQCivNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81fdd2899df36f969aca0714ed14bb0efd3c6070383da03a2fa22edce78e1b45","last_reissued_at":"2026-05-18T02:22:00.492740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:00.492740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Hybrid System Falsification With Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Georgios Fainekos, Houssam Abbas","submitted_at":"2011-05-09T17:16:26Z","abstract_excerpt":"In this paper, we address the problem of local search for the falsification of hybrid automata with affine dynamics. Namely, if we are given a sequence of locations and a maximum simulation time, we return the trajectory that comes the closest to the unsafe set. In order to solve this problem, we formulate it as a differentiable optimization problem which we solve using Sequential Quadratic Programming. The purpose of developing such a local search method is to combine it with high level stochastic optimization algorithms in order to falsify hybrid systems with complex discrete dynamics and hi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1733","kind":"arxiv","version":4},"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":"1105.1733","created_at":"2026-05-18T02:22:00.492835+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.1733v4","created_at":"2026-05-18T02:22:00.492835+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1733","created_at":"2026-05-18T02:22:00.492835+00:00"},{"alias_kind":"pith_short_12","alias_value":"QH65FCM56NXZ","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QH65FCM56NXZNGWK","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QH65FCM5","created_at":"2026-05-18T12:26:39.201973+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/QH65FCM56NXZNGWKA4KO2FF3B3","json":"https://pith.science/pith/QH65FCM56NXZNGWKA4KO2FF3B3.json","graph_json":"https://pith.science/api/pith-number/QH65FCM56NXZNGWKA4KO2FF3B3/graph.json","events_json":"https://pith.science/api/pith-number/QH65FCM56NXZNGWKA4KO2FF3B3/events.json","paper":"https://pith.science/paper/QH65FCM5"},"agent_actions":{"view_html":"https://pith.science/pith/QH65FCM56NXZNGWKA4KO2FF3B3","download_json":"https://pith.science/pith/QH65FCM56NXZNGWKA4KO2FF3B3.json","view_paper":"https://pith.science/paper/QH65FCM5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.1733&json=true","fetch_graph":"https://pith.science/api/pith-number/QH65FCM56NXZNGWKA4KO2FF3B3/graph.json","fetch_events":"https://pith.science/api/pith-number/QH65FCM56NXZNGWKA4KO2FF3B3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QH65FCM56NXZNGWKA4KO2FF3B3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QH65FCM56NXZNGWKA4KO2FF3B3/action/storage_attestation","attest_author":"https://pith.science/pith/QH65FCM56NXZNGWKA4KO2FF3B3/action/author_attestation","sign_citation":"https://pith.science/pith/QH65FCM56NXZNGWKA4KO2FF3B3/action/citation_signature","submit_replication":"https://pith.science/pith/QH65FCM56NXZNGWKA4KO2FF3B3/action/replication_record"}},"created_at":"2026-05-18T02:22:00.492835+00:00","updated_at":"2026-05-18T02:22:00.492835+00:00"}