{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DG6ZEN7FWDT23NNJECLCXL4IUO","short_pith_number":"pith:DG6ZEN7F","canonical_record":{"source":{"id":"1802.04866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-13T21:34:35Z","cross_cats_sorted":["cs.FL","math.OC"],"title_canon_sha256":"acc853b3f197fac38b51254b63bdfae977379c98a43fff5f37324e89f7e5a626","abstract_canon_sha256":"84e57cb647d9d5d3fcfdf01839ac7ab302e235b17fe892f798e60574adf6248d"},"schema_version":"1.0"},"canonical_sha256":"19bd9237e5b0e7adb5a920962baf88a3a26d0e19a48c377e482e809e1bc5a350","source":{"kind":"arxiv","id":"1802.04866","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04866","created_at":"2026-05-18T00:23:22Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04866v1","created_at":"2026-05-18T00:23:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04866","created_at":"2026-05-18T00:23:22Z"},{"alias_kind":"pith_short_12","alias_value":"DG6ZEN7FWDT2","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DG6ZEN7FWDT23NNJ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DG6ZEN7F","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DG6ZEN7FWDT23NNJECLCXL4IUO","target":"record","payload":{"canonical_record":{"source":{"id":"1802.04866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-13T21:34:35Z","cross_cats_sorted":["cs.FL","math.OC"],"title_canon_sha256":"acc853b3f197fac38b51254b63bdfae977379c98a43fff5f37324e89f7e5a626","abstract_canon_sha256":"84e57cb647d9d5d3fcfdf01839ac7ab302e235b17fe892f798e60574adf6248d"},"schema_version":"1.0"},"canonical_sha256":"19bd9237e5b0e7adb5a920962baf88a3a26d0e19a48c377e482e809e1bc5a350","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:22.388725Z","signature_b64":"qAIPu48lPMM65g+BTleLanHGEUWhZK9Psq5JNvol7IvUb/a0OyBsbuSfSwJ2wVI0Da9xkSm5FMnqnoF6bAA/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19bd9237e5b0e7adb5a920962baf88a3a26d0e19a48c377e482e809e1bc5a350","last_reissued_at":"2026-05-18T00:23:22.388056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:22.388056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.04866","source_version":1,"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-18T00:23:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qawdshb5DdnlDHWAYf3ccYFbXRQM30USVjKdFT28Uf7Erp+iBLyS37j9IU3nl+79q9Sh4jYbt7sCwtDMoMaLCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:29:23.406636Z"},"content_sha256":"f32813dc49415e796439ccb62b8cc8c79ffa53c72eb18e87a9c1a6a1b9ecab88","schema_version":"1.0","event_id":"sha256:f32813dc49415e796439ccb62b8cc8c79ffa53c72eb18e87a9c1a6a1b9ecab88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DG6ZEN7FWDT23NNJECLCXL4IUO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Descent For Temporal Logic Falsification of Cyber-Physical Systems (Extended Technical Report)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","math.OC"],"primary_cat":"cs.SY","authors_text":"Georgios Fainekos, Shakiba Yaghoubi","submitted_at":"2018-02-13T21:34:35Z","abstract_excerpt":"One way to analyze Cyber-Physical Systems is by modeling them as hybrid automata. Since reachability analysis for hybrid nonlinear automata is a very challenging and computationally expensive problem, in practice, engineers try to solve the requirements falsification problem. In one method, the falsification problem is solved by minimizing a robustness metric induced by the requirements. This optimization problem is usually a non-convex non-smooth problem that requires heuristic and analytical guidance to be solved. In this paper, functional gradient descent for hybrid systems is utilized for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04866","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"},"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-18T00:23:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yTcc4+mf3WJKr72+HsvB8KfcD4d4bTPYA23BSenWdWtWi/AjdOi0bvgNbUpc1StQrQSTosbD1cu/VLeYFy4/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:29:23.407046Z"},"content_sha256":"c72dfda081476df13599f79a68c6be0e915b61113853532370349d9ff6b6f10a","schema_version":"1.0","event_id":"sha256:c72dfda081476df13599f79a68c6be0e915b61113853532370349d9ff6b6f10a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DG6ZEN7FWDT23NNJECLCXL4IUO/bundle.json","state_url":"https://pith.science/pith/DG6ZEN7FWDT23NNJECLCXL4IUO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DG6ZEN7FWDT23NNJECLCXL4IUO/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-28T22:29:23Z","links":{"resolver":"https://pith.science/pith/DG6ZEN7FWDT23NNJECLCXL4IUO","bundle":"https://pith.science/pith/DG6ZEN7FWDT23NNJECLCXL4IUO/bundle.json","state":"https://pith.science/pith/DG6ZEN7FWDT23NNJECLCXL4IUO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DG6ZEN7FWDT23NNJECLCXL4IUO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DG6ZEN7FWDT23NNJECLCXL4IUO","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":"84e57cb647d9d5d3fcfdf01839ac7ab302e235b17fe892f798e60574adf6248d","cross_cats_sorted":["cs.FL","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-13T21:34:35Z","title_canon_sha256":"acc853b3f197fac38b51254b63bdfae977379c98a43fff5f37324e89f7e5a626"},"schema_version":"1.0","source":{"id":"1802.04866","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04866","created_at":"2026-05-18T00:23:22Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04866v1","created_at":"2026-05-18T00:23:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04866","created_at":"2026-05-18T00:23:22Z"},{"alias_kind":"pith_short_12","alias_value":"DG6ZEN7FWDT2","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DG6ZEN7FWDT23NNJ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DG6ZEN7F","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:c72dfda081476df13599f79a68c6be0e915b61113853532370349d9ff6b6f10a","target":"graph","created_at":"2026-05-18T00:23:22Z","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":"One way to analyze Cyber-Physical Systems is by modeling them as hybrid automata. Since reachability analysis for hybrid nonlinear automata is a very challenging and computationally expensive problem, in practice, engineers try to solve the requirements falsification problem. In one method, the falsification problem is solved by minimizing a robustness metric induced by the requirements. This optimization problem is usually a non-convex non-smooth problem that requires heuristic and analytical guidance to be solved. In this paper, functional gradient descent for hybrid systems is utilized for ","authors_text":"Georgios Fainekos, Shakiba Yaghoubi","cross_cats":["cs.FL","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-13T21:34:35Z","title":"Local Descent For Temporal Logic Falsification of Cyber-Physical Systems (Extended Technical Report)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04866","kind":"arxiv","version":1},"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:f32813dc49415e796439ccb62b8cc8c79ffa53c72eb18e87a9c1a6a1b9ecab88","target":"record","created_at":"2026-05-18T00:23:22Z","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":"84e57cb647d9d5d3fcfdf01839ac7ab302e235b17fe892f798e60574adf6248d","cross_cats_sorted":["cs.FL","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-13T21:34:35Z","title_canon_sha256":"acc853b3f197fac38b51254b63bdfae977379c98a43fff5f37324e89f7e5a626"},"schema_version":"1.0","source":{"id":"1802.04866","kind":"arxiv","version":1}},"canonical_sha256":"19bd9237e5b0e7adb5a920962baf88a3a26d0e19a48c377e482e809e1bc5a350","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19bd9237e5b0e7adb5a920962baf88a3a26d0e19a48c377e482e809e1bc5a350","first_computed_at":"2026-05-18T00:23:22.388056Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:22.388056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qAIPu48lPMM65g+BTleLanHGEUWhZK9Psq5JNvol7IvUb/a0OyBsbuSfSwJ2wVI0Da9xkSm5FMnqnoF6bAA/CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:22.388725Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.04866","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f32813dc49415e796439ccb62b8cc8c79ffa53c72eb18e87a9c1a6a1b9ecab88","sha256:c72dfda081476df13599f79a68c6be0e915b61113853532370349d9ff6b6f10a"],"state_sha256":"b0c5319f638ec8afeddc2b3eb4ab15609130a8f095b63af79f39b13355449a4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NiR1ANdCYJr6Mk6xTtOVTZvScswsK/QMpX1czSFmqNy6rcdbsAkAUbIgWJLITOn0xWwx96mKDjgw6kVElfRRDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:29:23.409701Z","bundle_sha256":"6262845f77a56dd599b806d61a4f7f2ff2469025a3c57c101d5e6aa0bb7bb4ac"}}