{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VLSFMFMWE3M2ZEBWUT57TB2NLD","short_pith_number":"pith:VLSFMFMW","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"},"canonical_sha256":"aae456159626d9ac9036a4fbf9874d58c39a47f691f37b19b2008ba969c42467","source":{"kind":"arxiv","id":"1610.08020","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08020","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08020v1","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08020","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"pith_short_12","alias_value":"VLSFMFMWE3M2","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VLSFMFMWE3M2ZEBW","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VLSFMFMW","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VLSFMFMWE3M2ZEBWUT57TB2NLD","target":"record","payload":{"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"},"canonical_sha256":"aae456159626d9ac9036a4fbf9874d58c39a47f691f37b19b2008ba969c42467","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"},"source_kind":"arxiv","source_id":"1610.08020","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:01:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HuPfOeubB1ga6j0JG/+mTzz1RIKMVuvZU6i+qfUYUDV7m3y2rsNTHNFACUZ6YY7rygJrcdCHYvuaWd3eomSPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:32:13.459547Z"},"content_sha256":"b0f1813abdb498acd32da609a5e86cf09cd5e0ab5a02910590d4f63070bfb80b","schema_version":"1.0","event_id":"sha256:b0f1813abdb498acd32da609a5e86cf09cd5e0ab5a02910590d4f63070bfb80b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VLSFMFMWE3M2ZEBWUT57TB2NLD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:01:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o3AOJqxQQgQQIOBsHZTGgcyIfN0W8LngmBkYWkkJFVVsPjGDWQKsqrZJgxvXn7cbi5p4HVOKg94L/r16VB5hDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:32:13.459899Z"},"content_sha256":"3827ded597e3933623d835f01042f3a2f2c1f9ece28ea2521e74211238f4efec","schema_version":"1.0","event_id":"sha256:3827ded597e3933623d835f01042f3a2f2c1f9ece28ea2521e74211238f4efec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VLSFMFMWE3M2ZEBWUT57TB2NLD/bundle.json","state_url":"https://pith.science/pith/VLSFMFMWE3M2ZEBWUT57TB2NLD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VLSFMFMWE3M2ZEBWUT57TB2NLD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T17:32:13Z","links":{"resolver":"https://pith.science/pith/VLSFMFMWE3M2ZEBWUT57TB2NLD","bundle":"https://pith.science/pith/VLSFMFMWE3M2ZEBWUT57TB2NLD/bundle.json","state":"https://pith.science/pith/VLSFMFMWE3M2ZEBWUT57TB2NLD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VLSFMFMWE3M2ZEBWUT57TB2NLD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VLSFMFMWE3M2ZEBWUT57TB2NLD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"999f0535e25b574f326f6880c5729436cbbfe6e6ec8907bb59b1f88220c18422","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-09-20T22:50:40Z","title_canon_sha256":"f58cb90ccd46bc71dcfdc80c8eeac5a4c708cc14cd412bb5223302a61966b969"},"schema_version":"1.0","source":{"id":"1610.08020","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08020","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08020v1","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08020","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"pith_short_12","alias_value":"VLSFMFMWE3M2","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VLSFMFMWE3M2ZEBW","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VLSFMFMW","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:3827ded597e3933623d835f01042f3a2f2c1f9ece28ea2521e74211238f4efec","target":"graph","created_at":"2026-05-18T01:01:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alex Groce, Mohammad Amin Alipour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-09-20T22:50:40Z","title":"Bounded Model Checking and Feature Omission Diversity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08020","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b0f1813abdb498acd32da609a5e86cf09cd5e0ab5a02910590d4f63070bfb80b","target":"record","created_at":"2026-05-18T01:01:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"999f0535e25b574f326f6880c5729436cbbfe6e6ec8907bb59b1f88220c18422","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-09-20T22:50:40Z","title_canon_sha256":"f58cb90ccd46bc71dcfdc80c8eeac5a4c708cc14cd412bb5223302a61966b969"},"schema_version":"1.0","source":{"id":"1610.08020","kind":"arxiv","version":1}},"canonical_sha256":"aae456159626d9ac9036a4fbf9874d58c39a47f691f37b19b2008ba969c42467","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aae456159626d9ac9036a4fbf9874d58c39a47f691f37b19b2008ba969c42467","first_computed_at":"2026-05-18T01:01:16.915893Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:16.915893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9lyizQe3OaKWuAoy8Rbmbj92QsrsPINh9PTylwXS2SoxL7yAbTgKPwkIjokRH3MmNWzcS/cRdtJbwldMawA4Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:16.916525Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.08020","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0f1813abdb498acd32da609a5e86cf09cd5e0ab5a02910590d4f63070bfb80b","sha256:3827ded597e3933623d835f01042f3a2f2c1f9ece28ea2521e74211238f4efec"],"state_sha256":"be1f10bfd14228829c46864b20b116d9ac2a5eb31f9dd145b0dd6213bddbe1cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LYaBSx3D027gjU/HSnfNkaQPPx4rN+4tx02v6oSJly46j5A+HQB0rEI1Maj+P6NMEjxIvAH9jQyIOsL3ceXdDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T17:32:13.461865Z","bundle_sha256":"0513b369ba8471366006a6fdd8ebc784f3966eaedc74cb2c8f0f345c61251545"}}