{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YITB3O2MX6LK7PKHYUNKKCHBDT","short_pith_number":"pith:YITB3O2M","schema_version":"1.0","canonical_sha256":"c2261dbb4cbf96afbd47c51aa508e11cd842b6f4677024234727a137e7d8b2e3","source":{"kind":"arxiv","id":"2307.10266","version":3},"attestation_state":"computed","paper":{"title":"A DPLL(T) Framework for Verifying Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.SE"],"primary_cat":"cs.LG","authors_text":"Hai Duong, Matthew Dwyer, ThanhVu Nguyen","submitted_at":"2023-07-17T18:49:46Z","abstract_excerpt":"Deep Neural Networks (DNNs) have emerged as an effective approach to tackling real-world problems. However, like human-written software, DNNs can have bugs and can be attacked. To address this, research has explored a wide-range of algorithmic approaches to verify DNN behavior. In this work, we introduce NeuralSAT, a new verification approach that adapts the widely-used DPLL(T) algorithm used in modern SMT solvers. A key feature of SMT solvers is the use of conflict clause learning and search restart to scale verification. Unlike prior DNN verification approaches, NeuralSAT combines an abstrac"},"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":"2307.10266","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-17T18:49:46Z","cross_cats_sorted":["cs.LO","cs.SE"],"title_canon_sha256":"501c5925bd6d7e7bbb74670879146d271b289a451d28133bc5fb32b3a3a7a617","abstract_canon_sha256":"2a03d4da6e373355e89c2a0365a29411659639c34039976bed5737fd84709cdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:35:38.572718Z","signature_b64":"5tWm6hl1ZavgtwiDFR39q+r/pyHaVXJzTPzu9IUaeHlKpYUenLUJ8yAY/f8F9iPQ+2YoR2i1Ako8Y1UFXVASDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2261dbb4cbf96afbd47c51aa508e11cd842b6f4677024234727a137e7d8b2e3","last_reissued_at":"2026-07-05T07:35:38.572253Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:35:38.572253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A DPLL(T) Framework for Verifying Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.SE"],"primary_cat":"cs.LG","authors_text":"Hai Duong, Matthew Dwyer, ThanhVu Nguyen","submitted_at":"2023-07-17T18:49:46Z","abstract_excerpt":"Deep Neural Networks (DNNs) have emerged as an effective approach to tackling real-world problems. However, like human-written software, DNNs can have bugs and can be attacked. To address this, research has explored a wide-range of algorithmic approaches to verify DNN behavior. In this work, we introduce NeuralSAT, a new verification approach that adapts the widely-used DPLL(T) algorithm used in modern SMT solvers. A key feature of SMT solvers is the use of conflict clause learning and search restart to scale verification. Unlike prior DNN verification approaches, NeuralSAT combines an abstrac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.10266","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/2307.10266/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":"2307.10266","created_at":"2026-07-05T07:35:38.572310+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.10266v3","created_at":"2026-07-05T07:35:38.572310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.10266","created_at":"2026-07-05T07:35:38.572310+00:00"},{"alias_kind":"pith_short_12","alias_value":"YITB3O2MX6LK","created_at":"2026-07-05T07:35:38.572310+00:00"},{"alias_kind":"pith_short_16","alias_value":"YITB3O2MX6LK7PKH","created_at":"2026-07-05T07:35:38.572310+00:00"},{"alias_kind":"pith_short_8","alias_value":"YITB3O2M","created_at":"2026-07-05T07:35:38.572310+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05251","citing_title":"Privacy-Preserving Robustness Verification for Neural Networks","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17153","citing_title":"Stress-Testing Neural Network Verifiers with Provably Robust Instances","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YITB3O2MX6LK7PKHYUNKKCHBDT","json":"https://pith.science/pith/YITB3O2MX6LK7PKHYUNKKCHBDT.json","graph_json":"https://pith.science/api/pith-number/YITB3O2MX6LK7PKHYUNKKCHBDT/graph.json","events_json":"https://pith.science/api/pith-number/YITB3O2MX6LK7PKHYUNKKCHBDT/events.json","paper":"https://pith.science/paper/YITB3O2M"},"agent_actions":{"view_html":"https://pith.science/pith/YITB3O2MX6LK7PKHYUNKKCHBDT","download_json":"https://pith.science/pith/YITB3O2MX6LK7PKHYUNKKCHBDT.json","view_paper":"https://pith.science/paper/YITB3O2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.10266&json=true","fetch_graph":"https://pith.science/api/pith-number/YITB3O2MX6LK7PKHYUNKKCHBDT/graph.json","fetch_events":"https://pith.science/api/pith-number/YITB3O2MX6LK7PKHYUNKKCHBDT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YITB3O2MX6LK7PKHYUNKKCHBDT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YITB3O2MX6LK7PKHYUNKKCHBDT/action/storage_attestation","attest_author":"https://pith.science/pith/YITB3O2MX6LK7PKHYUNKKCHBDT/action/author_attestation","sign_citation":"https://pith.science/pith/YITB3O2MX6LK7PKHYUNKKCHBDT/action/citation_signature","submit_replication":"https://pith.science/pith/YITB3O2MX6LK7PKHYUNKKCHBDT/action/replication_record"}},"created_at":"2026-07-05T07:35:38.572310+00:00","updated_at":"2026-07-05T07:35:38.572310+00:00"}