{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZJT6L4FTZYVTJCIEZ4P24EEVTY","short_pith_number":"pith:ZJT6L4FT","schema_version":"1.0","canonical_sha256":"ca67e5f0b3ce2b348904cf1fae10959e120702eb62469897b1da5b7b9c33ad0a","source":{"kind":"arxiv","id":"1910.12396","version":2},"attestation_state":"computed","paper":{"title":"Simplifying Neural Networks using Formal Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.LO","authors_text":"Adi Malca, Alexander Feldsher, Clark Barrett, Guy Katz, Sumathi Gokulanathan","submitted_at":"2019-10-25T17:29:53Z","abstract_excerpt":"Deep neural network (DNN) verification is an emerging field, with diverse verification engines quickly becoming available. Demonstrating the effectiveness of these engines on real-world DNNs is an important step towards their wider adoption. We present a tool that can leverage existing verification engines in performing a novel application: neural network simplification, through the reduction of the size of a DNN without harming its accuracy. We report on the work-flow of the simplification process, and demonstrate its potential significance and applicability on a family of real-world DNNs for"},"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":"1910.12396","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-10-25T17:29:53Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"e158ba475230d13225d0ee0fc6cd97e9bce92ce92ef2aec599558c4dd3af160f","abstract_canon_sha256":"964bbf04030a6708cc69eeab7341d0ac2ebbb1cf4b5c4e480e5d38b747249935"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:25:52.153870Z","signature_b64":"mHm2jXBLcUeYVgMby/j+62XSfhS6FAFV/RxlrdoLHnrnJEYReHVncuocgeZL5s3QQI2N4D0ZOJbuvr34kDryCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca67e5f0b3ce2b348904cf1fae10959e120702eb62469897b1da5b7b9c33ad0a","last_reissued_at":"2026-07-05T01:25:52.153388Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:25:52.153388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplifying Neural Networks using Formal Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.LO","authors_text":"Adi Malca, Alexander Feldsher, Clark Barrett, Guy Katz, Sumathi Gokulanathan","submitted_at":"2019-10-25T17:29:53Z","abstract_excerpt":"Deep neural network (DNN) verification is an emerging field, with diverse verification engines quickly becoming available. Demonstrating the effectiveness of these engines on real-world DNNs is an important step towards their wider adoption. We present a tool that can leverage existing verification engines in performing a novel application: neural network simplification, through the reduction of the size of a DNN without harming its accuracy. We report on the work-flow of the simplification process, and demonstrate its potential significance and applicability on a family of real-world DNNs for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.12396","kind":"arxiv","version":2},"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/1910.12396/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":"1910.12396","created_at":"2026-07-05T01:25:52.153447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.12396v2","created_at":"2026-07-05T01:25:52.153447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.12396","created_at":"2026-07-05T01:25:52.153447+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJT6L4FTZYVT","created_at":"2026-07-05T01:25:52.153447+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJT6L4FTZYVTJCIE","created_at":"2026-07-05T01:25:52.153447+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJT6L4FT","created_at":"2026-07-05T01:25:52.153447+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZJT6L4FTZYVTJCIEZ4P24EEVTY","json":"https://pith.science/pith/ZJT6L4FTZYVTJCIEZ4P24EEVTY.json","graph_json":"https://pith.science/api/pith-number/ZJT6L4FTZYVTJCIEZ4P24EEVTY/graph.json","events_json":"https://pith.science/api/pith-number/ZJT6L4FTZYVTJCIEZ4P24EEVTY/events.json","paper":"https://pith.science/paper/ZJT6L4FT"},"agent_actions":{"view_html":"https://pith.science/pith/ZJT6L4FTZYVTJCIEZ4P24EEVTY","download_json":"https://pith.science/pith/ZJT6L4FTZYVTJCIEZ4P24EEVTY.json","view_paper":"https://pith.science/paper/ZJT6L4FT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.12396&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJT6L4FTZYVTJCIEZ4P24EEVTY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJT6L4FTZYVTJCIEZ4P24EEVTY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJT6L4FTZYVTJCIEZ4P24EEVTY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJT6L4FTZYVTJCIEZ4P24EEVTY/action/storage_attestation","attest_author":"https://pith.science/pith/ZJT6L4FTZYVTJCIEZ4P24EEVTY/action/author_attestation","sign_citation":"https://pith.science/pith/ZJT6L4FTZYVTJCIEZ4P24EEVTY/action/citation_signature","submit_replication":"https://pith.science/pith/ZJT6L4FTZYVTJCIEZ4P24EEVTY/action/replication_record"}},"created_at":"2026-07-05T01:25:52.153447+00:00","updated_at":"2026-07-05T01:25:52.153447+00:00"}