{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:W47VNSLR3HFL6IT6JCCLKZ4YQJ","short_pith_number":"pith:W47VNSLR","canonical_record":{"source":{"id":"2111.00664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-11-01T02:36:18Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"90474a73b001abd7b42a7bb09e9230b168a1ce83f4b35da01135d3b1904f791d","abstract_canon_sha256":"6602eea664e05f4df59acfc93c2b8196ad7d5a37c0b07bb88e6319b19a82746a"},"schema_version":"1.0"},"canonical_sha256":"b73f56c971d9cabf227e4884b56798825a52f5977d00fae89b5aa74d9e5aa9c3","source":{"kind":"arxiv","id":"2111.00664","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.00664","created_at":"2026-07-05T03:27:45Z"},{"alias_kind":"arxiv_version","alias_value":"2111.00664v1","created_at":"2026-07-05T03:27:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.00664","created_at":"2026-07-05T03:27:45Z"},{"alias_kind":"pith_short_12","alias_value":"W47VNSLR3HFL","created_at":"2026-07-05T03:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"W47VNSLR3HFL6IT6","created_at":"2026-07-05T03:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"W47VNSLR","created_at":"2026-07-05T03:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:W47VNSLR3HFL6IT6JCCLKZ4YQJ","target":"record","payload":{"canonical_record":{"source":{"id":"2111.00664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-11-01T02:36:18Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"90474a73b001abd7b42a7bb09e9230b168a1ce83f4b35da01135d3b1904f791d","abstract_canon_sha256":"6602eea664e05f4df59acfc93c2b8196ad7d5a37c0b07bb88e6319b19a82746a"},"schema_version":"1.0"},"canonical_sha256":"b73f56c971d9cabf227e4884b56798825a52f5977d00fae89b5aa74d9e5aa9c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:27:45.466092Z","signature_b64":"NsiKGhLlUrapQF7ZDoI8MP11UzoVQmXsXRSNtYJMACyVvzuXtfWDPKNl2MWq5lfEof+BzcMWZ9SFe3P5VyXEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b73f56c971d9cabf227e4884b56798825a52f5977d00fae89b5aa74d9e5aa9c3","last_reissued_at":"2026-07-05T03:27:45.465660Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:27:45.465660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.00664","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-05T03:27:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SglvQd4mTmjjK1CDsAGPKzc/o/5jJHbqjLDuhpolcbAgZbFH9Ge+5xEJsN5Yu53LkNH3iYwfcPHAgRtqn0VMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:33:57.410569Z"},"content_sha256":"4edf00c982e90783b8cb1b1942b8fe3d450b32d5320222f60c120e09bfdacefc","schema_version":"1.0","event_id":"sha256:4edf00c982e90783b8cb1b1942b8fe3d450b32d5320222f60c120e09bfdacefc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:W47VNSLR3HFL6IT6JCCLKZ4YQJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Sketching for Trace Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Hai Pham, Qiuyi (Richard) Zhang, Shuli Jiang","submitted_at":"2021-11-01T02:36:18Z","abstract_excerpt":"Matrix trace estimation is ubiquitous in machine learning applications and has traditionally relied on Hutchinson's method, which requires $O(\\log(1/\\delta)/\\epsilon^2)$ matrix-vector product queries to achieve a $(1 \\pm \\epsilon)$-multiplicative approximation to $\\text{tr}(A)$ with failure probability $\\delta$ on positive-semidefinite input matrices $A$. Recently, the Hutch++ algorithm was proposed, which reduces the number of matrix-vector queries from $O(1/\\epsilon^2)$ to the optimal $O(1/\\epsilon)$, and the algorithm succeeds with constant probability. However, in the high probability sett"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.00664","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/2111.00664/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-05T03:27:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FMH5xC+fy/wablzCrhQs4ZbntNDXYxB0XiAi35bvC4wqtyQeiU+8wxkvEQMe6kE1Gj2PWjR5LGCoH6kWevKiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:33:57.411076Z"},"content_sha256":"dadc90f53a9d2b7cfeabad4c1b6508f6ffe060a13056806f110f14817a197b72","schema_version":"1.0","event_id":"sha256:dadc90f53a9d2b7cfeabad4c1b6508f6ffe060a13056806f110f14817a197b72"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W47VNSLR3HFL6IT6JCCLKZ4YQJ/bundle.json","state_url":"https://pith.science/pith/W47VNSLR3HFL6IT6JCCLKZ4YQJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W47VNSLR3HFL6IT6JCCLKZ4YQJ/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-03T17:33:57Z","links":{"resolver":"https://pith.science/pith/W47VNSLR3HFL6IT6JCCLKZ4YQJ","bundle":"https://pith.science/pith/W47VNSLR3HFL6IT6JCCLKZ4YQJ/bundle.json","state":"https://pith.science/pith/W47VNSLR3HFL6IT6JCCLKZ4YQJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W47VNSLR3HFL6IT6JCCLKZ4YQJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:W47VNSLR3HFL6IT6JCCLKZ4YQJ","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":"6602eea664e05f4df59acfc93c2b8196ad7d5a37c0b07bb88e6319b19a82746a","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-11-01T02:36:18Z","title_canon_sha256":"90474a73b001abd7b42a7bb09e9230b168a1ce83f4b35da01135d3b1904f791d"},"schema_version":"1.0","source":{"id":"2111.00664","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.00664","created_at":"2026-07-05T03:27:45Z"},{"alias_kind":"arxiv_version","alias_value":"2111.00664v1","created_at":"2026-07-05T03:27:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.00664","created_at":"2026-07-05T03:27:45Z"},{"alias_kind":"pith_short_12","alias_value":"W47VNSLR3HFL","created_at":"2026-07-05T03:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"W47VNSLR3HFL6IT6","created_at":"2026-07-05T03:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"W47VNSLR","created_at":"2026-07-05T03:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:dadc90f53a9d2b7cfeabad4c1b6508f6ffe060a13056806f110f14817a197b72","target":"graph","created_at":"2026-07-05T03:27:45Z","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/2111.00664/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Matrix trace estimation is ubiquitous in machine learning applications and has traditionally relied on Hutchinson's method, which requires $O(\\log(1/\\delta)/\\epsilon^2)$ matrix-vector product queries to achieve a $(1 \\pm \\epsilon)$-multiplicative approximation to $\\text{tr}(A)$ with failure probability $\\delta$ on positive-semidefinite input matrices $A$. Recently, the Hutch++ algorithm was proposed, which reduces the number of matrix-vector queries from $O(1/\\epsilon^2)$ to the optimal $O(1/\\epsilon)$, and the algorithm succeeds with constant probability. However, in the high probability sett","authors_text":"David P. Woodruff, Hai Pham, Qiuyi (Richard) Zhang, Shuli Jiang","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-11-01T02:36:18Z","title":"Optimal Sketching for Trace Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.00664","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:4edf00c982e90783b8cb1b1942b8fe3d450b32d5320222f60c120e09bfdacefc","target":"record","created_at":"2026-07-05T03:27:45Z","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":"6602eea664e05f4df59acfc93c2b8196ad7d5a37c0b07bb88e6319b19a82746a","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-11-01T02:36:18Z","title_canon_sha256":"90474a73b001abd7b42a7bb09e9230b168a1ce83f4b35da01135d3b1904f791d"},"schema_version":"1.0","source":{"id":"2111.00664","kind":"arxiv","version":1}},"canonical_sha256":"b73f56c971d9cabf227e4884b56798825a52f5977d00fae89b5aa74d9e5aa9c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b73f56c971d9cabf227e4884b56798825a52f5977d00fae89b5aa74d9e5aa9c3","first_computed_at":"2026-07-05T03:27:45.465660Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:27:45.465660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NsiKGhLlUrapQF7ZDoI8MP11UzoVQmXsXRSNtYJMACyVvzuXtfWDPKNl2MWq5lfEof+BzcMWZ9SFe3P5VyXEAg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:27:45.466092Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.00664","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4edf00c982e90783b8cb1b1942b8fe3d450b32d5320222f60c120e09bfdacefc","sha256:dadc90f53a9d2b7cfeabad4c1b6508f6ffe060a13056806f110f14817a197b72"],"state_sha256":"7c54ef3fa1c07c97e98378a95241272622059101930bf12f7b29d5973380432f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ugQgDbKGPWh/aqRqt2ESu/cZc1NSQDoU4fOvsyqyt2MaczJxMryZU+7o9thAQ0xgjeUG7xitAx6js64ZUAzsDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T17:33:57.415568Z","bundle_sha256":"499f51d80be09335e38ac81d0c1f4df3c540a911a68509895cd9181d2b02faac"}}