{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KHE4CKQ5NLGXW5NPCLFTCQIPEY","short_pith_number":"pith:KHE4CKQ5","canonical_record":{"source":{"id":"1411.2021","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-07T20:23:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"665a86556386cc40c6b54094abbc42717c03582df8045844686899e9dbebd3ca","abstract_canon_sha256":"a34f06853dcef6c5e66e3d9f7cbfe2a63ab99f044d3b08318ee7c9b248f3788c"},"schema_version":"1.0"},"canonical_sha256":"51c9c12a1d6acd7b75af12cb31410f261545e75f00956f26961d09f1cb238f11","source":{"kind":"arxiv","id":"1411.2021","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2021","created_at":"2026-05-18T00:51:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2021v3","created_at":"2026-05-18T00:51:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2021","created_at":"2026-05-18T00:51:52Z"},{"alias_kind":"pith_short_12","alias_value":"KHE4CKQ5NLGX","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KHE4CKQ5NLGXW5NP","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KHE4CKQ5","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KHE4CKQ5NLGXW5NPCLFTCQIPEY","target":"record","payload":{"canonical_record":{"source":{"id":"1411.2021","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-07T20:23:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"665a86556386cc40c6b54094abbc42717c03582df8045844686899e9dbebd3ca","abstract_canon_sha256":"a34f06853dcef6c5e66e3d9f7cbfe2a63ab99f044d3b08318ee7c9b248f3788c"},"schema_version":"1.0"},"canonical_sha256":"51c9c12a1d6acd7b75af12cb31410f261545e75f00956f26961d09f1cb238f11","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:52.474276Z","signature_b64":"0rGqmCki/CpSujMTBQNng5YJzY+8oWWYSgWI+EtYTrT+Pat+tl2Pu5AcW/y9zQE3N7nuwtEFE17sAP7yKL2bCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51c9c12a1d6acd7b75af12cb31410f261545e75f00956f26961d09f1cb238f11","last_reissued_at":"2026-05-18T00:51:52.473710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:52.473710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.2021","source_version":3,"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:51:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gLjkX4oyiwouoQn3Uj++SXY9699DvmPlLtRmu+8BHySMNIXnm1n7SLRk20Cl1q/bQ2en4BFxJR2RpgOwsJQ5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T22:59:40.243502Z"},"content_sha256":"c1211d8b62e7c235f6c098548b239781c090a272dbaaf309f8313bf6489372a1","schema_version":"1.0","event_id":"sha256:c1211d8b62e7c235f6c098548b239781c090a272dbaaf309f8313bf6489372a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KHE4CKQ5NLGXW5NPCLFTCQIPEY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partitioning Well-Clustered Graphs: Spectral Clustering Works!","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"He Sun, Luca Zanetti, Richard Peng","submitted_at":"2014-11-07T20:23:50Z","abstract_excerpt":"In this paper we study variants of the widely used spectral clustering that partitions a graph into k clusters by (1) embedding the vertices of a graph into a low-dimensional space using the bottom eigenvectors of the Laplacian matrix, and (2) grouping the embedded points into k clusters via k-means algorithms. We show that, for a wide class of graphs, spectral clustering gives a good approximation of the optimal clustering. While this approach was proposed in the early 1990s and has comprehensive applications, prior to our work similar results were known only for graphs generated from stochas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2021","kind":"arxiv","version":3},"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:51:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Nrl2c/XGfkJTqkpx7GmA3BZ3hr9rED1E5Up8TwRecSuUWyH9SOf5qPiIOjYA5I+ShAHDiWN7bPON7FnG2+nCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T22:59:40.243861Z"},"content_sha256":"1290fbaebbd94d09ab1a228e492866dc95a9a5cf332fe262cc128a235b0585dd","schema_version":"1.0","event_id":"sha256:1290fbaebbd94d09ab1a228e492866dc95a9a5cf332fe262cc128a235b0585dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHE4CKQ5NLGXW5NPCLFTCQIPEY/bundle.json","state_url":"https://pith.science/pith/KHE4CKQ5NLGXW5NPCLFTCQIPEY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHE4CKQ5NLGXW5NPCLFTCQIPEY/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-07-01T22:59:40Z","links":{"resolver":"https://pith.science/pith/KHE4CKQ5NLGXW5NPCLFTCQIPEY","bundle":"https://pith.science/pith/KHE4CKQ5NLGXW5NPCLFTCQIPEY/bundle.json","state":"https://pith.science/pith/KHE4CKQ5NLGXW5NPCLFTCQIPEY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHE4CKQ5NLGXW5NPCLFTCQIPEY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KHE4CKQ5NLGXW5NPCLFTCQIPEY","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":"a34f06853dcef6c5e66e3d9f7cbfe2a63ab99f044d3b08318ee7c9b248f3788c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-07T20:23:50Z","title_canon_sha256":"665a86556386cc40c6b54094abbc42717c03582df8045844686899e9dbebd3ca"},"schema_version":"1.0","source":{"id":"1411.2021","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2021","created_at":"2026-05-18T00:51:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2021v3","created_at":"2026-05-18T00:51:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2021","created_at":"2026-05-18T00:51:52Z"},{"alias_kind":"pith_short_12","alias_value":"KHE4CKQ5NLGX","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KHE4CKQ5NLGXW5NP","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KHE4CKQ5","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:1290fbaebbd94d09ab1a228e492866dc95a9a5cf332fe262cc128a235b0585dd","target":"graph","created_at":"2026-05-18T00:51:52Z","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":"In this paper we study variants of the widely used spectral clustering that partitions a graph into k clusters by (1) embedding the vertices of a graph into a low-dimensional space using the bottom eigenvectors of the Laplacian matrix, and (2) grouping the embedded points into k clusters via k-means algorithms. We show that, for a wide class of graphs, spectral clustering gives a good approximation of the optimal clustering. While this approach was proposed in the early 1990s and has comprehensive applications, prior to our work similar results were known only for graphs generated from stochas","authors_text":"He Sun, Luca Zanetti, Richard Peng","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-07T20:23:50Z","title":"Partitioning Well-Clustered Graphs: Spectral Clustering Works!"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2021","kind":"arxiv","version":3},"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:c1211d8b62e7c235f6c098548b239781c090a272dbaaf309f8313bf6489372a1","target":"record","created_at":"2026-05-18T00:51:52Z","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":"a34f06853dcef6c5e66e3d9f7cbfe2a63ab99f044d3b08318ee7c9b248f3788c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-07T20:23:50Z","title_canon_sha256":"665a86556386cc40c6b54094abbc42717c03582df8045844686899e9dbebd3ca"},"schema_version":"1.0","source":{"id":"1411.2021","kind":"arxiv","version":3}},"canonical_sha256":"51c9c12a1d6acd7b75af12cb31410f261545e75f00956f26961d09f1cb238f11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51c9c12a1d6acd7b75af12cb31410f261545e75f00956f26961d09f1cb238f11","first_computed_at":"2026-05-18T00:51:52.473710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:52.473710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0rGqmCki/CpSujMTBQNng5YJzY+8oWWYSgWI+EtYTrT+Pat+tl2Pu5AcW/y9zQE3N7nuwtEFE17sAP7yKL2bCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:52.474276Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.2021","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1211d8b62e7c235f6c098548b239781c090a272dbaaf309f8313bf6489372a1","sha256:1290fbaebbd94d09ab1a228e492866dc95a9a5cf332fe262cc128a235b0585dd"],"state_sha256":"11cf17b55b4f39746d3017a3afc9492c40b1209be2fe40b1e25d2f0c40d17f4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"57E5+2/v1uz++F1sjZGkiDh9ZUMv7M70FPrIml5jcq8ikDqUkgfz6Qn7EzpF6zWlT+7bShBsaEKTNjU43nG6Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T22:59:40.245924Z","bundle_sha256":"f3c222696440fdd338ccba31d0732d207604074958f83bdf16fc0d7d630f1735"}}