{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:YCWNWDZ5TSE4DC5HCFA6LBMKDM","short_pith_number":"pith:YCWNWDZ5","schema_version":"1.0","canonical_sha256":"c0acdb0f3d9c89c18ba71141e5858a1b1f5cc827ccfd7fde51f1928d24714ec3","source":{"kind":"arxiv","id":"0903.2816","version":1},"attestation_state":"computed","paper":{"title":"A Note on Preconditioning by Low-Stretch Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NA"],"primary_cat":"cs.NA","authors_text":"Daniel A Spielman, Jaeoh Woo","submitted_at":"2009-03-16T18:04:31Z","abstract_excerpt":"Boman and Hendrickson observed that one can solve linear systems in Laplacian matrices in time $\\bigO{m^{3/2 + o (1)} \\ln (1/\\epsilon)}$ by preconditioning with the Laplacian of a low-stretch spanning tree. By examining the distribution of eigenvalues of the preconditioned linear system, we prove that the preconditioned conjugate gradient will actually solve the linear system in time $\\softO{m^{4/3} \\ln (1/\\epsilon)}$."},"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":"0903.2816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2009-03-16T18:04:31Z","cross_cats_sorted":["cs.DS","cs.NA"],"title_canon_sha256":"9469025403645ed814de2ccf9df37f0d48157e3ca5aef056c996fee598e860db","abstract_canon_sha256":"352ca28b077a20cd6b88860edd69022b29b8fbea527006a64e1be341b39d8f52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T23:06:25.075527Z","signature_b64":"z2LayVhKk+9Q1B5w486DSNt/6eWIsrqa9E+PmWhfnSicOfyajIZ+iyZ9PhXOVdFFMIBYzAUPz5dHLiZ3FagzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0acdb0f3d9c89c18ba71141e5858a1b1f5cc827ccfd7fde51f1928d24714ec3","last_reissued_at":"2026-06-03T23:06:25.074992Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T23:06:25.074992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Preconditioning by Low-Stretch Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NA"],"primary_cat":"cs.NA","authors_text":"Daniel A Spielman, Jaeoh Woo","submitted_at":"2009-03-16T18:04:31Z","abstract_excerpt":"Boman and Hendrickson observed that one can solve linear systems in Laplacian matrices in time $\\bigO{m^{3/2 + o (1)} \\ln (1/\\epsilon)}$ by preconditioning with the Laplacian of a low-stretch spanning tree. By examining the distribution of eigenvalues of the preconditioned linear system, we prove that the preconditioned conjugate gradient will actually solve the linear system in time $\\softO{m^{4/3} \\ln (1/\\epsilon)}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.2816","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/0903.2816/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":"0903.2816","created_at":"2026-06-03T23:06:25.075061+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.2816v1","created_at":"2026-06-03T23:06:25.075061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.2816","created_at":"2026-06-03T23:06:25.075061+00:00"},{"alias_kind":"pith_short_12","alias_value":"YCWNWDZ5TSE4","created_at":"2026-06-03T23:06:25.075061+00:00"},{"alias_kind":"pith_short_16","alias_value":"YCWNWDZ5TSE4DC5H","created_at":"2026-06-03T23:06:25.075061+00:00"},{"alias_kind":"pith_short_8","alias_value":"YCWNWDZ5","created_at":"2026-06-03T23:06:25.075061+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.11724","citing_title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","ref_index":55,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YCWNWDZ5TSE4DC5HCFA6LBMKDM","json":"https://pith.science/pith/YCWNWDZ5TSE4DC5HCFA6LBMKDM.json","graph_json":"https://pith.science/api/pith-number/YCWNWDZ5TSE4DC5HCFA6LBMKDM/graph.json","events_json":"https://pith.science/api/pith-number/YCWNWDZ5TSE4DC5HCFA6LBMKDM/events.json","paper":"https://pith.science/paper/YCWNWDZ5"},"agent_actions":{"view_html":"https://pith.science/pith/YCWNWDZ5TSE4DC5HCFA6LBMKDM","download_json":"https://pith.science/pith/YCWNWDZ5TSE4DC5HCFA6LBMKDM.json","view_paper":"https://pith.science/paper/YCWNWDZ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.2816&json=true","fetch_graph":"https://pith.science/api/pith-number/YCWNWDZ5TSE4DC5HCFA6LBMKDM/graph.json","fetch_events":"https://pith.science/api/pith-number/YCWNWDZ5TSE4DC5HCFA6LBMKDM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YCWNWDZ5TSE4DC5HCFA6LBMKDM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YCWNWDZ5TSE4DC5HCFA6LBMKDM/action/storage_attestation","attest_author":"https://pith.science/pith/YCWNWDZ5TSE4DC5HCFA6LBMKDM/action/author_attestation","sign_citation":"https://pith.science/pith/YCWNWDZ5TSE4DC5HCFA6LBMKDM/action/citation_signature","submit_replication":"https://pith.science/pith/YCWNWDZ5TSE4DC5HCFA6LBMKDM/action/replication_record"}},"created_at":"2026-06-03T23:06:25.075061+00:00","updated_at":"2026-06-03T23:06:25.075061+00:00"}