{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:G7LPSGZYROD6X7HSORYARV67LL","short_pith_number":"pith:G7LPSGZY","schema_version":"1.0","canonical_sha256":"37d6f91b388b87ebfcf2747008d7df5aef16c17cbd3e57b8c3afba0207d84db2","source":{"kind":"arxiv","id":"1006.0407","version":2},"attestation_state":"computed","paper":{"title":"A Note on Element-wise Matrix Sparsification via a Matrix-valued Bernstein Inequality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anastasios Zouzias, Petros Drineas","submitted_at":"2010-06-02T14:39:17Z","abstract_excerpt":"Given an n x n matrix A, we present a simple, element-wise sparsification algorithm that zeroes out all sufficiently small elements of A and then retains some of the remaining elements with probabilities proportional to the square of their magnitudes. We analyze the approximation accuracy of the proposed algorithm using a recent, elegant non-commutative Bernstein inequality, and compare our bounds with all existing (to the best of our knowledge) element-wise matrix sparsification algorithms."},"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":"1006.0407","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-02T14:39:17Z","cross_cats_sorted":[],"title_canon_sha256":"ca0ecf533639dc134469ea482777a46edf9f12f23955170c2d789839a36fe1dc","abstract_canon_sha256":"626f2aaebaad1e6dd22f5c3f33017f230de888cc9afad94da9f2e03662d739df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:04.808886Z","signature_b64":"phd4yIPDMQkBDyicHZa/G2VymZw1tN6GB2gyxhw/yy66D7nZbht4bsJ8wAw8N7PLJJXeWW3JlFpeBFdFMN4MDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37d6f91b388b87ebfcf2747008d7df5aef16c17cbd3e57b8c3afba0207d84db2","last_reissued_at":"2026-05-18T03:44:04.807769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:04.807769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Element-wise Matrix Sparsification via a Matrix-valued Bernstein Inequality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anastasios Zouzias, Petros Drineas","submitted_at":"2010-06-02T14:39:17Z","abstract_excerpt":"Given an n x n matrix A, we present a simple, element-wise sparsification algorithm that zeroes out all sufficiently small elements of A and then retains some of the remaining elements with probabilities proportional to the square of their magnitudes. We analyze the approximation accuracy of the proposed algorithm using a recent, elegant non-commutative Bernstein inequality, and compare our bounds with all existing (to the best of our knowledge) element-wise matrix sparsification algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.0407","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":""},"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":"1006.0407","created_at":"2026-05-18T03:44:04.807923+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.0407v2","created_at":"2026-05-18T03:44:04.807923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.0407","created_at":"2026-05-18T03:44:04.807923+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7LPSGZYROD6","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7LPSGZYROD6X7HS","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7LPSGZY","created_at":"2026-05-18T12:26:07.630475+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/G7LPSGZYROD6X7HSORYARV67LL","json":"https://pith.science/pith/G7LPSGZYROD6X7HSORYARV67LL.json","graph_json":"https://pith.science/api/pith-number/G7LPSGZYROD6X7HSORYARV67LL/graph.json","events_json":"https://pith.science/api/pith-number/G7LPSGZYROD6X7HSORYARV67LL/events.json","paper":"https://pith.science/paper/G7LPSGZY"},"agent_actions":{"view_html":"https://pith.science/pith/G7LPSGZYROD6X7HSORYARV67LL","download_json":"https://pith.science/pith/G7LPSGZYROD6X7HSORYARV67LL.json","view_paper":"https://pith.science/paper/G7LPSGZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.0407&json=true","fetch_graph":"https://pith.science/api/pith-number/G7LPSGZYROD6X7HSORYARV67LL/graph.json","fetch_events":"https://pith.science/api/pith-number/G7LPSGZYROD6X7HSORYARV67LL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7LPSGZYROD6X7HSORYARV67LL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7LPSGZYROD6X7HSORYARV67LL/action/storage_attestation","attest_author":"https://pith.science/pith/G7LPSGZYROD6X7HSORYARV67LL/action/author_attestation","sign_citation":"https://pith.science/pith/G7LPSGZYROD6X7HSORYARV67LL/action/citation_signature","submit_replication":"https://pith.science/pith/G7LPSGZYROD6X7HSORYARV67LL/action/replication_record"}},"created_at":"2026-05-18T03:44:04.807923+00:00","updated_at":"2026-05-18T03:44:04.807923+00:00"}