{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NLILW7FWHYCXVR555S2FMSYD54","short_pith_number":"pith:NLILW7FW","schema_version":"1.0","canonical_sha256":"6ad0bb7cb63e057ac7bdecb4564b03ef01dacbabb2788f3708e5e698203dc06a","source":{"kind":"arxiv","id":"1602.01376","version":1},"attestation_state":"computed","paper":{"title":"Inv-ASKIT: A Parallel Fast Diret Solver for Kernel Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.MS"],"primary_cat":"cs.NA","authors_text":"Bo Xiao, Chenhan D. Yu, George Biros, William B. March","submitted_at":"2016-02-03T17:23:24Z","abstract_excerpt":"We present a parallel algorithm for computing the approximate factorization of an $N$-by-$N$ kernel matrix. Once this factorization has been constructed (with $N \\log^2 N $ work), we can solve linear systems with this matrix with $N \\log N $ work. Kernel matrices represent pairwise interactions of points in metric spaces. They appear in machine learning, approximation theory, and computational physics. Kernel matrices are typically dense (matrix multiplication scales quadratically with $N$) and ill-conditioned (solves can require 100s of Krylov iterations). Thus, fast algorithms for matrix mul"},"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":"1602.01376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-02-03T17:23:24Z","cross_cats_sorted":["cs.DS","cs.MS"],"title_canon_sha256":"2602147a20c18d0e5aa85e81f373bbe1dbd24e33fd940c5af16db75d51aaef5e","abstract_canon_sha256":"babeffdc2bcb848c56a1a1552b7d0fcff0941ad807ac20ffb97e39d9999ef399"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:20.358469Z","signature_b64":"B3pr06HMQ0gujfwxqbGCIeAUoISH/iXPlXPRJo+vVdUCRDXzYIwWPh9koLLLF84YaOVgNNapPzdGfzHJSOpECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ad0bb7cb63e057ac7bdecb4564b03ef01dacbabb2788f3708e5e698203dc06a","last_reissued_at":"2026-05-18T01:21:20.357773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:20.357773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inv-ASKIT: A Parallel Fast Diret Solver for Kernel Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.MS"],"primary_cat":"cs.NA","authors_text":"Bo Xiao, Chenhan D. Yu, George Biros, William B. March","submitted_at":"2016-02-03T17:23:24Z","abstract_excerpt":"We present a parallel algorithm for computing the approximate factorization of an $N$-by-$N$ kernel matrix. Once this factorization has been constructed (with $N \\log^2 N $ work), we can solve linear systems with this matrix with $N \\log N $ work. Kernel matrices represent pairwise interactions of points in metric spaces. They appear in machine learning, approximation theory, and computational physics. Kernel matrices are typically dense (matrix multiplication scales quadratically with $N$) and ill-conditioned (solves can require 100s of Krylov iterations). Thus, fast algorithms for matrix mul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01376","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":""},"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":"1602.01376","created_at":"2026-05-18T01:21:20.357878+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.01376v1","created_at":"2026-05-18T01:21:20.357878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01376","created_at":"2026-05-18T01:21:20.357878+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLILW7FWHYCX","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLILW7FWHYCXVR55","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLILW7FW","created_at":"2026-05-18T12:30:32.724797+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/NLILW7FWHYCXVR555S2FMSYD54","json":"https://pith.science/pith/NLILW7FWHYCXVR555S2FMSYD54.json","graph_json":"https://pith.science/api/pith-number/NLILW7FWHYCXVR555S2FMSYD54/graph.json","events_json":"https://pith.science/api/pith-number/NLILW7FWHYCXVR555S2FMSYD54/events.json","paper":"https://pith.science/paper/NLILW7FW"},"agent_actions":{"view_html":"https://pith.science/pith/NLILW7FWHYCXVR555S2FMSYD54","download_json":"https://pith.science/pith/NLILW7FWHYCXVR555S2FMSYD54.json","view_paper":"https://pith.science/paper/NLILW7FW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.01376&json=true","fetch_graph":"https://pith.science/api/pith-number/NLILW7FWHYCXVR555S2FMSYD54/graph.json","fetch_events":"https://pith.science/api/pith-number/NLILW7FWHYCXVR555S2FMSYD54/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLILW7FWHYCXVR555S2FMSYD54/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLILW7FWHYCXVR555S2FMSYD54/action/storage_attestation","attest_author":"https://pith.science/pith/NLILW7FWHYCXVR555S2FMSYD54/action/author_attestation","sign_citation":"https://pith.science/pith/NLILW7FWHYCXVR555S2FMSYD54/action/citation_signature","submit_replication":"https://pith.science/pith/NLILW7FWHYCXVR555S2FMSYD54/action/replication_record"}},"created_at":"2026-05-18T01:21:20.357878+00:00","updated_at":"2026-05-18T01:21:20.357878+00:00"}