{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OZADMDLSIH3EWPSAEBU2Y6W4RE","short_pith_number":"pith:OZADMDLS","schema_version":"1.0","canonical_sha256":"7640360d7241f64b3e402069ac7adc8928592fba26667f0258fb90062e505a8e","source":{"kind":"arxiv","id":"2404.09952","version":2},"attestation_state":"computed","paper":{"title":"LLMorpheus: Mutation Testing using Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Frank Tip, Jonathan Bell, Max Schaefer","submitted_at":"2024-04-15T17:25:14Z","abstract_excerpt":"In mutation testing, the quality of a test suite is evaluated by introducing faults into a program and determining whether the program's tests detect them. Most existing approaches for mutation testing involve the application of a fixed set of mutation operators, e.g., replacing a \"+\" with a \"-\", or removing a function's body. However, certain types of real-world bugs cannot easily be simulated by such approaches, limiting their effectiveness. This paper presents a technique for mutation testing where placeholders are introduced at designated locations in a program's source code and where a La"},"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":"2404.09952","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2024-04-15T17:25:14Z","cross_cats_sorted":[],"title_canon_sha256":"5088ec4bff0997ccce091d59068d92990d86f95db578d177a57d02b90d99efca","abstract_canon_sha256":"fcfc148f02b95222f152f5b25caf9e5b6a0a139316f0c650360b9cc10fcd105a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:26:02.437407Z","signature_b64":"MK79jie6F+34iQhCsnRIXqPtsHeQEsl43da1Wx4TBizp3LwVLkfEvKbaaOt6/ftz+Dz1QgJ5xQlB5+cA39uRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7640360d7241f64b3e402069ac7adc8928592fba26667f0258fb90062e505a8e","last_reissued_at":"2026-07-05T10:26:02.436710Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:26:02.436710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LLMorpheus: Mutation Testing using Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Frank Tip, Jonathan Bell, Max Schaefer","submitted_at":"2024-04-15T17:25:14Z","abstract_excerpt":"In mutation testing, the quality of a test suite is evaluated by introducing faults into a program and determining whether the program's tests detect them. Most existing approaches for mutation testing involve the application of a fixed set of mutation operators, e.g., replacing a \"+\" with a \"-\", or removing a function's body. However, certain types of real-world bugs cannot easily be simulated by such approaches, limiting their effectiveness. This paper presents a technique for mutation testing where placeholders are introduced at designated locations in a program's source code and where a La"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.09952","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.09952/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":"2404.09952","created_at":"2026-07-05T10:26:02.436798+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.09952v2","created_at":"2026-07-05T10:26:02.436798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.09952","created_at":"2026-07-05T10:26:02.436798+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZADMDLSIH3E","created_at":"2026-07-05T10:26:02.436798+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZADMDLSIH3EWPSA","created_at":"2026-07-05T10:26:02.436798+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZADMDLS","created_at":"2026-07-05T10:26:02.436798+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.28653","citing_title":"BACE: LLM-based Code Generation through Bayesian Anchored Co-Evolution of Code and Test Populations","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OZADMDLSIH3EWPSAEBU2Y6W4RE","json":"https://pith.science/pith/OZADMDLSIH3EWPSAEBU2Y6W4RE.json","graph_json":"https://pith.science/api/pith-number/OZADMDLSIH3EWPSAEBU2Y6W4RE/graph.json","events_json":"https://pith.science/api/pith-number/OZADMDLSIH3EWPSAEBU2Y6W4RE/events.json","paper":"https://pith.science/paper/OZADMDLS"},"agent_actions":{"view_html":"https://pith.science/pith/OZADMDLSIH3EWPSAEBU2Y6W4RE","download_json":"https://pith.science/pith/OZADMDLSIH3EWPSAEBU2Y6W4RE.json","view_paper":"https://pith.science/paper/OZADMDLS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.09952&json=true","fetch_graph":"https://pith.science/api/pith-number/OZADMDLSIH3EWPSAEBU2Y6W4RE/graph.json","fetch_events":"https://pith.science/api/pith-number/OZADMDLSIH3EWPSAEBU2Y6W4RE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZADMDLSIH3EWPSAEBU2Y6W4RE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZADMDLSIH3EWPSAEBU2Y6W4RE/action/storage_attestation","attest_author":"https://pith.science/pith/OZADMDLSIH3EWPSAEBU2Y6W4RE/action/author_attestation","sign_citation":"https://pith.science/pith/OZADMDLSIH3EWPSAEBU2Y6W4RE/action/citation_signature","submit_replication":"https://pith.science/pith/OZADMDLSIH3EWPSAEBU2Y6W4RE/action/replication_record"}},"created_at":"2026-07-05T10:26:02.436798+00:00","updated_at":"2026-07-05T10:26:02.436798+00:00"}