{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Q63PFHUHMYGGZM5XDLOJHBPE46","short_pith_number":"pith:Q63PFHUH","canonical_record":{"source":{"id":"1806.02988","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-08T06:57:16Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"62171221cddf9bbe1a546043471dfc30ee53e7a1e9c9bed8f737776138ab894d","abstract_canon_sha256":"6dc83bbb1c1b3f618654f179e22102846a4e751c46c42f4f7f98641eb35ec5a0"},"schema_version":"1.0"},"canonical_sha256":"87b6f29e87660c6cb3b71adc9385e4e789cf4c840cbfc09872b622c4713caf23","source":{"kind":"arxiv","id":"1806.02988","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02988","created_at":"2026-05-18T00:13:53Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02988v1","created_at":"2026-05-18T00:13:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02988","created_at":"2026-05-18T00:13:53Z"},{"alias_kind":"pith_short_12","alias_value":"Q63PFHUHMYGG","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q63PFHUHMYGGZM5X","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q63PFHUH","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Q63PFHUHMYGGZM5XDLOJHBPE46","target":"record","payload":{"canonical_record":{"source":{"id":"1806.02988","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-08T06:57:16Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"62171221cddf9bbe1a546043471dfc30ee53e7a1e9c9bed8f737776138ab894d","abstract_canon_sha256":"6dc83bbb1c1b3f618654f179e22102846a4e751c46c42f4f7f98641eb35ec5a0"},"schema_version":"1.0"},"canonical_sha256":"87b6f29e87660c6cb3b71adc9385e4e789cf4c840cbfc09872b622c4713caf23","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:53.974988Z","signature_b64":"DQbbK1JXF170KUhGSeZMOMelmef1QEgj7A0tQ8kZc2E8Mrv2tGnpexM7rg9/4ngTlLwD1dij1/nIol7aTKwcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87b6f29e87660c6cb3b71adc9385e4e789cf4c840cbfc09872b622c4713caf23","last_reissued_at":"2026-05-18T00:13:53.974288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:53.974288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.02988","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:13:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OAk76N3TbolP1hqRVVkt/XwWylCzp0uc0jt1ohB3cLidb0OD62z3PdTEaSKOyaF3WIeMD+0WYxP46jra8qYeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:58:11.855117Z"},"content_sha256":"72bd515a51569bfefd97914d29d14dba552c060cee96160b6bf632f11bc0ff73","schema_version":"1.0","event_id":"sha256:72bd515a51569bfefd97914d29d14dba552c060cee96160b6bf632f11bc0ff73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Q63PFHUHMYGGZM5XDLOJHBPE46","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Binary-Valued Gates for Robust LSTM Training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Di He, Fei Tian, Liwei Wang, Tao Qin, Tie-Yan Liu, Wei Chen, Zhuohan Li","submitted_at":"2018-06-08T06:57:16Z","abstract_excerpt":"Long Short-Term Memory (LSTM) is one of the most widely used recurrent structures in sequence modeling. It aims to use gates to control information flow (e.g., whether to skip some information or not) in the recurrent computations, although its practical implementation based on soft gates only partially achieves this goal. In this paper, we propose a new way for LSTM training, which pushes the output values of the gates towards 0 or 1. By doing so, we can better control the information flow: the gates are mostly open or closed, instead of in a middle state, which makes the results more interpr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02988","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:13:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"keF8gKsCSaqQXQaJe/4OLAY2wp7uaqmYZ5gg+hramUSLteQnF8A8IghjC2Q8BW5+N0xjiXHKmefK1XWHANJeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:58:11.855509Z"},"content_sha256":"9c5280394a2acc31a76ab93405d34ac7c0bc4098df82aa52e07e8cf186cec255","schema_version":"1.0","event_id":"sha256:9c5280394a2acc31a76ab93405d34ac7c0bc4098df82aa52e07e8cf186cec255"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q63PFHUHMYGGZM5XDLOJHBPE46/bundle.json","state_url":"https://pith.science/pith/Q63PFHUHMYGGZM5XDLOJHBPE46/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q63PFHUHMYGGZM5XDLOJHBPE46/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-27T05:58:11Z","links":{"resolver":"https://pith.science/pith/Q63PFHUHMYGGZM5XDLOJHBPE46","bundle":"https://pith.science/pith/Q63PFHUHMYGGZM5XDLOJHBPE46/bundle.json","state":"https://pith.science/pith/Q63PFHUHMYGGZM5XDLOJHBPE46/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q63PFHUHMYGGZM5XDLOJHBPE46/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Q63PFHUHMYGGZM5XDLOJHBPE46","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":"6dc83bbb1c1b3f618654f179e22102846a4e751c46c42f4f7f98641eb35ec5a0","cross_cats_sorted":["cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-08T06:57:16Z","title_canon_sha256":"62171221cddf9bbe1a546043471dfc30ee53e7a1e9c9bed8f737776138ab894d"},"schema_version":"1.0","source":{"id":"1806.02988","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02988","created_at":"2026-05-18T00:13:53Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02988v1","created_at":"2026-05-18T00:13:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02988","created_at":"2026-05-18T00:13:53Z"},{"alias_kind":"pith_short_12","alias_value":"Q63PFHUHMYGG","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q63PFHUHMYGGZM5X","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q63PFHUH","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:9c5280394a2acc31a76ab93405d34ac7c0bc4098df82aa52e07e8cf186cec255","target":"graph","created_at":"2026-05-18T00:13:53Z","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":"Long Short-Term Memory (LSTM) is one of the most widely used recurrent structures in sequence modeling. It aims to use gates to control information flow (e.g., whether to skip some information or not) in the recurrent computations, although its practical implementation based on soft gates only partially achieves this goal. In this paper, we propose a new way for LSTM training, which pushes the output values of the gates towards 0 or 1. By doing so, we can better control the information flow: the gates are mostly open or closed, instead of in a middle state, which makes the results more interpr","authors_text":"Di He, Fei Tian, Liwei Wang, Tao Qin, Tie-Yan Liu, Wei Chen, Zhuohan Li","cross_cats":["cs.CL","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-08T06:57:16Z","title":"Towards Binary-Valued Gates for Robust LSTM Training"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02988","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:72bd515a51569bfefd97914d29d14dba552c060cee96160b6bf632f11bc0ff73","target":"record","created_at":"2026-05-18T00:13:53Z","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":"6dc83bbb1c1b3f618654f179e22102846a4e751c46c42f4f7f98641eb35ec5a0","cross_cats_sorted":["cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-08T06:57:16Z","title_canon_sha256":"62171221cddf9bbe1a546043471dfc30ee53e7a1e9c9bed8f737776138ab894d"},"schema_version":"1.0","source":{"id":"1806.02988","kind":"arxiv","version":1}},"canonical_sha256":"87b6f29e87660c6cb3b71adc9385e4e789cf4c840cbfc09872b622c4713caf23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87b6f29e87660c6cb3b71adc9385e4e789cf4c840cbfc09872b622c4713caf23","first_computed_at":"2026-05-18T00:13:53.974288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:53.974288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DQbbK1JXF170KUhGSeZMOMelmef1QEgj7A0tQ8kZc2E8Mrv2tGnpexM7rg9/4ngTlLwD1dij1/nIol7aTKwcBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:53.974988Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.02988","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72bd515a51569bfefd97914d29d14dba552c060cee96160b6bf632f11bc0ff73","sha256:9c5280394a2acc31a76ab93405d34ac7c0bc4098df82aa52e07e8cf186cec255"],"state_sha256":"f1a04eabe6e10659bcc9b2886cf56452b1e8b690965a84fd7809bca88c8e92e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aU/0e7UrjUH/GhD3jNPA2L/Leg97MF5hg2kbsUyUrDH6kOaZKhJ2R9q8DD58LPyBHDfOCHdMUiw+otUBfCkdAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:58:11.858508Z","bundle_sha256":"b474a5a62d60fc117b0aa5e1972aec8779ef20810fa61f4ca94ef6519215f240"}}