{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GGNY2O3P6IVGZTAE3HC3S7KWTF","short_pith_number":"pith:GGNY2O3P","canonical_record":{"source":{"id":"1705.00678","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-01T19:33:27Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"43e0c5c0d40717972cb4f14bf69665510cbb2ee4dba27c57300676d4ab62ff54","abstract_canon_sha256":"3faeae5ce7029f915ecb066b08c20ad9c3bb41ce14f8c06a3a881f1dbc92b7bb"},"schema_version":"1.0"},"canonical_sha256":"319b8d3b6ff22a6ccc04d9c5b97d5699655012b52993cdd3592df6e51dcdff9c","source":{"kind":"arxiv","id":"1705.00678","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00678","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00678v2","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00678","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"GGNY2O3P6IVG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GGNY2O3P6IVGZTAE","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GGNY2O3P","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GGNY2O3P6IVGZTAE3HC3S7KWTF","target":"record","payload":{"canonical_record":{"source":{"id":"1705.00678","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-01T19:33:27Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"43e0c5c0d40717972cb4f14bf69665510cbb2ee4dba27c57300676d4ab62ff54","abstract_canon_sha256":"3faeae5ce7029f915ecb066b08c20ad9c3bb41ce14f8c06a3a881f1dbc92b7bb"},"schema_version":"1.0"},"canonical_sha256":"319b8d3b6ff22a6ccc04d9c5b97d5699655012b52993cdd3592df6e51dcdff9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:05.927989Z","signature_b64":"XXYGICZaG+89bRRuDRSJt5QaYFVtLxyuFHbLHa31pkQVavGlKx53AWHky4dnItJarjXJcLgDinvT4QkxtiQjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"319b8d3b6ff22a6ccc04d9c5b97d5699655012b52993cdd3592df6e51dcdff9c","last_reissued_at":"2026-05-18T00:45:05.927559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:05.927559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.00678","source_version":2,"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:45:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T3DVm8Hwla0CLFxdp0AmlX+ohlL9ds9hkd+NDNl23TRKq6yj/RcxFxjrRPulSFrxxLnGQ+tx75PWBdEL+4dUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:15:07.026915Z"},"content_sha256":"6d8b65719ccb4bac55ca2671070b9e8c9e1abd9be4e3a40ce0e2a0a57d40be25","schema_version":"1.0","event_id":"sha256:6d8b65719ccb4bac55ca2671070b9e8c9e1abd9be4e3a40ce0e2a0a57d40be25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GGNY2O3P6IVGZTAE3HC3S7KWTF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Twin Learning for Similarity and Clustering: A Unified Kernel Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chong Peng, Qiang Cheng, Zhao Kang","submitted_at":"2017-05-01T19:33:27Z","abstract_excerpt":"Many similarity-based clustering methods work in two separate steps including similarity matrix computation and subsequent spectral clustering. However, similarity measurement is challenging because it is usually impacted by many factors, e.g., the choice of similarity metric, neighborhood size, scale of data, noise and outliers. Thus the learned similarity matrix is often not suitable, let alone optimal, for the subsequent clustering. In addition, nonlinear similarity often exists in many real world data which, however, has not been effectively considered by most existing methods. To tackle t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00678","kind":"arxiv","version":2},"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:45:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4gObt5vKxNa2ZkWCIuuzjuIpnkw6pE8g22IUHITs9zIwDZiQxkjtYeurhMmWb0I8YMGS4YQYsdvtGdbUJ0PNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:15:07.027641Z"},"content_sha256":"a255c31a027bc9e8b19f6d58d3a458038da4f1b6852f7390b14d5e46404c5cb2","schema_version":"1.0","event_id":"sha256:a255c31a027bc9e8b19f6d58d3a458038da4f1b6852f7390b14d5e46404c5cb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GGNY2O3P6IVGZTAE3HC3S7KWTF/bundle.json","state_url":"https://pith.science/pith/GGNY2O3P6IVGZTAE3HC3S7KWTF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GGNY2O3P6IVGZTAE3HC3S7KWTF/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-09T19:15:07Z","links":{"resolver":"https://pith.science/pith/GGNY2O3P6IVGZTAE3HC3S7KWTF","bundle":"https://pith.science/pith/GGNY2O3P6IVGZTAE3HC3S7KWTF/bundle.json","state":"https://pith.science/pith/GGNY2O3P6IVGZTAE3HC3S7KWTF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GGNY2O3P6IVGZTAE3HC3S7KWTF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GGNY2O3P6IVGZTAE3HC3S7KWTF","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":"3faeae5ce7029f915ecb066b08c20ad9c3bb41ce14f8c06a3a881f1dbc92b7bb","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-01T19:33:27Z","title_canon_sha256":"43e0c5c0d40717972cb4f14bf69665510cbb2ee4dba27c57300676d4ab62ff54"},"schema_version":"1.0","source":{"id":"1705.00678","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00678","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00678v2","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00678","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"GGNY2O3P6IVG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GGNY2O3P6IVGZTAE","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GGNY2O3P","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:a255c31a027bc9e8b19f6d58d3a458038da4f1b6852f7390b14d5e46404c5cb2","target":"graph","created_at":"2026-05-18T00:45:05Z","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":"Many similarity-based clustering methods work in two separate steps including similarity matrix computation and subsequent spectral clustering. However, similarity measurement is challenging because it is usually impacted by many factors, e.g., the choice of similarity metric, neighborhood size, scale of data, noise and outliers. Thus the learned similarity matrix is often not suitable, let alone optimal, for the subsequent clustering. In addition, nonlinear similarity often exists in many real world data which, however, has not been effectively considered by most existing methods. To tackle t","authors_text":"Chong Peng, Qiang Cheng, Zhao Kang","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-01T19:33:27Z","title":"Twin Learning for Similarity and Clustering: A Unified Kernel Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00678","kind":"arxiv","version":2},"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:6d8b65719ccb4bac55ca2671070b9e8c9e1abd9be4e3a40ce0e2a0a57d40be25","target":"record","created_at":"2026-05-18T00:45:05Z","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":"3faeae5ce7029f915ecb066b08c20ad9c3bb41ce14f8c06a3a881f1dbc92b7bb","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-01T19:33:27Z","title_canon_sha256":"43e0c5c0d40717972cb4f14bf69665510cbb2ee4dba27c57300676d4ab62ff54"},"schema_version":"1.0","source":{"id":"1705.00678","kind":"arxiv","version":2}},"canonical_sha256":"319b8d3b6ff22a6ccc04d9c5b97d5699655012b52993cdd3592df6e51dcdff9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"319b8d3b6ff22a6ccc04d9c5b97d5699655012b52993cdd3592df6e51dcdff9c","first_computed_at":"2026-05-18T00:45:05.927559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:05.927559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XXYGICZaG+89bRRuDRSJt5QaYFVtLxyuFHbLHa31pkQVavGlKx53AWHky4dnItJarjXJcLgDinvT4QkxtiQjDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:05.927989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.00678","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d8b65719ccb4bac55ca2671070b9e8c9e1abd9be4e3a40ce0e2a0a57d40be25","sha256:a255c31a027bc9e8b19f6d58d3a458038da4f1b6852f7390b14d5e46404c5cb2"],"state_sha256":"e73d6bb7a226f9ad6c4ea63419258221a7caa9150732db8601e1f2f1e722d6cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GmMQdcFK3kOg/uc1fBquBQI0PTqHs78PwNG5uUTcv/PmxGWAw9anH4JsJE9hwPqKF3re/JhdykSKq6R/bSoJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:15:07.031632Z","bundle_sha256":"f899302d616c9a8adc3d99eb0a6540902ab2eb5dd23bd949c3aa90dc7a786944"}}