{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZIU3GIOQTQSRDSJH4KYRI7RJBK","short_pith_number":"pith:ZIU3GIOQ","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"},"canonical_sha256":"ca29b321d09c2511c927e2b1147e290a877d1446d8f7727c88e8fa9b3bb676cc","source":{"kind":"arxiv","id":"1512.01904","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01904","created_at":"2026-05-18T01:13:23Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01904v2","created_at":"2026-05-18T01:13:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01904","created_at":"2026-05-18T01:13:23Z"},{"alias_kind":"pith_short_12","alias_value":"ZIU3GIOQTQSR","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZIU3GIOQTQSRDSJH","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZIU3GIOQ","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZIU3GIOQTQSRDSJH4KYRI7RJBK","target":"record","payload":{"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"},"canonical_sha256":"ca29b321d09c2511c927e2b1147e290a877d1446d8f7727c88e8fa9b3bb676cc","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"},"source_kind":"arxiv","source_id":"1512.01904","source_version":2,"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-05-18T01:13:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nzpCbzRvjPFhJ7st5t6ugleIvu5KNOVt2Z3V9DwKLWi8ALfuIOjNCr4IaaR9o1tkKHI10azmEHCaKrayd0xsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:50:08.370449Z"},"content_sha256":"36e08aa55c07590bec0bf1f42369d6e285622e27008aac975bd7d58fec171668","schema_version":"1.0","event_id":"sha256:36e08aa55c07590bec0bf1f42369d6e285622e27008aac975bd7d58fec171668"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZIU3GIOQTQSRDSJH4KYRI7RJBK","target":"graph","payload":{"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"},"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-05-18T01:13:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o1GIFXcI70ueQ4z8zrdRzJnwu6hMjcQnmdW7yGvcVcE+xzZuJ8/s6inRYGidx7ydXmRA29/QhgZVJOgZeMypBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:50:08.370803Z"},"content_sha256":"032e67ec6aeada60ab25d9a3ab0fd30629b6b6c20bfe0d80ac508a61f9f9fa3d","schema_version":"1.0","event_id":"sha256:032e67ec6aeada60ab25d9a3ab0fd30629b6b6c20bfe0d80ac508a61f9f9fa3d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZIU3GIOQTQSRDSJH4KYRI7RJBK/bundle.json","state_url":"https://pith.science/pith/ZIU3GIOQTQSRDSJH4KYRI7RJBK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZIU3GIOQTQSRDSJH4KYRI7RJBK/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-05T12:50:08Z","links":{"resolver":"https://pith.science/pith/ZIU3GIOQTQSRDSJH4KYRI7RJBK","bundle":"https://pith.science/pith/ZIU3GIOQTQSRDSJH4KYRI7RJBK/bundle.json","state":"https://pith.science/pith/ZIU3GIOQTQSRDSJH4KYRI7RJBK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZIU3GIOQTQSRDSJH4KYRI7RJBK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZIU3GIOQTQSRDSJH4KYRI7RJBK","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":"037b87a4fbc80140de2d09b0ff31f98f9a37420196274a75de7c62c88a8b6747","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-12-07T04:13:45Z","title_canon_sha256":"dea1497bf9506e0cccb578635743803cf08729988b0edda2094d2718f7c8fa5a"},"schema_version":"1.0","source":{"id":"1512.01904","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01904","created_at":"2026-05-18T01:13:23Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01904v2","created_at":"2026-05-18T01:13:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01904","created_at":"2026-05-18T01:13:23Z"},{"alias_kind":"pith_short_12","alias_value":"ZIU3GIOQTQSR","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZIU3GIOQTQSRDSJH","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZIU3GIOQ","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:032e67ec6aeada60ab25d9a3ab0fd30629b6b6c20bfe0d80ac508a61f9f9fa3d","target":"graph","created_at":"2026-05-18T01:13:23Z","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"},"paper":{"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","authors_text":"Chengtao Li, Stefanie Jegelka, Suvrit Sra","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-12-07T04:13:45Z","title":"Gauss quadrature for matrix inverse forms with applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01904","kind":"arxiv","version":2},"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:36e08aa55c07590bec0bf1f42369d6e285622e27008aac975bd7d58fec171668","target":"record","created_at":"2026-05-18T01:13:23Z","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":"037b87a4fbc80140de2d09b0ff31f98f9a37420196274a75de7c62c88a8b6747","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-12-07T04:13:45Z","title_canon_sha256":"dea1497bf9506e0cccb578635743803cf08729988b0edda2094d2718f7c8fa5a"},"schema_version":"1.0","source":{"id":"1512.01904","kind":"arxiv","version":2}},"canonical_sha256":"ca29b321d09c2511c927e2b1147e290a877d1446d8f7727c88e8fa9b3bb676cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca29b321d09c2511c927e2b1147e290a877d1446d8f7727c88e8fa9b3bb676cc","first_computed_at":"2026-05-18T01:13:23.854122Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:23.854122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gfjRnxptH/HnBNiBLjldpMrSBDl22HrL55TC7bwmuJ/1M/Xhf9x9qC8bz2SPeiyss9h00NwLq76Eg5Z4Cz9pBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:23.854559Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.01904","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36e08aa55c07590bec0bf1f42369d6e285622e27008aac975bd7d58fec171668","sha256:032e67ec6aeada60ab25d9a3ab0fd30629b6b6c20bfe0d80ac508a61f9f9fa3d"],"state_sha256":"524f8b5b8099ecb8b4e04e726ecad15ddfa25a273076dae35e9839bbcec43432"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MaT1ghl68H7UdpQnPTMRf6ug4M2nEcQ5u/FXQZY3wt7OFoi8fcVgXqj/2l0UAwVyurH8gAp8iVhsIhBG2GTbCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:50:08.372714Z","bundle_sha256":"03fa37855f3bbf1ea95d4ef74eca0d911cfdb0a58d8b0cd14670ec9b03d3a4b8"}}