{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:MQVQZET4OQBDADZWECWJ2MU63X","short_pith_number":"pith:MQVQZET4","schema_version":"1.0","canonical_sha256":"642b0c927c7402300f3620ac9d329eddcb6e251de26f0acdc3e5b2bb79b8f59f","source":{"kind":"arxiv","id":"2111.13110","version":1},"attestation_state":"computed","paper":{"title":"QNNVerifier: A Tool for Verifying Neural Networks using SMT-Based Model Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.AI","authors_text":"Eddie de Lima Filho, Edoardo Manino, Erickson Alves, Iury Bessa, Lucas Cordeiro, Luiz Sena, Mikel Lujan, Xidan Song","submitted_at":"2021-11-25T14:55:40Z","abstract_excerpt":"QNNVerifier is the first open-source tool for verifying implementations of neural networks that takes into account the finite word-length (i.e. quantization) of their operands. The novel support for quantization is achieved by employing state-of-the-art software model checking (SMC) techniques. It translates the implementation of neural networks to a decidable fragment of first-order logic based on satisfiability modulo theories (SMT). The effects of fixed- and floating-point operations are represented through direct implementations given a hardware-determined precision. Furthermore, QNNVerifi"},"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":"2111.13110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-11-25T14:55:40Z","cross_cats_sorted":["cs.LG","cs.LO"],"title_canon_sha256":"5689667e03307a03091870ffc9482d95d22848c6c23ffd49b75534abb90f6dae","abstract_canon_sha256":"b8986dd8e781bc2edc6c0ff8ecebce780f5813f5f97cc81b7422158b6143fb44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:35:17.354377Z","signature_b64":"uzsz/cLtcPJB6gBKvGMZ1+esFuRX9SQTh+I/keiusF/KlRaBr6FsiWyEFqpc7kPQDMDjreQxpO7hrqYBkViLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"642b0c927c7402300f3620ac9d329eddcb6e251de26f0acdc3e5b2bb79b8f59f","last_reissued_at":"2026-07-05T03:35:17.353947Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:35:17.353947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QNNVerifier: A Tool for Verifying Neural Networks using SMT-Based Model Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.AI","authors_text":"Eddie de Lima Filho, Edoardo Manino, Erickson Alves, Iury Bessa, Lucas Cordeiro, Luiz Sena, Mikel Lujan, Xidan Song","submitted_at":"2021-11-25T14:55:40Z","abstract_excerpt":"QNNVerifier is the first open-source tool for verifying implementations of neural networks that takes into account the finite word-length (i.e. quantization) of their operands. The novel support for quantization is achieved by employing state-of-the-art software model checking (SMC) techniques. It translates the implementation of neural networks to a decidable fragment of first-order logic based on satisfiability modulo theories (SMT). The effects of fixed- and floating-point operations are represented through direct implementations given a hardware-determined precision. Furthermore, QNNVerifi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.13110","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/2111.13110/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":"2111.13110","created_at":"2026-07-05T03:35:17.354011+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.13110v1","created_at":"2026-07-05T03:35:17.354011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.13110","created_at":"2026-07-05T03:35:17.354011+00:00"},{"alias_kind":"pith_short_12","alias_value":"MQVQZET4OQBD","created_at":"2026-07-05T03:35:17.354011+00:00"},{"alias_kind":"pith_short_16","alias_value":"MQVQZET4OQBDADZW","created_at":"2026-07-05T03:35:17.354011+00:00"},{"alias_kind":"pith_short_8","alias_value":"MQVQZET4","created_at":"2026-07-05T03:35:17.354011+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/MQVQZET4OQBDADZWECWJ2MU63X","json":"https://pith.science/pith/MQVQZET4OQBDADZWECWJ2MU63X.json","graph_json":"https://pith.science/api/pith-number/MQVQZET4OQBDADZWECWJ2MU63X/graph.json","events_json":"https://pith.science/api/pith-number/MQVQZET4OQBDADZWECWJ2MU63X/events.json","paper":"https://pith.science/paper/MQVQZET4"},"agent_actions":{"view_html":"https://pith.science/pith/MQVQZET4OQBDADZWECWJ2MU63X","download_json":"https://pith.science/pith/MQVQZET4OQBDADZWECWJ2MU63X.json","view_paper":"https://pith.science/paper/MQVQZET4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.13110&json=true","fetch_graph":"https://pith.science/api/pith-number/MQVQZET4OQBDADZWECWJ2MU63X/graph.json","fetch_events":"https://pith.science/api/pith-number/MQVQZET4OQBDADZWECWJ2MU63X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MQVQZET4OQBDADZWECWJ2MU63X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MQVQZET4OQBDADZWECWJ2MU63X/action/storage_attestation","attest_author":"https://pith.science/pith/MQVQZET4OQBDADZWECWJ2MU63X/action/author_attestation","sign_citation":"https://pith.science/pith/MQVQZET4OQBDADZWECWJ2MU63X/action/citation_signature","submit_replication":"https://pith.science/pith/MQVQZET4OQBDADZWECWJ2MU63X/action/replication_record"}},"created_at":"2026-07-05T03:35:17.354011+00:00","updated_at":"2026-07-05T03:35:17.354011+00:00"}