{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IQLS7NNQ2RBVDOUYK5CBR776B4","short_pith_number":"pith:IQLS7NNQ","canonical_record":{"source":{"id":"1801.05420","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-16T03:19:37Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"ee87510f7f8eca722db6500a9da86e3f3e27a082df7531af92fd591e9f06b8ac","abstract_canon_sha256":"08cff349402be6c64db215afaff30f3ab6ab4a810f8db800546c276e9345a0cb"},"schema_version":"1.0"},"canonical_sha256":"44172fb5b0d44351ba98574418fffe0f04c472824857954e0333068b28b0dc42","source":{"kind":"arxiv","id":"1801.05420","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05420","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05420v2","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05420","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"pith_short_12","alias_value":"IQLS7NNQ2RBV","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IQLS7NNQ2RBVDOUY","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IQLS7NNQ","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IQLS7NNQ2RBVDOUYK5CBR776B4","target":"record","payload":{"canonical_record":{"source":{"id":"1801.05420","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-16T03:19:37Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"ee87510f7f8eca722db6500a9da86e3f3e27a082df7531af92fd591e9f06b8ac","abstract_canon_sha256":"08cff349402be6c64db215afaff30f3ab6ab4a810f8db800546c276e9345a0cb"},"schema_version":"1.0"},"canonical_sha256":"44172fb5b0d44351ba98574418fffe0f04c472824857954e0333068b28b0dc42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:39.795831Z","signature_b64":"1XzFFseOq4nPYFsd3Nl3wzT7gxDOXiQ1F+PweTuckHMN4SQkA3Kdo55pEBdySEwWMDn0JUgMQ0CyjQH3nTJqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44172fb5b0d44351ba98574418fffe0f04c472824857954e0333068b28b0dc42","last_reissued_at":"2026-05-18T00:00:39.795392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:39.795392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.05420","source_version":2,"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:00:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kmmGwG+zwhJogRcIxe8vpdxsAzPTw3sjQT+iF0PrLjLJINkaslRaLIxQEtvUD+B48Ot87blnhTcWAoc0sgzyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T14:37:00.304589Z"},"content_sha256":"9f12b9f5f30206c11adb4d492a8ac72da3b47010efc150acb5fe522a1cec1e71","schema_version":"1.0","event_id":"sha256:9f12b9f5f30206c11adb4d492a8ac72da3b47010efc150acb5fe522a1cec1e71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IQLS7NNQ2RBVDOUYK5CBR776B4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Comparative Study of Rule Extraction for Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Alexander G. Ororbia II, C. Lee Giles, Kaixuan Zhang, Qinglong Wang, Xinyu Xing, Xue Liu","submitted_at":"2018-01-16T03:19:37Z","abstract_excerpt":"Understanding recurrent networks through rule extraction has a long history. This has taken on new interests due to the need for interpreting or verifying neural networks. One basic form for representing stateful rules is deterministic finite automata (DFA). Previous research shows that extracting DFAs from trained second-order recurrent networks is not only possible but also relatively stable. Recently, several new types of recurrent networks with more complicated architectures have been introduced. These handle challenging learning tasks usually involving sequential data. However, it remains"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05420","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":""},"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:00:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AlAd9JyMy4oUPvURJzMMTHM/AKljAGBwzR5yY4VKat/Fhf5SkyC3uyTwBq9jCQr9C1nucrgbP0vNPOVP10gmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T14:37:00.305300Z"},"content_sha256":"aea07ca98e1a5b5fccdfe4470cee556f37e846da08f7ad2919f7db11e74df314","schema_version":"1.0","event_id":"sha256:aea07ca98e1a5b5fccdfe4470cee556f37e846da08f7ad2919f7db11e74df314"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IQLS7NNQ2RBVDOUYK5CBR776B4/bundle.json","state_url":"https://pith.science/pith/IQLS7NNQ2RBVDOUYK5CBR776B4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IQLS7NNQ2RBVDOUYK5CBR776B4/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-24T14:37:00Z","links":{"resolver":"https://pith.science/pith/IQLS7NNQ2RBVDOUYK5CBR776B4","bundle":"https://pith.science/pith/IQLS7NNQ2RBVDOUYK5CBR776B4/bundle.json","state":"https://pith.science/pith/IQLS7NNQ2RBVDOUYK5CBR776B4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IQLS7NNQ2RBVDOUYK5CBR776B4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IQLS7NNQ2RBVDOUYK5CBR776B4","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":"08cff349402be6c64db215afaff30f3ab6ab4a810f8db800546c276e9345a0cb","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-16T03:19:37Z","title_canon_sha256":"ee87510f7f8eca722db6500a9da86e3f3e27a082df7531af92fd591e9f06b8ac"},"schema_version":"1.0","source":{"id":"1801.05420","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05420","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05420v2","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05420","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"pith_short_12","alias_value":"IQLS7NNQ2RBV","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IQLS7NNQ2RBVDOUY","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IQLS7NNQ","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:aea07ca98e1a5b5fccdfe4470cee556f37e846da08f7ad2919f7db11e74df314","target":"graph","created_at":"2026-05-18T00:00:39Z","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":"Understanding recurrent networks through rule extraction has a long history. This has taken on new interests due to the need for interpreting or verifying neural networks. One basic form for representing stateful rules is deterministic finite automata (DFA). Previous research shows that extracting DFAs from trained second-order recurrent networks is not only possible but also relatively stable. Recently, several new types of recurrent networks with more complicated architectures have been introduced. These handle challenging learning tasks usually involving sequential data. However, it remains","authors_text":"Alexander G. Ororbia II, C. Lee Giles, Kaixuan Zhang, Qinglong Wang, Xinyu Xing, Xue Liu","cross_cats":["cs.CL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-16T03:19:37Z","title":"A Comparative Study of Rule Extraction for Recurrent Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05420","kind":"arxiv","version":2},"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:9f12b9f5f30206c11adb4d492a8ac72da3b47010efc150acb5fe522a1cec1e71","target":"record","created_at":"2026-05-18T00:00:39Z","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":"08cff349402be6c64db215afaff30f3ab6ab4a810f8db800546c276e9345a0cb","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-16T03:19:37Z","title_canon_sha256":"ee87510f7f8eca722db6500a9da86e3f3e27a082df7531af92fd591e9f06b8ac"},"schema_version":"1.0","source":{"id":"1801.05420","kind":"arxiv","version":2}},"canonical_sha256":"44172fb5b0d44351ba98574418fffe0f04c472824857954e0333068b28b0dc42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44172fb5b0d44351ba98574418fffe0f04c472824857954e0333068b28b0dc42","first_computed_at":"2026-05-18T00:00:39.795392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:39.795392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1XzFFseOq4nPYFsd3Nl3wzT7gxDOXiQ1F+PweTuckHMN4SQkA3Kdo55pEBdySEwWMDn0JUgMQ0CyjQH3nTJqBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:39.795831Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.05420","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f12b9f5f30206c11adb4d492a8ac72da3b47010efc150acb5fe522a1cec1e71","sha256:aea07ca98e1a5b5fccdfe4470cee556f37e846da08f7ad2919f7db11e74df314"],"state_sha256":"f0b660fdd62d290186c049ca6a3c12ca1c2dc33850e8569626ccc8f0d044e95d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rEcDzzG4BrPuaHqi8paUU94DP6OoJpTMZVHa4JrE12PDqtWxA5Xdytx1ZlH0Ck2ahZ48fK6JsR4KUFwLDGt3Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T14:37:00.309425Z","bundle_sha256":"3c262a9e8ade5a8afc8b3873cf5dcfc26efc3f14d9d426110b3417da9b529688"}}