{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:YBMNZ3GAAO6HRLOZ335MKIIJU3","short_pith_number":"pith:YBMNZ3GA","canonical_record":{"source":{"id":"2002.10410","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-24T17:55:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4a1dd6f0bf192acace4d03afc9cb9ffa79510f7c63285ae35051aed7f97eb243","abstract_canon_sha256":"c714f4f3f288ee2b260b68776e1ee2d4731c903d3377739910a15b11a02fd9e0"},"schema_version":"1.0"},"canonical_sha256":"c058dcecc003bc78add9defac52109a6c2866aa1227fd9b9e709867943f55feb","source":{"kind":"arxiv","id":"2002.10410","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.10410","created_at":"2026-07-05T01:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"2002.10410v3","created_at":"2026-07-05T01:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.10410","created_at":"2026-07-05T01:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"YBMNZ3GAAO6H","created_at":"2026-07-05T01:10:58Z"},{"alias_kind":"pith_short_16","alias_value":"YBMNZ3GAAO6HRLOZ","created_at":"2026-07-05T01:10:58Z"},{"alias_kind":"pith_short_8","alias_value":"YBMNZ3GA","created_at":"2026-07-05T01:10:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:YBMNZ3GAAO6HRLOZ335MKIIJU3","target":"record","payload":{"canonical_record":{"source":{"id":"2002.10410","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-24T17:55:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4a1dd6f0bf192acace4d03afc9cb9ffa79510f7c63285ae35051aed7f97eb243","abstract_canon_sha256":"c714f4f3f288ee2b260b68776e1ee2d4731c903d3377739910a15b11a02fd9e0"},"schema_version":"1.0"},"canonical_sha256":"c058dcecc003bc78add9defac52109a6c2866aa1227fd9b9e709867943f55feb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:10:58.067839Z","signature_b64":"8krMVe53OCOrExQ6mrdq7jxOaXU1tiq9G2VI+nkjKuNpj3VWmYP/2Wvsfm6PnCYT3ijv2ODOSZt1Red7kc2fAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c058dcecc003bc78add9defac52109a6c2866aa1227fd9b9e709867943f55feb","last_reissued_at":"2026-07-05T01:10:58.067357Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:10:58.067357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.10410","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-05T01:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ksi6W6fGzLE2IYX9o+fzmDWkhh6F/rBezhGHr2CRmfKpk1mjasdNiw56HL8erPzo0FXg7gW6BHXcPhnF5XjdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T17:33:37.196249Z"},"content_sha256":"2ce92f36dd466edee5e96119c204b9984540fdc49c26ff22fbfb239f8a0747df","schema_version":"1.0","event_id":"sha256:2ce92f36dd466edee5e96119c204b9984540fdc49c26ff22fbfb239f8a0747df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:YBMNZ3GAAO6HRLOZ335MKIIJU3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lagrangian Decomposition for Neural Network Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alban Desmaison, Alessandro De Palma, Krishnamurthy Dvijotham, M. Pawan Kumar, Philip H.S. Torr, Pushmeet Kohli, Rudy Bunel","submitted_at":"2020-02-24T17:55:10Z","abstract_excerpt":"A fundamental component of neural network verification is the computation of bounds on the values their outputs can take. Previous methods have either used off-the-shelf solvers, discarding the problem structure, or relaxed the problem even further, making the bounds unnecessarily loose. We propose a novel approach based on Lagrangian Decomposition. Our formulation admits an efficient supergradient ascent algorithm, as well as an improved proximal algorithm. Both the algorithms offer three advantages: (i) they yield bounds that are provably at least as tight as previous dual algorithms relying"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.10410","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/2002.10410/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-05T01:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PxzswWUYuwaB07CZKsFiV5irhmdPvtWJgrK4ExE3ZMgVaA2hrwLBFpJOLWHtNArMbhZUUIXMYDNcKYbbK8TUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T17:33:37.196863Z"},"content_sha256":"502472e19b791e7ffec03a2cb046b6f2384238014744173a1cbf69a51ba842a5","schema_version":"1.0","event_id":"sha256:502472e19b791e7ffec03a2cb046b6f2384238014744173a1cbf69a51ba842a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YBMNZ3GAAO6HRLOZ335MKIIJU3/bundle.json","state_url":"https://pith.science/pith/YBMNZ3GAAO6HRLOZ335MKIIJU3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YBMNZ3GAAO6HRLOZ335MKIIJU3/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-22T17:33:37Z","links":{"resolver":"https://pith.science/pith/YBMNZ3GAAO6HRLOZ335MKIIJU3","bundle":"https://pith.science/pith/YBMNZ3GAAO6HRLOZ335MKIIJU3/bundle.json","state":"https://pith.science/pith/YBMNZ3GAAO6HRLOZ335MKIIJU3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YBMNZ3GAAO6HRLOZ335MKIIJU3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:YBMNZ3GAAO6HRLOZ335MKIIJU3","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":"c714f4f3f288ee2b260b68776e1ee2d4731c903d3377739910a15b11a02fd9e0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-24T17:55:10Z","title_canon_sha256":"4a1dd6f0bf192acace4d03afc9cb9ffa79510f7c63285ae35051aed7f97eb243"},"schema_version":"1.0","source":{"id":"2002.10410","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.10410","created_at":"2026-07-05T01:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"2002.10410v3","created_at":"2026-07-05T01:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.10410","created_at":"2026-07-05T01:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"YBMNZ3GAAO6H","created_at":"2026-07-05T01:10:58Z"},{"alias_kind":"pith_short_16","alias_value":"YBMNZ3GAAO6HRLOZ","created_at":"2026-07-05T01:10:58Z"},{"alias_kind":"pith_short_8","alias_value":"YBMNZ3GA","created_at":"2026-07-05T01:10:58Z"}],"graph_snapshots":[{"event_id":"sha256:502472e19b791e7ffec03a2cb046b6f2384238014744173a1cbf69a51ba842a5","target":"graph","created_at":"2026-07-05T01:10:58Z","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/2002.10410/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A fundamental component of neural network verification is the computation of bounds on the values their outputs can take. Previous methods have either used off-the-shelf solvers, discarding the problem structure, or relaxed the problem even further, making the bounds unnecessarily loose. We propose a novel approach based on Lagrangian Decomposition. Our formulation admits an efficient supergradient ascent algorithm, as well as an improved proximal algorithm. Both the algorithms offer three advantages: (i) they yield bounds that are provably at least as tight as previous dual algorithms relying","authors_text":"Alban Desmaison, Alessandro De Palma, Krishnamurthy Dvijotham, M. Pawan Kumar, Philip H.S. Torr, Pushmeet Kohli, Rudy Bunel","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-24T17:55:10Z","title":"Lagrangian Decomposition for Neural Network Verification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.10410","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:2ce92f36dd466edee5e96119c204b9984540fdc49c26ff22fbfb239f8a0747df","target":"record","created_at":"2026-07-05T01:10:58Z","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":"c714f4f3f288ee2b260b68776e1ee2d4731c903d3377739910a15b11a02fd9e0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-24T17:55:10Z","title_canon_sha256":"4a1dd6f0bf192acace4d03afc9cb9ffa79510f7c63285ae35051aed7f97eb243"},"schema_version":"1.0","source":{"id":"2002.10410","kind":"arxiv","version":3}},"canonical_sha256":"c058dcecc003bc78add9defac52109a6c2866aa1227fd9b9e709867943f55feb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c058dcecc003bc78add9defac52109a6c2866aa1227fd9b9e709867943f55feb","first_computed_at":"2026-07-05T01:10:58.067357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:10:58.067357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8krMVe53OCOrExQ6mrdq7jxOaXU1tiq9G2VI+nkjKuNpj3VWmYP/2Wvsfm6PnCYT3ijv2ODOSZt1Red7kc2fAA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:10:58.067839Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.10410","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ce92f36dd466edee5e96119c204b9984540fdc49c26ff22fbfb239f8a0747df","sha256:502472e19b791e7ffec03a2cb046b6f2384238014744173a1cbf69a51ba842a5"],"state_sha256":"e30cd71d0cb47eb006c554f5bd2ae9233fc861860f61d665e6693c084c1da21d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dO1SiGk7k7DCGGSExxi76B9OvYuCJ8qNEt2bcU5td7uY7anSOdpzgorYxUl/etnuiBqgFrbpdVFEd0QoUe72Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T17:33:37.201235Z","bundle_sha256":"62074c9d3dd516a028cf7a514c4b0c6c5f3f0f132b379181975346dca80386eb"}}