{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JGNBOKKKY2HVZYBY6ECEH4ROIQ","short_pith_number":"pith:JGNBOKKK","schema_version":"1.0","canonical_sha256":"499a17294ac68f5ce038f10443f22e441e7df6cfbc7f7ee4fd1b43ec841d3d9c","source":{"kind":"arxiv","id":"1901.01808","version":3},"attestation_state":"computed","paper":{"title":"SequenceR: Sequence-to-Sequence Learning for End-to-End Program Repair","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SE","authors_text":"Denys Poshyvanyk, Louis-No\\\"el Pouchet, Martin Monperrus, Michele Tufano, Steve Kommrusch, Zimin Chen","submitted_at":"2018-12-24T18:04:14Z","abstract_excerpt":"This paper presents a novel end-to-end approach to program repair based on sequence-to-sequence learning. We devise, implement, and evaluate a system, called SequenceR, for fixing bugs based on sequence-to-sequence learning on source code. This approach uses the copy mechanism to overcome the unlimited vocabulary problem that occurs with big code. Our system is data-driven; we train it on 35,578 samples, carefully curated from commits to open-source repositories. We evaluate it on 4,711 independent real bug fixes, as well on the Defects4J benchmark used in program repair research. SequenceR is"},"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":"1901.01808","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-12-24T18:04:14Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"d98b72f236a4e6d5182057a236376102d534b7c1e9ad1a011274a918b9eca4fe","abstract_canon_sha256":"a68c0863af5e582f2793be022a2681623ee5858621df5832aa534a8ea8fb73d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:03:55.196916Z","signature_b64":"xseEnfdTSuTT0raijvwcoAtNegow7vjw6SDo7BRAyZWL+rFVZ8D7d8AbW5NVUMq7P8b2hdWZ+mJtiQEy8ZK6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"499a17294ac68f5ce038f10443f22e441e7df6cfbc7f7ee4fd1b43ec841d3d9c","last_reissued_at":"2026-07-05T00:03:55.196459Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:03:55.196459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SequenceR: Sequence-to-Sequence Learning for End-to-End Program Repair","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SE","authors_text":"Denys Poshyvanyk, Louis-No\\\"el Pouchet, Martin Monperrus, Michele Tufano, Steve Kommrusch, Zimin Chen","submitted_at":"2018-12-24T18:04:14Z","abstract_excerpt":"This paper presents a novel end-to-end approach to program repair based on sequence-to-sequence learning. We devise, implement, and evaluate a system, called SequenceR, for fixing bugs based on sequence-to-sequence learning on source code. This approach uses the copy mechanism to overcome the unlimited vocabulary problem that occurs with big code. Our system is data-driven; we train it on 35,578 samples, carefully curated from commits to open-source repositories. We evaluate it on 4,711 independent real bug fixes, as well on the Defects4J benchmark used in program repair research. SequenceR is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01808","kind":"arxiv","version":3},"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/1901.01808/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":"1901.01808","created_at":"2026-07-05T00:03:55.196520+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.01808v3","created_at":"2026-07-05T00:03:55.196520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01808","created_at":"2026-07-05T00:03:55.196520+00:00"},{"alias_kind":"pith_short_12","alias_value":"JGNBOKKKY2HV","created_at":"2026-07-05T00:03:55.196520+00:00"},{"alias_kind":"pith_short_16","alias_value":"JGNBOKKKY2HVZYBY","created_at":"2026-07-05T00:03:55.196520+00:00"},{"alias_kind":"pith_short_8","alias_value":"JGNBOKKK","created_at":"2026-07-05T00:03:55.196520+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.18487","citing_title":"AuPair: Golden Example Pairs for Code Repair","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JGNBOKKKY2HVZYBY6ECEH4ROIQ","json":"https://pith.science/pith/JGNBOKKKY2HVZYBY6ECEH4ROIQ.json","graph_json":"https://pith.science/api/pith-number/JGNBOKKKY2HVZYBY6ECEH4ROIQ/graph.json","events_json":"https://pith.science/api/pith-number/JGNBOKKKY2HVZYBY6ECEH4ROIQ/events.json","paper":"https://pith.science/paper/JGNBOKKK"},"agent_actions":{"view_html":"https://pith.science/pith/JGNBOKKKY2HVZYBY6ECEH4ROIQ","download_json":"https://pith.science/pith/JGNBOKKKY2HVZYBY6ECEH4ROIQ.json","view_paper":"https://pith.science/paper/JGNBOKKK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.01808&json=true","fetch_graph":"https://pith.science/api/pith-number/JGNBOKKKY2HVZYBY6ECEH4ROIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/JGNBOKKKY2HVZYBY6ECEH4ROIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JGNBOKKKY2HVZYBY6ECEH4ROIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JGNBOKKKY2HVZYBY6ECEH4ROIQ/action/storage_attestation","attest_author":"https://pith.science/pith/JGNBOKKKY2HVZYBY6ECEH4ROIQ/action/author_attestation","sign_citation":"https://pith.science/pith/JGNBOKKKY2HVZYBY6ECEH4ROIQ/action/citation_signature","submit_replication":"https://pith.science/pith/JGNBOKKKY2HVZYBY6ECEH4ROIQ/action/replication_record"}},"created_at":"2026-07-05T00:03:55.196520+00:00","updated_at":"2026-07-05T00:03:55.196520+00:00"}