{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:M7F7YONDOXBQ7QW4JGUHHZGH2P","short_pith_number":"pith:M7F7YOND","canonical_record":{"source":{"id":"1305.5826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-05-24T19:00:28Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"ff04e89bf8e660b5d0ded5379135235922a71c07f08cf75822a936437b5256fa","abstract_canon_sha256":"afe9bb687889c632e0548d550ca1611b7d60f4ae6a4da48824c6169e905977fd"},"schema_version":"1.0"},"canonical_sha256":"67cbfc39a375c30fc2dc49a873e4c7d3f951af651e145013462061be838be30d","source":{"kind":"arxiv","id":"1305.5826","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5826","created_at":"2026-05-18T03:24:54Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5826v1","created_at":"2026-05-18T03:24:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5826","created_at":"2026-05-18T03:24:54Z"},{"alias_kind":"pith_short_12","alias_value":"M7F7YONDOXBQ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M7F7YONDOXBQ7QW4","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M7F7YOND","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:M7F7YONDOXBQ7QW4JGUHHZGH2P","target":"record","payload":{"canonical_record":{"source":{"id":"1305.5826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-05-24T19:00:28Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"ff04e89bf8e660b5d0ded5379135235922a71c07f08cf75822a936437b5256fa","abstract_canon_sha256":"afe9bb687889c632e0548d550ca1611b7d60f4ae6a4da48824c6169e905977fd"},"schema_version":"1.0"},"canonical_sha256":"67cbfc39a375c30fc2dc49a873e4c7d3f951af651e145013462061be838be30d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:54.696343Z","signature_b64":"gACxX2fndeh193w4bUwtts9mLxq44DvRBLgzljPHYu8emweityr8tPjTr5iPSmqGaK6Ynr/6/1TkNWwwmqrlBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67cbfc39a375c30fc2dc49a873e4c7d3f951af651e145013462061be838be30d","last_reissued_at":"2026-05-18T03:24:54.695701Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:54.695701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.5826","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-05-18T03:24:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GFCnzUYAboDES+ZbbclO4cIPZ0UFmjJ5XjVitVm+tG1CQaPsJgPSdbV/+mB/PJZznRHHoh1BmFTCSofmUVawDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:10:26.377643Z"},"content_sha256":"76558ece1f2e319ed300f0a83680d7d48f82dbfd8b084bfb5353e3e551b8152f","schema_version":"1.0","event_id":"sha256:76558ece1f2e319ed300f0a83680d7d48f82dbfd8b084bfb5353e3e551b8152f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:M7F7YONDOXBQ7QW4JGUHHZGH2P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Gaussian Process Regression with Low-Rank Covariance Matrix Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG"],"primary_cat":"stat.ML","authors_text":"Colin Keng-Yan Tan, Jie Chen, Kian Hsiang Low, Nannan Cao, Patrick Jaillet, Ruofei Ouyang","submitted_at":"2013-05-24T19:00:28Z","abstract_excerpt":"Gaussian processes (GP) are Bayesian non-parametric models that are widely used for probabilistic regression. Unfortunately, it cannot scale well with large data nor perform real-time predictions due to its cubic time cost in the data size. This paper presents two parallel GP regression methods that exploit low-rank covariance matrix approximations for distributing the computational load among parallel machines to achieve time efficiency and scalability. We theoretically guarantee the predictive performances of our proposed parallel GPs to be equivalent to that of some centralized approximate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5826","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"},"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-05-18T03:24:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3UdHvlu5eMDDpyhSQJ6kzaTC2J2MLmONtALeoBcPmkW0Z30kYduqRgiDjvZ2dSwc/xnGpELibAQxCpd+58l3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:10:26.378266Z"},"content_sha256":"deb7e92824686809a55d65cdb9bdb15b01d08b669d9873755ffb1c0e3cc68197","schema_version":"1.0","event_id":"sha256:deb7e92824686809a55d65cdb9bdb15b01d08b669d9873755ffb1c0e3cc68197"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M7F7YONDOXBQ7QW4JGUHHZGH2P/bundle.json","state_url":"https://pith.science/pith/M7F7YONDOXBQ7QW4JGUHHZGH2P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M7F7YONDOXBQ7QW4JGUHHZGH2P/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-06-01T20:10:26Z","links":{"resolver":"https://pith.science/pith/M7F7YONDOXBQ7QW4JGUHHZGH2P","bundle":"https://pith.science/pith/M7F7YONDOXBQ7QW4JGUHHZGH2P/bundle.json","state":"https://pith.science/pith/M7F7YONDOXBQ7QW4JGUHHZGH2P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M7F7YONDOXBQ7QW4JGUHHZGH2P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:M7F7YONDOXBQ7QW4JGUHHZGH2P","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":"afe9bb687889c632e0548d550ca1611b7d60f4ae6a4da48824c6169e905977fd","cross_cats_sorted":["cs.DC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-05-24T19:00:28Z","title_canon_sha256":"ff04e89bf8e660b5d0ded5379135235922a71c07f08cf75822a936437b5256fa"},"schema_version":"1.0","source":{"id":"1305.5826","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5826","created_at":"2026-05-18T03:24:54Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5826v1","created_at":"2026-05-18T03:24:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5826","created_at":"2026-05-18T03:24:54Z"},{"alias_kind":"pith_short_12","alias_value":"M7F7YONDOXBQ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M7F7YONDOXBQ7QW4","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M7F7YOND","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:deb7e92824686809a55d65cdb9bdb15b01d08b669d9873755ffb1c0e3cc68197","target":"graph","created_at":"2026-05-18T03:24:54Z","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"},"paper":{"abstract_excerpt":"Gaussian processes (GP) are Bayesian non-parametric models that are widely used for probabilistic regression. Unfortunately, it cannot scale well with large data nor perform real-time predictions due to its cubic time cost in the data size. This paper presents two parallel GP regression methods that exploit low-rank covariance matrix approximations for distributing the computational load among parallel machines to achieve time efficiency and scalability. We theoretically guarantee the predictive performances of our proposed parallel GPs to be equivalent to that of some centralized approximate ","authors_text":"Colin Keng-Yan Tan, Jie Chen, Kian Hsiang Low, Nannan Cao, Patrick Jaillet, Ruofei Ouyang","cross_cats":["cs.DC","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-05-24T19:00:28Z","title":"Parallel Gaussian Process Regression with Low-Rank Covariance Matrix Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5826","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:76558ece1f2e319ed300f0a83680d7d48f82dbfd8b084bfb5353e3e551b8152f","target":"record","created_at":"2026-05-18T03:24:54Z","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":"afe9bb687889c632e0548d550ca1611b7d60f4ae6a4da48824c6169e905977fd","cross_cats_sorted":["cs.DC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-05-24T19:00:28Z","title_canon_sha256":"ff04e89bf8e660b5d0ded5379135235922a71c07f08cf75822a936437b5256fa"},"schema_version":"1.0","source":{"id":"1305.5826","kind":"arxiv","version":1}},"canonical_sha256":"67cbfc39a375c30fc2dc49a873e4c7d3f951af651e145013462061be838be30d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67cbfc39a375c30fc2dc49a873e4c7d3f951af651e145013462061be838be30d","first_computed_at":"2026-05-18T03:24:54.695701Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:24:54.695701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gACxX2fndeh193w4bUwtts9mLxq44DvRBLgzljPHYu8emweityr8tPjTr5iPSmqGaK6Ynr/6/1TkNWwwmqrlBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:24:54.696343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.5826","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76558ece1f2e319ed300f0a83680d7d48f82dbfd8b084bfb5353e3e551b8152f","sha256:deb7e92824686809a55d65cdb9bdb15b01d08b669d9873755ffb1c0e3cc68197"],"state_sha256":"80521bdeed5b0aa589bc4eb570948da512a4153c94cc06086361cfa633578323"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nEI6m1nHpjfqtOn3EzTB69iVa8tUNziknENbQyqgL7Emr7AcGfm4HhH1g+ko/XESUo1QtiFve6cOXGXvab0OAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:10:26.380433Z","bundle_sha256":"373ed3561c2e6fd1ae787afd15041e8fa05657de699bd69d122879558d185612"}}