{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:R7HT44JBGQOQOMAHW35IASWWCM","short_pith_number":"pith:R7HT44JB","schema_version":"1.0","canonical_sha256":"8fcf3e7121341d073007b6fa804ad6132e8e7146c5656d1f03b93f47b1395c8e","source":{"kind":"arxiv","id":"1308.0583","version":2},"attestation_state":"computed","paper":{"title":"Verification of Sequential Circuits by Tests-As-Proofs Paradigm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Eugene Goldberg, Mitesh Jain, Panagiotis Manolios","submitted_at":"2013-08-02T19:01:52Z","abstract_excerpt":"We introduce an algorithm for detection of bugs in sequential circuits. This algorithm is incomplete i.e. its failure to find a bug breaking a property P does not imply that P holds. The appeal of incomplete algorithms is that they scale better than their complete counterparts. However, to make an incomplete algorithm effective one needs to guarantee that the probability of finding a bug is reasonably high. We try to achieve such effectiveness by employing the Test-As-Proofs (TAP) paradigm. In our TAP based approach, a counterexample is built as a sequence of states extracted from proofs that "},"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":"1308.0583","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-08-02T19:01:52Z","cross_cats_sorted":[],"title_canon_sha256":"6e169ae9eac466ac7404ada017fdce129dbe3617006df3ef9e2a97e10054d252","abstract_canon_sha256":"1a9d8c7544afc843124edf4d79dbb247c62c612a747227d42d097e2fb6330a31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:21.925895Z","signature_b64":"z1cd+PkTAVLxG2nx2frRRoRBG3bDA78oBTBKnGx6BAAc9r3bRXSIQCWHCe2N/k6NUTUHNMsecamO6n02GNd7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fcf3e7121341d073007b6fa804ad6132e8e7146c5656d1f03b93f47b1395c8e","last_reissued_at":"2026-05-18T03:12:21.925051Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:21.925051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verification of Sequential Circuits by Tests-As-Proofs Paradigm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Eugene Goldberg, Mitesh Jain, Panagiotis Manolios","submitted_at":"2013-08-02T19:01:52Z","abstract_excerpt":"We introduce an algorithm for detection of bugs in sequential circuits. This algorithm is incomplete i.e. its failure to find a bug breaking a property P does not imply that P holds. The appeal of incomplete algorithms is that they scale better than their complete counterparts. However, to make an incomplete algorithm effective one needs to guarantee that the probability of finding a bug is reasonably high. We try to achieve such effectiveness by employing the Test-As-Proofs (TAP) paradigm. In our TAP based approach, a counterexample is built as a sequence of states extracted from proofs that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0583","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":""},"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":"1308.0583","created_at":"2026-05-18T03:12:21.925185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.0583v2","created_at":"2026-05-18T03:12:21.925185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0583","created_at":"2026-05-18T03:12:21.925185+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7HT44JBGQOQ","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7HT44JBGQOQOMAH","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7HT44JB","created_at":"2026-05-18T12:27:57.521954+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/R7HT44JBGQOQOMAHW35IASWWCM","json":"https://pith.science/pith/R7HT44JBGQOQOMAHW35IASWWCM.json","graph_json":"https://pith.science/api/pith-number/R7HT44JBGQOQOMAHW35IASWWCM/graph.json","events_json":"https://pith.science/api/pith-number/R7HT44JBGQOQOMAHW35IASWWCM/events.json","paper":"https://pith.science/paper/R7HT44JB"},"agent_actions":{"view_html":"https://pith.science/pith/R7HT44JBGQOQOMAHW35IASWWCM","download_json":"https://pith.science/pith/R7HT44JBGQOQOMAHW35IASWWCM.json","view_paper":"https://pith.science/paper/R7HT44JB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.0583&json=true","fetch_graph":"https://pith.science/api/pith-number/R7HT44JBGQOQOMAHW35IASWWCM/graph.json","fetch_events":"https://pith.science/api/pith-number/R7HT44JBGQOQOMAHW35IASWWCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7HT44JBGQOQOMAHW35IASWWCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7HT44JBGQOQOMAHW35IASWWCM/action/storage_attestation","attest_author":"https://pith.science/pith/R7HT44JBGQOQOMAHW35IASWWCM/action/author_attestation","sign_citation":"https://pith.science/pith/R7HT44JBGQOQOMAHW35IASWWCM/action/citation_signature","submit_replication":"https://pith.science/pith/R7HT44JBGQOQOMAHW35IASWWCM/action/replication_record"}},"created_at":"2026-05-18T03:12:21.925185+00:00","updated_at":"2026-05-18T03:12:21.925185+00:00"}