{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LUZPCMZHPM4KUP7O3ZEQ57ZKCT","short_pith_number":"pith:LUZPCMZH","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"},"canonical_sha256":"5d32f133277b38aa3feede490eff2a14e5202ca5a17aa2a9d73a151364e9e35f","source":{"kind":"arxiv","id":"1905.08419","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08419","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08419v1","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08419","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"pith_short_12","alias_value":"LUZPCMZHPM4K","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LUZPCMZHPM4KUP7O","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LUZPCMZH","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LUZPCMZHPM4KUP7O3ZEQ57ZKCT","target":"record","payload":{"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"},"canonical_sha256":"5d32f133277b38aa3feede490eff2a14e5202ca5a17aa2a9d73a151364e9e35f","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"},"source_kind":"arxiv","source_id":"1905.08419","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-17T23:45:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q/5o0XhflX++Ovu1Xtp49C5Gcfzk/6jv1Kvp7ts+TrzdL1JTJIuORxDTuiCeL/urBk16lWILoD8Bxy44y6SCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:12:35.079637Z"},"content_sha256":"089714cb532b20b28e3d8f102dc6974d04110f11ffcbd2c6245daace548af8dd","schema_version":"1.0","event_id":"sha256:089714cb532b20b28e3d8f102dc6974d04110f11ffcbd2c6245daace548af8dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LUZPCMZHPM4KUP7O3ZEQ57ZKCT","target":"graph","payload":{"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"},"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-17T23:45:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4OSp7Fz/jBcsEhclTXhP/6UxpFaI91sZyytCi10KfrYqq8i+INNNBhf7QAyRLbpiSV1pF3R7GSTpVxIrNnLCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:12:35.079989Z"},"content_sha256":"0ee116fcc608b73b3f127f05153b561708308bc74267689f9d9b569c90364fb3","schema_version":"1.0","event_id":"sha256:0ee116fcc608b73b3f127f05153b561708308bc74267689f9d9b569c90364fb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LUZPCMZHPM4KUP7O3ZEQ57ZKCT/bundle.json","state_url":"https://pith.science/pith/LUZPCMZHPM4KUP7O3ZEQ57ZKCT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LUZPCMZHPM4KUP7O3ZEQ57ZKCT/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-02T06:12:35Z","links":{"resolver":"https://pith.science/pith/LUZPCMZHPM4KUP7O3ZEQ57ZKCT","bundle":"https://pith.science/pith/LUZPCMZHPM4KUP7O3ZEQ57ZKCT/bundle.json","state":"https://pith.science/pith/LUZPCMZHPM4KUP7O3ZEQ57ZKCT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LUZPCMZHPM4KUP7O3ZEQ57ZKCT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LUZPCMZHPM4KUP7O3ZEQ57ZKCT","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":"06503b0a59c5d6537ab440d4f6fdc43ed25ff6ffe02917336920249d729ed399","cross_cats_sorted":["cs.AI","cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-21T03:11:30Z","title_canon_sha256":"619193c9247880ea543769cba77c04d163877e7c7269d3cb3479ce469c1d6f34"},"schema_version":"1.0","source":{"id":"1905.08419","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08419","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08419v1","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08419","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"pith_short_12","alias_value":"LUZPCMZHPM4K","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LUZPCMZHPM4KUP7O","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LUZPCMZH","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:0ee116fcc608b73b3f127f05153b561708308bc74267689f9d9b569c90364fb3","target":"graph","created_at":"2026-05-17T23:45:43Z","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":"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","authors_text":"Boyu Wang, Honghui Xu, Hongyuan Zhu, Zenglin Xu, Zhao Kang","cross_cats":["cs.AI","cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-21T03:11:30Z","title":"Clustering with Similarity Preserving"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08419","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:089714cb532b20b28e3d8f102dc6974d04110f11ffcbd2c6245daace548af8dd","target":"record","created_at":"2026-05-17T23:45:43Z","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":"06503b0a59c5d6537ab440d4f6fdc43ed25ff6ffe02917336920249d729ed399","cross_cats_sorted":["cs.AI","cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-21T03:11:30Z","title_canon_sha256":"619193c9247880ea543769cba77c04d163877e7c7269d3cb3479ce469c1d6f34"},"schema_version":"1.0","source":{"id":"1905.08419","kind":"arxiv","version":1}},"canonical_sha256":"5d32f133277b38aa3feede490eff2a14e5202ca5a17aa2a9d73a151364e9e35f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d32f133277b38aa3feede490eff2a14e5202ca5a17aa2a9d73a151364e9e35f","first_computed_at":"2026-05-17T23:45:43.273906Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:43.273906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f+I0BbWu8Tpwkz6yfckqeBbcUIoYz2QcXsNDxwNlkIkNRJ0GPdMFpFN4ACDYTKYO28JPDZZLj/e9H1skqiLxDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:43.274735Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.08419","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:089714cb532b20b28e3d8f102dc6974d04110f11ffcbd2c6245daace548af8dd","sha256:0ee116fcc608b73b3f127f05153b561708308bc74267689f9d9b569c90364fb3"],"state_sha256":"ee9998d3413fe8997ab0924af877d6905576849288dfd6d88ef2f1d0a411a466"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JREOsZK3h4kaJSUM3qon4kwtj+3vxHwEPJVA6sRPHMWyL39lNbr7Kt1LZa/dTVLVYLT17k5h62FjKZOYqbgsAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:12:35.082089Z","bundle_sha256":"9a59ad193e7604d62306be9b310b233749189e3237dad13c74a9aab36c3a81d6"}}