{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JYI5UZ4GFPDWN57TKLPT72QOYW","short_pith_number":"pith:JYI5UZ4G","schema_version":"1.0","canonical_sha256":"4e11da67862bc766f7f352df3fea0ec5baa3881b2b9064b9d21fffb3b680c23a","source":{"kind":"arxiv","id":"1906.02876","version":5},"attestation_state":"computed","paper":{"title":"Compressing RNNs for IoT devices by 15-38x using Kronecker Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chu Zhou, Dibakar Gope, Ganesh Dasika, Igor Fedorov, Jesse Beu, Matthew Mattina, Urmish Thakker","submitted_at":"2019-06-07T03:09:23Z","abstract_excerpt":"Recurrent Neural Networks (RNN) can be difficult to deploy on resource constrained devices due to their size.As a result, there is a need for compression techniques that can significantly compress RNNs without negatively impacting task accuracy. This paper introduces a method to compress RNNs for resource constrained environments using Kronecker product (KP). KPs can compress RNN layers by 15-38x with minimal accuracy loss. By quantizing the resulting models to 8-bits, we further push the compression factor to 50x. We show that KP can beat the task accuracy achieved by other state-of-the-art c"},"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":"1906.02876","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-07T03:09:23Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"698700662b3fd2d815d5de4f78bcfc411f885bab0e8b5bd68e62683a46f5343e","abstract_canon_sha256":"ebeedd6282202faaaa6a1d44e9214038b25b5de2890da7017a95dee60c9f4154"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:37:27.555700Z","signature_b64":"EZ7HWz6PlNy3k0v7+lC8z7mEmFXMx8skNVhNuR3tpTt8MuVhBGz/k1/a91tCT/tp5ZCz9EYhoBTawchsyJVwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e11da67862bc766f7f352df3fea0ec5baa3881b2b9064b9d21fffb3b680c23a","last_reissued_at":"2026-07-05T00:37:27.555205Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:37:27.555205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressing RNNs for IoT devices by 15-38x using Kronecker Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chu Zhou, Dibakar Gope, Ganesh Dasika, Igor Fedorov, Jesse Beu, Matthew Mattina, Urmish Thakker","submitted_at":"2019-06-07T03:09:23Z","abstract_excerpt":"Recurrent Neural Networks (RNN) can be difficult to deploy on resource constrained devices due to their size.As a result, there is a need for compression techniques that can significantly compress RNNs without negatively impacting task accuracy. This paper introduces a method to compress RNNs for resource constrained environments using Kronecker product (KP). KPs can compress RNN layers by 15-38x with minimal accuracy loss. By quantizing the resulting models to 8-bits, we further push the compression factor to 50x. We show that KP can beat the task accuracy achieved by other state-of-the-art c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02876","kind":"arxiv","version":5},"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/1906.02876/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":"1906.02876","created_at":"2026-07-05T00:37:27.555263+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.02876v5","created_at":"2026-07-05T00:37:27.555263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02876","created_at":"2026-07-05T00:37:27.555263+00:00"},{"alias_kind":"pith_short_12","alias_value":"JYI5UZ4GFPDW","created_at":"2026-07-05T00:37:27.555263+00:00"},{"alias_kind":"pith_short_16","alias_value":"JYI5UZ4GFPDWN57T","created_at":"2026-07-05T00:37:27.555263+00:00"},{"alias_kind":"pith_short_8","alias_value":"JYI5UZ4G","created_at":"2026-07-05T00:37:27.555263+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.10239","citing_title":"Efficient Zeroth-Order Federated Finetuning of Language Models on Resource-Constrained Devices","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JYI5UZ4GFPDWN57TKLPT72QOYW","json":"https://pith.science/pith/JYI5UZ4GFPDWN57TKLPT72QOYW.json","graph_json":"https://pith.science/api/pith-number/JYI5UZ4GFPDWN57TKLPT72QOYW/graph.json","events_json":"https://pith.science/api/pith-number/JYI5UZ4GFPDWN57TKLPT72QOYW/events.json","paper":"https://pith.science/paper/JYI5UZ4G"},"agent_actions":{"view_html":"https://pith.science/pith/JYI5UZ4GFPDWN57TKLPT72QOYW","download_json":"https://pith.science/pith/JYI5UZ4GFPDWN57TKLPT72QOYW.json","view_paper":"https://pith.science/paper/JYI5UZ4G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.02876&json=true","fetch_graph":"https://pith.science/api/pith-number/JYI5UZ4GFPDWN57TKLPT72QOYW/graph.json","fetch_events":"https://pith.science/api/pith-number/JYI5UZ4GFPDWN57TKLPT72QOYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JYI5UZ4GFPDWN57TKLPT72QOYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JYI5UZ4GFPDWN57TKLPT72QOYW/action/storage_attestation","attest_author":"https://pith.science/pith/JYI5UZ4GFPDWN57TKLPT72QOYW/action/author_attestation","sign_citation":"https://pith.science/pith/JYI5UZ4GFPDWN57TKLPT72QOYW/action/citation_signature","submit_replication":"https://pith.science/pith/JYI5UZ4GFPDWN57TKLPT72QOYW/action/replication_record"}},"created_at":"2026-07-05T00:37:27.555263+00:00","updated_at":"2026-07-05T00:37:27.555263+00:00"}