{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:H7GQG6ROIOTPLQI3Q3O5YQRNM5","short_pith_number":"pith:H7GQG6RO","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"},"canonical_sha256":"3fcd037a2e43a6f5c11b86dddc422d67747d88087ddbd0e63aa6efa668ee5d53","source":{"kind":"arxiv","id":"2010.03193","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.03193","created_at":"2026-07-05T01:41:10Z"},{"alias_kind":"arxiv_version","alias_value":"2010.03193v1","created_at":"2026-07-05T01:41:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.03193","created_at":"2026-07-05T01:41:10Z"},{"alias_kind":"pith_short_12","alias_value":"H7GQG6ROIOTP","created_at":"2026-07-05T01:41:10Z"},{"alias_kind":"pith_short_16","alias_value":"H7GQG6ROIOTPLQI3","created_at":"2026-07-05T01:41:10Z"},{"alias_kind":"pith_short_8","alias_value":"H7GQG6RO","created_at":"2026-07-05T01:41:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:H7GQG6ROIOTPLQI3Q3O5YQRNM5","target":"record","payload":{"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"},"canonical_sha256":"3fcd037a2e43a6f5c11b86dddc422d67747d88087ddbd0e63aa6efa668ee5d53","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"},"source_kind":"arxiv","source_id":"2010.03193","source_version":1,"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-07-05T01:41:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C49f+dAJRItLcoidbPALSE/mA1tjfjjec65NqcSvlCLf63wjUkiBXTgW3g9RInJI4eeFm3emLlvEx+1gCMdVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T00:34:13.485823Z"},"content_sha256":"4681eb5462e443e5a0a09e0276255595e55d2fdd370fc968240c2e93ca18ddbb","schema_version":"1.0","event_id":"sha256:4681eb5462e443e5a0a09e0276255595e55d2fdd370fc968240c2e93ca18ddbb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:H7GQG6ROIOTPLQI3Q3O5YQRNM5","target":"graph","payload":{"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"},"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-07-05T01:41:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dCXx53esUa7RA+yCgV0r7GVySdb/R/Z6iu9HHEtxI9mQg3Lb/emiMsfvyGUCbe+wK4WK9wbXvkCM5kNaegLQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T00:34:13.486254Z"},"content_sha256":"be541185e3821f43b9182191d327795d856326e74ca6c39e7b44241f37a6be15","schema_version":"1.0","event_id":"sha256:be541185e3821f43b9182191d327795d856326e74ca6c39e7b44241f37a6be15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H7GQG6ROIOTPLQI3Q3O5YQRNM5/bundle.json","state_url":"https://pith.science/pith/H7GQG6ROIOTPLQI3Q3O5YQRNM5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H7GQG6ROIOTPLQI3Q3O5YQRNM5/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-08-14T00:34:13Z","links":{"resolver":"https://pith.science/pith/H7GQG6ROIOTPLQI3Q3O5YQRNM5","bundle":"https://pith.science/pith/H7GQG6ROIOTPLQI3Q3O5YQRNM5/bundle.json","state":"https://pith.science/pith/H7GQG6ROIOTPLQI3Q3O5YQRNM5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H7GQG6ROIOTPLQI3Q3O5YQRNM5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:H7GQG6ROIOTPLQI3Q3O5YQRNM5","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":"1564499b2eb7cedfdabba1eccce0aced5593063bd4b7c25f43fdacb758a10f40","cross_cats_sorted":["cs.LG","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-10-06T16:03:15Z","title_canon_sha256":"708cd9f4989c124598ed5019aa12c6e963dc1046da22da0bfd2180ac300775e2"},"schema_version":"1.0","source":{"id":"2010.03193","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.03193","created_at":"2026-07-05T01:41:10Z"},{"alias_kind":"arxiv_version","alias_value":"2010.03193v1","created_at":"2026-07-05T01:41:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.03193","created_at":"2026-07-05T01:41:10Z"},{"alias_kind":"pith_short_12","alias_value":"H7GQG6ROIOTP","created_at":"2026-07-05T01:41:10Z"},{"alias_kind":"pith_short_16","alias_value":"H7GQG6ROIOTPLQI3","created_at":"2026-07-05T01:41:10Z"},{"alias_kind":"pith_short_8","alias_value":"H7GQG6RO","created_at":"2026-07-05T01:41:10Z"}],"graph_snapshots":[{"event_id":"sha256:be541185e3821f43b9182191d327795d856326e74ca6c39e7b44241f37a6be15","target":"graph","created_at":"2026-07-05T01:41:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2010.03193/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dibakar Gope, Ganesh Dasika, Jesse Beu, Matthew Mattina, Urmish Thakker","cross_cats":["cs.LG","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-10-06T16:03:15Z","title":"Rank and run-time aware compression of NLP Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.03193","kind":"arxiv","version":1},"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:4681eb5462e443e5a0a09e0276255595e55d2fdd370fc968240c2e93ca18ddbb","target":"record","created_at":"2026-07-05T01:41:10Z","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":"1564499b2eb7cedfdabba1eccce0aced5593063bd4b7c25f43fdacb758a10f40","cross_cats_sorted":["cs.LG","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-10-06T16:03:15Z","title_canon_sha256":"708cd9f4989c124598ed5019aa12c6e963dc1046da22da0bfd2180ac300775e2"},"schema_version":"1.0","source":{"id":"2010.03193","kind":"arxiv","version":1}},"canonical_sha256":"3fcd037a2e43a6f5c11b86dddc422d67747d88087ddbd0e63aa6efa668ee5d53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fcd037a2e43a6f5c11b86dddc422d67747d88087ddbd0e63aa6efa668ee5d53","first_computed_at":"2026-07-05T01:41:10.520503Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:41:10.520503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OOCbcN0OaVIgZ29wJG43DzjbeyDBL/hwYuCqXz1EFD/vFDj7ruoPFNoigQb1cOpd6NYsPuXAA8UF41t1fkiaDw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:41:10.521021Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.03193","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4681eb5462e443e5a0a09e0276255595e55d2fdd370fc968240c2e93ca18ddbb","sha256:be541185e3821f43b9182191d327795d856326e74ca6c39e7b44241f37a6be15"],"state_sha256":"21273a948d98f6b97045daceb23d80444ffc24df4db60ba09af28e4e79797b42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R0MBRGf7HNny/RM8c8twHPX7Iga02IU3qD6JJBADbTNDdWpuZtQGNhsNqsiorS9+xXWEGGp3/MJgfcKKpSSmAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T00:34:13.507180Z","bundle_sha256":"c462de010039b2d2488c116e69cef0037d616faf25c5daed94dc6da2da347662"}}