{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZFBJZIRY4HGOEG3LUFJQZ4NYWC","short_pith_number":"pith:ZFBJZIRY","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"},"canonical_sha256":"c9429ca238e1cce21b6ba1530cf1b8b0b4a37b07ea94aff8e2e595c11f349a44","source":{"kind":"arxiv","id":"1803.09571","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09571","created_at":"2026-05-18T00:11:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09571v2","created_at":"2026-05-18T00:11:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09571","created_at":"2026-05-18T00:11:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZFBJZIRY4HGO","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZFBJZIRY4HGOEG3L","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZFBJZIRY","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZFBJZIRY4HGOEG3LUFJQZ4NYWC","target":"record","payload":{"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"},"canonical_sha256":"c9429ca238e1cce21b6ba1530cf1b8b0b4a37b07ea94aff8e2e595c11f349a44","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"},"source_kind":"arxiv","source_id":"1803.09571","source_version":2,"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:11:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z31pnizywL/6Ubn6u56cWtZyytyz3Lq0syDnHF4G9TDeyPxYP8DNW3sg78NbiynEgCOTd2BN8GlwQbkuW3rMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T16:09:01.516463Z"},"content_sha256":"8583602e82c9476558ffd35858d08af2cc56c081db55e20f26e236797083df02","schema_version":"1.0","event_id":"sha256:8583602e82c9476558ffd35858d08af2cc56c081db55e20f26e236797083df02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZFBJZIRY4HGOEG3LUFJQZ4NYWC","target":"graph","payload":{"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"},"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:11:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3DH5SmRdSDA42mMLIi1akDgwfaUyWRYDJ2xncmBZVevyOJOgqA50CAC0IdVbTRrid0D2BFVEDEs+/uehPnJjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T16:09:01.516803Z"},"content_sha256":"9c04335827f049c88efdfea316a7deffa647fd2aff2d1c3df8b42b8c65185281","schema_version":"1.0","event_id":"sha256:9c04335827f049c88efdfea316a7deffa647fd2aff2d1c3df8b42b8c65185281"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZFBJZIRY4HGOEG3LUFJQZ4NYWC/bundle.json","state_url":"https://pith.science/pith/ZFBJZIRY4HGOEG3LUFJQZ4NYWC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZFBJZIRY4HGOEG3LUFJQZ4NYWC/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-26T16:09:01Z","links":{"resolver":"https://pith.science/pith/ZFBJZIRY4HGOEG3LUFJQZ4NYWC","bundle":"https://pith.science/pith/ZFBJZIRY4HGOEG3LUFJQZ4NYWC/bundle.json","state":"https://pith.science/pith/ZFBJZIRY4HGOEG3LUFJQZ4NYWC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZFBJZIRY4HGOEG3LUFJQZ4NYWC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZFBJZIRY4HGOEG3LUFJQZ4NYWC","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":"0357fba28f8eb29ff9361afea2d0b4fae7356712fbdb0f5c48c3a8a1a1f4490e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2018-03-26T13:23:17Z","title_canon_sha256":"3362b5ddd860c3d345ff89953a232b41a40bda18776b15e4c6724233d9eea414"},"schema_version":"1.0","source":{"id":"1803.09571","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09571","created_at":"2026-05-18T00:11:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09571v2","created_at":"2026-05-18T00:11:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09571","created_at":"2026-05-18T00:11:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZFBJZIRY4HGO","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZFBJZIRY4HGOEG3L","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZFBJZIRY","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:9c04335827f049c88efdfea316a7deffa647fd2aff2d1c3df8b42b8c65185281","target":"graph","created_at":"2026-05-18T00:11:49Z","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":"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","authors_text":"Jorge L\\'opez, Natalia Kushik, Nina Yevtushenko","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2018-03-26T13:23:17Z","title":"Source Code Optimization using Equivalent Mutants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09571","kind":"arxiv","version":2},"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:8583602e82c9476558ffd35858d08af2cc56c081db55e20f26e236797083df02","target":"record","created_at":"2026-05-18T00:11:49Z","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":"0357fba28f8eb29ff9361afea2d0b4fae7356712fbdb0f5c48c3a8a1a1f4490e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2018-03-26T13:23:17Z","title_canon_sha256":"3362b5ddd860c3d345ff89953a232b41a40bda18776b15e4c6724233d9eea414"},"schema_version":"1.0","source":{"id":"1803.09571","kind":"arxiv","version":2}},"canonical_sha256":"c9429ca238e1cce21b6ba1530cf1b8b0b4a37b07ea94aff8e2e595c11f349a44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9429ca238e1cce21b6ba1530cf1b8b0b4a37b07ea94aff8e2e595c11f349a44","first_computed_at":"2026-05-18T00:11:49.511384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:49.511384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CNx9SwG8x5lb7Nic6xXDVtUCbxC5QuppXtKuBbpEeU5UCwmqdU0Ga6lhr8C7vlCjv4ihD0eiH8h6z6aH8dzGBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:49.511941Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.09571","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8583602e82c9476558ffd35858d08af2cc56c081db55e20f26e236797083df02","sha256:9c04335827f049c88efdfea316a7deffa647fd2aff2d1c3df8b42b8c65185281"],"state_sha256":"44401f2254be1f2f59c1616273acd8a553c861b87b54616e614ad3cfec2d5a88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lhjjl4qlbNk/lj6Jknj5n975bRszRi4oEWqQS2lMnDjrpaxsqEEwsDC5I+4LSKvxA0/Qv8dWwtfPLXy+CVWvAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T16:09:01.518949Z","bundle_sha256":"c1bfa45f034eaa4866890efa3b8d98d4c93784869593ae27142683d02042c5f7"}}