{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:Q2OK6CX6AQ27SFNVESSDR742R3","short_pith_number":"pith:Q2OK6CX6","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"},"canonical_sha256":"869caf0afe0435f915b524a438ff9a8ee3bd0216ab2fd65b2bc802cf7b0fb498","source":{"kind":"arxiv","id":"2506.22701","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.22701","created_at":"2026-07-05T11:28:43Z"},{"alias_kind":"arxiv_version","alias_value":"2506.22701v1","created_at":"2026-07-05T11:28:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.22701","created_at":"2026-07-05T11:28:43Z"},{"alias_kind":"pith_short_12","alias_value":"Q2OK6CX6AQ27","created_at":"2026-07-05T11:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q2OK6CX6AQ27SFNV","created_at":"2026-07-05T11:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q2OK6CX6","created_at":"2026-07-05T11:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:Q2OK6CX6AQ27SFNVESSDR742R3","target":"record","payload":{"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"},"canonical_sha256":"869caf0afe0435f915b524a438ff9a8ee3bd0216ab2fd65b2bc802cf7b0fb498","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"},"source_kind":"arxiv","source_id":"2506.22701","source_version":1,"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-07-05T11:28:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pl8OBaqw7vJiC1sX75Vb3au/4IUOi76sFl/zHg2AaBjKf5qla7N4dp0yX6eYApoinzosPV/x4uVVipl2zRaXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:08:26.381990Z"},"content_sha256":"f6f08fde5617b1382bebfaecb4ee2ea1015ae585a601bfc0ca364ae11803c48b","schema_version":"1.0","event_id":"sha256:f6f08fde5617b1382bebfaecb4ee2ea1015ae585a601bfc0ca364ae11803c48b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:Q2OK6CX6AQ27SFNVESSDR742R3","target":"graph","payload":{"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"},"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-07-05T11:28:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WqQ63sqtMT+vH07vqVOQXzP0FRwqJ5aHg6ujBXMu/WiBJ3AXz+ARshkYCqsKZJx3hXa+orPlZ+oQYj575KHaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:08:26.382892Z"},"content_sha256":"eca4bdd37180d058d658863712693b945447240f42d8f1574ebfbb63e9c1d05b","schema_version":"1.0","event_id":"sha256:eca4bdd37180d058d658863712693b945447240f42d8f1574ebfbb63e9c1d05b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q2OK6CX6AQ27SFNVESSDR742R3/bundle.json","state_url":"https://pith.science/pith/Q2OK6CX6AQ27SFNVESSDR742R3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q2OK6CX6AQ27SFNVESSDR742R3/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-08-16T06:08:26Z","links":{"resolver":"https://pith.science/pith/Q2OK6CX6AQ27SFNVESSDR742R3","bundle":"https://pith.science/pith/Q2OK6CX6AQ27SFNVESSDR742R3/bundle.json","state":"https://pith.science/pith/Q2OK6CX6AQ27SFNVESSDR742R3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q2OK6CX6AQ27SFNVESSDR742R3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:Q2OK6CX6AQ27SFNVESSDR742R3","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":"a80508c278ad356ae821edfd07a970ae3126d32e7f7ee2b605574a877378dac7","cross_cats_sorted":["cs.DS","cs.LG","cs.NA","math.NA","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2025-06-28T00:41:39Z","title_canon_sha256":"da92208900a234c34e8c764cb0f742c49df5c47ed8581abec9c6e44e8ea3832d"},"schema_version":"1.0","source":{"id":"2506.22701","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.22701","created_at":"2026-07-05T11:28:43Z"},{"alias_kind":"arxiv_version","alias_value":"2506.22701v1","created_at":"2026-07-05T11:28:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.22701","created_at":"2026-07-05T11:28:43Z"},{"alias_kind":"pith_short_12","alias_value":"Q2OK6CX6AQ27","created_at":"2026-07-05T11:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q2OK6CX6AQ27SFNV","created_at":"2026-07-05T11:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q2OK6CX6","created_at":"2026-07-05T11:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:eca4bdd37180d058d658863712693b945447240f42d8f1574ebfbb63e9c1d05b","target":"graph","created_at":"2026-07-05T11:28:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.22701/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Shi Jie Yu","cross_cats":["cs.DS","cs.LG","cs.NA","math.NA","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2025-06-28T00:41:39Z","title":"Lower bounds for trace estimation via Block Krylov and other methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.22701","kind":"arxiv","version":1},"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:f6f08fde5617b1382bebfaecb4ee2ea1015ae585a601bfc0ca364ae11803c48b","target":"record","created_at":"2026-07-05T11:28:43Z","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":"a80508c278ad356ae821edfd07a970ae3126d32e7f7ee2b605574a877378dac7","cross_cats_sorted":["cs.DS","cs.LG","cs.NA","math.NA","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2025-06-28T00:41:39Z","title_canon_sha256":"da92208900a234c34e8c764cb0f742c49df5c47ed8581abec9c6e44e8ea3832d"},"schema_version":"1.0","source":{"id":"2506.22701","kind":"arxiv","version":1}},"canonical_sha256":"869caf0afe0435f915b524a438ff9a8ee3bd0216ab2fd65b2bc802cf7b0fb498","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"869caf0afe0435f915b524a438ff9a8ee3bd0216ab2fd65b2bc802cf7b0fb498","first_computed_at":"2026-07-05T11:28:43.805036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:28:43.805036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cu4NBB2Krq1ZukquPxYeC0fylghBhWs7sZXXDf+AOJ1mxYzXdURtydWKGN7tEjH62w5rITFyAx6VYS8rwetADw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:28:43.805604Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.22701","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6f08fde5617b1382bebfaecb4ee2ea1015ae585a601bfc0ca364ae11803c48b","sha256:eca4bdd37180d058d658863712693b945447240f42d8f1574ebfbb63e9c1d05b"],"state_sha256":"f1b476cb0280dbd74d64f40ae4dfa0c4fb8083b551eecf34db35edfcb8405034"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v5m2625xXqhkBZprP6fsduxN52slI1rJms3PWeMb2yZmv/xxHtG3A1ocwT2mQ2oDo1TgV+RXY3wujrP02xpfDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T06:08:26.554489Z","bundle_sha256":"8f2f24afe9bc1ff24bb9675c1e49120bb68f657a989e2f03a6982336d11ea045"}}