{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JXIQUCRY3PXZAOME4F3F3ZTLXR","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":"a960db78fc033d470a971859602f448610c8005cf7120f256b9c86e06f8f0429","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-01-10T17:24:24Z","title_canon_sha256":"ff2b96adf7d71ce773faf16ed226ec67f6d2fa6c20946f7a388ac9b8a96d5b1c"},"schema_version":"1.0","source":{"id":"2401.05280","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.05280","created_at":"2026-07-05T08:02:23Z"},{"alias_kind":"arxiv_version","alias_value":"2401.05280v3","created_at":"2026-07-05T08:02:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.05280","created_at":"2026-07-05T08:02:23Z"},{"alias_kind":"pith_short_12","alias_value":"JXIQUCRY3PXZ","created_at":"2026-07-05T08:02:23Z"},{"alias_kind":"pith_short_16","alias_value":"JXIQUCRY3PXZAOME","created_at":"2026-07-05T08:02:23Z"},{"alias_kind":"pith_short_8","alias_value":"JXIQUCRY","created_at":"2026-07-05T08:02:23Z"}],"graph_snapshots":[{"event_id":"sha256:e34a872e35c911607f57839a1db7247ffbf762bc2173fb386feb00f0d40ed233","target":"graph","created_at":"2026-07-05T08:02:23Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.05280/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Neural network verification aims at providing formal guarantees on the output of trained neural networks, to ensure their robustness against adversarial examples and enable their deployment in safety-critical applications. This paper introduces a new approach to neural network verification using a novel mixed-integer programming rolling-horizon decomposition method. The algorithm leverages the layered structure of neural networks, by employing optimization-based bound-tightening on smaller sub-graphs of the original network in a rolling-horizon fashion. This strategy strikes a balance between ","authors_text":"Haoruo Zhao, Hassan Hijazi, Haydn Jones, Juston Moore, Mathieu Tanneau, Pascal Van Hentenryck","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-01-10T17:24:24Z","title":"Bound Tightening using Rolling-Horizon Decomposition for Neural Network Verification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.05280","kind":"arxiv","version":3},"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:cc9955cead5a1e19d18674133ffae6b358c1ff10a4f65c31e87e651cad005ab6","target":"record","created_at":"2026-07-05T08:02:23Z","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":"a960db78fc033d470a971859602f448610c8005cf7120f256b9c86e06f8f0429","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-01-10T17:24:24Z","title_canon_sha256":"ff2b96adf7d71ce773faf16ed226ec67f6d2fa6c20946f7a388ac9b8a96d5b1c"},"schema_version":"1.0","source":{"id":"2401.05280","kind":"arxiv","version":3}},"canonical_sha256":"4dd10a0a38dbef903984e1765de66bbc62f252a77649754aa4cec46fa75b169b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4dd10a0a38dbef903984e1765de66bbc62f252a77649754aa4cec46fa75b169b","first_computed_at":"2026-07-05T08:02:23.938655Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:02:23.938655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AN1EQ2aRQJwuE05t3eFgj+9sM4YdA12okSGdDsBHnbRH3R0SeIUWXyxj0NEDsJ51GwrG7u/QWHd1/7l1L2ddBA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:02:23.939162Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.05280","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc9955cead5a1e19d18674133ffae6b358c1ff10a4f65c31e87e651cad005ab6","sha256:e34a872e35c911607f57839a1db7247ffbf762bc2173fb386feb00f0d40ed233"],"state_sha256":"4fe89485b30b278f7f5121d77c17842dd37f26ae89ab7f3bef7d09260daa6959"}