{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:OMMMIEY4J2EYXZORM2LRAQSY7Z","short_pith_number":"pith:OMMMIEY4","schema_version":"1.0","canonical_sha256":"7318c4131c4e898be5d16697104258fe4be11928143614f568b3b6635192873b","source":{"kind":"arxiv","id":"2011.12046","version":2},"attestation_state":"computed","paper":{"title":"Effective and Sparse Count-Sketch via k-means clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Liang Lan, Yuhan Wang, Zijian Lei","submitted_at":"2020-11-24T11:44:02Z","abstract_excerpt":"Count-sketch is a popular matrix sketching algorithm that can produce a sketch of an input data matrix X in O(nnz(X))time where nnz(X) denotes the number of non-zero entries in X. The sketched matrix will be much smaller than X while preserving most of its properties. Therefore, count-sketch is widely used for addressing high-dimensionality challenge in machine learning. However, there are two main limitations of count-sketch: (1) The sketching matrix used count-sketch is generated randomly which does not consider any intrinsic data properties of X. This data-oblivious matrix sketching method "},"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":"2011.12046","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-11-24T11:44:02Z","cross_cats_sorted":[],"title_canon_sha256":"3c35403d1b95f3397f716017524ff0cfee1a36d489f9ddf0b973a243ee3bb54b","abstract_canon_sha256":"49bd19e5ccaf19785150fe9b9ee736d6afa6a7f6903be5a0cbf291e4805ea37c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:54:49.342932Z","signature_b64":"qvLTTuXCH2GPnAOqpnMFVmssTTefPzRll0YrMVDosFKtgrwBE7fstedEMDUcWIHVC8CI840qq82gKyrE33m6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7318c4131c4e898be5d16697104258fe4be11928143614f568b3b6635192873b","last_reissued_at":"2026-07-05T01:54:49.342270Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:54:49.342270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effective and Sparse Count-Sketch via k-means clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Liang Lan, Yuhan Wang, Zijian Lei","submitted_at":"2020-11-24T11:44:02Z","abstract_excerpt":"Count-sketch is a popular matrix sketching algorithm that can produce a sketch of an input data matrix X in O(nnz(X))time where nnz(X) denotes the number of non-zero entries in X. The sketched matrix will be much smaller than X while preserving most of its properties. Therefore, count-sketch is widely used for addressing high-dimensionality challenge in machine learning. However, there are two main limitations of count-sketch: (1) The sketching matrix used count-sketch is generated randomly which does not consider any intrinsic data properties of X. This data-oblivious matrix sketching method "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.12046","kind":"arxiv","version":2},"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/2011.12046/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":"2011.12046","created_at":"2026-07-05T01:54:49.342346+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.12046v2","created_at":"2026-07-05T01:54:49.342346+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.12046","created_at":"2026-07-05T01:54:49.342346+00:00"},{"alias_kind":"pith_short_12","alias_value":"OMMMIEY4J2EY","created_at":"2026-07-05T01:54:49.342346+00:00"},{"alias_kind":"pith_short_16","alias_value":"OMMMIEY4J2EYXZOR","created_at":"2026-07-05T01:54:49.342346+00:00"},{"alias_kind":"pith_short_8","alias_value":"OMMMIEY4","created_at":"2026-07-05T01:54:49.342346+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/OMMMIEY4J2EYXZORM2LRAQSY7Z","json":"https://pith.science/pith/OMMMIEY4J2EYXZORM2LRAQSY7Z.json","graph_json":"https://pith.science/api/pith-number/OMMMIEY4J2EYXZORM2LRAQSY7Z/graph.json","events_json":"https://pith.science/api/pith-number/OMMMIEY4J2EYXZORM2LRAQSY7Z/events.json","paper":"https://pith.science/paper/OMMMIEY4"},"agent_actions":{"view_html":"https://pith.science/pith/OMMMIEY4J2EYXZORM2LRAQSY7Z","download_json":"https://pith.science/pith/OMMMIEY4J2EYXZORM2LRAQSY7Z.json","view_paper":"https://pith.science/paper/OMMMIEY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.12046&json=true","fetch_graph":"https://pith.science/api/pith-number/OMMMIEY4J2EYXZORM2LRAQSY7Z/graph.json","fetch_events":"https://pith.science/api/pith-number/OMMMIEY4J2EYXZORM2LRAQSY7Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OMMMIEY4J2EYXZORM2LRAQSY7Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OMMMIEY4J2EYXZORM2LRAQSY7Z/action/storage_attestation","attest_author":"https://pith.science/pith/OMMMIEY4J2EYXZORM2LRAQSY7Z/action/author_attestation","sign_citation":"https://pith.science/pith/OMMMIEY4J2EYXZORM2LRAQSY7Z/action/citation_signature","submit_replication":"https://pith.science/pith/OMMMIEY4J2EYXZORM2LRAQSY7Z/action/replication_record"}},"created_at":"2026-07-05T01:54:49.342346+00:00","updated_at":"2026-07-05T01:54:49.342346+00:00"}