{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7A3H3H6NNVNOTEHFY7K33V74KS","short_pith_number":"pith:7A3H3H6N","schema_version":"1.0","canonical_sha256":"f8367d9fcd6d5ae990e5c7d5bdd7fc54939405041773045880026643b5aac9dc","source":{"kind":"arxiv","id":"2309.04952","version":2},"attestation_state":"computed","paper":{"title":"Hutchinson's Estimator is Bad at Kronecker-Trace-Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Haim Avron, Raphael A. Meyer","submitted_at":"2023-09-10T07:48:03Z","abstract_excerpt":"We study the problem of estimating the trace of a matrix $\\mathbf{A}$ that can only be accessed through Kronecker-matrix-vector products. That is, for any Kronecker-structured vector $\\mathrm{x} = \\otimes_{i=1}^k \\mathrm{x}_i$, we can compute $\\mathbf{A}\\mathrm{x}$. We focus on the natural generalization of Hutchinson's Estimator to this setting, proving tight rates for the number of matrix-vector products this estimator needs to find a $(1\\pm\\varepsilon)$ approximation to the trace of $\\mathbf{A}$.\n  We find an exact equation for the variance of the estimator when using a Kronecker of Gaussia"},"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":"2309.04952","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-09-10T07:48:03Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"473545528e7c075254176395eb65a10ac59b4375fcfa555ef72c92877dd9b2ec","abstract_canon_sha256":"8a802c4ad10b56d0002b9952dca0d7e77281671b081874b223998ecce3c216d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:07:38.394563Z","signature_b64":"gVAfV+pNxek4z9vBTgOIdgLcwGdVeOJ4ZWNYnOKuZ+5ZtGiSPBuSQoGqT/uImvcdZz9yM2WZqFubDRrbOda/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8367d9fcd6d5ae990e5c7d5bdd7fc54939405041773045880026643b5aac9dc","last_reissued_at":"2026-07-05T10:07:38.394087Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:07:38.394087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hutchinson's Estimator is Bad at Kronecker-Trace-Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Haim Avron, Raphael A. Meyer","submitted_at":"2023-09-10T07:48:03Z","abstract_excerpt":"We study the problem of estimating the trace of a matrix $\\mathbf{A}$ that can only be accessed through Kronecker-matrix-vector products. That is, for any Kronecker-structured vector $\\mathrm{x} = \\otimes_{i=1}^k \\mathrm{x}_i$, we can compute $\\mathbf{A}\\mathrm{x}$. We focus on the natural generalization of Hutchinson's Estimator to this setting, proving tight rates for the number of matrix-vector products this estimator needs to find a $(1\\pm\\varepsilon)$ approximation to the trace of $\\mathbf{A}$.\n  We find an exact equation for the variance of the estimator when using a Kronecker of Gaussia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.04952","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2309.04952/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":"2309.04952","created_at":"2026-07-05T10:07:38.394148+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.04952v2","created_at":"2026-07-05T10:07:38.394148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.04952","created_at":"2026-07-05T10:07:38.394148+00:00"},{"alias_kind":"pith_short_12","alias_value":"7A3H3H6NNVNO","created_at":"2026-07-05T10:07:38.394148+00:00"},{"alias_kind":"pith_short_16","alias_value":"7A3H3H6NNVNOTEHF","created_at":"2026-07-05T10:07:38.394148+00:00"},{"alias_kind":"pith_short_8","alias_value":"7A3H3H6N","created_at":"2026-07-05T10:07:38.394148+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.24879","citing_title":"Efficient DP-SGD for LLMs with Randomized Clipping","ref_index":40,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7A3H3H6NNVNOTEHFY7K33V74KS","json":"https://pith.science/pith/7A3H3H6NNVNOTEHFY7K33V74KS.json","graph_json":"https://pith.science/api/pith-number/7A3H3H6NNVNOTEHFY7K33V74KS/graph.json","events_json":"https://pith.science/api/pith-number/7A3H3H6NNVNOTEHFY7K33V74KS/events.json","paper":"https://pith.science/paper/7A3H3H6N"},"agent_actions":{"view_html":"https://pith.science/pith/7A3H3H6NNVNOTEHFY7K33V74KS","download_json":"https://pith.science/pith/7A3H3H6NNVNOTEHFY7K33V74KS.json","view_paper":"https://pith.science/paper/7A3H3H6N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.04952&json=true","fetch_graph":"https://pith.science/api/pith-number/7A3H3H6NNVNOTEHFY7K33V74KS/graph.json","fetch_events":"https://pith.science/api/pith-number/7A3H3H6NNVNOTEHFY7K33V74KS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7A3H3H6NNVNOTEHFY7K33V74KS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7A3H3H6NNVNOTEHFY7K33V74KS/action/storage_attestation","attest_author":"https://pith.science/pith/7A3H3H6NNVNOTEHFY7K33V74KS/action/author_attestation","sign_citation":"https://pith.science/pith/7A3H3H6NNVNOTEHFY7K33V74KS/action/citation_signature","submit_replication":"https://pith.science/pith/7A3H3H6NNVNOTEHFY7K33V74KS/action/replication_record"}},"created_at":"2026-07-05T10:07:38.394148+00:00","updated_at":"2026-07-05T10:07:38.394148+00:00"}