{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6BYWSMMDHLCRQXBV4COQTKY7AM","short_pith_number":"pith:6BYWSMMD","schema_version":"1.0","canonical_sha256":"f0716931833ac5185c35e09d09ab1f032e34ac0e8de0db8db863b8a8a9c52c81","source":{"kind":"arxiv","id":"2301.03543","version":1},"attestation_state":"computed","paper":{"title":"Efficient Mutation Testing via Pre-Trained Language Models","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Ahmed Khanfir, Mike Papadakis, Renzo Degiovanni, Yves Le Traon","submitted_at":"2023-01-09T17:49:59Z","abstract_excerpt":"Mutation testing is an established fault-based testing technique. It operates by seeding faults into the programs under test and asking developers to write tests that reveal these faults. These tests have the potential to reveal a large number of faults -- those that couple with the seeded ones -- and thus are deemed important. To this end, mutation testing should seed faults that are both \"natural\" in a sense easily understood by developers and strong (have high chances to reveal faults). To achieve this we propose using pre-trained generative language models (i.e. CodeBERT) that have the abi"},"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":"2301.03543","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.SE","submitted_at":"2023-01-09T17:49:59Z","cross_cats_sorted":[],"title_canon_sha256":"3a7bc99a55f57b23405381af973cadcd27f0794eed18713c1f017ca86ff6e0a7","abstract_canon_sha256":"32464f5ee4c4105d85359a9aa3a8686641f45da37ffbb2c6d093ddc3aeb0d927"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:31:36.858895Z","signature_b64":"V8UcAtA7gm+JZMmSYXsoRztewXCZOUNXogdUsDNXFqfum0Qoze/g1bMZDyYTNEyghYB8+NawjHat4gVVjEQeDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0716931833ac5185c35e09d09ab1f032e34ac0e8de0db8db863b8a8a9c52c81","last_reissued_at":"2026-07-05T05:31:36.858501Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:31:36.858501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Mutation Testing via Pre-Trained Language Models","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Ahmed Khanfir, Mike Papadakis, Renzo Degiovanni, Yves Le Traon","submitted_at":"2023-01-09T17:49:59Z","abstract_excerpt":"Mutation testing is an established fault-based testing technique. It operates by seeding faults into the programs under test and asking developers to write tests that reveal these faults. These tests have the potential to reveal a large number of faults -- those that couple with the seeded ones -- and thus are deemed important. To this end, mutation testing should seed faults that are both \"natural\" in a sense easily understood by developers and strong (have high chances to reveal faults). To achieve this we propose using pre-trained generative language models (i.e. CodeBERT) that have the abi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.03543","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.03543/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2301.03543","created_at":"2026-07-05T05:31:36.858555+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.03543v1","created_at":"2026-07-05T05:31:36.858555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.03543","created_at":"2026-07-05T05:31:36.858555+00:00"},{"alias_kind":"pith_short_12","alias_value":"6BYWSMMDHLCR","created_at":"2026-07-05T05:31:36.858555+00:00"},{"alias_kind":"pith_short_16","alias_value":"6BYWSMMDHLCRQXBV","created_at":"2026-07-05T05:31:36.858555+00:00"},{"alias_kind":"pith_short_8","alias_value":"6BYWSMMD","created_at":"2026-07-05T05:31:36.858555+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/6BYWSMMDHLCRQXBV4COQTKY7AM","json":"https://pith.science/pith/6BYWSMMDHLCRQXBV4COQTKY7AM.json","graph_json":"https://pith.science/api/pith-number/6BYWSMMDHLCRQXBV4COQTKY7AM/graph.json","events_json":"https://pith.science/api/pith-number/6BYWSMMDHLCRQXBV4COQTKY7AM/events.json","paper":"https://pith.science/paper/6BYWSMMD"},"agent_actions":{"view_html":"https://pith.science/pith/6BYWSMMDHLCRQXBV4COQTKY7AM","download_json":"https://pith.science/pith/6BYWSMMDHLCRQXBV4COQTKY7AM.json","view_paper":"https://pith.science/paper/6BYWSMMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.03543&json=true","fetch_graph":"https://pith.science/api/pith-number/6BYWSMMDHLCRQXBV4COQTKY7AM/graph.json","fetch_events":"https://pith.science/api/pith-number/6BYWSMMDHLCRQXBV4COQTKY7AM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6BYWSMMDHLCRQXBV4COQTKY7AM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6BYWSMMDHLCRQXBV4COQTKY7AM/action/storage_attestation","attest_author":"https://pith.science/pith/6BYWSMMDHLCRQXBV4COQTKY7AM/action/author_attestation","sign_citation":"https://pith.science/pith/6BYWSMMDHLCRQXBV4COQTKY7AM/action/citation_signature","submit_replication":"https://pith.science/pith/6BYWSMMDHLCRQXBV4COQTKY7AM/action/replication_record"}},"created_at":"2026-07-05T05:31:36.858555+00:00","updated_at":"2026-07-05T05:31:36.858555+00:00"}