{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XDA73NA6F3KMKXGISVHHDOGJCX","short_pith_number":"pith:XDA73NA6","schema_version":"1.0","canonical_sha256":"b8c1fdb41e2ed4c55cc8954e71b8c915c571cecd3e59d9c2e0535cf6663b7d7b","source":{"kind":"arxiv","id":"2405.11962","version":1},"attestation_state":"computed","paper":{"title":"Subspace embedding with random Khatri-Rao products and its application to eigensolvers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Daniel Kressner, Hei Yin Lam, Luka Grubi\\v{s}i\\'c, Zvonimir Bujanovi\\'c","submitted_at":"2024-05-20T11:37:24Z","abstract_excerpt":"Various iterative eigenvalue solvers have been developed to compute parts of the spectrum for a large sparse matrix, including the power method, Krylov subspace methods, contour integral methods, and preconditioned solvers such as the so called LOBPCG method. All of these solvers rely on random matrices to determine, e.g., starting vectors that have, with high probability, a non-negligible overlap with the eigenvectors of interest. For this purpose, a safe and common choice are unstructured Gaussian random matrices. In this work, we investigate the use of random Khatri-Rao products in eigenval"},"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":"2405.11962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-05-20T11:37:24Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"76d898fda428d859943b844972a5b5af6a75d929751de2de461df50fdf415d52","abstract_canon_sha256":"3c442d77ebf025a2d31079f705f032d8bb7c7def2bcc50325643f7135d956313"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:20:58.561532Z","signature_b64":"JYGWaUu+B0EQ8dMzicpGoQhCtXljdDVSwHVkx16H/bG8X2ukHyvyWuwDPcNxdfTri4HZ2SE0lF0+tB1fIPWQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8c1fdb41e2ed4c55cc8954e71b8c915c571cecd3e59d9c2e0535cf6663b7d7b","last_reissued_at":"2026-07-05T08:20:58.561070Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:20:58.561070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subspace embedding with random Khatri-Rao products and its application to eigensolvers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Daniel Kressner, Hei Yin Lam, Luka Grubi\\v{s}i\\'c, Zvonimir Bujanovi\\'c","submitted_at":"2024-05-20T11:37:24Z","abstract_excerpt":"Various iterative eigenvalue solvers have been developed to compute parts of the spectrum for a large sparse matrix, including the power method, Krylov subspace methods, contour integral methods, and preconditioned solvers such as the so called LOBPCG method. All of these solvers rely on random matrices to determine, e.g., starting vectors that have, with high probability, a non-negligible overlap with the eigenvectors of interest. For this purpose, a safe and common choice are unstructured Gaussian random matrices. In this work, we investigate the use of random Khatri-Rao products in eigenval"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.11962","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.11962/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2405.11962","created_at":"2026-07-05T08:20:58.561126+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.11962v1","created_at":"2026-07-05T08:20:58.561126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.11962","created_at":"2026-07-05T08:20:58.561126+00:00"},{"alias_kind":"pith_short_12","alias_value":"XDA73NA6F3KM","created_at":"2026-07-05T08:20:58.561126+00:00"},{"alias_kind":"pith_short_16","alias_value":"XDA73NA6F3KMKXGI","created_at":"2026-07-05T08:20:58.561126+00:00"},{"alias_kind":"pith_short_8","alias_value":"XDA73NA6","created_at":"2026-07-05T08:20:58.561126+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.05174","citing_title":"Norming Sets for Tensor and Polynomial Sketching","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XDA73NA6F3KMKXGISVHHDOGJCX","json":"https://pith.science/pith/XDA73NA6F3KMKXGISVHHDOGJCX.json","graph_json":"https://pith.science/api/pith-number/XDA73NA6F3KMKXGISVHHDOGJCX/graph.json","events_json":"https://pith.science/api/pith-number/XDA73NA6F3KMKXGISVHHDOGJCX/events.json","paper":"https://pith.science/paper/XDA73NA6"},"agent_actions":{"view_html":"https://pith.science/pith/XDA73NA6F3KMKXGISVHHDOGJCX","download_json":"https://pith.science/pith/XDA73NA6F3KMKXGISVHHDOGJCX.json","view_paper":"https://pith.science/paper/XDA73NA6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.11962&json=true","fetch_graph":"https://pith.science/api/pith-number/XDA73NA6F3KMKXGISVHHDOGJCX/graph.json","fetch_events":"https://pith.science/api/pith-number/XDA73NA6F3KMKXGISVHHDOGJCX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XDA73NA6F3KMKXGISVHHDOGJCX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XDA73NA6F3KMKXGISVHHDOGJCX/action/storage_attestation","attest_author":"https://pith.science/pith/XDA73NA6F3KMKXGISVHHDOGJCX/action/author_attestation","sign_citation":"https://pith.science/pith/XDA73NA6F3KMKXGISVHHDOGJCX/action/citation_signature","submit_replication":"https://pith.science/pith/XDA73NA6F3KMKXGISVHHDOGJCX/action/replication_record"}},"created_at":"2026-07-05T08:20:58.561126+00:00","updated_at":"2026-07-05T08:20:58.561126+00:00"}