{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4Z6CIU2PTMEAWPSCT2RXQAOTOI","short_pith_number":"pith:4Z6CIU2P","schema_version":"1.0","canonical_sha256":"e67c24534f9b080b3e429ea37801d3721b88cc7a04960b33467fd04cea36261d","source":{"kind":"arxiv","id":"1311.4643","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Entrywise Sampling for Data Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NA","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dimitris Achlioptas, Edo Liberty, Zohar Karnin","submitted_at":"2013-11-19T08:00:50Z","abstract_excerpt":"We consider the problem of selecting non-zero entries of a matrix $A$ in order to produce a sparse sketch of it, $B$, that minimizes $\\|A-B\\|_2$. For large $m \\times n$ matrices, such that $n \\gg m$ (for example, representing $n$ observations over $m$ attributes) we give sampling distributions that exhibit four important properties. First, they have closed forms computable from minimal information regarding $A$. Second, they allow sketching of matrices whose non-zeros are presented to the algorithm in arbitrary order as a stream, with $O(1)$ computation per non-zero. Third, the resulting sketc"},"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":"1311.4643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-19T08:00:50Z","cross_cats_sorted":["cs.IT","cs.NA","math.IT","stat.ML"],"title_canon_sha256":"778e6ca347ddc73a68caa7377f41b29aba8b18ba330c9a21e28bd625acd55a13","abstract_canon_sha256":"d5521e763bf734fba9d26c764ce87a447f1893cc39617dc09f08e35bab88d3bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:43.797763Z","signature_b64":"JBXrMC8AGO7Dj2cqj+eY39q+HW49qi328Uqt/Ti0vJpPZuBxFwjnhneGYjRM3YdGz/zjrU8ylnHQ9nQFzO0CAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e67c24534f9b080b3e429ea37801d3721b88cc7a04960b33467fd04cea36261d","last_reissued_at":"2026-05-18T03:06:43.797410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:43.797410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Entrywise Sampling for Data Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NA","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dimitris Achlioptas, Edo Liberty, Zohar Karnin","submitted_at":"2013-11-19T08:00:50Z","abstract_excerpt":"We consider the problem of selecting non-zero entries of a matrix $A$ in order to produce a sparse sketch of it, $B$, that minimizes $\\|A-B\\|_2$. For large $m \\times n$ matrices, such that $n \\gg m$ (for example, representing $n$ observations over $m$ attributes) we give sampling distributions that exhibit four important properties. First, they have closed forms computable from minimal information regarding $A$. Second, they allow sketching of matrices whose non-zeros are presented to the algorithm in arbitrary order as a stream, with $O(1)$ computation per non-zero. Third, the resulting sketc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4643","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.4643","created_at":"2026-05-18T03:06:43.797461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.4643v1","created_at":"2026-05-18T03:06:43.797461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4643","created_at":"2026-05-18T03:06:43.797461+00:00"},{"alias_kind":"pith_short_12","alias_value":"4Z6CIU2PTMEA","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4Z6CIU2PTMEAWPSC","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4Z6CIU2P","created_at":"2026-05-18T12:27:34.582898+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/4Z6CIU2PTMEAWPSCT2RXQAOTOI","json":"https://pith.science/pith/4Z6CIU2PTMEAWPSCT2RXQAOTOI.json","graph_json":"https://pith.science/api/pith-number/4Z6CIU2PTMEAWPSCT2RXQAOTOI/graph.json","events_json":"https://pith.science/api/pith-number/4Z6CIU2PTMEAWPSCT2RXQAOTOI/events.json","paper":"https://pith.science/paper/4Z6CIU2P"},"agent_actions":{"view_html":"https://pith.science/pith/4Z6CIU2PTMEAWPSCT2RXQAOTOI","download_json":"https://pith.science/pith/4Z6CIU2PTMEAWPSCT2RXQAOTOI.json","view_paper":"https://pith.science/paper/4Z6CIU2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.4643&json=true","fetch_graph":"https://pith.science/api/pith-number/4Z6CIU2PTMEAWPSCT2RXQAOTOI/graph.json","fetch_events":"https://pith.science/api/pith-number/4Z6CIU2PTMEAWPSCT2RXQAOTOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4Z6CIU2PTMEAWPSCT2RXQAOTOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4Z6CIU2PTMEAWPSCT2RXQAOTOI/action/storage_attestation","attest_author":"https://pith.science/pith/4Z6CIU2PTMEAWPSCT2RXQAOTOI/action/author_attestation","sign_citation":"https://pith.science/pith/4Z6CIU2PTMEAWPSCT2RXQAOTOI/action/citation_signature","submit_replication":"https://pith.science/pith/4Z6CIU2PTMEAWPSCT2RXQAOTOI/action/replication_record"}},"created_at":"2026-05-18T03:06:43.797461+00:00","updated_at":"2026-05-18T03:06:43.797461+00:00"}