{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QS2QTQMCGQWF2FLCYIXJRYFNFA","short_pith_number":"pith:QS2QTQMC","schema_version":"1.0","canonical_sha256":"84b509c182342c5d1562c22e98e0ad280e599086c3f32213a9a32bf65eac972d","source":{"kind":"arxiv","id":"1709.00139","version":4},"attestation_state":"computed","paper":{"title":"Fast Incremental SVDD Learning Algorithm with the Gaussian Kernel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Arin Chaudhuri, Deovrat Kakde, Hansi Jiang, Haoyu Wang, Wenhao Hu","submitted_at":"2017-09-01T02:47:05Z","abstract_excerpt":"Support vector data description (SVDD) is a machine learning technique that is used for single-class classification and outlier detection. The idea of SVDD is to find a set of support vectors that defines a boundary around data. When dealing with online or large data, existing batch SVDD methods have to be rerun in each iteration. We propose an incremental learning algorithm for SVDD that uses the Gaussian kernel. This algorithm builds on the observation that all support vectors on the boundary have the same distance to the center of sphere in a higher-dimensional feature space as mapped by th"},"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":"1709.00139","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-01T02:47:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8075373b243f2de648773209726c598375b05417af5ee474cb1e004f1b4e70a0","abstract_canon_sha256":"592a24b0d4af4edb8d8637f84ac03da2d2ef54b2f746fdd0040840b1904a9dd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:43.830691Z","signature_b64":"luI9TsVXsaQn7+iQPXP9cxEUv3vvHhnQKg6++cLxC/eNKr76FFAjkFK6+2hkKTmx+/6HWPeU+z/ixE1+8pRaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84b509c182342c5d1562c22e98e0ad280e599086c3f32213a9a32bf65eac972d","last_reissued_at":"2026-05-18T00:01:43.830196Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:43.830196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Incremental SVDD Learning Algorithm with the Gaussian Kernel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Arin Chaudhuri, Deovrat Kakde, Hansi Jiang, Haoyu Wang, Wenhao Hu","submitted_at":"2017-09-01T02:47:05Z","abstract_excerpt":"Support vector data description (SVDD) is a machine learning technique that is used for single-class classification and outlier detection. The idea of SVDD is to find a set of support vectors that defines a boundary around data. When dealing with online or large data, existing batch SVDD methods have to be rerun in each iteration. We propose an incremental learning algorithm for SVDD that uses the Gaussian kernel. This algorithm builds on the observation that all support vectors on the boundary have the same distance to the center of sphere in a higher-dimensional feature space as mapped by th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00139","kind":"arxiv","version":4},"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":"1709.00139","created_at":"2026-05-18T00:01:43.830276+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.00139v4","created_at":"2026-05-18T00:01:43.830276+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00139","created_at":"2026-05-18T00:01:43.830276+00:00"},{"alias_kind":"pith_short_12","alias_value":"QS2QTQMCGQWF","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QS2QTQMCGQWF2FLC","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QS2QTQMC","created_at":"2026-05-18T12:31:39.905425+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/QS2QTQMCGQWF2FLCYIXJRYFNFA","json":"https://pith.science/pith/QS2QTQMCGQWF2FLCYIXJRYFNFA.json","graph_json":"https://pith.science/api/pith-number/QS2QTQMCGQWF2FLCYIXJRYFNFA/graph.json","events_json":"https://pith.science/api/pith-number/QS2QTQMCGQWF2FLCYIXJRYFNFA/events.json","paper":"https://pith.science/paper/QS2QTQMC"},"agent_actions":{"view_html":"https://pith.science/pith/QS2QTQMCGQWF2FLCYIXJRYFNFA","download_json":"https://pith.science/pith/QS2QTQMCGQWF2FLCYIXJRYFNFA.json","view_paper":"https://pith.science/paper/QS2QTQMC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.00139&json=true","fetch_graph":"https://pith.science/api/pith-number/QS2QTQMCGQWF2FLCYIXJRYFNFA/graph.json","fetch_events":"https://pith.science/api/pith-number/QS2QTQMCGQWF2FLCYIXJRYFNFA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QS2QTQMCGQWF2FLCYIXJRYFNFA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QS2QTQMCGQWF2FLCYIXJRYFNFA/action/storage_attestation","attest_author":"https://pith.science/pith/QS2QTQMCGQWF2FLCYIXJRYFNFA/action/author_attestation","sign_citation":"https://pith.science/pith/QS2QTQMCGQWF2FLCYIXJRYFNFA/action/citation_signature","submit_replication":"https://pith.science/pith/QS2QTQMCGQWF2FLCYIXJRYFNFA/action/replication_record"}},"created_at":"2026-05-18T00:01:43.830276+00:00","updated_at":"2026-05-18T00:01:43.830276+00:00"}