{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VPNTFLBGEI7U2M5FYETJIFWYOZ","short_pith_number":"pith:VPNTFLBG","schema_version":"1.0","canonical_sha256":"abdb32ac26223f4d33a5c1269416d87666639682ea25c96da63d13b8e92220bb","source":{"kind":"arxiv","id":"2109.09828","version":2},"attestation_state":"computed","paper":{"title":"iRNN: Integer-only Recurrent Neural Network","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Eyy\\\"ub Sari, Vahid Partovi Nia, Vanessa Courville","submitted_at":"2021-09-20T20:17:40Z","abstract_excerpt":"Recurrent neural networks (RNN) are used in many real-world text and speech applications. They include complex modules such as recurrence, exponential-based activation, gate interaction, unfoldable normalization, bi-directional dependence, and attention. The interaction between these elements prevents running them on integer-only operations without a significant performance drop. Deploying RNNs that include layer normalization and attention on integer-only arithmetic is still an open problem. We present a quantization-aware training method for obtaining a highly accurate integer-only recurrent"},"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":"2109.09828","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-09-20T20:17:40Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"22fed05117eed166b55cd682603d528184a122013eb9e67c55719d44a8c04b6a","abstract_canon_sha256":"33f483b0e266db7e81c3dace8bc0ae6e2a0ee6124cf19bae0a16e056694eba62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:56:50.057487Z","signature_b64":"Ha9vWPOHirUhb8lkcJm4VMN0U7TP9bS6W6it7Q0xtR1ShiSJMiqzvLVDoIrpBxJNb3asoukjCfzgYLS5TwMZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abdb32ac26223f4d33a5c1269416d87666639682ea25c96da63d13b8e92220bb","last_reissued_at":"2026-07-05T03:56:50.057029Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:56:50.057029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"iRNN: Integer-only Recurrent Neural Network","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Eyy\\\"ub Sari, Vahid Partovi Nia, Vanessa Courville","submitted_at":"2021-09-20T20:17:40Z","abstract_excerpt":"Recurrent neural networks (RNN) are used in many real-world text and speech applications. They include complex modules such as recurrence, exponential-based activation, gate interaction, unfoldable normalization, bi-directional dependence, and attention. The interaction between these elements prevents running them on integer-only operations without a significant performance drop. Deploying RNNs that include layer normalization and attention on integer-only arithmetic is still an open problem. We present a quantization-aware training method for obtaining a highly accurate integer-only recurrent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.09828","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.09828/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2109.09828","created_at":"2026-07-05T03:56:50.057085+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.09828v2","created_at":"2026-07-05T03:56:50.057085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.09828","created_at":"2026-07-05T03:56:50.057085+00:00"},{"alias_kind":"pith_short_12","alias_value":"VPNTFLBGEI7U","created_at":"2026-07-05T03:56:50.057085+00:00"},{"alias_kind":"pith_short_16","alias_value":"VPNTFLBGEI7U2M5F","created_at":"2026-07-05T03:56:50.057085+00:00"},{"alias_kind":"pith_short_8","alias_value":"VPNTFLBG","created_at":"2026-07-05T03:56:50.057085+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01765","citing_title":"An Algebraic View of the Expressivity of Recurrent Language Models","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VPNTFLBGEI7U2M5FYETJIFWYOZ","json":"https://pith.science/pith/VPNTFLBGEI7U2M5FYETJIFWYOZ.json","graph_json":"https://pith.science/api/pith-number/VPNTFLBGEI7U2M5FYETJIFWYOZ/graph.json","events_json":"https://pith.science/api/pith-number/VPNTFLBGEI7U2M5FYETJIFWYOZ/events.json","paper":"https://pith.science/paper/VPNTFLBG"},"agent_actions":{"view_html":"https://pith.science/pith/VPNTFLBGEI7U2M5FYETJIFWYOZ","download_json":"https://pith.science/pith/VPNTFLBGEI7U2M5FYETJIFWYOZ.json","view_paper":"https://pith.science/paper/VPNTFLBG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.09828&json=true","fetch_graph":"https://pith.science/api/pith-number/VPNTFLBGEI7U2M5FYETJIFWYOZ/graph.json","fetch_events":"https://pith.science/api/pith-number/VPNTFLBGEI7U2M5FYETJIFWYOZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VPNTFLBGEI7U2M5FYETJIFWYOZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VPNTFLBGEI7U2M5FYETJIFWYOZ/action/storage_attestation","attest_author":"https://pith.science/pith/VPNTFLBGEI7U2M5FYETJIFWYOZ/action/author_attestation","sign_citation":"https://pith.science/pith/VPNTFLBGEI7U2M5FYETJIFWYOZ/action/citation_signature","submit_replication":"https://pith.science/pith/VPNTFLBGEI7U2M5FYETJIFWYOZ/action/replication_record"}},"created_at":"2026-07-05T03:56:50.057085+00:00","updated_at":"2026-07-05T03:56:50.057085+00:00"}