{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:JXIQUCRY3PXZAOME4F3F3ZTLXR","short_pith_number":"pith:JXIQUCRY","canonical_record":{"source":{"id":"2401.05280","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-01-10T17:24:24Z","cross_cats_sorted":[],"title_canon_sha256":"ff2b96adf7d71ce773faf16ed226ec67f6d2fa6c20946f7a388ac9b8a96d5b1c","abstract_canon_sha256":"a960db78fc033d470a971859602f448610c8005cf7120f256b9c86e06f8f0429"},"schema_version":"1.0"},"canonical_sha256":"4dd10a0a38dbef903984e1765de66bbc62f252a77649754aa4cec46fa75b169b","source":{"kind":"arxiv","id":"2401.05280","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:JXIQUCRY3PXZAOME4F3F3ZTLXR","target":"record","payload":{"canonical_record":{"source":{"id":"2401.05280","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-01-10T17:24:24Z","cross_cats_sorted":[],"title_canon_sha256":"ff2b96adf7d71ce773faf16ed226ec67f6d2fa6c20946f7a388ac9b8a96d5b1c","abstract_canon_sha256":"a960db78fc033d470a971859602f448610c8005cf7120f256b9c86e06f8f0429"},"schema_version":"1.0"},"canonical_sha256":"4dd10a0a38dbef903984e1765de66bbc62f252a77649754aa4cec46fa75b169b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:02:23.939162Z","signature_b64":"AN1EQ2aRQJwuE05t3eFgj+9sM4YdA12okSGdDsBHnbRH3R0SeIUWXyxj0NEDsJ51GwrG7u/QWHd1/7l1L2ddBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dd10a0a38dbef903984e1765de66bbc62f252a77649754aa4cec46fa75b169b","last_reissued_at":"2026-07-05T08:02:23.938655Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:02:23.938655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.05280","source_version":3,"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-07-05T08:02:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JC+r592c5MgtDeiKZFeNa3Ejg+4coNwmM4nkHuXz7ZPbYEme+Yes5BdIJual2IRSpgLscKMS/U6t9hvAn6XECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T13:48:56.207096Z"},"content_sha256":"cc9955cead5a1e19d18674133ffae6b358c1ff10a4f65c31e87e651cad005ab6","schema_version":"1.0","event_id":"sha256:cc9955cead5a1e19d18674133ffae6b358c1ff10a4f65c31e87e651cad005ab6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:JXIQUCRY3PXZAOME4F3F3ZTLXR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bound Tightening using Rolling-Horizon Decomposition for Neural Network Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Haoruo Zhao, Hassan Hijazi, Haydn Jones, Juston Moore, Mathieu Tanneau, Pascal Van Hentenryck","submitted_at":"2024-01-10T17:24:24Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.05280","kind":"arxiv","version":3},"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/2401.05280/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"},"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-07-05T08:02:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dXsITzf7ksfcfBRkTkGvKk1l8Ci1DhftEymP6dORApW4DFdRCg6r/9xxtpBnOVK1tLvTHOWPGOt0cwaRWOQzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T13:48:56.208244Z"},"content_sha256":"e34a872e35c911607f57839a1db7247ffbf762bc2173fb386feb00f0d40ed233","schema_version":"1.0","event_id":"sha256:e34a872e35c911607f57839a1db7247ffbf762bc2173fb386feb00f0d40ed233"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JXIQUCRY3PXZAOME4F3F3ZTLXR/bundle.json","state_url":"https://pith.science/pith/JXIQUCRY3PXZAOME4F3F3ZTLXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JXIQUCRY3PXZAOME4F3F3ZTLXR/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-08-04T13:48:56Z","links":{"resolver":"https://pith.science/pith/JXIQUCRY3PXZAOME4F3F3ZTLXR","bundle":"https://pith.science/pith/JXIQUCRY3PXZAOME4F3F3ZTLXR/bundle.json","state":"https://pith.science/pith/JXIQUCRY3PXZAOME4F3F3ZTLXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JXIQUCRY3PXZAOME4F3F3ZTLXR/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gwt4WWnbNH9l1tSZlUVUA2oMW1WmkiLq5+1lrroKchj2wCzOQSKyqD8xy8lb0ZmKCj+hME6l9rgntRxMkiyZBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T13:48:56.250028Z","bundle_sha256":"771e8a414872a6ad59e7ddd85be11c0c983fb9b4dfcec5990a8f995b882fe982"}}