{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IPDMYQLXIRNWCN42SUDCBVQ53N","short_pith_number":"pith:IPDMYQLX","schema_version":"1.0","canonical_sha256":"43c6cc4177445b61379a950620d61ddb4868c1222cfd095b5c435d1b46b5faac","source":{"kind":"arxiv","id":"1411.4510","version":1},"attestation_state":"computed","paper":{"title":"Parallel Gaussian Process Regression for Big Data: Low-Rank Representation Meets Markov Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG"],"primary_cat":"stat.ML","authors_text":"Jiangbo Yu, Jie Chen, Kian Hsiang Low, Patrick Jaillet","submitted_at":"2014-11-17T15:31:04Z","abstract_excerpt":"The expressive power of a Gaussian process (GP) model comes at a cost of poor scalability in the data size. To improve its scalability, this paper presents a low-rank-cum-Markov approximation (LMA) of the GP model that is novel in leveraging the dual computational advantages stemming from complementing a low-rank approximate representation of the full-rank GP based on a support set of inputs with a Markov approximation of the resulting residual process; the latter approximation is guaranteed to be closest in the Kullback-Leibler distance criterion subject to some constraint and is considerably"},"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":"1411.4510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-17T15:31:04Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"13e0b0b8edea78f47e5284a371d8006bc8433471d343d3b118a7487bfe9ca7e4","abstract_canon_sha256":"b9d6942b5d833e764f311d04374c49a4d48edd36ac6ce7423a1c6f10495540d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:45.610071Z","signature_b64":"pxmQ+nEfzVW/QEfQqpvvKQRX+cDMXvnjM/Qey2z0fGLucLUAzCbQbzw61qCC/qpnyecc6rfvALIneFkxQv5YAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43c6cc4177445b61379a950620d61ddb4868c1222cfd095b5c435d1b46b5faac","last_reissued_at":"2026-05-18T02:35:45.609469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:45.609469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Gaussian Process Regression for Big Data: Low-Rank Representation Meets Markov Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG"],"primary_cat":"stat.ML","authors_text":"Jiangbo Yu, Jie Chen, Kian Hsiang Low, Patrick Jaillet","submitted_at":"2014-11-17T15:31:04Z","abstract_excerpt":"The expressive power of a Gaussian process (GP) model comes at a cost of poor scalability in the data size. To improve its scalability, this paper presents a low-rank-cum-Markov approximation (LMA) of the GP model that is novel in leveraging the dual computational advantages stemming from complementing a low-rank approximate representation of the full-rank GP based on a support set of inputs with a Markov approximation of the resulting residual process; the latter approximation is guaranteed to be closest in the Kullback-Leibler distance criterion subject to some constraint and is considerably"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4510","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":"1411.4510","created_at":"2026-05-18T02:35:45.609567+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.4510v1","created_at":"2026-05-18T02:35:45.609567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4510","created_at":"2026-05-18T02:35:45.609567+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPDMYQLXIRNW","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPDMYQLXIRNWCN42","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPDMYQLX","created_at":"2026-05-18T12:28:33.132498+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/IPDMYQLXIRNWCN42SUDCBVQ53N","json":"https://pith.science/pith/IPDMYQLXIRNWCN42SUDCBVQ53N.json","graph_json":"https://pith.science/api/pith-number/IPDMYQLXIRNWCN42SUDCBVQ53N/graph.json","events_json":"https://pith.science/api/pith-number/IPDMYQLXIRNWCN42SUDCBVQ53N/events.json","paper":"https://pith.science/paper/IPDMYQLX"},"agent_actions":{"view_html":"https://pith.science/pith/IPDMYQLXIRNWCN42SUDCBVQ53N","download_json":"https://pith.science/pith/IPDMYQLXIRNWCN42SUDCBVQ53N.json","view_paper":"https://pith.science/paper/IPDMYQLX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.4510&json=true","fetch_graph":"https://pith.science/api/pith-number/IPDMYQLXIRNWCN42SUDCBVQ53N/graph.json","fetch_events":"https://pith.science/api/pith-number/IPDMYQLXIRNWCN42SUDCBVQ53N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPDMYQLXIRNWCN42SUDCBVQ53N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPDMYQLXIRNWCN42SUDCBVQ53N/action/storage_attestation","attest_author":"https://pith.science/pith/IPDMYQLXIRNWCN42SUDCBVQ53N/action/author_attestation","sign_citation":"https://pith.science/pith/IPDMYQLXIRNWCN42SUDCBVQ53N/action/citation_signature","submit_replication":"https://pith.science/pith/IPDMYQLXIRNWCN42SUDCBVQ53N/action/replication_record"}},"created_at":"2026-05-18T02:35:45.609567+00:00","updated_at":"2026-05-18T02:35:45.609567+00:00"}