{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:QQ56WRUL4OS2M7H2R4R6FQYKUC","short_pith_number":"pith:QQ56WRUL","schema_version":"1.0","canonical_sha256":"843beb468be3a5a67cfa8f23e2c30aa0beb47a72829dff1bfcf32ec08758baa2","source":{"kind":"arxiv","id":"0911.4108","version":1},"attestation_state":"computed","paper":{"title":"Error Bounds for Random Matrix Approximation Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alex Gittens, Joel A. Tropp","submitted_at":"2009-11-20T20:38:11Z","abstract_excerpt":"Randomized matrix sparsification has proven to be a fruitful technique for producing faster algorithms in applications ranging from graph partitioning to semidefinite programming. In the decade or so of research into this technique, the focus has been--with few exceptions--on ensuring the quality of approximation in the spectral and Frobenius norms. For certain graph algorithms, however, the $(\\infty,1)$ norm may be a more natural measure of performance.\n  This paper addresses the problem of approximating a real matrix A by a sparse random matrix X with respect to several norms. It provides th"},"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":"0911.4108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-11-20T20:38:11Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"14dea98df04a563c58a555e52ea3474db21c2da160a146decdfb8cf161ac1d2a","abstract_canon_sha256":"ca76f2fb3111a8e939904a45b61970ea48ba4fc25559d21def122f4124ed49f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T23:06:30.834548Z","signature_b64":"aIcACd05L/qUXxJirIEPmmIAtlcpp3IGSOjr2zhF4ahEavrvGvgPJSBbMz4OBxyYttZEkWT+5mRY3ywQQ17nBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"843beb468be3a5a67cfa8f23e2c30aa0beb47a72829dff1bfcf32ec08758baa2","last_reissued_at":"2026-06-03T23:06:30.834125Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T23:06:30.834125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error Bounds for Random Matrix Approximation Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alex Gittens, Joel A. Tropp","submitted_at":"2009-11-20T20:38:11Z","abstract_excerpt":"Randomized matrix sparsification has proven to be a fruitful technique for producing faster algorithms in applications ranging from graph partitioning to semidefinite programming. In the decade or so of research into this technique, the focus has been--with few exceptions--on ensuring the quality of approximation in the spectral and Frobenius norms. For certain graph algorithms, however, the $(\\infty,1)$ norm may be a more natural measure of performance.\n  This paper addresses the problem of approximating a real matrix A by a sparse random matrix X with respect to several norms. It provides th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4108","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/0911.4108/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":"0911.4108","created_at":"2026-06-03T23:06:30.834187+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.4108v1","created_at":"2026-06-03T23:06:30.834187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4108","created_at":"2026-06-03T23:06:30.834187+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQ56WRUL4OS2","created_at":"2026-06-03T23:06:30.834187+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQ56WRUL4OS2M7H2","created_at":"2026-06-03T23:06:30.834187+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQ56WRUL","created_at":"2026-06-03T23:06:30.834187+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/QQ56WRUL4OS2M7H2R4R6FQYKUC","json":"https://pith.science/pith/QQ56WRUL4OS2M7H2R4R6FQYKUC.json","graph_json":"https://pith.science/api/pith-number/QQ56WRUL4OS2M7H2R4R6FQYKUC/graph.json","events_json":"https://pith.science/api/pith-number/QQ56WRUL4OS2M7H2R4R6FQYKUC/events.json","paper":"https://pith.science/paper/QQ56WRUL"},"agent_actions":{"view_html":"https://pith.science/pith/QQ56WRUL4OS2M7H2R4R6FQYKUC","download_json":"https://pith.science/pith/QQ56WRUL4OS2M7H2R4R6FQYKUC.json","view_paper":"https://pith.science/paper/QQ56WRUL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.4108&json=true","fetch_graph":"https://pith.science/api/pith-number/QQ56WRUL4OS2M7H2R4R6FQYKUC/graph.json","fetch_events":"https://pith.science/api/pith-number/QQ56WRUL4OS2M7H2R4R6FQYKUC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQ56WRUL4OS2M7H2R4R6FQYKUC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQ56WRUL4OS2M7H2R4R6FQYKUC/action/storage_attestation","attest_author":"https://pith.science/pith/QQ56WRUL4OS2M7H2R4R6FQYKUC/action/author_attestation","sign_citation":"https://pith.science/pith/QQ56WRUL4OS2M7H2R4R6FQYKUC/action/citation_signature","submit_replication":"https://pith.science/pith/QQ56WRUL4OS2M7H2R4R6FQYKUC/action/replication_record"}},"created_at":"2026-06-03T23:06:30.834187+00:00","updated_at":"2026-06-03T23:06:30.834187+00:00"}