{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TFKEL47AAUVM52BOJURS5HIPNA","short_pith_number":"pith:TFKEL47A","schema_version":"1.0","canonical_sha256":"995445f3e0052acee82e4d232e9d0f6805aea26f16729ac0cdd059ea1a32b8cc","source":{"kind":"arxiv","id":"1807.10875","version":1},"attestation_state":"computed","paper":{"title":"TensorFuzz: Debugging Neural Networks with Coverage-Guided Fuzzing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Augustus Odena, Ian Goodfellow","submitted_at":"2018-07-28T02:11:40Z","abstract_excerpt":"Machine learning models are notoriously difficult to interpret and debug. This is particularly true of neural networks. In this work, we introduce automated software testing techniques for neural networks that are well-suited to discovering errors which occur only for rare inputs. Specifically, we develop coverage-guided fuzzing (CGF) methods for neural networks. In CGF, random mutations of inputs to a neural network are guided by a coverage metric toward the goal of satisfying user-specified constraints. We describe how fast approximate nearest neighbor algorithms can provide this coverage me"},"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":"1807.10875","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-28T02:11:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3661c3433152c67bf0f4c98d2a5d815f7dad4f47648ac41a8b231ddd8d0f71dc","abstract_canon_sha256":"4f07c2d95143279c96eeaf4c89a5459ca604ca05eed0e3a7cdc2a178d2ffc32d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:37.178959Z","signature_b64":"qFqtpXRcLnU6FUXCqrZUP+sR9jsHBHYTcZvO3A13Pwlu5ODU1dT0C2xnwyiHKFls32UQe2Ya45bipGCd7OcGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"995445f3e0052acee82e4d232e9d0f6805aea26f16729ac0cdd059ea1a32b8cc","last_reissued_at":"2026-05-18T00:09:37.178435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:37.178435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TensorFuzz: Debugging Neural Networks with Coverage-Guided Fuzzing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Augustus Odena, Ian Goodfellow","submitted_at":"2018-07-28T02:11:40Z","abstract_excerpt":"Machine learning models are notoriously difficult to interpret and debug. This is particularly true of neural networks. In this work, we introduce automated software testing techniques for neural networks that are well-suited to discovering errors which occur only for rare inputs. Specifically, we develop coverage-guided fuzzing (CGF) methods for neural networks. In CGF, random mutations of inputs to a neural network are guided by a coverage metric toward the goal of satisfying user-specified constraints. We describe how fast approximate nearest neighbor algorithms can provide this coverage me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10875","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":""},"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":"1807.10875","created_at":"2026-05-18T00:09:37.178513+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.10875v1","created_at":"2026-05-18T00:09:37.178513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10875","created_at":"2026-05-18T00:09:37.178513+00:00"},{"alias_kind":"pith_short_12","alias_value":"TFKEL47AAUVM","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TFKEL47AAUVM52BO","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TFKEL47A","created_at":"2026-05-18T12:32:53.628368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.06977","citing_title":"Toward Reproducible Cross-Backend Compatibility for Deep Learning: A Configuration-First Framework with Three-Tier Verification","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TFKEL47AAUVM52BOJURS5HIPNA","json":"https://pith.science/pith/TFKEL47AAUVM52BOJURS5HIPNA.json","graph_json":"https://pith.science/api/pith-number/TFKEL47AAUVM52BOJURS5HIPNA/graph.json","events_json":"https://pith.science/api/pith-number/TFKEL47AAUVM52BOJURS5HIPNA/events.json","paper":"https://pith.science/paper/TFKEL47A"},"agent_actions":{"view_html":"https://pith.science/pith/TFKEL47AAUVM52BOJURS5HIPNA","download_json":"https://pith.science/pith/TFKEL47AAUVM52BOJURS5HIPNA.json","view_paper":"https://pith.science/paper/TFKEL47A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.10875&json=true","fetch_graph":"https://pith.science/api/pith-number/TFKEL47AAUVM52BOJURS5HIPNA/graph.json","fetch_events":"https://pith.science/api/pith-number/TFKEL47AAUVM52BOJURS5HIPNA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TFKEL47AAUVM52BOJURS5HIPNA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TFKEL47AAUVM52BOJURS5HIPNA/action/storage_attestation","attest_author":"https://pith.science/pith/TFKEL47AAUVM52BOJURS5HIPNA/action/author_attestation","sign_citation":"https://pith.science/pith/TFKEL47AAUVM52BOJURS5HIPNA/action/citation_signature","submit_replication":"https://pith.science/pith/TFKEL47AAUVM52BOJURS5HIPNA/action/replication_record"}},"created_at":"2026-05-18T00:09:37.178513+00:00","updated_at":"2026-05-18T00:09:37.178513+00:00"}