{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:67DYIZZG7DLR4AQZINMZK3ZZ4D","short_pith_number":"pith:67DYIZZG","schema_version":"1.0","canonical_sha256":"f7c7846726f8d71e02194359956f39e0d50e6a8bfa33f74635d36b278fc1a233","source":{"kind":"arxiv","id":"2405.14400","version":3},"attestation_state":"computed","paper":{"title":"Verifying Global Two-Safety Properties in Neural Networks with Confidence","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Anagha Athavale, Dejan Nickovic, Ezio Bartocci, Georg Weissenbacher, Maria Christakis, Matteo Maffei","submitted_at":"2024-05-23T10:19:35Z","abstract_excerpt":"We present the first automated verification technique for confidence-based 2-safety properties, such as global robustness and global fairness, in deep neural networks (DNNs). Our approach combines self-composition to leverage existing reachability analysis techniques and a novel abstraction of the softmax function, which is amenable to automated verification. We characterize and prove the soundness of our static analysis technique. Furthermore, we implement it on top of Marabou, a safety analysis tool for neural networks, conducting a performance evaluation on several publicly available benchm"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2405.14400","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-05-23T10:19:35Z","cross_cats_sorted":[],"title_canon_sha256":"b517f65698a94984b28a027d183b965034882976ed83fcb591a5ff1fd3555eab","abstract_canon_sha256":"6fb91a9b20c56938e13baf5dbbba9164e6923a39fdce04362396f49820fec697"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:02:19.770374Z","signature_b64":"2AfJKzKht0672vUU25aIu7hQM40YOXzzw4ce5VUgWaKF9LIvKj2Hffx3+FibVJWU+f43HCGasX79vFg2jfoADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7c7846726f8d71e02194359956f39e0d50e6a8bfa33f74635d36b278fc1a233","last_reissued_at":"2026-07-05T09:02:19.769887Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:02:19.769887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verifying Global Two-Safety Properties in Neural Networks with Confidence","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Anagha Athavale, Dejan Nickovic, Ezio Bartocci, Georg Weissenbacher, Maria Christakis, Matteo Maffei","submitted_at":"2024-05-23T10:19:35Z","abstract_excerpt":"We present the first automated verification technique for confidence-based 2-safety properties, such as global robustness and global fairness, in deep neural networks (DNNs). Our approach combines self-composition to leverage existing reachability analysis techniques and a novel abstraction of the softmax function, which is amenable to automated verification. We characterize and prove the soundness of our static analysis technique. Furthermore, we implement it on top of Marabou, a safety analysis tool for neural networks, conducting a performance evaluation on several publicly available benchm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.14400","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/2405.14400/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2405.14400","created_at":"2026-07-05T09:02:19.769944+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.14400v3","created_at":"2026-07-05T09:02:19.769944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.14400","created_at":"2026-07-05T09:02:19.769944+00:00"},{"alias_kind":"pith_short_12","alias_value":"67DYIZZG7DLR","created_at":"2026-07-05T09:02:19.769944+00:00"},{"alias_kind":"pith_short_16","alias_value":"67DYIZZG7DLR4AQZ","created_at":"2026-07-05T09:02:19.769944+00:00"},{"alias_kind":"pith_short_8","alias_value":"67DYIZZG","created_at":"2026-07-05T09:02:19.769944+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.05867","citing_title":"Neural Network Verification is a Programming Language Challenge","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/67DYIZZG7DLR4AQZINMZK3ZZ4D","json":"https://pith.science/pith/67DYIZZG7DLR4AQZINMZK3ZZ4D.json","graph_json":"https://pith.science/api/pith-number/67DYIZZG7DLR4AQZINMZK3ZZ4D/graph.json","events_json":"https://pith.science/api/pith-number/67DYIZZG7DLR4AQZINMZK3ZZ4D/events.json","paper":"https://pith.science/paper/67DYIZZG"},"agent_actions":{"view_html":"https://pith.science/pith/67DYIZZG7DLR4AQZINMZK3ZZ4D","download_json":"https://pith.science/pith/67DYIZZG7DLR4AQZINMZK3ZZ4D.json","view_paper":"https://pith.science/paper/67DYIZZG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.14400&json=true","fetch_graph":"https://pith.science/api/pith-number/67DYIZZG7DLR4AQZINMZK3ZZ4D/graph.json","fetch_events":"https://pith.science/api/pith-number/67DYIZZG7DLR4AQZINMZK3ZZ4D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/67DYIZZG7DLR4AQZINMZK3ZZ4D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/67DYIZZG7DLR4AQZINMZK3ZZ4D/action/storage_attestation","attest_author":"https://pith.science/pith/67DYIZZG7DLR4AQZINMZK3ZZ4D/action/author_attestation","sign_citation":"https://pith.science/pith/67DYIZZG7DLR4AQZINMZK3ZZ4D/action/citation_signature","submit_replication":"https://pith.science/pith/67DYIZZG7DLR4AQZINMZK3ZZ4D/action/replication_record"}},"created_at":"2026-07-05T09:02:19.769944+00:00","updated_at":"2026-07-05T09:02:19.769944+00:00"}