{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VQ2RFBJ3QZQQODKVRFAFXENOUM","short_pith_number":"pith:VQ2RFBJ3","schema_version":"1.0","canonical_sha256":"ac3512853b8661070d5589405b91aea30a670d6634cda61a4a06e7744c87ec06","source":{"kind":"arxiv","id":"2104.12418","version":1},"attestation_state":"computed","paper":{"title":"Fast Falsification of Neural Networks using Property Directed Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Ansuman Banerjee, Moumita Das, Rajarshi Ray, Swarup Kumar Mohalik","submitted_at":"2021-04-26T09:16:27Z","abstract_excerpt":"Neural networks are now extensively used in perception, prediction and control of autonomous systems. Their deployment in safety-critical systems brings forth the need for verification techniques for such networks. As an alternative to exhaustive and costly verification algorithms, lightweight falsification algorithms have been heavily used to search for an input to the system that produces an unsafe output, i.e., a counterexample to the safety of the system. In this work, we propose a falsification algorithm for neural networks that directs the search for a counterexample, guided by a safety "},"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":"2104.12418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-04-26T09:16:27Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"06e515756162e390d2ffab9e0d81e9569975527585527a5b152607c52655e35a","abstract_canon_sha256":"2d41360fb13ef65b2b7084169b6339ea38652e5f78f76499a9a61f95b0d8d27c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:34:56.617631Z","signature_b64":"KtmVWE7+ZgMp6o0Ej40+ppWE7Z2Zx2KGlpYGu6/9F7hE6x4XEFho802w6TBQr+wUHH0UAQOTTSnxDj2jiGd6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac3512853b8661070d5589405b91aea30a670d6634cda61a4a06e7744c87ec06","last_reissued_at":"2026-07-05T02:34:56.617205Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:34:56.617205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Falsification of Neural Networks using Property Directed Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Ansuman Banerjee, Moumita Das, Rajarshi Ray, Swarup Kumar Mohalik","submitted_at":"2021-04-26T09:16:27Z","abstract_excerpt":"Neural networks are now extensively used in perception, prediction and control of autonomous systems. Their deployment in safety-critical systems brings forth the need for verification techniques for such networks. As an alternative to exhaustive and costly verification algorithms, lightweight falsification algorithms have been heavily used to search for an input to the system that produces an unsafe output, i.e., a counterexample to the safety of the system. In this work, we propose a falsification algorithm for neural networks that directs the search for a counterexample, guided by a safety "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.12418","kind":"arxiv","version":1},"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/2104.12418/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":"2104.12418","created_at":"2026-07-05T02:34:56.617265+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.12418v1","created_at":"2026-07-05T02:34:56.617265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.12418","created_at":"2026-07-05T02:34:56.617265+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQ2RFBJ3QZQQ","created_at":"2026-07-05T02:34:56.617265+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQ2RFBJ3QZQQODKV","created_at":"2026-07-05T02:34:56.617265+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQ2RFBJ3","created_at":"2026-07-05T02:34:56.617265+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.17453","citing_title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VQ2RFBJ3QZQQODKVRFAFXENOUM","json":"https://pith.science/pith/VQ2RFBJ3QZQQODKVRFAFXENOUM.json","graph_json":"https://pith.science/api/pith-number/VQ2RFBJ3QZQQODKVRFAFXENOUM/graph.json","events_json":"https://pith.science/api/pith-number/VQ2RFBJ3QZQQODKVRFAFXENOUM/events.json","paper":"https://pith.science/paper/VQ2RFBJ3"},"agent_actions":{"view_html":"https://pith.science/pith/VQ2RFBJ3QZQQODKVRFAFXENOUM","download_json":"https://pith.science/pith/VQ2RFBJ3QZQQODKVRFAFXENOUM.json","view_paper":"https://pith.science/paper/VQ2RFBJ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.12418&json=true","fetch_graph":"https://pith.science/api/pith-number/VQ2RFBJ3QZQQODKVRFAFXENOUM/graph.json","fetch_events":"https://pith.science/api/pith-number/VQ2RFBJ3QZQQODKVRFAFXENOUM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQ2RFBJ3QZQQODKVRFAFXENOUM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQ2RFBJ3QZQQODKVRFAFXENOUM/action/storage_attestation","attest_author":"https://pith.science/pith/VQ2RFBJ3QZQQODKVRFAFXENOUM/action/author_attestation","sign_citation":"https://pith.science/pith/VQ2RFBJ3QZQQODKVRFAFXENOUM/action/citation_signature","submit_replication":"https://pith.science/pith/VQ2RFBJ3QZQQODKVRFAFXENOUM/action/replication_record"}},"created_at":"2026-07-05T02:34:56.617265+00:00","updated_at":"2026-07-05T02:34:56.617265+00:00"}