{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CJIDBXNIEW3XKVZL5ZIVDWBWA4","short_pith_number":"pith:CJIDBXNI","schema_version":"1.0","canonical_sha256":"125030dda825b775572bee5151d8360704720f46d5db30701789d7bf2e47c2ac","source":{"kind":"arxiv","id":"1608.03000","version":1},"attestation_state":"computed","paper":{"title":"Neural Generation of Regular Expressions from Natural Language with Minimal Domain Knowledge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Eduardo DeLeon, Karthik Narasimhan, Nate Kushman, Nicholas Locascio, Regina Barzilay","submitted_at":"2016-08-09T23:05:03Z","abstract_excerpt":"This paper explores the task of translating natural language queries into regular expressions which embody their meaning. In contrast to prior work, the proposed neural model does not utilize domain-specific crafting, learning to translate directly from a parallel corpus. To fully explore the potential of neural models, we propose a methodology for collecting a large corpus of regular expression, natural language pairs. Our resulting model achieves a performance gain of 19.6% over previous state-of-the-art models."},"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":"1608.03000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-08-09T23:05:03Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"fedc0b3bb3d8c39358e46f58c3f7ed251580ace29ade74e3e2081c3da6f16d2b","abstract_canon_sha256":"ebeb1613684a73bb934e3977a8e0586955ba4e2f0fe2dffb1c3ff1744ce3c264"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:30.495854Z","signature_b64":"kAeP7u4d9+UHLGllRD8KvDKGqiTNA21e7KvlCttUGhVThTgmcvmNEX5VoD/lxzmo4cHbJNp/W5ZdGgMcRLNRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"125030dda825b775572bee5151d8360704720f46d5db30701789d7bf2e47c2ac","last_reissued_at":"2026-05-18T01:09:30.495510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:30.495510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Generation of Regular Expressions from Natural Language with Minimal Domain Knowledge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Eduardo DeLeon, Karthik Narasimhan, Nate Kushman, Nicholas Locascio, Regina Barzilay","submitted_at":"2016-08-09T23:05:03Z","abstract_excerpt":"This paper explores the task of translating natural language queries into regular expressions which embody their meaning. In contrast to prior work, the proposed neural model does not utilize domain-specific crafting, learning to translate directly from a parallel corpus. To fully explore the potential of neural models, we propose a methodology for collecting a large corpus of regular expression, natural language pairs. Our resulting model achieves a performance gain of 19.6% over previous state-of-the-art models."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03000","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":"1608.03000","created_at":"2026-05-18T01:09:30.495567+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.03000v1","created_at":"2026-05-18T01:09:30.495567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03000","created_at":"2026-05-18T01:09:30.495567+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJIDBXNIEW3X","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJIDBXNIEW3XKVZL","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJIDBXNI","created_at":"2026-05-18T12:30:09.641336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.12228","citing_title":"From IOCs to Regex: Automating CTI Operationalization for SOC with LLMs","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CJIDBXNIEW3XKVZL5ZIVDWBWA4","json":"https://pith.science/pith/CJIDBXNIEW3XKVZL5ZIVDWBWA4.json","graph_json":"https://pith.science/api/pith-number/CJIDBXNIEW3XKVZL5ZIVDWBWA4/graph.json","events_json":"https://pith.science/api/pith-number/CJIDBXNIEW3XKVZL5ZIVDWBWA4/events.json","paper":"https://pith.science/paper/CJIDBXNI"},"agent_actions":{"view_html":"https://pith.science/pith/CJIDBXNIEW3XKVZL5ZIVDWBWA4","download_json":"https://pith.science/pith/CJIDBXNIEW3XKVZL5ZIVDWBWA4.json","view_paper":"https://pith.science/paper/CJIDBXNI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.03000&json=true","fetch_graph":"https://pith.science/api/pith-number/CJIDBXNIEW3XKVZL5ZIVDWBWA4/graph.json","fetch_events":"https://pith.science/api/pith-number/CJIDBXNIEW3XKVZL5ZIVDWBWA4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJIDBXNIEW3XKVZL5ZIVDWBWA4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJIDBXNIEW3XKVZL5ZIVDWBWA4/action/storage_attestation","attest_author":"https://pith.science/pith/CJIDBXNIEW3XKVZL5ZIVDWBWA4/action/author_attestation","sign_citation":"https://pith.science/pith/CJIDBXNIEW3XKVZL5ZIVDWBWA4/action/citation_signature","submit_replication":"https://pith.science/pith/CJIDBXNIEW3XKVZL5ZIVDWBWA4/action/replication_record"}},"created_at":"2026-05-18T01:09:30.495567+00:00","updated_at":"2026-05-18T01:09:30.495567+00:00"}