{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:Z5CYXY4PFIACMPOSNMCSZM2USN","short_pith_number":"pith:Z5CYXY4P","schema_version":"1.0","canonical_sha256":"cf458be38f2a00263dd26b052cb354934d8ad27f823aad2c1f500215a19ff58e","source":{"kind":"arxiv","id":"2203.10135","version":1},"attestation_state":"computed","paper":{"title":"Learning Compressed Embeddings for On-Device Inference","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Aditya Arora, Chandru Venkataraman, Frank Cipollone, Jay Katukuri, Niketan Pansare, Noyan Tokgozoglu, Riyaaz Shaik","submitted_at":"2022-03-18T19:32:40Z","abstract_excerpt":"In deep learning, embeddings are widely used to represent categorical entities such as words, apps, and movies. An embedding layer maps each entity to a unique vector, causing the layer's memory requirement to be proportional to the number of entities. In the recommendation domain, a given category can have hundreds of thousands of entities, and its embedding layer can take gigabytes of memory. The scale of these networks makes them difficult to deploy in resource constrained environments. In this paper, we propose a novel approach for reducing the size of an embedding table while still mappin"},"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":"2203.10135","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-18T19:32:40Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f6baa2bde010b14e138ed17124392d21214df5a9dca67a840c51d825f03c65e9","abstract_canon_sha256":"7e8c8f3d9b2984d78d6a0eebc0e9382a9c40d77fb4170b01cf940dfd33020852"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:06:31.818099Z","signature_b64":"Q3qyvIJNaVZ+F3OWMGdc6nxoVPW3pe6K9hv05ILIycZYNKg6+POBoGMZzZXWsvWqb5r/fw3xKGyj/I29IJdPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf458be38f2a00263dd26b052cb354934d8ad27f823aad2c1f500215a19ff58e","last_reissued_at":"2026-07-05T04:06:31.817700Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:06:31.817700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Compressed Embeddings for On-Device Inference","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Aditya Arora, Chandru Venkataraman, Frank Cipollone, Jay Katukuri, Niketan Pansare, Noyan Tokgozoglu, Riyaaz Shaik","submitted_at":"2022-03-18T19:32:40Z","abstract_excerpt":"In deep learning, embeddings are widely used to represent categorical entities such as words, apps, and movies. An embedding layer maps each entity to a unique vector, causing the layer's memory requirement to be proportional to the number of entities. In the recommendation domain, a given category can have hundreds of thousands of entities, and its embedding layer can take gigabytes of memory. The scale of these networks makes them difficult to deploy in resource constrained environments. In this paper, we propose a novel approach for reducing the size of an embedding table while still mappin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.10135","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/2203.10135/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":"2203.10135","created_at":"2026-07-05T04:06:31.817757+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.10135v1","created_at":"2026-07-05T04:06:31.817757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.10135","created_at":"2026-07-05T04:06:31.817757+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z5CYXY4PFIAC","created_at":"2026-07-05T04:06:31.817757+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z5CYXY4PFIACMPOS","created_at":"2026-07-05T04:06:31.817757+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z5CYXY4P","created_at":"2026-07-05T04:06:31.817757+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z5CYXY4PFIACMPOSNMCSZM2USN","json":"https://pith.science/pith/Z5CYXY4PFIACMPOSNMCSZM2USN.json","graph_json":"https://pith.science/api/pith-number/Z5CYXY4PFIACMPOSNMCSZM2USN/graph.json","events_json":"https://pith.science/api/pith-number/Z5CYXY4PFIACMPOSNMCSZM2USN/events.json","paper":"https://pith.science/paper/Z5CYXY4P"},"agent_actions":{"view_html":"https://pith.science/pith/Z5CYXY4PFIACMPOSNMCSZM2USN","download_json":"https://pith.science/pith/Z5CYXY4PFIACMPOSNMCSZM2USN.json","view_paper":"https://pith.science/paper/Z5CYXY4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.10135&json=true","fetch_graph":"https://pith.science/api/pith-number/Z5CYXY4PFIACMPOSNMCSZM2USN/graph.json","fetch_events":"https://pith.science/api/pith-number/Z5CYXY4PFIACMPOSNMCSZM2USN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z5CYXY4PFIACMPOSNMCSZM2USN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z5CYXY4PFIACMPOSNMCSZM2USN/action/storage_attestation","attest_author":"https://pith.science/pith/Z5CYXY4PFIACMPOSNMCSZM2USN/action/author_attestation","sign_citation":"https://pith.science/pith/Z5CYXY4PFIACMPOSNMCSZM2USN/action/citation_signature","submit_replication":"https://pith.science/pith/Z5CYXY4PFIACMPOSNMCSZM2USN/action/replication_record"}},"created_at":"2026-07-05T04:06:31.817757+00:00","updated_at":"2026-07-05T04:06:31.817757+00:00"}