{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VLSFMFMWE3M2ZEBWUT57TB2NLD","short_pith_number":"pith:VLSFMFMW","schema_version":"1.0","canonical_sha256":"aae456159626d9ac9036a4fbf9874d58c39a47f691f37b19b2008ba969c42467","source":{"kind":"arxiv","id":"1610.08020","version":1},"attestation_state":"computed","paper":{"title":"Bounded Model Checking and Feature Omission Diversity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Alex Groce, Mohammad Amin Alipour","submitted_at":"2016-09-20T22:50:40Z","abstract_excerpt":"In this paper we introduce a novel way to speed up the discovery of counterexamples in bounded model checking, based on parallel runs over versions of a system in which features have been randomly disabled. As shown in previous work, adding constraints to a bounded model checking problem can reduce the size of the verification problem and dramatically decrease the time required to find counterexample. Adapting a technique developed in software testing to this problem provides a simple way to produce useful partial verification problems, with a resulting decrease in average time until a counter"},"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":"1610.08020","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-09-20T22:50:40Z","cross_cats_sorted":[],"title_canon_sha256":"f58cb90ccd46bc71dcfdc80c8eeac5a4c708cc14cd412bb5223302a61966b969","abstract_canon_sha256":"999f0535e25b574f326f6880c5729436cbbfe6e6ec8907bb59b1f88220c18422"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:16.916525Z","signature_b64":"9lyizQe3OaKWuAoy8Rbmbj92QsrsPINh9PTylwXS2SoxL7yAbTgKPwkIjokRH3MmNWzcS/cRdtJbwldMawA4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aae456159626d9ac9036a4fbf9874d58c39a47f691f37b19b2008ba969c42467","last_reissued_at":"2026-05-18T01:01:16.915893Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:16.915893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded Model Checking and Feature Omission Diversity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Alex Groce, Mohammad Amin Alipour","submitted_at":"2016-09-20T22:50:40Z","abstract_excerpt":"In this paper we introduce a novel way to speed up the discovery of counterexamples in bounded model checking, based on parallel runs over versions of a system in which features have been randomly disabled. As shown in previous work, adding constraints to a bounded model checking problem can reduce the size of the verification problem and dramatically decrease the time required to find counterexample. Adapting a technique developed in software testing to this problem provides a simple way to produce useful partial verification problems, with a resulting decrease in average time until a counter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08020","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":"1610.08020","created_at":"2026-05-18T01:01:16.915983+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.08020v1","created_at":"2026-05-18T01:01:16.915983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08020","created_at":"2026-05-18T01:01:16.915983+00:00"},{"alias_kind":"pith_short_12","alias_value":"VLSFMFMWE3M2","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VLSFMFMWE3M2ZEBW","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VLSFMFMW","created_at":"2026-05-18T12:30:48.956258+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/VLSFMFMWE3M2ZEBWUT57TB2NLD","json":"https://pith.science/pith/VLSFMFMWE3M2ZEBWUT57TB2NLD.json","graph_json":"https://pith.science/api/pith-number/VLSFMFMWE3M2ZEBWUT57TB2NLD/graph.json","events_json":"https://pith.science/api/pith-number/VLSFMFMWE3M2ZEBWUT57TB2NLD/events.json","paper":"https://pith.science/paper/VLSFMFMW"},"agent_actions":{"view_html":"https://pith.science/pith/VLSFMFMWE3M2ZEBWUT57TB2NLD","download_json":"https://pith.science/pith/VLSFMFMWE3M2ZEBWUT57TB2NLD.json","view_paper":"https://pith.science/paper/VLSFMFMW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.08020&json=true","fetch_graph":"https://pith.science/api/pith-number/VLSFMFMWE3M2ZEBWUT57TB2NLD/graph.json","fetch_events":"https://pith.science/api/pith-number/VLSFMFMWE3M2ZEBWUT57TB2NLD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VLSFMFMWE3M2ZEBWUT57TB2NLD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VLSFMFMWE3M2ZEBWUT57TB2NLD/action/storage_attestation","attest_author":"https://pith.science/pith/VLSFMFMWE3M2ZEBWUT57TB2NLD/action/author_attestation","sign_citation":"https://pith.science/pith/VLSFMFMWE3M2ZEBWUT57TB2NLD/action/citation_signature","submit_replication":"https://pith.science/pith/VLSFMFMWE3M2ZEBWUT57TB2NLD/action/replication_record"}},"created_at":"2026-05-18T01:01:16.915983+00:00","updated_at":"2026-05-18T01:01:16.915983+00:00"}