{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LY6IT76E7ZH6MD76J5DFVJ2BLH","short_pith_number":"pith:LY6IT76E","schema_version":"1.0","canonical_sha256":"5e3c89ffc4fe4fe60ffe4f465aa74159c5a1fb34ad54d287a45ca49df5848def","source":{"kind":"arxiv","id":"1511.01870","version":1},"attestation_state":"computed","paper":{"title":"Thoughts on Massively Scalable Gaussian Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ME","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew Gordon Wilson, Christoph Dann, Hannes Nickisch","submitted_at":"2015-11-05T19:51:31Z","abstract_excerpt":"We introduce a framework and early results for massively scalable Gaussian processes (MSGP), significantly extending the KISS-GP approach of Wilson and Nickisch (2015). The MSGP framework enables the use of Gaussian processes (GPs) on billions of datapoints, without requiring distributed inference, or severe assumptions. In particular, MSGP reduces the standard $O(n^3)$ complexity of GP learning and inference to $O(n)$, and the standard $O(n^2)$ complexity per test point prediction to $O(1)$. MSGP involves 1) decomposing covariance matrices as Kronecker products of Toeplitz matrices approximat"},"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":"1511.01870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-05T19:51:31Z","cross_cats_sorted":["cs.AI","stat.ME","stat.ML"],"title_canon_sha256":"3a52ba47985740426616257c8e8c614c6671f5e1db0759aa1efec25da24407b8","abstract_canon_sha256":"047fbd21c39fa6302d9cb079e63f194de5679ad54272a6eb50943621d3193207"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:39.583603Z","signature_b64":"K2n8CIq7co+tGPWqoFeh9MP0LgygVZ8nLqWHIbks6rY2aHp6t5PgHxZbWTzJnvMFehnjS8phOH8UtFRso/4KCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e3c89ffc4fe4fe60ffe4f465aa74159c5a1fb34ad54d287a45ca49df5848def","last_reissued_at":"2026-05-18T01:27:39.583174Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:39.583174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Thoughts on Massively Scalable Gaussian Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ME","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew Gordon Wilson, Christoph Dann, Hannes Nickisch","submitted_at":"2015-11-05T19:51:31Z","abstract_excerpt":"We introduce a framework and early results for massively scalable Gaussian processes (MSGP), significantly extending the KISS-GP approach of Wilson and Nickisch (2015). The MSGP framework enables the use of Gaussian processes (GPs) on billions of datapoints, without requiring distributed inference, or severe assumptions. In particular, MSGP reduces the standard $O(n^3)$ complexity of GP learning and inference to $O(n)$, and the standard $O(n^2)$ complexity per test point prediction to $O(1)$. MSGP involves 1) decomposing covariance matrices as Kronecker products of Toeplitz matrices approximat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01870","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":""},"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":"1511.01870","created_at":"2026-05-18T01:27:39.583234+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.01870v1","created_at":"2026-05-18T01:27:39.583234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01870","created_at":"2026-05-18T01:27:39.583234+00:00"},{"alias_kind":"pith_short_12","alias_value":"LY6IT76E7ZH6","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LY6IT76E7ZH6MD76","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LY6IT76E","created_at":"2026-05-18T12:29:29.992203+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LY6IT76E7ZH6MD76J5DFVJ2BLH","json":"https://pith.science/pith/LY6IT76E7ZH6MD76J5DFVJ2BLH.json","graph_json":"https://pith.science/api/pith-number/LY6IT76E7ZH6MD76J5DFVJ2BLH/graph.json","events_json":"https://pith.science/api/pith-number/LY6IT76E7ZH6MD76J5DFVJ2BLH/events.json","paper":"https://pith.science/paper/LY6IT76E"},"agent_actions":{"view_html":"https://pith.science/pith/LY6IT76E7ZH6MD76J5DFVJ2BLH","download_json":"https://pith.science/pith/LY6IT76E7ZH6MD76J5DFVJ2BLH.json","view_paper":"https://pith.science/paper/LY6IT76E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.01870&json=true","fetch_graph":"https://pith.science/api/pith-number/LY6IT76E7ZH6MD76J5DFVJ2BLH/graph.json","fetch_events":"https://pith.science/api/pith-number/LY6IT76E7ZH6MD76J5DFVJ2BLH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LY6IT76E7ZH6MD76J5DFVJ2BLH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LY6IT76E7ZH6MD76J5DFVJ2BLH/action/storage_attestation","attest_author":"https://pith.science/pith/LY6IT76E7ZH6MD76J5DFVJ2BLH/action/author_attestation","sign_citation":"https://pith.science/pith/LY6IT76E7ZH6MD76J5DFVJ2BLH/action/citation_signature","submit_replication":"https://pith.science/pith/LY6IT76E7ZH6MD76J5DFVJ2BLH/action/replication_record"}},"created_at":"2026-05-18T01:27:39.583234+00:00","updated_at":"2026-05-18T01:27:39.583234+00:00"}