{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2G3KQLNSKRWDIQKAMFUAEKNJ7J","short_pith_number":"pith:2G3KQLNS","canonical_record":{"source":{"id":"1206.6030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-26T15:58:21Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"92a00a8241070f6cf1060e8baeb367025c6f480c9ee5f3c51bc494f13a773455","abstract_canon_sha256":"047408cb3364bfe58bed4fd6144a3f9b889f9af8aa19142a67619f79bd3fb716"},"schema_version":"1.0"},"canonical_sha256":"d1b6a82db2546c34414061680229a9fa61cfb5884152425940d27c2e03de1bdd","source":{"kind":"arxiv","id":"1206.6030","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6030","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6030v1","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6030","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"pith_short_12","alias_value":"2G3KQLNSKRWD","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2G3KQLNSKRWDIQKA","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2G3KQLNS","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2G3KQLNSKRWDIQKAMFUAEKNJ7J","target":"record","payload":{"canonical_record":{"source":{"id":"1206.6030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-26T15:58:21Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"92a00a8241070f6cf1060e8baeb367025c6f480c9ee5f3c51bc494f13a773455","abstract_canon_sha256":"047408cb3364bfe58bed4fd6144a3f9b889f9af8aa19142a67619f79bd3fb716"},"schema_version":"1.0"},"canonical_sha256":"d1b6a82db2546c34414061680229a9fa61cfb5884152425940d27c2e03de1bdd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:28.948298Z","signature_b64":"+Dv1xtB+0lC40TRXAPdTwyDryiN95REzrfldDTAHEyO0iNNdtO0+ULZkOzin3+C5fz7aPuhr+oJ9AL0+RBbDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1b6a82db2546c34414061680229a9fa61cfb5884152425940d27c2e03de1bdd","last_reissued_at":"2026-05-18T03:52:28.947567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:28.947567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.6030","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:52:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GATSLQYNDXJoj94cVcsWo/cdoR90UurLjxy9z+wNRJ+KkCtr3jjzcjXJnawN7DEmyw6KSqWZeqYU5H+u/DEnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:52:51.699932Z"},"content_sha256":"32ad7045f6f8021510b610a1294e9dde08559b3411d7f3d7f093ba898deffd5a","schema_version":"1.0","event_id":"sha256:32ad7045f6f8021510b610a1294e9dde08559b3411d7f3d7f093ba898deffd5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2G3KQLNSKRWDIQKAMFUAEKNJ7J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Additive Model View to Sparse Gaussian Process Classifier Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Shirish Shevade, Sundararajan Sellamanickam","submitted_at":"2012-06-26T15:58:21Z","abstract_excerpt":"We consider the problem of designing a sparse Gaussian process classifier (SGPC) that generalizes well. Viewing SGPC design as constructing an additive model like in boosting, we present an efficient and effective SGPC design method to perform a stage-wise optimization of a predictive loss function. We introduce new methods for two key components viz., site parameter estimation and basis vector selection in any SGPC design. The proposed adaptive sampling based basis vector selection method aids in achieving improved generalization performance at a reduced computational cost. This method can al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6030","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:52:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qDV1cF1eVMnMQhWQ62E7mfz0WK3sDi4tN9rW2mJqjQVVucGsPeLbBbQFLWQ4iYYRp8WlYPkuFgkidXtXqlEqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:52:51.700271Z"},"content_sha256":"60d7390e86a6da30e86698dd05d64e0ea01689fd8ad781065153134053142298","schema_version":"1.0","event_id":"sha256:60d7390e86a6da30e86698dd05d64e0ea01689fd8ad781065153134053142298"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2G3KQLNSKRWDIQKAMFUAEKNJ7J/bundle.json","state_url":"https://pith.science/pith/2G3KQLNSKRWDIQKAMFUAEKNJ7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2G3KQLNSKRWDIQKAMFUAEKNJ7J/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-02T07:52:51Z","links":{"resolver":"https://pith.science/pith/2G3KQLNSKRWDIQKAMFUAEKNJ7J","bundle":"https://pith.science/pith/2G3KQLNSKRWDIQKAMFUAEKNJ7J/bundle.json","state":"https://pith.science/pith/2G3KQLNSKRWDIQKAMFUAEKNJ7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2G3KQLNSKRWDIQKAMFUAEKNJ7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2G3KQLNSKRWDIQKAMFUAEKNJ7J","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":"047408cb3364bfe58bed4fd6144a3f9b889f9af8aa19142a67619f79bd3fb716","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-26T15:58:21Z","title_canon_sha256":"92a00a8241070f6cf1060e8baeb367025c6f480c9ee5f3c51bc494f13a773455"},"schema_version":"1.0","source":{"id":"1206.6030","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6030","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6030v1","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6030","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"pith_short_12","alias_value":"2G3KQLNSKRWD","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2G3KQLNSKRWDIQKA","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2G3KQLNS","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:60d7390e86a6da30e86698dd05d64e0ea01689fd8ad781065153134053142298","target":"graph","created_at":"2026-05-18T03:52:28Z","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":"We consider the problem of designing a sparse Gaussian process classifier (SGPC) that generalizes well. Viewing SGPC design as constructing an additive model like in boosting, we present an efficient and effective SGPC design method to perform a stage-wise optimization of a predictive loss function. We introduce new methods for two key components viz., site parameter estimation and basis vector selection in any SGPC design. The proposed adaptive sampling based basis vector selection method aids in achieving improved generalization performance at a reduced computational cost. This method can al","authors_text":"Shirish Shevade, Sundararajan Sellamanickam","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-26T15:58:21Z","title":"An Additive Model View to Sparse Gaussian Process Classifier Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6030","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:32ad7045f6f8021510b610a1294e9dde08559b3411d7f3d7f093ba898deffd5a","target":"record","created_at":"2026-05-18T03:52:28Z","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":"047408cb3364bfe58bed4fd6144a3f9b889f9af8aa19142a67619f79bd3fb716","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-26T15:58:21Z","title_canon_sha256":"92a00a8241070f6cf1060e8baeb367025c6f480c9ee5f3c51bc494f13a773455"},"schema_version":"1.0","source":{"id":"1206.6030","kind":"arxiv","version":1}},"canonical_sha256":"d1b6a82db2546c34414061680229a9fa61cfb5884152425940d27c2e03de1bdd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1b6a82db2546c34414061680229a9fa61cfb5884152425940d27c2e03de1bdd","first_computed_at":"2026-05-18T03:52:28.947567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:28.947567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Dv1xtB+0lC40TRXAPdTwyDryiN95REzrfldDTAHEyO0iNNdtO0+ULZkOzin3+C5fz7aPuhr+oJ9AL0+RBbDBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:28.948298Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6030","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32ad7045f6f8021510b610a1294e9dde08559b3411d7f3d7f093ba898deffd5a","sha256:60d7390e86a6da30e86698dd05d64e0ea01689fd8ad781065153134053142298"],"state_sha256":"3f37fc6309e6385496087f531ba1b3919f36f364061d6d8a6228c4ec39c706c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dZpfb4Et0+wAo3rfMgLYahfz10mvkTj8v6hHHSrShWFDJbdr7ppYTaYMvh3FDN/nc5mSiGrM9n9li40U80ZmAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:52:51.702126Z","bundle_sha256":"e2c21ce6a18af6bf8dee07fc494e7a639a41b6bb00668d5d64058f7d53953577"}}