{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:H7GQG6ROIOTPLQI3Q3O5YQRNM5","short_pith_number":"pith:H7GQG6RO","schema_version":"1.0","canonical_sha256":"3fcd037a2e43a6f5c11b86dddc422d67747d88087ddbd0e63aa6efa668ee5d53","source":{"kind":"arxiv","id":"2010.03193","version":1},"attestation_state":"computed","paper":{"title":"Rank and run-time aware compression of NLP Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.PF"],"primary_cat":"cs.CL","authors_text":"Dibakar Gope, Ganesh Dasika, Jesse Beu, Matthew Mattina, Urmish Thakker","submitted_at":"2020-10-06T16:03:15Z","abstract_excerpt":"Sequence model based NLP applications can be large. Yet, many applications that benefit from them run on small devices with very limited compute and storage capabilities, while still having run-time constraints. As a result, there is a need for a compression technique that can achieve significant compression without negatively impacting inference run-time and task accuracy. This paper proposes a new compression technique called Hybrid Matrix Factorization that achieves this dual objective. HMF improves low-rank matrix factorization (LMF) techniques by doubling the rank of the matrix using an i"},"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":"2010.03193","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-10-06T16:03:15Z","cross_cats_sorted":["cs.LG","cs.PF"],"title_canon_sha256":"708cd9f4989c124598ed5019aa12c6e963dc1046da22da0bfd2180ac300775e2","abstract_canon_sha256":"1564499b2eb7cedfdabba1eccce0aced5593063bd4b7c25f43fdacb758a10f40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:41:10.521021Z","signature_b64":"OOCbcN0OaVIgZ29wJG43DzjbeyDBL/hwYuCqXz1EFD/vFDj7ruoPFNoigQb1cOpd6NYsPuXAA8UF41t1fkiaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fcd037a2e43a6f5c11b86dddc422d67747d88087ddbd0e63aa6efa668ee5d53","last_reissued_at":"2026-07-05T01:41:10.520503Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:41:10.520503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rank and run-time aware compression of NLP Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.PF"],"primary_cat":"cs.CL","authors_text":"Dibakar Gope, Ganesh Dasika, Jesse Beu, Matthew Mattina, Urmish Thakker","submitted_at":"2020-10-06T16:03:15Z","abstract_excerpt":"Sequence model based NLP applications can be large. Yet, many applications that benefit from them run on small devices with very limited compute and storage capabilities, while still having run-time constraints. As a result, there is a need for a compression technique that can achieve significant compression without negatively impacting inference run-time and task accuracy. This paper proposes a new compression technique called Hybrid Matrix Factorization that achieves this dual objective. HMF improves low-rank matrix factorization (LMF) techniques by doubling the rank of the matrix using an i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.03193","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.03193/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":"2010.03193","created_at":"2026-07-05T01:41:10.520575+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.03193v1","created_at":"2026-07-05T01:41:10.520575+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.03193","created_at":"2026-07-05T01:41:10.520575+00:00"},{"alias_kind":"pith_short_12","alias_value":"H7GQG6ROIOTP","created_at":"2026-07-05T01:41:10.520575+00:00"},{"alias_kind":"pith_short_16","alias_value":"H7GQG6ROIOTPLQI3","created_at":"2026-07-05T01:41:10.520575+00:00"},{"alias_kind":"pith_short_8","alias_value":"H7GQG6RO","created_at":"2026-07-05T01:41:10.520575+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.21127","citing_title":"HyperFM: An Efficient Hyperspectral Foundation Model with Spectral Grouping","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H7GQG6ROIOTPLQI3Q3O5YQRNM5","json":"https://pith.science/pith/H7GQG6ROIOTPLQI3Q3O5YQRNM5.json","graph_json":"https://pith.science/api/pith-number/H7GQG6ROIOTPLQI3Q3O5YQRNM5/graph.json","events_json":"https://pith.science/api/pith-number/H7GQG6ROIOTPLQI3Q3O5YQRNM5/events.json","paper":"https://pith.science/paper/H7GQG6RO"},"agent_actions":{"view_html":"https://pith.science/pith/H7GQG6ROIOTPLQI3Q3O5YQRNM5","download_json":"https://pith.science/pith/H7GQG6ROIOTPLQI3Q3O5YQRNM5.json","view_paper":"https://pith.science/paper/H7GQG6RO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.03193&json=true","fetch_graph":"https://pith.science/api/pith-number/H7GQG6ROIOTPLQI3Q3O5YQRNM5/graph.json","fetch_events":"https://pith.science/api/pith-number/H7GQG6ROIOTPLQI3Q3O5YQRNM5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H7GQG6ROIOTPLQI3Q3O5YQRNM5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H7GQG6ROIOTPLQI3Q3O5YQRNM5/action/storage_attestation","attest_author":"https://pith.science/pith/H7GQG6ROIOTPLQI3Q3O5YQRNM5/action/author_attestation","sign_citation":"https://pith.science/pith/H7GQG6ROIOTPLQI3Q3O5YQRNM5/action/citation_signature","submit_replication":"https://pith.science/pith/H7GQG6ROIOTPLQI3Q3O5YQRNM5/action/replication_record"}},"created_at":"2026-07-05T01:41:10.520575+00:00","updated_at":"2026-07-05T01:41:10.520575+00:00"}