{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:I4NDKCDJTVKUFUIEROMHU6WXS4","short_pith_number":"pith:I4NDKCDJ","schema_version":"1.0","canonical_sha256":"471a3508699d5542d1048b987a7ad79729edbf810158528191a0c3ed9b450e34","source":{"kind":"arxiv","id":"1711.02085","version":3},"attestation_state":"computed","paper":{"title":"Neural Speed Reading via Skim-RNN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ali Farhadi, Hannaneh Hajishirzi, Minjoon Seo, Sewon Min","submitted_at":"2017-11-06T18:58:46Z","abstract_excerpt":"Inspired by the principles of speed reading, we introduce Skim-RNN, a recurrent neural network (RNN) that dynamically decides to update only a small fraction of the hidden state for relatively unimportant input tokens. Skim-RNN gives computational advantage over an RNN that always updates the entire hidden state. Skim-RNN uses the same input and output interfaces as a standard RNN and can be easily used instead of RNNs in existing models. In our experiments, we show that Skim-RNN can achieve significantly reduced computational cost without losing accuracy compared to standard RNNs across five "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1711.02085","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-11-06T18:58:46Z","cross_cats_sorted":[],"title_canon_sha256":"1a86da66c90354909eeb2337d35f502768d8849812291e604264d3fba3b1d2af","abstract_canon_sha256":"52c60d9db3d732d72ab1a7c10719ab01e6e35504ff6f9a9aabb5b6a8ea30f070"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:53.388021Z","signature_b64":"zfpd/Uqljh5QHKz29von02EmozKWoXPpKiBP0n5zfprZy6UQ6EewCBv+vfWVB6WVxPqQVBARNwOMMRhbZcMpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"471a3508699d5542d1048b987a7ad79729edbf810158528191a0c3ed9b450e34","last_reissued_at":"2026-05-18T00:19:53.387353Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:53.387353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Speed Reading via Skim-RNN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ali Farhadi, Hannaneh Hajishirzi, Minjoon Seo, Sewon Min","submitted_at":"2017-11-06T18:58:46Z","abstract_excerpt":"Inspired by the principles of speed reading, we introduce Skim-RNN, a recurrent neural network (RNN) that dynamically decides to update only a small fraction of the hidden state for relatively unimportant input tokens. Skim-RNN gives computational advantage over an RNN that always updates the entire hidden state. Skim-RNN uses the same input and output interfaces as a standard RNN and can be easily used instead of RNNs in existing models. In our experiments, we show that Skim-RNN can achieve significantly reduced computational cost without losing accuracy compared to standard RNNs across five "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02085","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.02085","created_at":"2026-05-18T00:19:53.387462+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02085v3","created_at":"2026-05-18T00:19:53.387462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02085","created_at":"2026-05-18T00:19:53.387462+00:00"},{"alias_kind":"pith_short_12","alias_value":"I4NDKCDJTVKU","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"I4NDKCDJTVKUFUIE","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"I4NDKCDJ","created_at":"2026-05-18T12:31:21.493067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2310.01801","citing_title":"Model Tells You What to Discard: Adaptive KV Cache Compression for LLMs","ref_index":93,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I4NDKCDJTVKUFUIEROMHU6WXS4","json":"https://pith.science/pith/I4NDKCDJTVKUFUIEROMHU6WXS4.json","graph_json":"https://pith.science/api/pith-number/I4NDKCDJTVKUFUIEROMHU6WXS4/graph.json","events_json":"https://pith.science/api/pith-number/I4NDKCDJTVKUFUIEROMHU6WXS4/events.json","paper":"https://pith.science/paper/I4NDKCDJ"},"agent_actions":{"view_html":"https://pith.science/pith/I4NDKCDJTVKUFUIEROMHU6WXS4","download_json":"https://pith.science/pith/I4NDKCDJTVKUFUIEROMHU6WXS4.json","view_paper":"https://pith.science/paper/I4NDKCDJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02085&json=true","fetch_graph":"https://pith.science/api/pith-number/I4NDKCDJTVKUFUIEROMHU6WXS4/graph.json","fetch_events":"https://pith.science/api/pith-number/I4NDKCDJTVKUFUIEROMHU6WXS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I4NDKCDJTVKUFUIEROMHU6WXS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I4NDKCDJTVKUFUIEROMHU6WXS4/action/storage_attestation","attest_author":"https://pith.science/pith/I4NDKCDJTVKUFUIEROMHU6WXS4/action/author_attestation","sign_citation":"https://pith.science/pith/I4NDKCDJTVKUFUIEROMHU6WXS4/action/citation_signature","submit_replication":"https://pith.science/pith/I4NDKCDJTVKUFUIEROMHU6WXS4/action/replication_record"}},"created_at":"2026-05-18T00:19:53.387462+00:00","updated_at":"2026-05-18T00:19:53.387462+00:00"}