{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:NJHLZAYIMOAHCTDWJIL27TDUUC","short_pith_number":"pith:NJHLZAYI","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"},"canonical_sha256":"6a4ebc83086380714c764a17afcc74a0a2e5e2faf361117d53465ecc7958abcf","source":{"kind":"arxiv","id":"1001.0149","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.0149","created_at":"2026-05-18T04:42:01Z"},{"alias_kind":"arxiv_version","alias_value":"1001.0149v2","created_at":"2026-05-18T04:42:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.0149","created_at":"2026-05-18T04:42:01Z"},{"alias_kind":"pith_short_12","alias_value":"NJHLZAYIMOAH","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"NJHLZAYIMOAHCTDW","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"NJHLZAYI","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:NJHLZAYIMOAHCTDWJIL27TDUUC","target":"record","payload":{"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"},"canonical_sha256":"6a4ebc83086380714c764a17afcc74a0a2e5e2faf361117d53465ecc7958abcf","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"},"source_kind":"arxiv","source_id":"1001.0149","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-18T04:42:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hoklpvA3l8f5Rc7j2jGqm3oWF50SrKnjvM3qVxqYWjrdVwVfDhTLZ08SfLQ/tV1TrRZul0VPZb1c0+UUifBnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:54:22.416948Z"},"content_sha256":"4bde06d8af18f55efe8454ccad7fcda2de74050c2fa0a8a6ee00b6642f12c04d","schema_version":"1.0","event_id":"sha256:4bde06d8af18f55efe8454ccad7fcda2de74050c2fa0a8a6ee00b6642f12c04d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:NJHLZAYIMOAHCTDWJIL27TDUUC","target":"graph","payload":{"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"},"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-18T04:42:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z2FOYv5SvAFaawQfH7poW97b3GTkzdOAvI+7qqF6kNG782Dtay4gvQPgJ4/B87DsfZjDnuNgkz7Zs0asDItoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:54:22.417641Z"},"content_sha256":"bbdd6805250f24c412afd3ecf378bfd68f5199f77fbf4f67dbc01a00258ad005","schema_version":"1.0","event_id":"sha256:bbdd6805250f24c412afd3ecf378bfd68f5199f77fbf4f67dbc01a00258ad005"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NJHLZAYIMOAHCTDWJIL27TDUUC/bundle.json","state_url":"https://pith.science/pith/NJHLZAYIMOAHCTDWJIL27TDUUC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NJHLZAYIMOAHCTDWJIL27TDUUC/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-05-26T01:54:22Z","links":{"resolver":"https://pith.science/pith/NJHLZAYIMOAHCTDWJIL27TDUUC","bundle":"https://pith.science/pith/NJHLZAYIMOAHCTDWJIL27TDUUC/bundle.json","state":"https://pith.science/pith/NJHLZAYIMOAHCTDWJIL27TDUUC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NJHLZAYIMOAHCTDWJIL27TDUUC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:NJHLZAYIMOAHCTDWJIL27TDUUC","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":"92740e9b9bf1ca82362503e96bff546b3409309ab12527ed2a5ba27db57945ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-12-31T16:31:48Z","title_canon_sha256":"de030be598ab68fabfa502bad68a032e761852a1cc799163175cb30e0a7e5b2e"},"schema_version":"1.0","source":{"id":"1001.0149","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.0149","created_at":"2026-05-18T04:42:01Z"},{"alias_kind":"arxiv_version","alias_value":"1001.0149v2","created_at":"2026-05-18T04:42:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.0149","created_at":"2026-05-18T04:42:01Z"},{"alias_kind":"pith_short_12","alias_value":"NJHLZAYIMOAH","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"NJHLZAYIMOAHCTDW","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"NJHLZAYI","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:bbdd6805250f24c412afd3ecf378bfd68f5199f77fbf4f67dbc01a00258ad005","target":"graph","created_at":"2026-05-18T04:42:01Z","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 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.","authors_text":"Jianfeng Lu, Lexing Ying, Lin Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-12-31T16:31:48Z","title":"Fast construction of hierarchical matrix representation from matrix-vector multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.0149","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:4bde06d8af18f55efe8454ccad7fcda2de74050c2fa0a8a6ee00b6642f12c04d","target":"record","created_at":"2026-05-18T04:42:01Z","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":"92740e9b9bf1ca82362503e96bff546b3409309ab12527ed2a5ba27db57945ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-12-31T16:31:48Z","title_canon_sha256":"de030be598ab68fabfa502bad68a032e761852a1cc799163175cb30e0a7e5b2e"},"schema_version":"1.0","source":{"id":"1001.0149","kind":"arxiv","version":2}},"canonical_sha256":"6a4ebc83086380714c764a17afcc74a0a2e5e2faf361117d53465ecc7958abcf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a4ebc83086380714c764a17afcc74a0a2e5e2faf361117d53465ecc7958abcf","first_computed_at":"2026-05-18T04:42:01.879680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:01.879680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lNoyxHZokN/deJGDxRS+ifi/s4mTNylBznXD2qSv5O4peb3jtd7PfZfoMZsJYpuKIPwEaGqwAFzCFRzdHBJEAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:01.880027Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.0149","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4bde06d8af18f55efe8454ccad7fcda2de74050c2fa0a8a6ee00b6642f12c04d","sha256:bbdd6805250f24c412afd3ecf378bfd68f5199f77fbf4f67dbc01a00258ad005"],"state_sha256":"46963354665389612cb1e127faf9ca0896fdfc11357395eab4e4f98ee74872a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/JOKURcueuAjVKs4pwzz0wXQ8jOU8UuOITZBK/coVqy9dKafuvL+1b2UgNSrFx5vXHE/39V22KA8H5CqgYiGAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:54:22.421209Z","bundle_sha256":"1ecdab669dd34c17d5759ae5b0f5fc376a91db25417d6d37ae9863ed3bc11328"}}