{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LEGPGCJJFR3R6ZRZGP7XTSORB7","short_pith_number":"pith:LEGPGCJJ","schema_version":"1.0","canonical_sha256":"590cf309292c771f663933ff79c9d10fde992d3b44fe2652ddb73bff936a88fa","source":{"kind":"arxiv","id":"1807.02537","version":2},"attestation_state":"computed","paper":{"title":"Fully Scalable Gaussian Processes using Subspace Inducing Inputs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Aristeidis Panos, Michalis K. Titsias, Petros Dellaportas","submitted_at":"2018-07-06T18:18:36Z","abstract_excerpt":"We introduce fully scalable Gaussian processes, an implementation scheme that tackles the problem of treating a high number of training instances together with high dimensional input data. Our key idea is a representation trick over the inducing variables called subspace inducing inputs. This is combined with certain matrix-preconditioning based parametrizations of the variational distributions that lead to simplified and numerically stable variational lower bounds. Our illustrative applications are based on challenging extreme multi-label classification problems with the extra burden of the v"},"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":"1807.02537","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-06T18:18:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"50bed68fd4009cafa2bbfe7eadfa7f942b3c43cfbb18cf35ef5f1f91c44812e5","abstract_canon_sha256":"56291aef63646296d4399e995bc3fe317c01617c1ec28396af2daa4919c9d27b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:51.567812Z","signature_b64":"jymvQobYySTGJls7Y6Xg6QB9AN+Hfjb8iMkgTc5+DLWs6mMDHKSo9TrSRmtUMJ3IXWLxzKEGNtt8Ke5UVCNXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"590cf309292c771f663933ff79c9d10fde992d3b44fe2652ddb73bff936a88fa","last_reissued_at":"2026-05-18T00:10:51.567357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:51.567357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully Scalable Gaussian Processes using Subspace Inducing Inputs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Aristeidis Panos, Michalis K. Titsias, Petros Dellaportas","submitted_at":"2018-07-06T18:18:36Z","abstract_excerpt":"We introduce fully scalable Gaussian processes, an implementation scheme that tackles the problem of treating a high number of training instances together with high dimensional input data. Our key idea is a representation trick over the inducing variables called subspace inducing inputs. This is combined with certain matrix-preconditioning based parametrizations of the variational distributions that lead to simplified and numerically stable variational lower bounds. Our illustrative applications are based on challenging extreme multi-label classification problems with the extra burden of the v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02537","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":""},"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":"1807.02537","created_at":"2026-05-18T00:10:51.567432+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.02537v2","created_at":"2026-05-18T00:10:51.567432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02537","created_at":"2026-05-18T00:10:51.567432+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEGPGCJJFR3R","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEGPGCJJFR3R6ZRZ","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEGPGCJJ","created_at":"2026-05-18T12:32:37.024351+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/LEGPGCJJFR3R6ZRZGP7XTSORB7","json":"https://pith.science/pith/LEGPGCJJFR3R6ZRZGP7XTSORB7.json","graph_json":"https://pith.science/api/pith-number/LEGPGCJJFR3R6ZRZGP7XTSORB7/graph.json","events_json":"https://pith.science/api/pith-number/LEGPGCJJFR3R6ZRZGP7XTSORB7/events.json","paper":"https://pith.science/paper/LEGPGCJJ"},"agent_actions":{"view_html":"https://pith.science/pith/LEGPGCJJFR3R6ZRZGP7XTSORB7","download_json":"https://pith.science/pith/LEGPGCJJFR3R6ZRZGP7XTSORB7.json","view_paper":"https://pith.science/paper/LEGPGCJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.02537&json=true","fetch_graph":"https://pith.science/api/pith-number/LEGPGCJJFR3R6ZRZGP7XTSORB7/graph.json","fetch_events":"https://pith.science/api/pith-number/LEGPGCJJFR3R6ZRZGP7XTSORB7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEGPGCJJFR3R6ZRZGP7XTSORB7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEGPGCJJFR3R6ZRZGP7XTSORB7/action/storage_attestation","attest_author":"https://pith.science/pith/LEGPGCJJFR3R6ZRZGP7XTSORB7/action/author_attestation","sign_citation":"https://pith.science/pith/LEGPGCJJFR3R6ZRZGP7XTSORB7/action/citation_signature","submit_replication":"https://pith.science/pith/LEGPGCJJFR3R6ZRZGP7XTSORB7/action/replication_record"}},"created_at":"2026-05-18T00:10:51.567432+00:00","updated_at":"2026-05-18T00:10:51.567432+00:00"}