{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QH65FCM56NXZNGWKA4KO2FF3B3","short_pith_number":"pith:QH65FCM5","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"},"canonical_sha256":"81fdd2899df36f969aca0714ed14bb0efd3c6070383da03a2fa22edce78e1b45","source":{"kind":"arxiv","id":"1105.1733","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.1733","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"arxiv_version","alias_value":"1105.1733v4","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1733","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"pith_short_12","alias_value":"QH65FCM56NXZ","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QH65FCM56NXZNGWK","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QH65FCM5","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QH65FCM56NXZNGWKA4KO2FF3B3","target":"record","payload":{"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"},"canonical_sha256":"81fdd2899df36f969aca0714ed14bb0efd3c6070383da03a2fa22edce78e1b45","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"},"source_kind":"arxiv","source_id":"1105.1733","source_version":4,"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-05-18T02:22:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hUK/zVXIhNjq2L4JHndoJP/J1/E1My1faJ9fxEzr7UT2kEmBJEZChPWSXJ/UrVM/8DqHeArRWFelFKC44aBXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T02:56:52.480743Z"},"content_sha256":"f2bf20d407632dbc8cfb684afb204a63253061d6987f1e7c510e52633ca9b1d3","schema_version":"1.0","event_id":"sha256:f2bf20d407632dbc8cfb684afb204a63253061d6987f1e7c510e52633ca9b1d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QH65FCM56NXZNGWKA4KO2FF3B3","target":"graph","payload":{"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"},"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-05-18T02:22:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t6x1fBR/yfaTdoZO9kGDi6G0dVety+DGQ39ksIGeo1Be7NhtoCuaAxr6cVfwswDwpPe1MXYwXdNu1peDO1YVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T02:56:52.481484Z"},"content_sha256":"e7076c416c34566d7f4d903c4a4e8bf1d96f0df86f2d10076f886ba964813cf6","schema_version":"1.0","event_id":"sha256:e7076c416c34566d7f4d903c4a4e8bf1d96f0df86f2d10076f886ba964813cf6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QH65FCM56NXZNGWKA4KO2FF3B3/bundle.json","state_url":"https://pith.science/pith/QH65FCM56NXZNGWKA4KO2FF3B3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QH65FCM56NXZNGWKA4KO2FF3B3/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-05-23T02:56:52Z","links":{"resolver":"https://pith.science/pith/QH65FCM56NXZNGWKA4KO2FF3B3","bundle":"https://pith.science/pith/QH65FCM56NXZNGWKA4KO2FF3B3/bundle.json","state":"https://pith.science/pith/QH65FCM56NXZNGWKA4KO2FF3B3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QH65FCM56NXZNGWKA4KO2FF3B3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QH65FCM56NXZNGWKA4KO2FF3B3","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":"7ff0d1fd1598c804620d2ad2d5f433c39154f095891672958d0630ae7de1e8c1","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-05-09T17:16:26Z","title_canon_sha256":"10e35fac99bedc246acb4ac042daadf50c739feea05b6b2094c7b04efc978e9e"},"schema_version":"1.0","source":{"id":"1105.1733","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.1733","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"arxiv_version","alias_value":"1105.1733v4","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1733","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"pith_short_12","alias_value":"QH65FCM56NXZ","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QH65FCM56NXZNGWK","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QH65FCM5","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:e7076c416c34566d7f4d903c4a4e8bf1d96f0df86f2d10076f886ba964813cf6","target":"graph","created_at":"2026-05-18T02:22:00Z","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"},"paper":{"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","authors_text":"Georgios Fainekos, Houssam Abbas","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-05-09T17:16:26Z","title":"Linear Hybrid System Falsification With Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1733","kind":"arxiv","version":4},"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:f2bf20d407632dbc8cfb684afb204a63253061d6987f1e7c510e52633ca9b1d3","target":"record","created_at":"2026-05-18T02:22:00Z","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":"7ff0d1fd1598c804620d2ad2d5f433c39154f095891672958d0630ae7de1e8c1","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-05-09T17:16:26Z","title_canon_sha256":"10e35fac99bedc246acb4ac042daadf50c739feea05b6b2094c7b04efc978e9e"},"schema_version":"1.0","source":{"id":"1105.1733","kind":"arxiv","version":4}},"canonical_sha256":"81fdd2899df36f969aca0714ed14bb0efd3c6070383da03a2fa22edce78e1b45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81fdd2899df36f969aca0714ed14bb0efd3c6070383da03a2fa22edce78e1b45","first_computed_at":"2026-05-18T02:22:00.492740Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:00.492740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zcZ5Im+6IFn4I7QMuMoVJIXtFdLf2ECDNmFpev3bIBTWFMGDXNlNgdMlV7n2+jEjzRWb50c5maMDC7RQCivNBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:00.493461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.1733","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2bf20d407632dbc8cfb684afb204a63253061d6987f1e7c510e52633ca9b1d3","sha256:e7076c416c34566d7f4d903c4a4e8bf1d96f0df86f2d10076f886ba964813cf6"],"state_sha256":"fc51725824d39dc90226f693806f08ca51abf2cec4995698b8e2c34a26551b85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vjLaF++Y/mkmtzcUeET4XrJxVwqvR6w9dndCDxjYJ2ou+oK1w/XzXCUigIXa6YH6W6XZbvZExwDTBs8w08MlBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T02:56:52.484572Z","bundle_sha256":"c17da23b4401c5863b141757fcbf384efc1c17a4dc3dbb9251678f1cbec15efc"}}