{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZIU3GIOQTQSRDSJH4KYRI7RJBK","short_pith_number":"pith:ZIU3GIOQ","schema_version":"1.0","canonical_sha256":"ca29b321d09c2511c927e2b1147e290a877d1446d8f7727c88e8fa9b3bb676cc","source":{"kind":"arxiv","id":"1512.01904","version":2},"attestation_state":"computed","paper":{"title":"Gauss quadrature for matrix inverse forms with applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"stat.ML","authors_text":"Chengtao Li, Stefanie Jegelka, Suvrit Sra","submitted_at":"2015-12-07T04:13:45Z","abstract_excerpt":"We present a framework for accelerating a spectrum of machine learning algorithms that require computation of bilinear inverse forms $u^\\top A^{-1}u$, where $A$ is a positive definite matrix and $u$ a given vector. Our framework is built on Gauss-type quadrature and easily scales to large, sparse matrices. Further, it allows retrospective computation of lower and upper bounds on $u^\\top A^{-1}u$, which in turn accelerates several algorithms. We prove that these bounds tighten iteratively and converge at a linear (geometric) rate. To our knowledge, ours is the first work to demonstrate these ke"},"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":"1512.01904","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-12-07T04:13:45Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"dea1497bf9506e0cccb578635743803cf08729988b0edda2094d2718f7c8fa5a","abstract_canon_sha256":"037b87a4fbc80140de2d09b0ff31f98f9a37420196274a75de7c62c88a8b6747"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:23.854559Z","signature_b64":"gfjRnxptH/HnBNiBLjldpMrSBDl22HrL55TC7bwmuJ/1M/Xhf9x9qC8bz2SPeiyss9h00NwLq76Eg5Z4Cz9pBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca29b321d09c2511c927e2b1147e290a877d1446d8f7727c88e8fa9b3bb676cc","last_reissued_at":"2026-05-18T01:13:23.854122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:23.854122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gauss quadrature for matrix inverse forms with applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"stat.ML","authors_text":"Chengtao Li, Stefanie Jegelka, Suvrit Sra","submitted_at":"2015-12-07T04:13:45Z","abstract_excerpt":"We present a framework for accelerating a spectrum of machine learning algorithms that require computation of bilinear inverse forms $u^\\top A^{-1}u$, where $A$ is a positive definite matrix and $u$ a given vector. Our framework is built on Gauss-type quadrature and easily scales to large, sparse matrices. Further, it allows retrospective computation of lower and upper bounds on $u^\\top A^{-1}u$, which in turn accelerates several algorithms. We prove that these bounds tighten iteratively and converge at a linear (geometric) rate. To our knowledge, ours is the first work to demonstrate these ke"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01904","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":"1512.01904","created_at":"2026-05-18T01:13:23.854185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.01904v2","created_at":"2026-05-18T01:13:23.854185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01904","created_at":"2026-05-18T01:13:23.854185+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZIU3GIOQTQSR","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZIU3GIOQTQSRDSJH","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZIU3GIOQ","created_at":"2026-05-18T12:29:52.810259+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/ZIU3GIOQTQSRDSJH4KYRI7RJBK","json":"https://pith.science/pith/ZIU3GIOQTQSRDSJH4KYRI7RJBK.json","graph_json":"https://pith.science/api/pith-number/ZIU3GIOQTQSRDSJH4KYRI7RJBK/graph.json","events_json":"https://pith.science/api/pith-number/ZIU3GIOQTQSRDSJH4KYRI7RJBK/events.json","paper":"https://pith.science/paper/ZIU3GIOQ"},"agent_actions":{"view_html":"https://pith.science/pith/ZIU3GIOQTQSRDSJH4KYRI7RJBK","download_json":"https://pith.science/pith/ZIU3GIOQTQSRDSJH4KYRI7RJBK.json","view_paper":"https://pith.science/paper/ZIU3GIOQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.01904&json=true","fetch_graph":"https://pith.science/api/pith-number/ZIU3GIOQTQSRDSJH4KYRI7RJBK/graph.json","fetch_events":"https://pith.science/api/pith-number/ZIU3GIOQTQSRDSJH4KYRI7RJBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZIU3GIOQTQSRDSJH4KYRI7RJBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZIU3GIOQTQSRDSJH4KYRI7RJBK/action/storage_attestation","attest_author":"https://pith.science/pith/ZIU3GIOQTQSRDSJH4KYRI7RJBK/action/author_attestation","sign_citation":"https://pith.science/pith/ZIU3GIOQTQSRDSJH4KYRI7RJBK/action/citation_signature","submit_replication":"https://pith.science/pith/ZIU3GIOQTQSRDSJH4KYRI7RJBK/action/replication_record"}},"created_at":"2026-05-18T01:13:23.854185+00:00","updated_at":"2026-05-18T01:13:23.854185+00:00"}