{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MQEQ7ARC3SRP6KFURDX5Z24JMD","short_pith_number":"pith:MQEQ7ARC","schema_version":"1.0","canonical_sha256":"64090f8222dca2ff28b488efdceb8960f65497a60029618207636ce26ded0dac","source":{"kind":"arxiv","id":"2202.12329","version":2},"attestation_state":"computed","paper":{"title":"A Dynamic Low-Rank Fast Gaussian Transform","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Baihe Huang, Hengjie Zhang, Junze Yin, Omri Weinstein, Ruizhe Zhang, Zhao Song","submitted_at":"2022-02-24T19:33:58Z","abstract_excerpt":"The \\emph{Fast Gaussian Transform} (FGT) enables subquadratic-time multiplication of an $n\\times n$ Gaussian kernel matrix $\\mathsf{K}_{i,j}= \\exp ( - \\| x_i - x_j \\|_2^2 ) $ with an arbitrary vector $h \\in \\mathbb{R}^n$, where $x_1,\\dots, x_n \\in \\mathbb{R}^d$ are a set of \\emph{fixed} source points. This kernel plays a central role in machine learning and random feature maps. Nevertheless, in most modern data analysis applications, datasets are dynamically changing (yet often have low rank), and recomputing the FGT from scratch in (kernel-based) algorithms incurs a major computational overhe"},"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":"2202.12329","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-02-24T19:33:58Z","cross_cats_sorted":[],"title_canon_sha256":"bbed0f71ed24d4f7a31edcbeac8bd77d3386db41e71d43a7daefe09696a2e890","abstract_canon_sha256":"72afb24f6ab8aa4d3813b966657e305f335033adad80b9ca3d3e91e2bd667bee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:41:36.227805Z","signature_b64":"apYIoiDfi2mWPvldtg6v5LyFyhkPVWxzIoZjJpSzvJLzVosHEZQ4ydSY3r859Yj9PqNBl8jKsVr3PKgxn7hYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64090f8222dca2ff28b488efdceb8960f65497a60029618207636ce26ded0dac","last_reissued_at":"2026-07-05T07:41:36.227238Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:41:36.227238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Dynamic Low-Rank Fast Gaussian Transform","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Baihe Huang, Hengjie Zhang, Junze Yin, Omri Weinstein, Ruizhe Zhang, Zhao Song","submitted_at":"2022-02-24T19:33:58Z","abstract_excerpt":"The \\emph{Fast Gaussian Transform} (FGT) enables subquadratic-time multiplication of an $n\\times n$ Gaussian kernel matrix $\\mathsf{K}_{i,j}= \\exp ( - \\| x_i - x_j \\|_2^2 ) $ with an arbitrary vector $h \\in \\mathbb{R}^n$, where $x_1,\\dots, x_n \\in \\mathbb{R}^d$ are a set of \\emph{fixed} source points. This kernel plays a central role in machine learning and random feature maps. Nevertheless, in most modern data analysis applications, datasets are dynamically changing (yet often have low rank), and recomputing the FGT from scratch in (kernel-based) algorithms incurs a major computational overhe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.12329","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/2202.12329/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":"2202.12329","created_at":"2026-07-05T07:41:36.227306+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.12329v2","created_at":"2026-07-05T07:41:36.227306+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.12329","created_at":"2026-07-05T07:41:36.227306+00:00"},{"alias_kind":"pith_short_12","alias_value":"MQEQ7ARC3SRP","created_at":"2026-07-05T07:41:36.227306+00:00"},{"alias_kind":"pith_short_16","alias_value":"MQEQ7ARC3SRP6KFU","created_at":"2026-07-05T07:41:36.227306+00:00"},{"alias_kind":"pith_short_8","alias_value":"MQEQ7ARC","created_at":"2026-07-05T07:41:36.227306+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.01696","citing_title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MQEQ7ARC3SRP6KFURDX5Z24JMD","json":"https://pith.science/pith/MQEQ7ARC3SRP6KFURDX5Z24JMD.json","graph_json":"https://pith.science/api/pith-number/MQEQ7ARC3SRP6KFURDX5Z24JMD/graph.json","events_json":"https://pith.science/api/pith-number/MQEQ7ARC3SRP6KFURDX5Z24JMD/events.json","paper":"https://pith.science/paper/MQEQ7ARC"},"agent_actions":{"view_html":"https://pith.science/pith/MQEQ7ARC3SRP6KFURDX5Z24JMD","download_json":"https://pith.science/pith/MQEQ7ARC3SRP6KFURDX5Z24JMD.json","view_paper":"https://pith.science/paper/MQEQ7ARC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.12329&json=true","fetch_graph":"https://pith.science/api/pith-number/MQEQ7ARC3SRP6KFURDX5Z24JMD/graph.json","fetch_events":"https://pith.science/api/pith-number/MQEQ7ARC3SRP6KFURDX5Z24JMD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MQEQ7ARC3SRP6KFURDX5Z24JMD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MQEQ7ARC3SRP6KFURDX5Z24JMD/action/storage_attestation","attest_author":"https://pith.science/pith/MQEQ7ARC3SRP6KFURDX5Z24JMD/action/author_attestation","sign_citation":"https://pith.science/pith/MQEQ7ARC3SRP6KFURDX5Z24JMD/action/citation_signature","submit_replication":"https://pith.science/pith/MQEQ7ARC3SRP6KFURDX5Z24JMD/action/replication_record"}},"created_at":"2026-07-05T07:41:36.227306+00:00","updated_at":"2026-07-05T07:41:36.227306+00:00"}