{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:M7CWVYCHEWI5CNBD3E4BX4YS34","short_pith_number":"pith:M7CWVYCH","schema_version":"1.0","canonical_sha256":"67c56ae0472591d13423d9381bf312df29dcb6e30a07564a8158df757fcc99b3","source":{"kind":"arxiv","id":"1005.3097","version":1},"attestation_state":"computed","paper":{"title":"Effective Resistances, Statistical Leverage, and Applications to Linear Equation Solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.NA","authors_text":"Michael W. Mahoney, Petros Drineas","submitted_at":"2010-05-18T04:24:36Z","abstract_excerpt":"Recent work in theoretical computer science and scientific computing has focused on nearly-linear-time algorithms for solving systems of linear equations. While introducing several novel theoretical perspectives, this work has yet to lead to practical algorithms. In an effort to bridge this gap, we describe in this paper two related results. Our first and main result is a simple algorithm to approximate the solution to a set of linear equations defined by a Laplacian (for a graph $G$ with $n$ nodes and $m \\le n^2$ edges) constraint matrix. The algorithm is a non-recursive algorithm; even thoug"},"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":"1005.3097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2010-05-18T04:24:36Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"920bc892e4043115d585cb4cd23023d07acc5b1d77dc56695ad3ec97d0b60cf7","abstract_canon_sha256":"63dead5be14de8014b5e3bb5ca7f72a03b4dcd5cedb8c490e8e1767b342843d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T23:06:37.404028Z","signature_b64":"w7pFO5Vyu7nGoq4dJ//hz4+rODeZN/wC7AUY/A7jT7IOO4qJjvaJYr/lc/+A58IPHGKnpX0NvtJZNytDDuWBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67c56ae0472591d13423d9381bf312df29dcb6e30a07564a8158df757fcc99b3","last_reissued_at":"2026-06-03T23:06:37.403617Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T23:06:37.403617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effective Resistances, Statistical Leverage, and Applications to Linear Equation Solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.NA","authors_text":"Michael W. Mahoney, Petros Drineas","submitted_at":"2010-05-18T04:24:36Z","abstract_excerpt":"Recent work in theoretical computer science and scientific computing has focused on nearly-linear-time algorithms for solving systems of linear equations. While introducing several novel theoretical perspectives, this work has yet to lead to practical algorithms. In an effort to bridge this gap, we describe in this paper two related results. Our first and main result is a simple algorithm to approximate the solution to a set of linear equations defined by a Laplacian (for a graph $G$ with $n$ nodes and $m \\le n^2$ edges) constraint matrix. The algorithm is a non-recursive algorithm; even thoug"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.3097","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/1005.3097/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":"1005.3097","created_at":"2026-06-03T23:06:37.403670+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.3097v1","created_at":"2026-06-03T23:06:37.403670+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.3097","created_at":"2026-06-03T23:06:37.403670+00:00"},{"alias_kind":"pith_short_12","alias_value":"M7CWVYCHEWI5","created_at":"2026-06-03T23:06:37.403670+00:00"},{"alias_kind":"pith_short_16","alias_value":"M7CWVYCHEWI5CNBD","created_at":"2026-06-03T23:06:37.403670+00:00"},{"alias_kind":"pith_short_8","alias_value":"M7CWVYCH","created_at":"2026-06-03T23:06:37.403670+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/M7CWVYCHEWI5CNBD3E4BX4YS34","json":"https://pith.science/pith/M7CWVYCHEWI5CNBD3E4BX4YS34.json","graph_json":"https://pith.science/api/pith-number/M7CWVYCHEWI5CNBD3E4BX4YS34/graph.json","events_json":"https://pith.science/api/pith-number/M7CWVYCHEWI5CNBD3E4BX4YS34/events.json","paper":"https://pith.science/paper/M7CWVYCH"},"agent_actions":{"view_html":"https://pith.science/pith/M7CWVYCHEWI5CNBD3E4BX4YS34","download_json":"https://pith.science/pith/M7CWVYCHEWI5CNBD3E4BX4YS34.json","view_paper":"https://pith.science/paper/M7CWVYCH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.3097&json=true","fetch_graph":"https://pith.science/api/pith-number/M7CWVYCHEWI5CNBD3E4BX4YS34/graph.json","fetch_events":"https://pith.science/api/pith-number/M7CWVYCHEWI5CNBD3E4BX4YS34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M7CWVYCHEWI5CNBD3E4BX4YS34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M7CWVYCHEWI5CNBD3E4BX4YS34/action/storage_attestation","attest_author":"https://pith.science/pith/M7CWVYCHEWI5CNBD3E4BX4YS34/action/author_attestation","sign_citation":"https://pith.science/pith/M7CWVYCHEWI5CNBD3E4BX4YS34/action/citation_signature","submit_replication":"https://pith.science/pith/M7CWVYCHEWI5CNBD3E4BX4YS34/action/replication_record"}},"created_at":"2026-06-03T23:06:37.403670+00:00","updated_at":"2026-06-03T23:06:37.403670+00:00"}