{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:QQ56WRUL4OS2M7H2R4R6FQYKUC","short_pith_number":"pith:QQ56WRUL","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"},"canonical_sha256":"843beb468be3a5a67cfa8f23e2c30aa0beb47a72829dff1bfcf32ec08758baa2","source":{"kind":"arxiv","id":"0911.4108","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.4108","created_at":"2026-06-03T23:06:30Z"},{"alias_kind":"arxiv_version","alias_value":"0911.4108v1","created_at":"2026-06-03T23:06:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4108","created_at":"2026-06-03T23:06:30Z"},{"alias_kind":"pith_short_12","alias_value":"QQ56WRUL4OS2","created_at":"2026-06-03T23:06:30Z"},{"alias_kind":"pith_short_16","alias_value":"QQ56WRUL4OS2M7H2","created_at":"2026-06-03T23:06:30Z"},{"alias_kind":"pith_short_8","alias_value":"QQ56WRUL","created_at":"2026-06-03T23:06:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:QQ56WRUL4OS2M7H2R4R6FQYKUC","target":"record","payload":{"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"},"canonical_sha256":"843beb468be3a5a67cfa8f23e2c30aa0beb47a72829dff1bfcf32ec08758baa2","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"},"source_kind":"arxiv","source_id":"0911.4108","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-03T23:06:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L32WRBwJHVSogDpl27urWfPZUf0Nxk7XVQelcHQiS5woXNNK2wM7FBIaQLLbjrMQRSqIMnxmk+LJlIJmAUeDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:13:44.120994Z"},"content_sha256":"f13bbd6b80a6137e59a2dc240fe4e3708c935e18792ee7a392ed46e69d3384c0","schema_version":"1.0","event_id":"sha256:f13bbd6b80a6137e59a2dc240fe4e3708c935e18792ee7a392ed46e69d3384c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:QQ56WRUL4OS2M7H2R4R6FQYKUC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-03T23:06:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0nq19YefoE1Jp1UPKuEI5/BM20hUXTcLEdCHQYLdiOHzM6FjibUIZzGUwxbBQ5FLdYZN0hgGufRk81N9Bi+TBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:13:44.121384Z"},"content_sha256":"7fb7db4addd309299e9341f8b8e4f81c20a61799308286a79e54b3b9d6774d14","schema_version":"1.0","event_id":"sha256:7fb7db4addd309299e9341f8b8e4f81c20a61799308286a79e54b3b9d6774d14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QQ56WRUL4OS2M7H2R4R6FQYKUC/bundle.json","state_url":"https://pith.science/pith/QQ56WRUL4OS2M7H2R4R6FQYKUC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QQ56WRUL4OS2M7H2R4R6FQYKUC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T14:13:44Z","links":{"resolver":"https://pith.science/pith/QQ56WRUL4OS2M7H2R4R6FQYKUC","bundle":"https://pith.science/pith/QQ56WRUL4OS2M7H2R4R6FQYKUC/bundle.json","state":"https://pith.science/pith/QQ56WRUL4OS2M7H2R4R6FQYKUC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QQ56WRUL4OS2M7H2R4R6FQYKUC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:QQ56WRUL4OS2M7H2R4R6FQYKUC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ca76f2fb3111a8e939904a45b61970ea48ba4fc25559d21def122f4124ed49f2","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-11-20T20:38:11Z","title_canon_sha256":"14dea98df04a563c58a555e52ea3474db21c2da160a146decdfb8cf161ac1d2a"},"schema_version":"1.0","source":{"id":"0911.4108","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.4108","created_at":"2026-06-03T23:06:30Z"},{"alias_kind":"arxiv_version","alias_value":"0911.4108v1","created_at":"2026-06-03T23:06:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4108","created_at":"2026-06-03T23:06:30Z"},{"alias_kind":"pith_short_12","alias_value":"QQ56WRUL4OS2","created_at":"2026-06-03T23:06:30Z"},{"alias_kind":"pith_short_16","alias_value":"QQ56WRUL4OS2M7H2","created_at":"2026-06-03T23:06:30Z"},{"alias_kind":"pith_short_8","alias_value":"QQ56WRUL","created_at":"2026-06-03T23:06:30Z"}],"graph_snapshots":[{"event_id":"sha256:7fb7db4addd309299e9341f8b8e4f81c20a61799308286a79e54b3b9d6774d14","target":"graph","created_at":"2026-06-03T23:06:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0911.4108/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alex Gittens, Joel A. Tropp","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-11-20T20:38:11Z","title":"Error Bounds for Random Matrix Approximation Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4108","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f13bbd6b80a6137e59a2dc240fe4e3708c935e18792ee7a392ed46e69d3384c0","target":"record","created_at":"2026-06-03T23:06:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ca76f2fb3111a8e939904a45b61970ea48ba4fc25559d21def122f4124ed49f2","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-11-20T20:38:11Z","title_canon_sha256":"14dea98df04a563c58a555e52ea3474db21c2da160a146decdfb8cf161ac1d2a"},"schema_version":"1.0","source":{"id":"0911.4108","kind":"arxiv","version":1}},"canonical_sha256":"843beb468be3a5a67cfa8f23e2c30aa0beb47a72829dff1bfcf32ec08758baa2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"843beb468be3a5a67cfa8f23e2c30aa0beb47a72829dff1bfcf32ec08758baa2","first_computed_at":"2026-06-03T23:06:30.834125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T23:06:30.834125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aIcACd05L/qUXxJirIEPmmIAtlcpp3IGSOjr2zhF4ahEavrvGvgPJSBbMz4OBxyYttZEkWT+5mRY3ywQQ17nBA==","signature_status":"signed_v1","signed_at":"2026-06-03T23:06:30.834548Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.4108","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f13bbd6b80a6137e59a2dc240fe4e3708c935e18792ee7a392ed46e69d3384c0","sha256:7fb7db4addd309299e9341f8b8e4f81c20a61799308286a79e54b3b9d6774d14"],"state_sha256":"d4ff618608b9eeba9c391e0e0c219ab690b1e912764755dfeb3a12c748f3db0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6UEgxetVwGc2ntyozUXpo1DaRynpfO3ppaoABm1FzFhrXAT4q/U4eLUIgtesk96FIjxCxxD+0A8z3G1MKmg9Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:13:44.123484Z","bundle_sha256":"c7a5da822b837b0bf0b8ac9a54d461d5947ed27eb5a26b74b561d2073a507e93"}}