{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:S4DSNN2PKSEZSCHOPJ5SSRAQ6O","short_pith_number":"pith:S4DSNN2P","canonical_record":{"source":{"id":"1901.09208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-01-26T13:17:27Z","cross_cats_sorted":[],"title_canon_sha256":"5d58ddfe279921f9317525ff780985b4cf4e7334b2231a137193ad48a043c97e","abstract_canon_sha256":"1803977b96a695d75ad22fa17b0499f2c7946b13d91e706982aeae3cdd8f2e0b"},"schema_version":"1.0"},"canonical_sha256":"970726b74f54899908ee7a7b294410f397bcf8670641f23fbc242c6b5e885487","source":{"kind":"arxiv","id":"1901.09208","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09208","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09208v1","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09208","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"pith_short_12","alias_value":"S4DSNN2PKSEZ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"S4DSNN2PKSEZSCHO","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"S4DSNN2P","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:S4DSNN2PKSEZSCHOPJ5SSRAQ6O","target":"record","payload":{"canonical_record":{"source":{"id":"1901.09208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-01-26T13:17:27Z","cross_cats_sorted":[],"title_canon_sha256":"5d58ddfe279921f9317525ff780985b4cf4e7334b2231a137193ad48a043c97e","abstract_canon_sha256":"1803977b96a695d75ad22fa17b0499f2c7946b13d91e706982aeae3cdd8f2e0b"},"schema_version":"1.0"},"canonical_sha256":"970726b74f54899908ee7a7b294410f397bcf8670641f23fbc242c6b5e885487","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:26.606897Z","signature_b64":"xFvQUI/lJFIcuAiyAgwBCbn45FT8nFkWw+Y8Y63Yv4jg3fwL4UT2dNs3N9u+0aGhjCWRzzRhALMVmGV3gcqNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"970726b74f54899908ee7a7b294410f397bcf8670641f23fbc242c6b5e885487","last_reissued_at":"2026-05-17T23:55:26.606503Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:26.606503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.09208","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-17T23:55:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kGrQ+ELhMSWq8vIfQipzJb9V+T9y1Wf1Ohsc23GLw6gJIw1PPkhdJUxOIZ/LgdB1/+tQEm5p6CxUJOMkjCcVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:49:16.716940Z"},"content_sha256":"1bcc39b983bc5da9d1c7bc5393c594722613018b2a6b7f2923ebad20ef892da5","schema_version":"1.0","event_id":"sha256:1bcc39b983bc5da9d1c7bc5393c594722613018b2a6b7f2923ebad20ef892da5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:S4DSNN2PKSEZSCHOPJ5SSRAQ6O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Intrinsically Sparse Long Short-Term Memory Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Decebal Constantin Mocanu, Mykola Pechenizkiy, Shiwei Liu","submitted_at":"2019-01-26T13:17:27Z","abstract_excerpt":"Long Short-Term Memory (LSTM) has achieved state-of-the-art performances on a wide range of tasks. Its outstanding performance is guaranteed by the long-term memory ability which matches the sequential data perfectly and the gating structure controlling the information flow. However, LSTMs are prone to be memory-bandwidth limited in realistic applications and need an unbearable period of training and inference time as the model size is ever-increasing. To tackle this problem, various efficient model compression methods have been proposed. Most of them need a big and expensive pre-trained model"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09208","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-17T23:55:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Szak5GV4l+2Tlthu3p9MrhMfKZy5yLfan6qbMJouKp3qozV7MAxHgwc5Y37xkXm41DSWOtGuha+P4DdbyVGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:49:16.717692Z"},"content_sha256":"8ab2665a36ec117383155bf07fdcf2fa9bf3c13a8aa12978f73f06dd41d25719","schema_version":"1.0","event_id":"sha256:8ab2665a36ec117383155bf07fdcf2fa9bf3c13a8aa12978f73f06dd41d25719"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S4DSNN2PKSEZSCHOPJ5SSRAQ6O/bundle.json","state_url":"https://pith.science/pith/S4DSNN2PKSEZSCHOPJ5SSRAQ6O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S4DSNN2PKSEZSCHOPJ5SSRAQ6O/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-06-09T07:49:16Z","links":{"resolver":"https://pith.science/pith/S4DSNN2PKSEZSCHOPJ5SSRAQ6O","bundle":"https://pith.science/pith/S4DSNN2PKSEZSCHOPJ5SSRAQ6O/bundle.json","state":"https://pith.science/pith/S4DSNN2PKSEZSCHOPJ5SSRAQ6O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S4DSNN2PKSEZSCHOPJ5SSRAQ6O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:S4DSNN2PKSEZSCHOPJ5SSRAQ6O","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":"1803977b96a695d75ad22fa17b0499f2c7946b13d91e706982aeae3cdd8f2e0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-01-26T13:17:27Z","title_canon_sha256":"5d58ddfe279921f9317525ff780985b4cf4e7334b2231a137193ad48a043c97e"},"schema_version":"1.0","source":{"id":"1901.09208","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09208","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09208v1","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09208","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"pith_short_12","alias_value":"S4DSNN2PKSEZ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"S4DSNN2PKSEZSCHO","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"S4DSNN2P","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:8ab2665a36ec117383155bf07fdcf2fa9bf3c13a8aa12978f73f06dd41d25719","target":"graph","created_at":"2026-05-17T23:55:26Z","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) has achieved state-of-the-art performances on a wide range of tasks. Its outstanding performance is guaranteed by the long-term memory ability which matches the sequential data perfectly and the gating structure controlling the information flow. However, LSTMs are prone to be memory-bandwidth limited in realistic applications and need an unbearable period of training and inference time as the model size is ever-increasing. To tackle this problem, various efficient model compression methods have been proposed. Most of them need a big and expensive pre-trained model","authors_text":"Decebal Constantin Mocanu, Mykola Pechenizkiy, Shiwei Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-01-26T13:17:27Z","title":"Intrinsically Sparse Long Short-Term Memory Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09208","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:1bcc39b983bc5da9d1c7bc5393c594722613018b2a6b7f2923ebad20ef892da5","target":"record","created_at":"2026-05-17T23:55:26Z","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":"1803977b96a695d75ad22fa17b0499f2c7946b13d91e706982aeae3cdd8f2e0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-01-26T13:17:27Z","title_canon_sha256":"5d58ddfe279921f9317525ff780985b4cf4e7334b2231a137193ad48a043c97e"},"schema_version":"1.0","source":{"id":"1901.09208","kind":"arxiv","version":1}},"canonical_sha256":"970726b74f54899908ee7a7b294410f397bcf8670641f23fbc242c6b5e885487","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"970726b74f54899908ee7a7b294410f397bcf8670641f23fbc242c6b5e885487","first_computed_at":"2026-05-17T23:55:26.606503Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:26.606503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xFvQUI/lJFIcuAiyAgwBCbn45FT8nFkWw+Y8Y63Yv4jg3fwL4UT2dNs3N9u+0aGhjCWRzzRhALMVmGV3gcqNBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:26.606897Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09208","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bcc39b983bc5da9d1c7bc5393c594722613018b2a6b7f2923ebad20ef892da5","sha256:8ab2665a36ec117383155bf07fdcf2fa9bf3c13a8aa12978f73f06dd41d25719"],"state_sha256":"c540d8a472fc2cd12e0d83b7b460ca504ace9d9e3705c2638c872a2637510dde"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AEuX6Xp4SfojJbafWKKyo9jkgxcoJJc6b8HeSmvzNL+K0yt6fIRw87siXtm7/hScBt7x4AjSKDH9MAOrGTGQBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:49:16.721835Z","bundle_sha256":"008b427dc8cced6cbca590e28632373c5a040a251c4986dc6fb9d7341fad98bc"}}