{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Q2OK6CX6AQ27SFNVESSDR742R3","short_pith_number":"pith:Q2OK6CX6","schema_version":"1.0","canonical_sha256":"869caf0afe0435f915b524a438ff9a8ee3bd0216ab2fd65b2bc802cf7b0fb498","source":{"kind":"arxiv","id":"2506.22701","version":1},"attestation_state":"computed","paper":{"title":"Lower bounds for trace estimation via Block Krylov and other methods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.LG","cs.NA","math.NA","stat.TH"],"primary_cat":"math.ST","authors_text":"Shi Jie Yu","submitted_at":"2025-06-28T00:41:39Z","abstract_excerpt":"This paper studies theoretical lower bounds for estimating the trace of a matrix function, $\\text{tr}(f(A))$, focusing on methods that use Hutchinson's method along with Block Krylov techniques. These methods work by approximating matrix-vector products like $f(A)V$ using a Block Krylov subspace. This is closely related to approximating functions with polynomials. We derive theoretical upper bounds on how many Krylov steps are needed for functions such as $A^{-1/2}$ and $A^{-1}$ by analyzing the upper bounds from the polynomial approximation of their scalar equivalent. In addition, we also dev"},"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":"2506.22701","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2025-06-28T00:41:39Z","cross_cats_sorted":["cs.DS","cs.LG","cs.NA","math.NA","stat.TH"],"title_canon_sha256":"da92208900a234c34e8c764cb0f742c49df5c47ed8581abec9c6e44e8ea3832d","abstract_canon_sha256":"a80508c278ad356ae821edfd07a970ae3126d32e7f7ee2b605574a877378dac7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:28:43.805604Z","signature_b64":"Cu4NBB2Krq1ZukquPxYeC0fylghBhWs7sZXXDf+AOJ1mxYzXdURtydWKGN7tEjH62w5rITFyAx6VYS8rwetADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"869caf0afe0435f915b524a438ff9a8ee3bd0216ab2fd65b2bc802cf7b0fb498","last_reissued_at":"2026-07-05T11:28:43.805036Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:28:43.805036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds for trace estimation via Block Krylov and other methods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.LG","cs.NA","math.NA","stat.TH"],"primary_cat":"math.ST","authors_text":"Shi Jie Yu","submitted_at":"2025-06-28T00:41:39Z","abstract_excerpt":"This paper studies theoretical lower bounds for estimating the trace of a matrix function, $\\text{tr}(f(A))$, focusing on methods that use Hutchinson's method along with Block Krylov techniques. These methods work by approximating matrix-vector products like $f(A)V$ using a Block Krylov subspace. This is closely related to approximating functions with polynomials. We derive theoretical upper bounds on how many Krylov steps are needed for functions such as $A^{-1/2}$ and $A^{-1}$ by analyzing the upper bounds from the polynomial approximation of their scalar equivalent. In addition, we also dev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.22701","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/2506.22701/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":"2506.22701","created_at":"2026-07-05T11:28:43.805099+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.22701v1","created_at":"2026-07-05T11:28:43.805099+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.22701","created_at":"2026-07-05T11:28:43.805099+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q2OK6CX6AQ27","created_at":"2026-07-05T11:28:43.805099+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q2OK6CX6AQ27SFNV","created_at":"2026-07-05T11:28:43.805099+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q2OK6CX6","created_at":"2026-07-05T11:28:43.805099+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/Q2OK6CX6AQ27SFNVESSDR742R3","json":"https://pith.science/pith/Q2OK6CX6AQ27SFNVESSDR742R3.json","graph_json":"https://pith.science/api/pith-number/Q2OK6CX6AQ27SFNVESSDR742R3/graph.json","events_json":"https://pith.science/api/pith-number/Q2OK6CX6AQ27SFNVESSDR742R3/events.json","paper":"https://pith.science/paper/Q2OK6CX6"},"agent_actions":{"view_html":"https://pith.science/pith/Q2OK6CX6AQ27SFNVESSDR742R3","download_json":"https://pith.science/pith/Q2OK6CX6AQ27SFNVESSDR742R3.json","view_paper":"https://pith.science/paper/Q2OK6CX6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.22701&json=true","fetch_graph":"https://pith.science/api/pith-number/Q2OK6CX6AQ27SFNVESSDR742R3/graph.json","fetch_events":"https://pith.science/api/pith-number/Q2OK6CX6AQ27SFNVESSDR742R3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q2OK6CX6AQ27SFNVESSDR742R3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q2OK6CX6AQ27SFNVESSDR742R3/action/storage_attestation","attest_author":"https://pith.science/pith/Q2OK6CX6AQ27SFNVESSDR742R3/action/author_attestation","sign_citation":"https://pith.science/pith/Q2OK6CX6AQ27SFNVESSDR742R3/action/citation_signature","submit_replication":"https://pith.science/pith/Q2OK6CX6AQ27SFNVESSDR742R3/action/replication_record"}},"created_at":"2026-07-05T11:28:43.805099+00:00","updated_at":"2026-07-05T11:28:43.805099+00:00"}