{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HLE6RBU4SZKMZFFF2LNPZE4ZTZ","short_pith_number":"pith:HLE6RBU4","canonical_record":{"source":{"id":"1710.00641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-09-29T12:40:50Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"title_canon_sha256":"c65945946150b29cb817fab0ff5c6f72520796671c0f7e2e7dcd2f0ae2150d9a","abstract_canon_sha256":"90079b3e21296e1800bd7a2eef1cef1aa71abbbb1e1e45a36b5cd3f2b3d00efd"},"schema_version":"1.0"},"canonical_sha256":"3ac9e8869c9654cc94a5d2dafc93999e5b86391c53c61a6e3ac1ad3c98cabbe2","source":{"kind":"arxiv","id":"1710.00641","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00641","created_at":"2026-05-18T00:33:54Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00641v1","created_at":"2026-05-18T00:33:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00641","created_at":"2026-05-18T00:33:54Z"},{"alias_kind":"pith_short_12","alias_value":"HLE6RBU4SZKM","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HLE6RBU4SZKMZFFF","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HLE6RBU4","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HLE6RBU4SZKMZFFF2LNPZE4ZTZ","target":"record","payload":{"canonical_record":{"source":{"id":"1710.00641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-09-29T12:40:50Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"title_canon_sha256":"c65945946150b29cb817fab0ff5c6f72520796671c0f7e2e7dcd2f0ae2150d9a","abstract_canon_sha256":"90079b3e21296e1800bd7a2eef1cef1aa71abbbb1e1e45a36b5cd3f2b3d00efd"},"schema_version":"1.0"},"canonical_sha256":"3ac9e8869c9654cc94a5d2dafc93999e5b86391c53c61a6e3ac1ad3c98cabbe2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:54.149010Z","signature_b64":"0eBWkxzHac1KuYHA8LzryouRneXH1TdWr0Q8/qUBYL9rv47UKFnph9hRnCHRviYfvF+8x2yek212GNHyMoG9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ac9e8869c9654cc94a5d2dafc93999e5b86391c53c61a6e3ac1ad3c98cabbe2","last_reissued_at":"2026-05-18T00:33:54.148457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:54.148457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.00641","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:33:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QnS9qPmhLDb7EOE43qxvjMkU5aMPZMbfFjLgiw3DdZqzPJ7JIZaJXOfZokRPY4NMUT8tDDOtTNCbiItjvwbABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T06:11:07.491378Z"},"content_sha256":"644bbce489008e22f7eb36cf42652c8e29c61757fff71569b18cb766273b7b88","schema_version":"1.0","event_id":"sha256:644bbce489008e22f7eb36cf42652c8e29c61757fff71569b18cb766273b7b88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HLE6RBU4SZKMZFFF2LNPZE4ZTZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving speech recognition by revising gated recurrent units","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE"],"primary_cat":"cs.CL","authors_text":"Maurizio Omologo, Mirco Ravanelli, Philemon Brakel, Yoshua Bengio","submitted_at":"2017-09-29T12:40:50Z","abstract_excerpt":"Speech recognition is largely taking advantage of deep learning, showing that substantial benefits can be obtained by modern Recurrent Neural Networks (RNNs). The most popular RNNs are Long Short-Term Memory (LSTMs), which typically reach state-of-the-art performance in many tasks thanks to their ability to learn long-term dependencies and robustness to vanishing gradients. Nevertheless, LSTMs have a rather complex design with three multiplicative gates, that might impair their efficient implementation. An attempt to simplify LSTMs has recently led to Gated Recurrent Units (GRUs), which are ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00641","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:33:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ls7L6RmwbV+AUB3t/U7+FBparXJB3sfQCCnVKyINwthWfrX0YSXS6YGXQYk7CiROazEjtvJu9wJUEuWamOw8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T06:11:07.491740Z"},"content_sha256":"5092a0bd5ffbf3c6e51df1ce9dd38ddf2eee13c3492aeba3d6a57863a2274a39","schema_version":"1.0","event_id":"sha256:5092a0bd5ffbf3c6e51df1ce9dd38ddf2eee13c3492aeba3d6a57863a2274a39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HLE6RBU4SZKMZFFF2LNPZE4ZTZ/bundle.json","state_url":"https://pith.science/pith/HLE6RBU4SZKMZFFF2LNPZE4ZTZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HLE6RBU4SZKMZFFF2LNPZE4ZTZ/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-21T06:11:07Z","links":{"resolver":"https://pith.science/pith/HLE6RBU4SZKMZFFF2LNPZE4ZTZ","bundle":"https://pith.science/pith/HLE6RBU4SZKMZFFF2LNPZE4ZTZ/bundle.json","state":"https://pith.science/pith/HLE6RBU4SZKMZFFF2LNPZE4ZTZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HLE6RBU4SZKMZFFF2LNPZE4ZTZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HLE6RBU4SZKMZFFF2LNPZE4ZTZ","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":"90079b3e21296e1800bd7a2eef1cef1aa71abbbb1e1e45a36b5cd3f2b3d00efd","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-09-29T12:40:50Z","title_canon_sha256":"c65945946150b29cb817fab0ff5c6f72520796671c0f7e2e7dcd2f0ae2150d9a"},"schema_version":"1.0","source":{"id":"1710.00641","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00641","created_at":"2026-05-18T00:33:54Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00641v1","created_at":"2026-05-18T00:33:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00641","created_at":"2026-05-18T00:33:54Z"},{"alias_kind":"pith_short_12","alias_value":"HLE6RBU4SZKM","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HLE6RBU4SZKMZFFF","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HLE6RBU4","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:5092a0bd5ffbf3c6e51df1ce9dd38ddf2eee13c3492aeba3d6a57863a2274a39","target":"graph","created_at":"2026-05-18T00:33:54Z","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":"Speech recognition is largely taking advantage of deep learning, showing that substantial benefits can be obtained by modern Recurrent Neural Networks (RNNs). The most popular RNNs are Long Short-Term Memory (LSTMs), which typically reach state-of-the-art performance in many tasks thanks to their ability to learn long-term dependencies and robustness to vanishing gradients. Nevertheless, LSTMs have a rather complex design with three multiplicative gates, that might impair their efficient implementation. An attempt to simplify LSTMs has recently led to Gated Recurrent Units (GRUs), which are ba","authors_text":"Maurizio Omologo, Mirco Ravanelli, Philemon Brakel, Yoshua Bengio","cross_cats":["cs.AI","cs.LG","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-09-29T12:40:50Z","title":"Improving speech recognition by revising gated recurrent units"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00641","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:644bbce489008e22f7eb36cf42652c8e29c61757fff71569b18cb766273b7b88","target":"record","created_at":"2026-05-18T00:33:54Z","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":"90079b3e21296e1800bd7a2eef1cef1aa71abbbb1e1e45a36b5cd3f2b3d00efd","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-09-29T12:40:50Z","title_canon_sha256":"c65945946150b29cb817fab0ff5c6f72520796671c0f7e2e7dcd2f0ae2150d9a"},"schema_version":"1.0","source":{"id":"1710.00641","kind":"arxiv","version":1}},"canonical_sha256":"3ac9e8869c9654cc94a5d2dafc93999e5b86391c53c61a6e3ac1ad3c98cabbe2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ac9e8869c9654cc94a5d2dafc93999e5b86391c53c61a6e3ac1ad3c98cabbe2","first_computed_at":"2026-05-18T00:33:54.148457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:54.148457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0eBWkxzHac1KuYHA8LzryouRneXH1TdWr0Q8/qUBYL9rv47UKFnph9hRnCHRviYfvF+8x2yek212GNHyMoG9CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:54.149010Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.00641","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:644bbce489008e22f7eb36cf42652c8e29c61757fff71569b18cb766273b7b88","sha256:5092a0bd5ffbf3c6e51df1ce9dd38ddf2eee13c3492aeba3d6a57863a2274a39"],"state_sha256":"31f69318ab0aacdcaf8e4779c3dd08db41fccfb3a02ceb0f8b65610909f477a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6AdpmHfl/Q/or+D4vcxP72rxgr5izFzRAABSx5qEpt5o/tyXXYLtk9BNPOpr+ZCyWntVZCG3/UXPFVQNbOcrCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T06:11:07.493940Z","bundle_sha256":"daf69b42f2e5a9b48cd95b9682e496f236d569f737e9acf718891dd2e0c8c6e0"}}