{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DXUI5HIUAPYWD5Z2GMHX3YI2AN","short_pith_number":"pith:DXUI5HIU","schema_version":"1.0","canonical_sha256":"1de88e9d1403f161f73a330f7de11a034cdcc6ed7d33860d41b3a865c88c7608","source":{"kind":"arxiv","id":"1804.00073","version":1},"attestation_state":"computed","paper":{"title":"Generation of complete test sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Eugene Goldberg","submitted_at":"2018-03-30T22:33:10Z","abstract_excerpt":"We use testing to check if a combinational circuit N always evaluates to 0. The usual point of view is that to prove that N always evaluates to 0 one has to check the value of N for all 2^|X| input assignments where X is the set of input variables of N. We use the notion of a Stable Set of Assignments (SSA) to show that one can build a complete test set (i.e. a test set proving that N always evaluates to 0) that consists of less than 2^|X| tests. Given an unsatisfiable CNF formula H(W), an SSA of H is a set of assignments to W proving unsatisfiability of H. A trivial SSA is the set of all 2^|W"},"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":"1804.00073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-03-30T22:33:10Z","cross_cats_sorted":[],"title_canon_sha256":"918ea28ef3e8cb45c18856727e5eb0caa7e5fcf344723151edad6ffd0356275e","abstract_canon_sha256":"5dec9c2d8c10884c170a4bbe5fd1fc61fedbdba09f92a2aa1ed95f74d3e030a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:40.611247Z","signature_b64":"bAsA0PWC9yYxQpC7YJb6lNiUyrEmcb+NlDc+jmwtHXvPCNPjuzoExyLsfHDcvw0dKgxtgwHu5pjOtsfme+JwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1de88e9d1403f161f73a330f7de11a034cdcc6ed7d33860d41b3a865c88c7608","last_reissued_at":"2026-05-18T00:19:40.610714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:40.610714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generation of complete test sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Eugene Goldberg","submitted_at":"2018-03-30T22:33:10Z","abstract_excerpt":"We use testing to check if a combinational circuit N always evaluates to 0. The usual point of view is that to prove that N always evaluates to 0 one has to check the value of N for all 2^|X| input assignments where X is the set of input variables of N. We use the notion of a Stable Set of Assignments (SSA) to show that one can build a complete test set (i.e. a test set proving that N always evaluates to 0) that consists of less than 2^|X| tests. Given an unsatisfiable CNF formula H(W), an SSA of H is a set of assignments to W proving unsatisfiability of H. A trivial SSA is the set of all 2^|W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00073","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":"1804.00073","created_at":"2026-05-18T00:19:40.610807+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.00073v1","created_at":"2026-05-18T00:19:40.610807+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00073","created_at":"2026-05-18T00:19:40.610807+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXUI5HIUAPYW","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXUI5HIUAPYWD5Z2","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXUI5HIU","created_at":"2026-05-18T12:32:19.392346+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/DXUI5HIUAPYWD5Z2GMHX3YI2AN","json":"https://pith.science/pith/DXUI5HIUAPYWD5Z2GMHX3YI2AN.json","graph_json":"https://pith.science/api/pith-number/DXUI5HIUAPYWD5Z2GMHX3YI2AN/graph.json","events_json":"https://pith.science/api/pith-number/DXUI5HIUAPYWD5Z2GMHX3YI2AN/events.json","paper":"https://pith.science/paper/DXUI5HIU"},"agent_actions":{"view_html":"https://pith.science/pith/DXUI5HIUAPYWD5Z2GMHX3YI2AN","download_json":"https://pith.science/pith/DXUI5HIUAPYWD5Z2GMHX3YI2AN.json","view_paper":"https://pith.science/paper/DXUI5HIU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.00073&json=true","fetch_graph":"https://pith.science/api/pith-number/DXUI5HIUAPYWD5Z2GMHX3YI2AN/graph.json","fetch_events":"https://pith.science/api/pith-number/DXUI5HIUAPYWD5Z2GMHX3YI2AN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXUI5HIUAPYWD5Z2GMHX3YI2AN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXUI5HIUAPYWD5Z2GMHX3YI2AN/action/storage_attestation","attest_author":"https://pith.science/pith/DXUI5HIUAPYWD5Z2GMHX3YI2AN/action/author_attestation","sign_citation":"https://pith.science/pith/DXUI5HIUAPYWD5Z2GMHX3YI2AN/action/citation_signature","submit_replication":"https://pith.science/pith/DXUI5HIUAPYWD5Z2GMHX3YI2AN/action/replication_record"}},"created_at":"2026-05-18T00:19:40.610807+00:00","updated_at":"2026-05-18T00:19:40.610807+00:00"}