{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GOVOXQ3A5ZJCFSFPAINF2C65W3","short_pith_number":"pith:GOVOXQ3A","schema_version":"1.0","canonical_sha256":"33aaebc360ee5222c8af021a5d0bddb6cc1b1a289d8605a50f1caad731d3d28a","source":{"kind":"arxiv","id":"1808.10025","version":1},"attestation_state":"computed","paper":{"title":"Retrieval-Based Neural Code Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Anthony Tomasic, Graham Neubig, Pengcheng Yin, Pravalika Avvaru, Raphael Olivier, Shirley Anugrah Hayati","submitted_at":"2018-08-29T20:01:21Z","abstract_excerpt":"In models to generate program source code from natural language, representing this code in a tree structure has been a common approach. However, existing methods often fail to generate complex code correctly due to a lack of ability to memorize large and complex structures. We introduce ReCode, a method based on subtree retrieval that makes it possible to explicitly reference existing code examples within a neural code generation model. First, we retrieve sentences that are similar to input sentences using a dynamic-programming-based sentence similarity scoring method. Next, we extract n-grams"},"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":"1808.10025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-29T20:01:21Z","cross_cats_sorted":[],"title_canon_sha256":"771185d9a39a8356001e03c520f9fd305f7ff01a6a966212875638b6d52f6028","abstract_canon_sha256":"3592bf61ceb5cbbd61bbd0074e44a7f845784fdbd4eafff7b0d6845b9f208053"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:50.079530Z","signature_b64":"S2dDNooiKrOlwx+0ySn6NLHRbqWLj2v8gvE2YaaDTzwHyzGA/xrRu48HRXnsN8MsotGw+MVuFhBQrONBmiaWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33aaebc360ee5222c8af021a5d0bddb6cc1b1a289d8605a50f1caad731d3d28a","last_reissued_at":"2026-05-18T00:06:50.078741Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:50.078741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Retrieval-Based Neural Code Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Anthony Tomasic, Graham Neubig, Pengcheng Yin, Pravalika Avvaru, Raphael Olivier, Shirley Anugrah Hayati","submitted_at":"2018-08-29T20:01:21Z","abstract_excerpt":"In models to generate program source code from natural language, representing this code in a tree structure has been a common approach. However, existing methods often fail to generate complex code correctly due to a lack of ability to memorize large and complex structures. We introduce ReCode, a method based on subtree retrieval that makes it possible to explicitly reference existing code examples within a neural code generation model. First, we retrieve sentences that are similar to input sentences using a dynamic-programming-based sentence similarity scoring method. Next, we extract n-grams"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10025","kind":"arxiv","version":1},"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":"1808.10025","created_at":"2026-05-18T00:06:50.078878+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.10025v1","created_at":"2026-05-18T00:06:50.078878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10025","created_at":"2026-05-18T00:06:50.078878+00:00"},{"alias_kind":"pith_short_12","alias_value":"GOVOXQ3A5ZJC","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GOVOXQ3A5ZJCFSFP","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GOVOXQ3A","created_at":"2026-05-18T12:32:25.280505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.17184","citing_title":"SynthFix: Adaptive Neuro-Symbolic Code Vulnerability Repair","ref_index":51,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GOVOXQ3A5ZJCFSFPAINF2C65W3","json":"https://pith.science/pith/GOVOXQ3A5ZJCFSFPAINF2C65W3.json","graph_json":"https://pith.science/api/pith-number/GOVOXQ3A5ZJCFSFPAINF2C65W3/graph.json","events_json":"https://pith.science/api/pith-number/GOVOXQ3A5ZJCFSFPAINF2C65W3/events.json","paper":"https://pith.science/paper/GOVOXQ3A"},"agent_actions":{"view_html":"https://pith.science/pith/GOVOXQ3A5ZJCFSFPAINF2C65W3","download_json":"https://pith.science/pith/GOVOXQ3A5ZJCFSFPAINF2C65W3.json","view_paper":"https://pith.science/paper/GOVOXQ3A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.10025&json=true","fetch_graph":"https://pith.science/api/pith-number/GOVOXQ3A5ZJCFSFPAINF2C65W3/graph.json","fetch_events":"https://pith.science/api/pith-number/GOVOXQ3A5ZJCFSFPAINF2C65W3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GOVOXQ3A5ZJCFSFPAINF2C65W3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GOVOXQ3A5ZJCFSFPAINF2C65W3/action/storage_attestation","attest_author":"https://pith.science/pith/GOVOXQ3A5ZJCFSFPAINF2C65W3/action/author_attestation","sign_citation":"https://pith.science/pith/GOVOXQ3A5ZJCFSFPAINF2C65W3/action/citation_signature","submit_replication":"https://pith.science/pith/GOVOXQ3A5ZJCFSFPAINF2C65W3/action/replication_record"}},"created_at":"2026-05-18T00:06:50.078878+00:00","updated_at":"2026-05-18T00:06:50.078878+00:00"}