{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GPW2H3HK3BZMGUZM3LCB5K4QYJ","short_pith_number":"pith:GPW2H3HK","canonical_record":{"source":{"id":"1711.04258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-12T09:20:25Z","cross_cats_sorted":["cs.AI","cs.CV","cs.MM","stat.ML"],"title_canon_sha256":"a6b220276c27560e2d810a2bd6c71b777beb6173f3f5776679b2011780a696d0","abstract_canon_sha256":"a336907cf53592ee9c198396362c0e15f92247c360e9ebb20090d0b3fcea9404"},"schema_version":"1.0"},"canonical_sha256":"33eda3ecead872c3532cdac41eab90c25265f60a876e9321bc9736f161d69e17","source":{"kind":"arxiv","id":"1711.04258","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04258","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04258v1","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04258","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"pith_short_12","alias_value":"GPW2H3HK3BZM","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GPW2H3HK3BZMGUZM","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GPW2H3HK","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GPW2H3HK3BZMGUZM3LCB5K4QYJ","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-12T09:20:25Z","cross_cats_sorted":["cs.AI","cs.CV","cs.MM","stat.ML"],"title_canon_sha256":"a6b220276c27560e2d810a2bd6c71b777beb6173f3f5776679b2011780a696d0","abstract_canon_sha256":"a336907cf53592ee9c198396362c0e15f92247c360e9ebb20090d0b3fcea9404"},"schema_version":"1.0"},"canonical_sha256":"33eda3ecead872c3532cdac41eab90c25265f60a876e9321bc9736f161d69e17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:39.583892Z","signature_b64":"mxAJcBmioL4FGVhA/ttxxZAHcN8kk/co8xlG3smrHKIBi94rrX0IaSxfnz8UmK0+XvFFI/ojgqOnMhwugUUxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33eda3ecead872c3532cdac41eab90c25265f60a876e9321bc9736f161d69e17","last_reissued_at":"2026-05-18T00:30:39.583143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:39.583143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04258","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:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qzhAC88arzN514pGZsGg374eI/G0YlSocOJT2zxlg9NSz7I56wC2D1eSkDvITI2z23sFOhHsXS+6ogWVhxlwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:56:42.755818Z"},"content_sha256":"18b0462ddd4cf8156995f5de0b87b542790fc600458961feb07dff9bbf9844dc","schema_version":"1.0","event_id":"sha256:18b0462ddd4cf8156995f5de0b87b542790fc600458961feb07dff9bbf9844dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GPW2H3HK3BZMGUZM3LCB5K4QYJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unified Spectral Clustering with Optimal Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.MM","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chong Peng, Qiang Cheng, Zenglin Xu, Zhao Kang","submitted_at":"2017-11-12T09:20:25Z","abstract_excerpt":"Spectral clustering has found extensive use in many areas. Most traditional spectral clustering algorithms work in three separate steps: similarity graph construction; continuous labels learning; discretizing the learned labels by k-means clustering. Such common practice has two potential flaws, which may lead to severe information loss and performance degradation. First, predefined similarity graph might not be optimal for subsequent clustering. It is well-accepted that similarity graph highly affects the clustering results. To this end, we propose to automatically learn similarity informatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04258","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:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J3VFIxEe4Un3qalJ8aybFYoYHkWld+bVdk9pemShTaNfSMlxbBEFpVBotB79nG+3yiVVk0RNcUaRjvs4F8sXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:56:42.756170Z"},"content_sha256":"94b3c7f710c64be6e99d8a6ecabca08a9df983dd673a37882f01056a6b777cc4","schema_version":"1.0","event_id":"sha256:94b3c7f710c64be6e99d8a6ecabca08a9df983dd673a37882f01056a6b777cc4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GPW2H3HK3BZMGUZM3LCB5K4QYJ/bundle.json","state_url":"https://pith.science/pith/GPW2H3HK3BZMGUZM3LCB5K4QYJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GPW2H3HK3BZMGUZM3LCB5K4QYJ/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-09T14:56:42Z","links":{"resolver":"https://pith.science/pith/GPW2H3HK3BZMGUZM3LCB5K4QYJ","bundle":"https://pith.science/pith/GPW2H3HK3BZMGUZM3LCB5K4QYJ/bundle.json","state":"https://pith.science/pith/GPW2H3HK3BZMGUZM3LCB5K4QYJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GPW2H3HK3BZMGUZM3LCB5K4QYJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GPW2H3HK3BZMGUZM3LCB5K4QYJ","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":"a336907cf53592ee9c198396362c0e15f92247c360e9ebb20090d0b3fcea9404","cross_cats_sorted":["cs.AI","cs.CV","cs.MM","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-12T09:20:25Z","title_canon_sha256":"a6b220276c27560e2d810a2bd6c71b777beb6173f3f5776679b2011780a696d0"},"schema_version":"1.0","source":{"id":"1711.04258","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04258","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04258v1","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04258","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"pith_short_12","alias_value":"GPW2H3HK3BZM","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GPW2H3HK3BZMGUZM","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GPW2H3HK","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:94b3c7f710c64be6e99d8a6ecabca08a9df983dd673a37882f01056a6b777cc4","target":"graph","created_at":"2026-05-18T00:30:39Z","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":"Spectral clustering has found extensive use in many areas. Most traditional spectral clustering algorithms work in three separate steps: similarity graph construction; continuous labels learning; discretizing the learned labels by k-means clustering. Such common practice has two potential flaws, which may lead to severe information loss and performance degradation. First, predefined similarity graph might not be optimal for subsequent clustering. It is well-accepted that similarity graph highly affects the clustering results. To this end, we propose to automatically learn similarity informatio","authors_text":"Chong Peng, Qiang Cheng, Zenglin Xu, Zhao Kang","cross_cats":["cs.AI","cs.CV","cs.MM","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-12T09:20:25Z","title":"Unified Spectral Clustering with Optimal Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04258","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:18b0462ddd4cf8156995f5de0b87b542790fc600458961feb07dff9bbf9844dc","target":"record","created_at":"2026-05-18T00:30:39Z","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":"a336907cf53592ee9c198396362c0e15f92247c360e9ebb20090d0b3fcea9404","cross_cats_sorted":["cs.AI","cs.CV","cs.MM","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-12T09:20:25Z","title_canon_sha256":"a6b220276c27560e2d810a2bd6c71b777beb6173f3f5776679b2011780a696d0"},"schema_version":"1.0","source":{"id":"1711.04258","kind":"arxiv","version":1}},"canonical_sha256":"33eda3ecead872c3532cdac41eab90c25265f60a876e9321bc9736f161d69e17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33eda3ecead872c3532cdac41eab90c25265f60a876e9321bc9736f161d69e17","first_computed_at":"2026-05-18T00:30:39.583143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:39.583143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mxAJcBmioL4FGVhA/ttxxZAHcN8kk/co8xlG3smrHKIBi94rrX0IaSxfnz8UmK0+XvFFI/ojgqOnMhwugUUxBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:39.583892Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04258","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18b0462ddd4cf8156995f5de0b87b542790fc600458961feb07dff9bbf9844dc","sha256:94b3c7f710c64be6e99d8a6ecabca08a9df983dd673a37882f01056a6b777cc4"],"state_sha256":"2e8b7496390b29e5118f60f396aaaf7586fc73760ae3d7b18c2b7670c77fb29a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HQtbreFYHq02mqiqL0Q97GOvS+kGe4LqcnGKiNGWw0vHDrtIS5Ef1QAK4QCkj8rIHzmuF1xo2022Zc6JTs4KBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:56:42.758051Z","bundle_sha256":"edffed61c5b4aa2f60f75125879ae416d6b62a2ad9781417cb13517bcf86c26d"}}