{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:X4NGVLLSSIYPL3DRI5BTPCOCXU","short_pith_number":"pith:X4NGVLLS","schema_version":"1.0","canonical_sha256":"bf1a6aad729230f5ec7147433789c2bd3c7c181d2f149140002ff898af031754","source":{"kind":"arxiv","id":"1811.07199","version":2},"attestation_state":"computed","paper":{"title":"A Fast and Greedy Subset-of-Data (SoD) Scheme for Sparsification in Gaussian processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"A.C. Faul, Vidhi Lalchand","submitted_at":"2018-11-17T18:04:41Z","abstract_excerpt":"In their standard form Gaussian processes (GPs) provide a powerful non-parametric framework for regression and classificaton tasks. Their one limiting property is their $\\mathcal{O}(N^{3})$ scaling where $N$ is the number of training data points. In this paper we present a framework for GP training with sequential selection of training data points using an intuitive selection metric. The greedy forward selection strategy is devised to target two factors - regions of high predictive uncertainty and underfit. Under this technique the complexity of GP training is reduced to $\\mathcal{O}(M^{3})$ w"},"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":"1811.07199","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-17T18:04:41Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8079a5315b9f084217d2763b41a7fc2fbd9aecadbbad07253b0b956114bba143","abstract_canon_sha256":"bb63fd1f2b7497c0c2dd2107a2a514b9cc11ec718041911efe71cabb4b9d997f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:33:32.948628Z","signature_b64":"skEmi9yPCpYP7wYMYOVK9CYII2e+NMIrmxJDNVhNwYo91d+TO0h2HdZaZK3P063w5TaIVMqTCLSbMjo03D+pBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf1a6aad729230f5ec7147433789c2bd3c7c181d2f149140002ff898af031754","last_reissued_at":"2026-07-05T00:33:32.948283Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:33:32.948283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast and Greedy Subset-of-Data (SoD) Scheme for Sparsification in Gaussian processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"A.C. Faul, Vidhi Lalchand","submitted_at":"2018-11-17T18:04:41Z","abstract_excerpt":"In their standard form Gaussian processes (GPs) provide a powerful non-parametric framework for regression and classificaton tasks. Their one limiting property is their $\\mathcal{O}(N^{3})$ scaling where $N$ is the number of training data points. In this paper we present a framework for GP training with sequential selection of training data points using an intuitive selection metric. The greedy forward selection strategy is devised to target two factors - regions of high predictive uncertainty and underfit. Under this technique the complexity of GP training is reduced to $\\mathcal{O}(M^{3})$ w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07199","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/1811.07199/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":"1811.07199","created_at":"2026-07-05T00:33:32.948344+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.07199v2","created_at":"2026-07-05T00:33:32.948344+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07199","created_at":"2026-07-05T00:33:32.948344+00:00"},{"alias_kind":"pith_short_12","alias_value":"X4NGVLLSSIYP","created_at":"2026-07-05T00:33:32.948344+00:00"},{"alias_kind":"pith_short_16","alias_value":"X4NGVLLSSIYPL3DR","created_at":"2026-07-05T00:33:32.948344+00:00"},{"alias_kind":"pith_short_8","alias_value":"X4NGVLLS","created_at":"2026-07-05T00:33:32.948344+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/X4NGVLLSSIYPL3DRI5BTPCOCXU","json":"https://pith.science/pith/X4NGVLLSSIYPL3DRI5BTPCOCXU.json","graph_json":"https://pith.science/api/pith-number/X4NGVLLSSIYPL3DRI5BTPCOCXU/graph.json","events_json":"https://pith.science/api/pith-number/X4NGVLLSSIYPL3DRI5BTPCOCXU/events.json","paper":"https://pith.science/paper/X4NGVLLS"},"agent_actions":{"view_html":"https://pith.science/pith/X4NGVLLSSIYPL3DRI5BTPCOCXU","download_json":"https://pith.science/pith/X4NGVLLSSIYPL3DRI5BTPCOCXU.json","view_paper":"https://pith.science/paper/X4NGVLLS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.07199&json=true","fetch_graph":"https://pith.science/api/pith-number/X4NGVLLSSIYPL3DRI5BTPCOCXU/graph.json","fetch_events":"https://pith.science/api/pith-number/X4NGVLLSSIYPL3DRI5BTPCOCXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X4NGVLLSSIYPL3DRI5BTPCOCXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X4NGVLLSSIYPL3DRI5BTPCOCXU/action/storage_attestation","attest_author":"https://pith.science/pith/X4NGVLLSSIYPL3DRI5BTPCOCXU/action/author_attestation","sign_citation":"https://pith.science/pith/X4NGVLLSSIYPL3DRI5BTPCOCXU/action/citation_signature","submit_replication":"https://pith.science/pith/X4NGVLLSSIYPL3DRI5BTPCOCXU/action/replication_record"}},"created_at":"2026-07-05T00:33:32.948344+00:00","updated_at":"2026-07-05T00:33:32.948344+00:00"}