{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:462LYNJFIESZNOMQNHHIH72SJB","short_pith_number":"pith:462LYNJF","schema_version":"1.0","canonical_sha256":"e7b4bc3525412596b99069ce83ff524844d18a2dc72ff87d4b33d932603cd7fe","source":{"kind":"arxiv","id":"1707.03139","version":2},"attestation_state":"computed","paper":{"title":"Partitioning Patches into Test-equivalence Classes for Scaling Program Repair","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Abhik Roychoudhury, Sergey Mechtaev, Shin Hwei Tan, Xiang Gao","submitted_at":"2017-07-11T06:13:56Z","abstract_excerpt":"Automated program repair is a problem of finding a transformation (called a patch) of a given incorrect program that eliminates the observable failures. It has important applications such as providing debugging aids, automatically grading assignments and patching security vulnerabilities. A common challenge faced by all existing repair techniques is scalability to large patch spaces, since there are many candidate patches that these techniques explicitly or implicitly consider.\n  The correctness criterion for program repair is often given as a suite of tests, since a formal specification of th"},"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":"1707.03139","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-07-11T06:13:56Z","cross_cats_sorted":[],"title_canon_sha256":"870f2b50f08b74fe20447095361f066765bd01cdea6b9e51f6ebc8d3e85e6c50","abstract_canon_sha256":"0cd3cabd4afea82db21f37cba67c25d8fa59a6a6369b294d84da8ccbbad8fc41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:17.239820Z","signature_b64":"YYJ8zj9x09cKGjCoarYH+4ul6u1VsWghobYlxId5nISWAPS4Hap8RJA4MP+/2I8YqXbuRZLBQ7fyGIQ4aN3WAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7b4bc3525412596b99069ce83ff524844d18a2dc72ff87d4b33d932603cd7fe","last_reissued_at":"2026-05-18T00:40:17.238820Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:17.238820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioning Patches into Test-equivalence Classes for Scaling Program Repair","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Abhik Roychoudhury, Sergey Mechtaev, Shin Hwei Tan, Xiang Gao","submitted_at":"2017-07-11T06:13:56Z","abstract_excerpt":"Automated program repair is a problem of finding a transformation (called a patch) of a given incorrect program that eliminates the observable failures. It has important applications such as providing debugging aids, automatically grading assignments and patching security vulnerabilities. A common challenge faced by all existing repair techniques is scalability to large patch spaces, since there are many candidate patches that these techniques explicitly or implicitly consider.\n  The correctness criterion for program repair is often given as a suite of tests, since a formal specification of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03139","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":"1707.03139","created_at":"2026-05-18T00:40:17.238990+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03139v2","created_at":"2026-05-18T00:40:17.238990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03139","created_at":"2026-05-18T00:40:17.238990+00:00"},{"alias_kind":"pith_short_12","alias_value":"462LYNJFIESZ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"462LYNJFIESZNOMQ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"462LYNJF","created_at":"2026-05-18T12:30:58.224056+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/462LYNJFIESZNOMQNHHIH72SJB","json":"https://pith.science/pith/462LYNJFIESZNOMQNHHIH72SJB.json","graph_json":"https://pith.science/api/pith-number/462LYNJFIESZNOMQNHHIH72SJB/graph.json","events_json":"https://pith.science/api/pith-number/462LYNJFIESZNOMQNHHIH72SJB/events.json","paper":"https://pith.science/paper/462LYNJF"},"agent_actions":{"view_html":"https://pith.science/pith/462LYNJFIESZNOMQNHHIH72SJB","download_json":"https://pith.science/pith/462LYNJFIESZNOMQNHHIH72SJB.json","view_paper":"https://pith.science/paper/462LYNJF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03139&json=true","fetch_graph":"https://pith.science/api/pith-number/462LYNJFIESZNOMQNHHIH72SJB/graph.json","fetch_events":"https://pith.science/api/pith-number/462LYNJFIESZNOMQNHHIH72SJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/462LYNJFIESZNOMQNHHIH72SJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/462LYNJFIESZNOMQNHHIH72SJB/action/storage_attestation","attest_author":"https://pith.science/pith/462LYNJFIESZNOMQNHHIH72SJB/action/author_attestation","sign_citation":"https://pith.science/pith/462LYNJFIESZNOMQNHHIH72SJB/action/citation_signature","submit_replication":"https://pith.science/pith/462LYNJFIESZNOMQNHHIH72SJB/action/replication_record"}},"created_at":"2026-05-18T00:40:17.238990+00:00","updated_at":"2026-05-18T00:40:17.238990+00:00"}