{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:R6DND4YMVTVQVDBOGMZDTQ4P2A","short_pith_number":"pith:R6DND4YM","canonical_record":{"source":{"id":"1611.06188","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-18T18:13:46Z","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"title_canon_sha256":"7de251d1ae6acab55a78ff97ac77b58060fe54ed9cf61e0dbb55bbed0c7b766e","abstract_canon_sha256":"f34b6f2967a77c00c93c4a8793c45bc0db2033f791394adc2d366140ff8d14d1"},"schema_version":"1.0"},"canonical_sha256":"8f86d1f30caceb0a8c2e333239c38fd03d978b7f8289816e3c30a4bd00b68e33","source":{"kind":"arxiv","id":"1611.06188","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06188","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06188v2","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06188","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"pith_short_12","alias_value":"R6DND4YMVTVQ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R6DND4YMVTVQVDBO","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R6DND4YM","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:R6DND4YMVTVQVDBOGMZDTQ4P2A","target":"record","payload":{"canonical_record":{"source":{"id":"1611.06188","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-18T18:13:46Z","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"title_canon_sha256":"7de251d1ae6acab55a78ff97ac77b58060fe54ed9cf61e0dbb55bbed0c7b766e","abstract_canon_sha256":"f34b6f2967a77c00c93c4a8793c45bc0db2033f791394adc2d366140ff8d14d1"},"schema_version":"1.0"},"canonical_sha256":"8f86d1f30caceb0a8c2e333239c38fd03d978b7f8289816e3c30a4bd00b68e33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:37.754641Z","signature_b64":"cC09LKi/keStjUjJ9iMVZp0iY1E1JgBbEKRFtaAGGZcmN11sDAafVkrWiuic9T7KJ8rkwLn6+1D/zD6JvMpZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f86d1f30caceb0a8c2e333239c38fd03d978b7f8289816e3c30a4bd00b68e33","last_reissued_at":"2026-05-18T00:49:37.753961Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:37.753961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.06188","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:49:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qAXvwXADeZRhHNKz+fmAOTpNKd3bkJZFPGRaoCZMPU49akHjxuOuTEENXnGL6J0dHF1ku4qB+/u/y8w7Xz2WAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:40:26.525731Z"},"content_sha256":"d9ad3fe77fa7abc5549155dab1b43f1c93781e417204b3f2274c6084e0ec5969","schema_version":"1.0","event_id":"sha256:d9ad3fe77fa7abc5549155dab1b43f1c93781e417204b3f2274c6084e0ec5969"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:R6DND4YMVTVQVDBOGMZDTQ4P2A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variable Computation in Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.LG"],"primary_cat":"stat.ML","authors_text":"Armand Joulin, Edouard Grave, Tomas Mikolov, Yacine Jernite","submitted_at":"2016-11-18T18:13:46Z","abstract_excerpt":"Recurrent neural networks (RNNs) have been used extensively and with increasing success to model various types of sequential data. Much of this progress has been achieved through devising recurrent units and architectures with the flexibility to capture complex statistics in the data, such as long range dependency or localized attention phenomena. However, while many sequential data (such as video, speech or language) can have highly variable information flow, most recurrent models still consume input features at a constant rate and perform a constant number of computations per time step, whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06188","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:49:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qGJPs1lMyexjcgCVaFeahgurz9CSekJ8m61vKyzykDq4En2S/Qa9EnkOX4FmY5wXxSbFwMJ9pusUCs0Y7eGBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:40:26.526075Z"},"content_sha256":"0971ee7e0b46b468973f505a6e2f846c6c320a33e0b36b243696d40f191458fd","schema_version":"1.0","event_id":"sha256:0971ee7e0b46b468973f505a6e2f846c6c320a33e0b36b243696d40f191458fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R6DND4YMVTVQVDBOGMZDTQ4P2A/bundle.json","state_url":"https://pith.science/pith/R6DND4YMVTVQVDBOGMZDTQ4P2A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R6DND4YMVTVQVDBOGMZDTQ4P2A/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-02T22:40:26Z","links":{"resolver":"https://pith.science/pith/R6DND4YMVTVQVDBOGMZDTQ4P2A","bundle":"https://pith.science/pith/R6DND4YMVTVQVDBOGMZDTQ4P2A/bundle.json","state":"https://pith.science/pith/R6DND4YMVTVQVDBOGMZDTQ4P2A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R6DND4YMVTVQVDBOGMZDTQ4P2A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:R6DND4YMVTVQVDBOGMZDTQ4P2A","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":"f34b6f2967a77c00c93c4a8793c45bc0db2033f791394adc2d366140ff8d14d1","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-18T18:13:46Z","title_canon_sha256":"7de251d1ae6acab55a78ff97ac77b58060fe54ed9cf61e0dbb55bbed0c7b766e"},"schema_version":"1.0","source":{"id":"1611.06188","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06188","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06188v2","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06188","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"pith_short_12","alias_value":"R6DND4YMVTVQ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R6DND4YMVTVQVDBO","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R6DND4YM","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:0971ee7e0b46b468973f505a6e2f846c6c320a33e0b36b243696d40f191458fd","target":"graph","created_at":"2026-05-18T00:49:37Z","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":"Recurrent neural networks (RNNs) have been used extensively and with increasing success to model various types of sequential data. Much of this progress has been achieved through devising recurrent units and architectures with the flexibility to capture complex statistics in the data, such as long range dependency or localized attention phenomena. However, while many sequential data (such as video, speech or language) can have highly variable information flow, most recurrent models still consume input features at a constant rate and perform a constant number of computations per time step, whic","authors_text":"Armand Joulin, Edouard Grave, Tomas Mikolov, Yacine Jernite","cross_cats":["cs.AI","cs.CL","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-18T18:13:46Z","title":"Variable Computation in Recurrent Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06188","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:d9ad3fe77fa7abc5549155dab1b43f1c93781e417204b3f2274c6084e0ec5969","target":"record","created_at":"2026-05-18T00:49:37Z","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":"f34b6f2967a77c00c93c4a8793c45bc0db2033f791394adc2d366140ff8d14d1","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-18T18:13:46Z","title_canon_sha256":"7de251d1ae6acab55a78ff97ac77b58060fe54ed9cf61e0dbb55bbed0c7b766e"},"schema_version":"1.0","source":{"id":"1611.06188","kind":"arxiv","version":2}},"canonical_sha256":"8f86d1f30caceb0a8c2e333239c38fd03d978b7f8289816e3c30a4bd00b68e33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f86d1f30caceb0a8c2e333239c38fd03d978b7f8289816e3c30a4bd00b68e33","first_computed_at":"2026-05-18T00:49:37.753961Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:37.753961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cC09LKi/keStjUjJ9iMVZp0iY1E1JgBbEKRFtaAGGZcmN11sDAafVkrWiuic9T7KJ8rkwLn6+1D/zD6JvMpZDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:37.754641Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.06188","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9ad3fe77fa7abc5549155dab1b43f1c93781e417204b3f2274c6084e0ec5969","sha256:0971ee7e0b46b468973f505a6e2f846c6c320a33e0b36b243696d40f191458fd"],"state_sha256":"1a92f523a7d86c15e429bc24046194aebb8cbd451926fdcc3933d431a138a0fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P9CUraHA/kEjd2mRVtjrD9mK23db0+I8lOuOQ9iUXIWEbSFG8a7UiNZnQPZ4JHhTurFLrt1Kx8OJDxdPY3KPCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:40:26.527924Z","bundle_sha256":"d2c6ae6578dd4b29e32240d57c8dad3734ca20db2b7f6cad5bfb679590fbe4a6"}}