{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BBZDOTKK5VXHC6IOTAMT5QR6D7","short_pith_number":"pith:BBZDOTKK","canonical_record":{"source":{"id":"1709.06444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-19T14:18:13Z","cross_cats_sorted":[],"title_canon_sha256":"f77b52ba032779ac2856cf9ea74d2f1c2442a0fadb3f6a93490d30c1f651d759","abstract_canon_sha256":"1f1f5d3a9ed122ce2f6149df0dd64251bb08fae68b2ed4ffaa64fbe395139bb2"},"schema_version":"1.0"},"canonical_sha256":"0872374d4aed6e71790e98193ec23e1fc24c35039bf6cedba14efd6aa4b39d13","source":{"kind":"arxiv","id":"1709.06444","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06444","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06444v1","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06444","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"BBZDOTKK5VXH","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BBZDOTKK5VXHC6IO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BBZDOTKK","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BBZDOTKK5VXHC6IOTAMT5QR6D7","target":"record","payload":{"canonical_record":{"source":{"id":"1709.06444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-19T14:18:13Z","cross_cats_sorted":[],"title_canon_sha256":"f77b52ba032779ac2856cf9ea74d2f1c2442a0fadb3f6a93490d30c1f651d759","abstract_canon_sha256":"1f1f5d3a9ed122ce2f6149df0dd64251bb08fae68b2ed4ffaa64fbe395139bb2"},"schema_version":"1.0"},"canonical_sha256":"0872374d4aed6e71790e98193ec23e1fc24c35039bf6cedba14efd6aa4b39d13","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:45.805103Z","signature_b64":"3gv4+J3yXEElvVXaY8ugO8uhyXQx88NltfRnPaWYhucN/llPFYc0avZljjbnblzqQlZOsKUxU1Gph8cmFmOoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0872374d4aed6e71790e98193ec23e1fc24c35039bf6cedba14efd6aa4b39d13","last_reissued_at":"2026-05-18T00:34:45.804369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:45.804369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.06444","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-18T00:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eFsUgldX1y17rciMecgPJU3DvmZuXSX7EaM7o+NdbV2lNUeLPmoJScHJaK940VxfF6f+ZfRhKTkCrm5jI4tnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:23:27.004676Z"},"content_sha256":"d99e7d523c57d4eb1737a2cc173dd13e17960cf8661c85326f589d66411608b3","schema_version":"1.0","event_id":"sha256:d99e7d523c57d4eb1737a2cc173dd13e17960cf8661c85326f589d66411608b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BBZDOTKK5VXHC6IOTAMT5QR6D7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Support Vector Clustering Using Budget","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hang Dang, Trung Le, Tung Pham","submitted_at":"2017-09-19T14:18:13Z","abstract_excerpt":"Owing to its application in solving the difficult and diverse clustering or outlier detection problem, support-based clustering has recently drawn plenty of attention. Support-based clustering method always undergoes two phases: finding the domain of novelty and performing clustering assignment. To find the domain of novelty, the training time given by the current solvers is typically over-quadratic in the training size, and hence precluding the usage of support-based clustering method for large-scale datasets. In this paper, we propose applying Stochastic Gradient Descent (SGD) framework to t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06444","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-18T00:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W1IrwdPd2STVhLwl252h6pv2MUTnG6WEK642NmjY7mRHIaHOktV/X+oNdN3WTFNv/e0fogDsVcMMstFVR9WwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:23:27.005174Z"},"content_sha256":"dc01119bd9daa578e2637504ccf43f74f0d71f5e2120d15aad3b8cb95c42d54a","schema_version":"1.0","event_id":"sha256:dc01119bd9daa578e2637504ccf43f74f0d71f5e2120d15aad3b8cb95c42d54a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BBZDOTKK5VXHC6IOTAMT5QR6D7/bundle.json","state_url":"https://pith.science/pith/BBZDOTKK5VXHC6IOTAMT5QR6D7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BBZDOTKK5VXHC6IOTAMT5QR6D7/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-04T22:23:27Z","links":{"resolver":"https://pith.science/pith/BBZDOTKK5VXHC6IOTAMT5QR6D7","bundle":"https://pith.science/pith/BBZDOTKK5VXHC6IOTAMT5QR6D7/bundle.json","state":"https://pith.science/pith/BBZDOTKK5VXHC6IOTAMT5QR6D7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BBZDOTKK5VXHC6IOTAMT5QR6D7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BBZDOTKK5VXHC6IOTAMT5QR6D7","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":"1f1f5d3a9ed122ce2f6149df0dd64251bb08fae68b2ed4ffaa64fbe395139bb2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-19T14:18:13Z","title_canon_sha256":"f77b52ba032779ac2856cf9ea74d2f1c2442a0fadb3f6a93490d30c1f651d759"},"schema_version":"1.0","source":{"id":"1709.06444","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06444","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06444v1","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06444","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"BBZDOTKK5VXH","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BBZDOTKK5VXHC6IO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BBZDOTKK","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:dc01119bd9daa578e2637504ccf43f74f0d71f5e2120d15aad3b8cb95c42d54a","target":"graph","created_at":"2026-05-18T00:34:45Z","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":"Owing to its application in solving the difficult and diverse clustering or outlier detection problem, support-based clustering has recently drawn plenty of attention. Support-based clustering method always undergoes two phases: finding the domain of novelty and performing clustering assignment. To find the domain of novelty, the training time given by the current solvers is typically over-quadratic in the training size, and hence precluding the usage of support-based clustering method for large-scale datasets. In this paper, we propose applying Stochastic Gradient Descent (SGD) framework to t","authors_text":"Hang Dang, Trung Le, Tung Pham","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-19T14:18:13Z","title":"Scalable Support Vector Clustering Using Budget"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06444","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:d99e7d523c57d4eb1737a2cc173dd13e17960cf8661c85326f589d66411608b3","target":"record","created_at":"2026-05-18T00:34:45Z","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":"1f1f5d3a9ed122ce2f6149df0dd64251bb08fae68b2ed4ffaa64fbe395139bb2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-19T14:18:13Z","title_canon_sha256":"f77b52ba032779ac2856cf9ea74d2f1c2442a0fadb3f6a93490d30c1f651d759"},"schema_version":"1.0","source":{"id":"1709.06444","kind":"arxiv","version":1}},"canonical_sha256":"0872374d4aed6e71790e98193ec23e1fc24c35039bf6cedba14efd6aa4b39d13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0872374d4aed6e71790e98193ec23e1fc24c35039bf6cedba14efd6aa4b39d13","first_computed_at":"2026-05-18T00:34:45.804369Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:45.804369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3gv4+J3yXEElvVXaY8ugO8uhyXQx88NltfRnPaWYhucN/llPFYc0avZljjbnblzqQlZOsKUxU1Gph8cmFmOoAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:45.805103Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.06444","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d99e7d523c57d4eb1737a2cc173dd13e17960cf8661c85326f589d66411608b3","sha256:dc01119bd9daa578e2637504ccf43f74f0d71f5e2120d15aad3b8cb95c42d54a"],"state_sha256":"1bd3e5b8b383f6d0aa7c91b8239ff5867088e34de8949e233fc90542a5e61f17"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mV5S1Y/GqdwO/uCylsHkqfxqMIGLkO1U4FMPRl2B0BeiPM8qdNDhXMAKOwCfdiutR5sVoGldtVADcQBa0lrMBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:23:27.007562Z","bundle_sha256":"58fb926296ffee8e11cecb60dd97841591f60718b3e837bb587025e1eb5984d9"}}