{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LUZPCMZHPM4KUP7O3ZEQ57ZKCT","short_pith_number":"pith:LUZPCMZH","schema_version":"1.0","canonical_sha256":"5d32f133277b38aa3feede490eff2a14e5202ca5a17aa2a9d73a151364e9e35f","source":{"kind":"arxiv","id":"1905.08419","version":1},"attestation_state":"computed","paper":{"title":"Clustering with Similarity Preserving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Boyu Wang, Honghui Xu, Hongyuan Zhu, Zenglin Xu, Zhao Kang","submitted_at":"2019-05-21T03:11:30Z","abstract_excerpt":"Graph-based clustering has shown promising performance in many tasks. A key step of graph-based approach is the similarity graph construction. In general, learning graph in kernel space can enhance clustering accuracy due to the incorporation of nonlinearity. However, most existing kernel-based graph learning mechanisms is not similarity-preserving, hence leads to sub-optimal performance. To overcome this drawback, we propose a more discriminative graph learning method which can preserve the pairwise similarities between samples in an adaptive manner for the first time. Specifically, we requir"},"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":"1905.08419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-21T03:11:30Z","cross_cats_sorted":["cs.AI","cs.CV","stat.ML"],"title_canon_sha256":"619193c9247880ea543769cba77c04d163877e7c7269d3cb3479ce469c1d6f34","abstract_canon_sha256":"06503b0a59c5d6537ab440d4f6fdc43ed25ff6ffe02917336920249d729ed399"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:43.274735Z","signature_b64":"f+I0BbWu8Tpwkz6yfckqeBbcUIoYz2QcXsNDxwNlkIkNRJ0GPdMFpFN4ACDYTKYO28JPDZZLj/e9H1skqiLxDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d32f133277b38aa3feede490eff2a14e5202ca5a17aa2a9d73a151364e9e35f","last_reissued_at":"2026-05-17T23:45:43.273906Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:43.273906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering with Similarity Preserving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Boyu Wang, Honghui Xu, Hongyuan Zhu, Zenglin Xu, Zhao Kang","submitted_at":"2019-05-21T03:11:30Z","abstract_excerpt":"Graph-based clustering has shown promising performance in many tasks. A key step of graph-based approach is the similarity graph construction. In general, learning graph in kernel space can enhance clustering accuracy due to the incorporation of nonlinearity. However, most existing kernel-based graph learning mechanisms is not similarity-preserving, hence leads to sub-optimal performance. To overcome this drawback, we propose a more discriminative graph learning method which can preserve the pairwise similarities between samples in an adaptive manner for the first time. Specifically, we requir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08419","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.08419","created_at":"2026-05-17T23:45:43.274051+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.08419v1","created_at":"2026-05-17T23:45:43.274051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08419","created_at":"2026-05-17T23:45:43.274051+00:00"},{"alias_kind":"pith_short_12","alias_value":"LUZPCMZHPM4K","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LUZPCMZHPM4KUP7O","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LUZPCMZH","created_at":"2026-05-18T12:33:21.387695+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/LUZPCMZHPM4KUP7O3ZEQ57ZKCT","json":"https://pith.science/pith/LUZPCMZHPM4KUP7O3ZEQ57ZKCT.json","graph_json":"https://pith.science/api/pith-number/LUZPCMZHPM4KUP7O3ZEQ57ZKCT/graph.json","events_json":"https://pith.science/api/pith-number/LUZPCMZHPM4KUP7O3ZEQ57ZKCT/events.json","paper":"https://pith.science/paper/LUZPCMZH"},"agent_actions":{"view_html":"https://pith.science/pith/LUZPCMZHPM4KUP7O3ZEQ57ZKCT","download_json":"https://pith.science/pith/LUZPCMZHPM4KUP7O3ZEQ57ZKCT.json","view_paper":"https://pith.science/paper/LUZPCMZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.08419&json=true","fetch_graph":"https://pith.science/api/pith-number/LUZPCMZHPM4KUP7O3ZEQ57ZKCT/graph.json","fetch_events":"https://pith.science/api/pith-number/LUZPCMZHPM4KUP7O3ZEQ57ZKCT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LUZPCMZHPM4KUP7O3ZEQ57ZKCT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LUZPCMZHPM4KUP7O3ZEQ57ZKCT/action/storage_attestation","attest_author":"https://pith.science/pith/LUZPCMZHPM4KUP7O3ZEQ57ZKCT/action/author_attestation","sign_citation":"https://pith.science/pith/LUZPCMZHPM4KUP7O3ZEQ57ZKCT/action/citation_signature","submit_replication":"https://pith.science/pith/LUZPCMZHPM4KUP7O3ZEQ57ZKCT/action/replication_record"}},"created_at":"2026-05-17T23:45:43.274051+00:00","updated_at":"2026-05-17T23:45:43.274051+00:00"}