{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7HPXDIECXE77FKW4Q73KGGPLQC","short_pith_number":"pith:7HPXDIEC","schema_version":"1.0","canonical_sha256":"f9df71a082b93ff2aadc87f6a319eb808f0733c966bf20faf072a5918381fe57","source":{"kind":"arxiv","id":"2301.07068","version":4},"attestation_state":"computed","paper":{"title":"The #DNN-Verification Problem: Counting Unsafe Inputs for Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Alessandro Farinelli, Davide Corsi, Ferdinando Cicalese, Luca Marzari","submitted_at":"2023-01-17T18:32:01Z","abstract_excerpt":"Deep Neural Networks are increasingly adopted in critical tasks that require a high level of safety, e.g., autonomous driving. While state-of-the-art verifiers can be employed to check whether a DNN is unsafe w.r.t. some given property (i.e., whether there is at least one unsafe input configuration), their yes/no output is not informative enough for other purposes, such as shielding, model selection, or training improvements. In this paper, we introduce the #DNN-Verification problem, which involves counting the number of input configurations of a DNN that result in a violation of a particular "},"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":"2301.07068","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-01-17T18:32:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"00f3db1cfc5d3c9de3c027aa0ab75ba45c5b937231bb6c4610cbb839b9e0c49b","abstract_canon_sha256":"d03f77cf2e8c6a441ccc64791d57262b2de8a21850f088e560270956ef30a124"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:21:57.900015Z","signature_b64":"vv44fUnwvjdg4Md28ms36ZmtDpsgOOLxnm3S5IZnJxzXW5RUqFQc3dP3TtrTIvZQkoyITqBVBKtyPGTYJPM0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9df71a082b93ff2aadc87f6a319eb808f0733c966bf20faf072a5918381fe57","last_reissued_at":"2026-07-05T06:21:57.899638Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:21:57.899638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The #DNN-Verification Problem: Counting Unsafe Inputs for Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Alessandro Farinelli, Davide Corsi, Ferdinando Cicalese, Luca Marzari","submitted_at":"2023-01-17T18:32:01Z","abstract_excerpt":"Deep Neural Networks are increasingly adopted in critical tasks that require a high level of safety, e.g., autonomous driving. While state-of-the-art verifiers can be employed to check whether a DNN is unsafe w.r.t. some given property (i.e., whether there is at least one unsafe input configuration), their yes/no output is not informative enough for other purposes, such as shielding, model selection, or training improvements. In this paper, we introduce the #DNN-Verification problem, which involves counting the number of input configurations of a DNN that result in a violation of a particular "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.07068","kind":"arxiv","version":4},"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/2301.07068/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":"2301.07068","created_at":"2026-07-05T06:21:57.899695+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.07068v4","created_at":"2026-07-05T06:21:57.899695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.07068","created_at":"2026-07-05T06:21:57.899695+00:00"},{"alias_kind":"pith_short_12","alias_value":"7HPXDIECXE77","created_at":"2026-07-05T06:21:57.899695+00:00"},{"alias_kind":"pith_short_16","alias_value":"7HPXDIECXE77FKW4","created_at":"2026-07-05T06:21:57.899695+00:00"},{"alias_kind":"pith_short_8","alias_value":"7HPXDIEC","created_at":"2026-07-05T06:21:57.899695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.17723","citing_title":"Statistical Runtime Verification for LLMs via Robustness Estimation","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7HPXDIECXE77FKW4Q73KGGPLQC","json":"https://pith.science/pith/7HPXDIECXE77FKW4Q73KGGPLQC.json","graph_json":"https://pith.science/api/pith-number/7HPXDIECXE77FKW4Q73KGGPLQC/graph.json","events_json":"https://pith.science/api/pith-number/7HPXDIECXE77FKW4Q73KGGPLQC/events.json","paper":"https://pith.science/paper/7HPXDIEC"},"agent_actions":{"view_html":"https://pith.science/pith/7HPXDIECXE77FKW4Q73KGGPLQC","download_json":"https://pith.science/pith/7HPXDIECXE77FKW4Q73KGGPLQC.json","view_paper":"https://pith.science/paper/7HPXDIEC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.07068&json=true","fetch_graph":"https://pith.science/api/pith-number/7HPXDIECXE77FKW4Q73KGGPLQC/graph.json","fetch_events":"https://pith.science/api/pith-number/7HPXDIECXE77FKW4Q73KGGPLQC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7HPXDIECXE77FKW4Q73KGGPLQC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7HPXDIECXE77FKW4Q73KGGPLQC/action/storage_attestation","attest_author":"https://pith.science/pith/7HPXDIECXE77FKW4Q73KGGPLQC/action/author_attestation","sign_citation":"https://pith.science/pith/7HPXDIECXE77FKW4Q73KGGPLQC/action/citation_signature","submit_replication":"https://pith.science/pith/7HPXDIECXE77FKW4Q73KGGPLQC/action/replication_record"}},"created_at":"2026-07-05T06:21:57.899695+00:00","updated_at":"2026-07-05T06:21:57.899695+00:00"}