{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MH2EH7XAKIUC6WB6J2HI2VBTMU","short_pith_number":"pith:MH2EH7XA","canonical_record":{"source":{"id":"1805.05588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-15T06:40:44Z","cross_cats_sorted":[],"title_canon_sha256":"39df1e331aeb9f1e9af76e828b47f8094b8ea9a1c8ee7880116f053d788a52b1","abstract_canon_sha256":"8bcfdf64741f818d8955efce31dd858b3fe307977e175a8c4de5b12cd9c875a3"},"schema_version":"1.0"},"canonical_sha256":"61f443fee052282f583e4e8e8d5433653a827a303688062d6b180d4cee60ddb1","source":{"kind":"arxiv","id":"1805.05588","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05588","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05588v1","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05588","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"pith_short_12","alias_value":"MH2EH7XAKIUC","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MH2EH7XAKIUC6WB6","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MH2EH7XA","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MH2EH7XAKIUC6WB6J2HI2VBTMU","target":"record","payload":{"canonical_record":{"source":{"id":"1805.05588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-15T06:40:44Z","cross_cats_sorted":[],"title_canon_sha256":"39df1e331aeb9f1e9af76e828b47f8094b8ea9a1c8ee7880116f053d788a52b1","abstract_canon_sha256":"8bcfdf64741f818d8955efce31dd858b3fe307977e175a8c4de5b12cd9c875a3"},"schema_version":"1.0"},"canonical_sha256":"61f443fee052282f583e4e8e8d5433653a827a303688062d6b180d4cee60ddb1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:00.094934Z","signature_b64":"7H4AMdUdiLnT9uamGU4DsPlExRgzgGIX4TYzue2KqOPJSrEl8JZKoCFRWjgbc0eScagxqpJwS4MSC42plFIACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61f443fee052282f583e4e8e8d5433653a827a303688062d6b180d4cee60ddb1","last_reissued_at":"2026-05-18T00:16:00.094236Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:00.094236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.05588","source_version":1,"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:16:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F6GXOILve61KECeRcrUjM9DaJE3x5ydXyAuBFlP3plWM8AccFKig5mAV7rWEjgCCdUHL5TAdXLiKSBf6JuPTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:56:49.677576Z"},"content_sha256":"b3e9da79afb74350faf71182a95a34f476313ae36aa64d49d5c2ff99e5787f7a","schema_version":"1.0","event_id":"sha256:b3e9da79afb74350faf71182a95a34f476313ae36aa64d49d5c2ff99e5787f7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MH2EH7XAKIUC6WB6J2HI2VBTMU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Marrying up Regular Expressions with Neural Networks: A Case Study for Spoken Language Understanding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bingfeng Luo, Dongyan Zhao, Rui Yan, Songfang Huang, Yansong Feng, Zheng Wang","submitted_at":"2018-05-15T06:40:44Z","abstract_excerpt":"The success of many natural language processing (NLP) tasks is bound by the number and quality of annotated data, but there is often a shortage of such training data. In this paper, we ask the question: \"Can we combine a neural network (NN) with regular expressions (RE) to improve supervised learning for NLP?\". In answer, we develop novel methods to exploit the rich expressiveness of REs at different levels within a NN, showing that the combination significantly enhances the learning effectiveness when a small number of training examples are available. We evaluate our approach by applying it t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05588","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"},"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:16:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VyEt3LA1z9tEKwRJ7mMst8vd6a54EQVxdM0B7HJsnUypEjCQDoM5ADxm1mP3+NgBejGPHaF9eh9iLgBCRq8PDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:56:49.678214Z"},"content_sha256":"71859ff9112f2424ad5fccd9cfafb830487ee9d0a0368e4483af0d46af075a49","schema_version":"1.0","event_id":"sha256:71859ff9112f2424ad5fccd9cfafb830487ee9d0a0368e4483af0d46af075a49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MH2EH7XAKIUC6WB6J2HI2VBTMU/bundle.json","state_url":"https://pith.science/pith/MH2EH7XAKIUC6WB6J2HI2VBTMU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MH2EH7XAKIUC6WB6J2HI2VBTMU/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-05-27T19:56:49Z","links":{"resolver":"https://pith.science/pith/MH2EH7XAKIUC6WB6J2HI2VBTMU","bundle":"https://pith.science/pith/MH2EH7XAKIUC6WB6J2HI2VBTMU/bundle.json","state":"https://pith.science/pith/MH2EH7XAKIUC6WB6J2HI2VBTMU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MH2EH7XAKIUC6WB6J2HI2VBTMU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MH2EH7XAKIUC6WB6J2HI2VBTMU","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":"8bcfdf64741f818d8955efce31dd858b3fe307977e175a8c4de5b12cd9c875a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-15T06:40:44Z","title_canon_sha256":"39df1e331aeb9f1e9af76e828b47f8094b8ea9a1c8ee7880116f053d788a52b1"},"schema_version":"1.0","source":{"id":"1805.05588","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05588","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05588v1","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05588","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"pith_short_12","alias_value":"MH2EH7XAKIUC","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MH2EH7XAKIUC6WB6","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MH2EH7XA","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:71859ff9112f2424ad5fccd9cfafb830487ee9d0a0368e4483af0d46af075a49","target":"graph","created_at":"2026-05-18T00:16:00Z","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":"The success of many natural language processing (NLP) tasks is bound by the number and quality of annotated data, but there is often a shortage of such training data. In this paper, we ask the question: \"Can we combine a neural network (NN) with regular expressions (RE) to improve supervised learning for NLP?\". In answer, we develop novel methods to exploit the rich expressiveness of REs at different levels within a NN, showing that the combination significantly enhances the learning effectiveness when a small number of training examples are available. We evaluate our approach by applying it t","authors_text":"Bingfeng Luo, Dongyan Zhao, Rui Yan, Songfang Huang, Yansong Feng, Zheng Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-15T06:40:44Z","title":"Marrying up Regular Expressions with Neural Networks: A Case Study for Spoken Language Understanding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05588","kind":"arxiv","version":1},"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:b3e9da79afb74350faf71182a95a34f476313ae36aa64d49d5c2ff99e5787f7a","target":"record","created_at":"2026-05-18T00:16:00Z","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":"8bcfdf64741f818d8955efce31dd858b3fe307977e175a8c4de5b12cd9c875a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-15T06:40:44Z","title_canon_sha256":"39df1e331aeb9f1e9af76e828b47f8094b8ea9a1c8ee7880116f053d788a52b1"},"schema_version":"1.0","source":{"id":"1805.05588","kind":"arxiv","version":1}},"canonical_sha256":"61f443fee052282f583e4e8e8d5433653a827a303688062d6b180d4cee60ddb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61f443fee052282f583e4e8e8d5433653a827a303688062d6b180d4cee60ddb1","first_computed_at":"2026-05-18T00:16:00.094236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:00.094236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7H4AMdUdiLnT9uamGU4DsPlExRgzgGIX4TYzue2KqOPJSrEl8JZKoCFRWjgbc0eScagxqpJwS4MSC42plFIACQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:00.094934Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.05588","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3e9da79afb74350faf71182a95a34f476313ae36aa64d49d5c2ff99e5787f7a","sha256:71859ff9112f2424ad5fccd9cfafb830487ee9d0a0368e4483af0d46af075a49"],"state_sha256":"4e8fe1ee722293f4ef0a77c74a6dd98606aacd91cfec335de3f8e2dd4050624e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3eJ6I7spWwH8SWVmNTOHYT5e+y1tq2cdkUCLwGfEg+A56wj/nw3P1PxFCMTBKfPOGPctfOBmwkQytGLawRpHAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:56:49.681286Z","bundle_sha256":"344191124bfddbaefd577e29508aa9757060a1b271c2a2895461f6b35195ebed"}}