{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ECFTALVJZJI7PPKS66RH4NFWNF","short_pith_number":"pith:ECFTALVJ","schema_version":"1.0","canonical_sha256":"208b302ea9ca51f7bd52f7a27e34b6696b8e299f40c3403ffb29d83ec514d32a","source":{"kind":"arxiv","id":"2210.10210","version":2},"attestation_state":"computed","paper":{"title":"Equispaced Fourier representations for efficient Gaussian process regression from a billion data points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"stat.CO","authors_text":"Alex Barnett, Manas Rachh, Philip Greengard","submitted_at":"2022-10-18T23:28:47Z","abstract_excerpt":"We introduce a Fourier-based fast algorithm for Gaussian process regression in low dimensions. It approximates a translationally-invariant covariance kernel by complex exponentials on an equispaced Cartesian frequency grid of $M$ nodes. This results in a weight-space $M\\times M$ system matrix with Toeplitz structure, which can thus be applied to a vector in ${\\mathcal O}(M \\log{M})$ operations via the fast Fourier transform (FFT), independent of the number of data points $N$. The linear system can be set up in ${\\mathcal O}(N + M \\log{M})$ operations using nonuniform FFTs. This enables efficie"},"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":"2210.10210","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2022-10-18T23:28:47Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"2f6f2aed5483038c03fd357676dcc3d9d230cb2679de3e3acae5aeec7f05805c","abstract_canon_sha256":"904006aae0b0e380c531e56fa1409e2ee2f4beafad57644e035c54299c01f0b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:11:17.404511Z","signature_b64":"yHviLecJ4M2HwEi09KZd0nkJ9sAzYzG0xXY0WDKxfxTgC4TxUJ4+fnpSUeR6pVGGKd06+X0mR1/qihITlQSqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"208b302ea9ca51f7bd52f7a27e34b6696b8e299f40c3403ffb29d83ec514d32a","last_reissued_at":"2026-07-05T06:11:17.403972Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:11:17.403972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equispaced Fourier representations for efficient Gaussian process regression from a billion data points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"stat.CO","authors_text":"Alex Barnett, Manas Rachh, Philip Greengard","submitted_at":"2022-10-18T23:28:47Z","abstract_excerpt":"We introduce a Fourier-based fast algorithm for Gaussian process regression in low dimensions. It approximates a translationally-invariant covariance kernel by complex exponentials on an equispaced Cartesian frequency grid of $M$ nodes. This results in a weight-space $M\\times M$ system matrix with Toeplitz structure, which can thus be applied to a vector in ${\\mathcal O}(M \\log{M})$ operations via the fast Fourier transform (FFT), independent of the number of data points $N$. The linear system can be set up in ${\\mathcal O}(N + M \\log{M})$ operations using nonuniform FFTs. This enables efficie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.10210","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/2210.10210/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":"2210.10210","created_at":"2026-07-05T06:11:17.404039+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.10210v2","created_at":"2026-07-05T06:11:17.404039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.10210","created_at":"2026-07-05T06:11:17.404039+00:00"},{"alias_kind":"pith_short_12","alias_value":"ECFTALVJZJI7","created_at":"2026-07-05T06:11:17.404039+00:00"},{"alias_kind":"pith_short_16","alias_value":"ECFTALVJZJI7PPKS","created_at":"2026-07-05T06:11:17.404039+00:00"},{"alias_kind":"pith_short_8","alias_value":"ECFTALVJ","created_at":"2026-07-05T06:11:17.404039+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.20884","citing_title":"A gradient-based and determinant-free framework for fully Bayesian Gaussian process regression","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ECFTALVJZJI7PPKS66RH4NFWNF","json":"https://pith.science/pith/ECFTALVJZJI7PPKS66RH4NFWNF.json","graph_json":"https://pith.science/api/pith-number/ECFTALVJZJI7PPKS66RH4NFWNF/graph.json","events_json":"https://pith.science/api/pith-number/ECFTALVJZJI7PPKS66RH4NFWNF/events.json","paper":"https://pith.science/paper/ECFTALVJ"},"agent_actions":{"view_html":"https://pith.science/pith/ECFTALVJZJI7PPKS66RH4NFWNF","download_json":"https://pith.science/pith/ECFTALVJZJI7PPKS66RH4NFWNF.json","view_paper":"https://pith.science/paper/ECFTALVJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.10210&json=true","fetch_graph":"https://pith.science/api/pith-number/ECFTALVJZJI7PPKS66RH4NFWNF/graph.json","fetch_events":"https://pith.science/api/pith-number/ECFTALVJZJI7PPKS66RH4NFWNF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ECFTALVJZJI7PPKS66RH4NFWNF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ECFTALVJZJI7PPKS66RH4NFWNF/action/storage_attestation","attest_author":"https://pith.science/pith/ECFTALVJZJI7PPKS66RH4NFWNF/action/author_attestation","sign_citation":"https://pith.science/pith/ECFTALVJZJI7PPKS66RH4NFWNF/action/citation_signature","submit_replication":"https://pith.science/pith/ECFTALVJZJI7PPKS66RH4NFWNF/action/replication_record"}},"created_at":"2026-07-05T06:11:17.404039+00:00","updated_at":"2026-07-05T06:11:17.404039+00:00"}