{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZFBJZIRY4HGOEG3LUFJQZ4NYWC","short_pith_number":"pith:ZFBJZIRY","schema_version":"1.0","canonical_sha256":"c9429ca238e1cce21b6ba1530cf1b8b0b4a37b07ea94aff8e2e595c11f349a44","source":{"kind":"arxiv","id":"1803.09571","version":2},"attestation_state":"computed","paper":{"title":"Source Code Optimization using Equivalent Mutants","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Jorge L\\'opez, Natalia Kushik, Nina Yevtushenko","submitted_at":"2018-03-26T13:23:17Z","abstract_excerpt":"A mutant is a program obtained by syntactically modifying a program's source code; an equivalent mutant is a mutant, which is functionally equivalent to the original program. Mutants are primarily used in \\emph{mutation testing}, and when deriving a test suite, obtaining an equivalent mutant is considered to be highly negative, although these equivalent mutants could be used for other purposes. We present an approach that considers equivalent mutants valuable, and utilizes them for source code optimization. Source code optimization enhances a program's source code preserving its behavior. We s"},"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":"1803.09571","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2018-03-26T13:23:17Z","cross_cats_sorted":[],"title_canon_sha256":"3362b5ddd860c3d345ff89953a232b41a40bda18776b15e4c6724233d9eea414","abstract_canon_sha256":"0357fba28f8eb29ff9361afea2d0b4fae7356712fbdb0f5c48c3a8a1a1f4490e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:49.511941Z","signature_b64":"CNx9SwG8x5lb7Nic6xXDVtUCbxC5QuppXtKuBbpEeU5UCwmqdU0Ga6lhr8C7vlCjv4ihD0eiH8h6z6aH8dzGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9429ca238e1cce21b6ba1530cf1b8b0b4a37b07ea94aff8e2e595c11f349a44","last_reissued_at":"2026-05-18T00:11:49.511384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:49.511384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Source Code Optimization using Equivalent Mutants","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Jorge L\\'opez, Natalia Kushik, Nina Yevtushenko","submitted_at":"2018-03-26T13:23:17Z","abstract_excerpt":"A mutant is a program obtained by syntactically modifying a program's source code; an equivalent mutant is a mutant, which is functionally equivalent to the original program. Mutants are primarily used in \\emph{mutation testing}, and when deriving a test suite, obtaining an equivalent mutant is considered to be highly negative, although these equivalent mutants could be used for other purposes. We present an approach that considers equivalent mutants valuable, and utilizes them for source code optimization. Source code optimization enhances a program's source code preserving its behavior. We s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09571","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":""},"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":"1803.09571","created_at":"2026-05-18T00:11:49.511470+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.09571v2","created_at":"2026-05-18T00:11:49.511470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09571","created_at":"2026-05-18T00:11:49.511470+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFBJZIRY4HGO","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFBJZIRY4HGOEG3L","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFBJZIRY","created_at":"2026-05-18T12:33:07.085635+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/ZFBJZIRY4HGOEG3LUFJQZ4NYWC","json":"https://pith.science/pith/ZFBJZIRY4HGOEG3LUFJQZ4NYWC.json","graph_json":"https://pith.science/api/pith-number/ZFBJZIRY4HGOEG3LUFJQZ4NYWC/graph.json","events_json":"https://pith.science/api/pith-number/ZFBJZIRY4HGOEG3LUFJQZ4NYWC/events.json","paper":"https://pith.science/paper/ZFBJZIRY"},"agent_actions":{"view_html":"https://pith.science/pith/ZFBJZIRY4HGOEG3LUFJQZ4NYWC","download_json":"https://pith.science/pith/ZFBJZIRY4HGOEG3LUFJQZ4NYWC.json","view_paper":"https://pith.science/paper/ZFBJZIRY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.09571&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFBJZIRY4HGOEG3LUFJQZ4NYWC/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFBJZIRY4HGOEG3LUFJQZ4NYWC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFBJZIRY4HGOEG3LUFJQZ4NYWC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFBJZIRY4HGOEG3LUFJQZ4NYWC/action/storage_attestation","attest_author":"https://pith.science/pith/ZFBJZIRY4HGOEG3LUFJQZ4NYWC/action/author_attestation","sign_citation":"https://pith.science/pith/ZFBJZIRY4HGOEG3LUFJQZ4NYWC/action/citation_signature","submit_replication":"https://pith.science/pith/ZFBJZIRY4HGOEG3LUFJQZ4NYWC/action/replication_record"}},"created_at":"2026-05-18T00:11:49.511470+00:00","updated_at":"2026-05-18T00:11:49.511470+00:00"}