{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:NJHLZAYIMOAHCTDWJIL27TDUUC","short_pith_number":"pith:NJHLZAYI","schema_version":"1.0","canonical_sha256":"6a4ebc83086380714c764a17afcc74a0a2e5e2faf361117d53465ecc7958abcf","source":{"kind":"arxiv","id":"1001.0149","version":2},"attestation_state":"computed","paper":{"title":"Fast construction of hierarchical matrix representation from matrix-vector multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Jianfeng Lu, Lexing Ying, Lin Lin","submitted_at":"2009-12-31T16:31:48Z","abstract_excerpt":"We develop a hierarchical matrix construction algorithm using matrix-vector multiplications, based on the randomized singular value decomposition of low-rank matrices. The algorithm uses $\\mathcal{O}(\\log n)$ applications of the matrix on structured random test vectors and $\\mathcal{O}(n \\log n)$ extra computational cost, where $n$ is the dimension of the unknown matrix. Numerical examples on constructing Green's functions for elliptic operators in two dimensions show efficiency and accuracy of the proposed algorithm."},"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":"1001.0149","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-12-31T16:31:48Z","cross_cats_sorted":[],"title_canon_sha256":"de030be598ab68fabfa502bad68a032e761852a1cc799163175cb30e0a7e5b2e","abstract_canon_sha256":"92740e9b9bf1ca82362503e96bff546b3409309ab12527ed2a5ba27db57945ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:01.880027Z","signature_b64":"lNoyxHZokN/deJGDxRS+ifi/s4mTNylBznXD2qSv5O4peb3jtd7PfZfoMZsJYpuKIPwEaGqwAFzCFRzdHBJEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a4ebc83086380714c764a17afcc74a0a2e5e2faf361117d53465ecc7958abcf","last_reissued_at":"2026-05-18T04:42:01.879680Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:01.879680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast construction of hierarchical matrix representation from matrix-vector multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Jianfeng Lu, Lexing Ying, Lin Lin","submitted_at":"2009-12-31T16:31:48Z","abstract_excerpt":"We develop a hierarchical matrix construction algorithm using matrix-vector multiplications, based on the randomized singular value decomposition of low-rank matrices. The algorithm uses $\\mathcal{O}(\\log n)$ applications of the matrix on structured random test vectors and $\\mathcal{O}(n \\log n)$ extra computational cost, where $n$ is the dimension of the unknown matrix. Numerical examples on constructing Green's functions for elliptic operators in two dimensions show efficiency and accuracy of the proposed algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.0149","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":"1001.0149","created_at":"2026-05-18T04:42:01.879734+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.0149v2","created_at":"2026-05-18T04:42:01.879734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.0149","created_at":"2026-05-18T04:42:01.879734+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJHLZAYIMOAH","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJHLZAYIMOAHCTDW","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJHLZAYI","created_at":"2026-05-18T12:26:00.592388+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/NJHLZAYIMOAHCTDWJIL27TDUUC","json":"https://pith.science/pith/NJHLZAYIMOAHCTDWJIL27TDUUC.json","graph_json":"https://pith.science/api/pith-number/NJHLZAYIMOAHCTDWJIL27TDUUC/graph.json","events_json":"https://pith.science/api/pith-number/NJHLZAYIMOAHCTDWJIL27TDUUC/events.json","paper":"https://pith.science/paper/NJHLZAYI"},"agent_actions":{"view_html":"https://pith.science/pith/NJHLZAYIMOAHCTDWJIL27TDUUC","download_json":"https://pith.science/pith/NJHLZAYIMOAHCTDWJIL27TDUUC.json","view_paper":"https://pith.science/paper/NJHLZAYI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.0149&json=true","fetch_graph":"https://pith.science/api/pith-number/NJHLZAYIMOAHCTDWJIL27TDUUC/graph.json","fetch_events":"https://pith.science/api/pith-number/NJHLZAYIMOAHCTDWJIL27TDUUC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJHLZAYIMOAHCTDWJIL27TDUUC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJHLZAYIMOAHCTDWJIL27TDUUC/action/storage_attestation","attest_author":"https://pith.science/pith/NJHLZAYIMOAHCTDWJIL27TDUUC/action/author_attestation","sign_citation":"https://pith.science/pith/NJHLZAYIMOAHCTDWJIL27TDUUC/action/citation_signature","submit_replication":"https://pith.science/pith/NJHLZAYIMOAHCTDWJIL27TDUUC/action/replication_record"}},"created_at":"2026-05-18T04:42:01.879734+00:00","updated_at":"2026-05-18T04:42:01.879734+00:00"}