{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ORFMUVVAG2FHCE2BWGH56Z2F6A","short_pith_number":"pith:ORFMUVVA","canonical_record":{"source":{"id":"1803.07901","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-03-21T13:21:16Z","cross_cats_sorted":[],"title_canon_sha256":"c26d6002cc4c174d904e80d567b007209adc99e84bd0d7c6fda06f3f72f8c242","abstract_canon_sha256":"ca4d8f43e337ee14f372e2bbed1c873d5d0fa68c435708aa3b45465cbb9efc23"},"schema_version":"1.0"},"canonical_sha256":"744aca56a0368a711341b18fdf6745f0071146247edcd73a6fb3332a18c3a4db","source":{"kind":"arxiv","id":"1803.07901","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07901","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07901v3","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07901","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"pith_short_12","alias_value":"ORFMUVVAG2FH","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"ORFMUVVAG2FHCE2B","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"ORFMUVVA","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ORFMUVVAG2FHCE2BWGH56Z2F6A","target":"record","payload":{"canonical_record":{"source":{"id":"1803.07901","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-03-21T13:21:16Z","cross_cats_sorted":[],"title_canon_sha256":"c26d6002cc4c174d904e80d567b007209adc99e84bd0d7c6fda06f3f72f8c242","abstract_canon_sha256":"ca4d8f43e337ee14f372e2bbed1c873d5d0fa68c435708aa3b45465cbb9efc23"},"schema_version":"1.0"},"canonical_sha256":"744aca56a0368a711341b18fdf6745f0071146247edcd73a6fb3332a18c3a4db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:38.561578Z","signature_b64":"885sKMbUpiaLOqORBgkxt6zPnmftIAN4U/ed8jPrNIC3kWQofZ1KKZNZ5YebHiYtH77Hp7ZbJqxVYwCtIIU/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"744aca56a0368a711341b18fdf6745f0071146247edcd73a6fb3332a18c3a4db","last_reissued_at":"2026-05-18T00:01:38.561032Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:38.561032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.07901","source_version":3,"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-18T00:01:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"86FSguOsEMlXf3uNoYRt+XVH/XUVPLx15UlvmjYez8r2XpGFfc+6yYpULT/q4I/sBeu+gxwNykuD4ds4XcjWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T01:27:16.532940Z"},"content_sha256":"b1891eb0327204067de11126c8d47441715968eba13d21c63ba96ea87c7b5bab","schema_version":"1.0","event_id":"sha256:b1891eb0327204067de11126c8d47441715968eba13d21c63ba96ea87c7b5bab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ORFMUVVAG2FHCE2BWGH56Z2F6A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Selecting Fault Revealing Mutants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Koushik Sen, Mike Papadakis, Tegawend\\'e Bissyand\\'e, Thierry Titcheu Chekam, Yves Le Traon","submitted_at":"2018-03-21T13:21:16Z","abstract_excerpt":"Mutant selection refers to the problem of choosing, among a large number of mutants, the (few) ones that should be used by the testers. In view of this, we investigate the problem of selecting the fault revealing mutants, i.e., the mutants that are most likely to be killable and lead to test cases that uncover unknown program faults. We formulate two variants of this problem: the fault revealing mutant selection and the fault revealing mutant prioritization. We argue and show that these problems can be tackled through a set of 'static' program features and propose a machine learning approach, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07901","kind":"arxiv","version":3},"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-18T00:01:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zk9lFzPOLT7ps3SXP4xsJgdmsS64Tm04fU+b7fpeuPbclLQCamtIQxK1TT8DEn8vgKEKr2n6SxofGly1nT6VDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T01:27:16.533651Z"},"content_sha256":"226aa5df05d0cc2d96e6e5dd631aad4bd9a82d07df73018baa39b5b821434d07","schema_version":"1.0","event_id":"sha256:226aa5df05d0cc2d96e6e5dd631aad4bd9a82d07df73018baa39b5b821434d07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ORFMUVVAG2FHCE2BWGH56Z2F6A/bundle.json","state_url":"https://pith.science/pith/ORFMUVVAG2FHCE2BWGH56Z2F6A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ORFMUVVAG2FHCE2BWGH56Z2F6A/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-05-20T01:27:16Z","links":{"resolver":"https://pith.science/pith/ORFMUVVAG2FHCE2BWGH56Z2F6A","bundle":"https://pith.science/pith/ORFMUVVAG2FHCE2BWGH56Z2F6A/bundle.json","state":"https://pith.science/pith/ORFMUVVAG2FHCE2BWGH56Z2F6A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ORFMUVVAG2FHCE2BWGH56Z2F6A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ORFMUVVAG2FHCE2BWGH56Z2F6A","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":"ca4d8f43e337ee14f372e2bbed1c873d5d0fa68c435708aa3b45465cbb9efc23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-03-21T13:21:16Z","title_canon_sha256":"c26d6002cc4c174d904e80d567b007209adc99e84bd0d7c6fda06f3f72f8c242"},"schema_version":"1.0","source":{"id":"1803.07901","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07901","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07901v3","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07901","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"pith_short_12","alias_value":"ORFMUVVAG2FH","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"ORFMUVVAG2FHCE2B","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"ORFMUVVA","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:226aa5df05d0cc2d96e6e5dd631aad4bd9a82d07df73018baa39b5b821434d07","target":"graph","created_at":"2026-05-18T00:01:38Z","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":"Mutant selection refers to the problem of choosing, among a large number of mutants, the (few) ones that should be used by the testers. In view of this, we investigate the problem of selecting the fault revealing mutants, i.e., the mutants that are most likely to be killable and lead to test cases that uncover unknown program faults. We formulate two variants of this problem: the fault revealing mutant selection and the fault revealing mutant prioritization. We argue and show that these problems can be tackled through a set of 'static' program features and propose a machine learning approach, ","authors_text":"Koushik Sen, Mike Papadakis, Tegawend\\'e Bissyand\\'e, Thierry Titcheu Chekam, Yves Le Traon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-03-21T13:21:16Z","title":"Selecting Fault Revealing Mutants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07901","kind":"arxiv","version":3},"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:b1891eb0327204067de11126c8d47441715968eba13d21c63ba96ea87c7b5bab","target":"record","created_at":"2026-05-18T00:01:38Z","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":"ca4d8f43e337ee14f372e2bbed1c873d5d0fa68c435708aa3b45465cbb9efc23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-03-21T13:21:16Z","title_canon_sha256":"c26d6002cc4c174d904e80d567b007209adc99e84bd0d7c6fda06f3f72f8c242"},"schema_version":"1.0","source":{"id":"1803.07901","kind":"arxiv","version":3}},"canonical_sha256":"744aca56a0368a711341b18fdf6745f0071146247edcd73a6fb3332a18c3a4db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"744aca56a0368a711341b18fdf6745f0071146247edcd73a6fb3332a18c3a4db","first_computed_at":"2026-05-18T00:01:38.561032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:38.561032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"885sKMbUpiaLOqORBgkxt6zPnmftIAN4U/ed8jPrNIC3kWQofZ1KKZNZ5YebHiYtH77Hp7ZbJqxVYwCtIIU/BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:38.561578Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.07901","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1891eb0327204067de11126c8d47441715968eba13d21c63ba96ea87c7b5bab","sha256:226aa5df05d0cc2d96e6e5dd631aad4bd9a82d07df73018baa39b5b821434d07"],"state_sha256":"f40bb4d07ecc8c7cb13323b3f69ad97647e91d838beaadd9d764f8c22e27e2cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KRh+salhrtzRboCbFpn7Mya15nJKjd7tHjB+CXgIAcaWp7oQEFVXrnWy1s2PRBCiGR4SYGMy3D8drmLWYeb+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T01:27:16.537200Z","bundle_sha256":"4ecce25fe5a4a4e5b052751acbed534fd1bd867816a1f7d407e5e850448e6bea"}}