{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SADMKGNGSHUXS6LJFKEKHMZKM3","short_pith_number":"pith:SADMKGNG","schema_version":"1.0","canonical_sha256":"9006c519a691e97979692a88a3b32a66d51c840a944bf45e99a4c9748dd3cd14","source":{"kind":"arxiv","id":"1909.05233","version":2},"attestation_state":"computed","paper":{"title":"The Neural State Pushdown Automata","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.NE","authors_text":"Alexander Ororbia, Ankur Mali, C. Lee Giles","submitted_at":"2019-09-07T00:32:11Z","abstract_excerpt":"In order to learn complex grammars, recurrent neural networks (RNNs) require sufficient computational resources to ensure correct grammar recognition. A widely-used approach to expand model capacity would be to couple an RNN to an external memory stack. Here, we introduce a \"neural state\" pushdown automaton (NSPDA), which consists of a digital stack, instead of an analog one, that is coupled to a neural network state machine. We empirically show its effectiveness in recognizing various context-free grammars (CFGs). First, we develop the underlying mechanics of the proposed higher order recurre"},"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":"1909.05233","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2019-09-07T00:32:11Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"badf019b03583be237d1b1e4203229d4a690dc9eaed8e308f8fb6e384de02b88","abstract_canon_sha256":"52a33571f1a615ad158efe93738e889534616af7024f60b2b25ddeda8829543d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:05:55.197010Z","signature_b64":"xaBVpFN3dv7JYmHJKRAwHY39EYBAJc4aqXV6oj1eS7vvIiLJBTPEX38V3IDw8EFgPoC/v4Py9QhnDVxBz7P8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9006c519a691e97979692a88a3b32a66d51c840a944bf45e99a4c9748dd3cd14","last_reissued_at":"2026-07-05T00:05:55.196599Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:05:55.196599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Neural State Pushdown Automata","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.NE","authors_text":"Alexander Ororbia, Ankur Mali, C. Lee Giles","submitted_at":"2019-09-07T00:32:11Z","abstract_excerpt":"In order to learn complex grammars, recurrent neural networks (RNNs) require sufficient computational resources to ensure correct grammar recognition. A widely-used approach to expand model capacity would be to couple an RNN to an external memory stack. Here, we introduce a \"neural state\" pushdown automaton (NSPDA), which consists of a digital stack, instead of an analog one, that is coupled to a neural network state machine. We empirically show its effectiveness in recognizing various context-free grammars (CFGs). First, we develop the underlying mechanics of the proposed higher order recurre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.05233","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.05233/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":"1909.05233","created_at":"2026-07-05T00:05:55.196660+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.05233v2","created_at":"2026-07-05T00:05:55.196660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.05233","created_at":"2026-07-05T00:05:55.196660+00:00"},{"alias_kind":"pith_short_12","alias_value":"SADMKGNGSHUX","created_at":"2026-07-05T00:05:55.196660+00:00"},{"alias_kind":"pith_short_16","alias_value":"SADMKGNGSHUXS6LJ","created_at":"2026-07-05T00:05:55.196660+00:00"},{"alias_kind":"pith_short_8","alias_value":"SADMKGNG","created_at":"2026-07-05T00:05:55.196660+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/SADMKGNGSHUXS6LJFKEKHMZKM3","json":"https://pith.science/pith/SADMKGNGSHUXS6LJFKEKHMZKM3.json","graph_json":"https://pith.science/api/pith-number/SADMKGNGSHUXS6LJFKEKHMZKM3/graph.json","events_json":"https://pith.science/api/pith-number/SADMKGNGSHUXS6LJFKEKHMZKM3/events.json","paper":"https://pith.science/paper/SADMKGNG"},"agent_actions":{"view_html":"https://pith.science/pith/SADMKGNGSHUXS6LJFKEKHMZKM3","download_json":"https://pith.science/pith/SADMKGNGSHUXS6LJFKEKHMZKM3.json","view_paper":"https://pith.science/paper/SADMKGNG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.05233&json=true","fetch_graph":"https://pith.science/api/pith-number/SADMKGNGSHUXS6LJFKEKHMZKM3/graph.json","fetch_events":"https://pith.science/api/pith-number/SADMKGNGSHUXS6LJFKEKHMZKM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SADMKGNGSHUXS6LJFKEKHMZKM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SADMKGNGSHUXS6LJFKEKHMZKM3/action/storage_attestation","attest_author":"https://pith.science/pith/SADMKGNGSHUXS6LJFKEKHMZKM3/action/author_attestation","sign_citation":"https://pith.science/pith/SADMKGNGSHUXS6LJFKEKHMZKM3/action/citation_signature","submit_replication":"https://pith.science/pith/SADMKGNGSHUXS6LJFKEKHMZKM3/action/replication_record"}},"created_at":"2026-07-05T00:05:55.196660+00:00","updated_at":"2026-07-05T00:05:55.196660+00:00"}