{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3Y4QUDWA6H6KDWRMTLBK5DZFYJ","short_pith_number":"pith:3Y4QUDWA","canonical_record":{"source":{"id":"1811.00641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-01T21:38:18Z","cross_cats_sorted":["cs.CL","cs.NA","stat.ML"],"title_canon_sha256":"cb9c6428704496b0a199f2ccd486e8d419b3bc8af29290a0c06c8f4f6e6bb9f6","abstract_canon_sha256":"ccb03d5b8818a2fcec88aaa8798710e4e03effc41a2df4878da435f4f54b04e2"},"schema_version":"1.0"},"canonical_sha256":"de390a0ec0f1fca1da2c9ac2ae8f25c254442d1237632c88e4fbb4e0a682a03f","source":{"kind":"arxiv","id":"1811.00641","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00641","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00641v1","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00641","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"3Y4QUDWA6H6K","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3Y4QUDWA6H6KDWRM","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3Y4QUDWA","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3Y4QUDWA6H6KDWRMTLBK5DZFYJ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.00641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-01T21:38:18Z","cross_cats_sorted":["cs.CL","cs.NA","stat.ML"],"title_canon_sha256":"cb9c6428704496b0a199f2ccd486e8d419b3bc8af29290a0c06c8f4f6e6bb9f6","abstract_canon_sha256":"ccb03d5b8818a2fcec88aaa8798710e4e03effc41a2df4878da435f4f54b04e2"},"schema_version":"1.0"},"canonical_sha256":"de390a0ec0f1fca1da2c9ac2ae8f25c254442d1237632c88e4fbb4e0a682a03f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:42.610519Z","signature_b64":"mj8DkwDj6bEng8j6h34kScK9XoU+fHg/XiFAFnLj6UydvVW179l1uktpsXKg1/JYyPVOuV2xrmRQsKPa5aOnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de390a0ec0f1fca1da2c9ac2ae8f25c254442d1237632c88e4fbb4e0a682a03f","last_reissued_at":"2026-05-18T00:01:42.610010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:42.610010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.00641","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-05-18T00:01:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u3rlQskDejppSri0o2Ip6W+VDYtx0zZCqNEmOkz6Tucz6rVy5cOe3jNJ70YbgVPphlWey6whIPh5Ac8M3wZIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:06:58.107400Z"},"content_sha256":"3ce32dbe0668ed9ab61eaf1bf04c737c65f8de3858d79cec495fc0cdcf2d4b48","schema_version":"1.0","event_id":"sha256:3ce32dbe0668ed9ab61eaf1bf04c737c65f8de3858d79cec495fc0cdcf2d4b48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3Y4QUDWA6H6KDWRMTLBK5DZFYJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Embedding Compression for Text Classification using Low Rank Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Angeliki Metallinou, Anish Acharya, Inderjit Dhillon, Rahul Goel","submitted_at":"2018-11-01T21:38:18Z","abstract_excerpt":"Deep learning models have become state of the art for natural language processing (NLP) tasks, however deploying these models in production system poses significant memory constraints. Existing compression methods are either lossy or introduce significant latency. We propose a compression method that leverages low rank matrix factorization during training,to compress the word embedding layer which represents the size bottleneck for most NLP models. Our models are trained, compressed and then further re-trained on the downstream task to recover accuracy while maintaining the reduced size. Empir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00641","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":""},"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-05-18T00:01:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qsjDqGmY8+h7rfHLG8FHemEiNGkU0Zv/qrbepvIzcCojl+P5YQtrfRO9WW6ZedtOtNQsI1V3oZqqpHaI34PgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:06:58.108131Z"},"content_sha256":"6554d98075bb1d2ba605ac5518f47c49d8612c4700c5820f536f3774894475d8","schema_version":"1.0","event_id":"sha256:6554d98075bb1d2ba605ac5518f47c49d8612c4700c5820f536f3774894475d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3Y4QUDWA6H6KDWRMTLBK5DZFYJ/bundle.json","state_url":"https://pith.science/pith/3Y4QUDWA6H6KDWRMTLBK5DZFYJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3Y4QUDWA6H6KDWRMTLBK5DZFYJ/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-06-01T03:06:58Z","links":{"resolver":"https://pith.science/pith/3Y4QUDWA6H6KDWRMTLBK5DZFYJ","bundle":"https://pith.science/pith/3Y4QUDWA6H6KDWRMTLBK5DZFYJ/bundle.json","state":"https://pith.science/pith/3Y4QUDWA6H6KDWRMTLBK5DZFYJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3Y4QUDWA6H6KDWRMTLBK5DZFYJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3Y4QUDWA6H6KDWRMTLBK5DZFYJ","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":"ccb03d5b8818a2fcec88aaa8798710e4e03effc41a2df4878da435f4f54b04e2","cross_cats_sorted":["cs.CL","cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-01T21:38:18Z","title_canon_sha256":"cb9c6428704496b0a199f2ccd486e8d419b3bc8af29290a0c06c8f4f6e6bb9f6"},"schema_version":"1.0","source":{"id":"1811.00641","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00641","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00641v1","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00641","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"3Y4QUDWA6H6K","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3Y4QUDWA6H6KDWRM","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3Y4QUDWA","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:6554d98075bb1d2ba605ac5518f47c49d8612c4700c5820f536f3774894475d8","target":"graph","created_at":"2026-05-18T00:01:42Z","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"},"paper":{"abstract_excerpt":"Deep learning models have become state of the art for natural language processing (NLP) tasks, however deploying these models in production system poses significant memory constraints. Existing compression methods are either lossy or introduce significant latency. We propose a compression method that leverages low rank matrix factorization during training,to compress the word embedding layer which represents the size bottleneck for most NLP models. Our models are trained, compressed and then further re-trained on the downstream task to recover accuracy while maintaining the reduced size. Empir","authors_text":"Angeliki Metallinou, Anish Acharya, Inderjit Dhillon, Rahul Goel","cross_cats":["cs.CL","cs.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-01T21:38:18Z","title":"Online Embedding Compression for Text Classification using Low Rank Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00641","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:3ce32dbe0668ed9ab61eaf1bf04c737c65f8de3858d79cec495fc0cdcf2d4b48","target":"record","created_at":"2026-05-18T00:01:42Z","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":"ccb03d5b8818a2fcec88aaa8798710e4e03effc41a2df4878da435f4f54b04e2","cross_cats_sorted":["cs.CL","cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-01T21:38:18Z","title_canon_sha256":"cb9c6428704496b0a199f2ccd486e8d419b3bc8af29290a0c06c8f4f6e6bb9f6"},"schema_version":"1.0","source":{"id":"1811.00641","kind":"arxiv","version":1}},"canonical_sha256":"de390a0ec0f1fca1da2c9ac2ae8f25c254442d1237632c88e4fbb4e0a682a03f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de390a0ec0f1fca1da2c9ac2ae8f25c254442d1237632c88e4fbb4e0a682a03f","first_computed_at":"2026-05-18T00:01:42.610010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:42.610010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mj8DkwDj6bEng8j6h34kScK9XoU+fHg/XiFAFnLj6UydvVW179l1uktpsXKg1/JYyPVOuV2xrmRQsKPa5aOnBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:42.610519Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.00641","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ce32dbe0668ed9ab61eaf1bf04c737c65f8de3858d79cec495fc0cdcf2d4b48","sha256:6554d98075bb1d2ba605ac5518f47c49d8612c4700c5820f536f3774894475d8"],"state_sha256":"af87bc4847eddba3431b4c40315d5420e6f8fd8bfd2d91f10e7fe40c16765033"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"be7iSrpmTaWcP6RuQABhLtPt06k3FvcnQqwqCFp4Dp2yL67xda5w2MRHxBAsmqjGvRoNp9xOdVKcJxyS4ZLRAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:06:58.111634Z","bundle_sha256":"bf4bd670cfd4a01e7c42585b2ed33e0ecd2bb9dbaaecb6db1a1ef5072263228e"}}