{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AXX6KJK3P3RY7Z3OIIHDTZZ4P2","short_pith_number":"pith:AXX6KJK3","canonical_record":{"source":{"id":"1901.10204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-29T10:27:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8d0da1da74a4295f0bf558c669a6bd27c05106b1eeb4859cb0442fede876818f","abstract_canon_sha256":"afadd8af1557a70ea153309f53fec6e9ca4984fdd6759101a9b9fa51d9341ea0"},"schema_version":"1.0"},"canonical_sha256":"05efe5255b7ee38fe76e420e39e73c7e9302357ab26cf20cf57761eae884f164","source":{"kind":"arxiv","id":"1901.10204","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10204","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10204v1","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10204","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"pith_short_12","alias_value":"AXX6KJK3P3RY","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AXX6KJK3P3RY7Z3O","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AXX6KJK3","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AXX6KJK3P3RY7Z3OIIHDTZZ4P2","target":"record","payload":{"canonical_record":{"source":{"id":"1901.10204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-29T10:27:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8d0da1da74a4295f0bf558c669a6bd27c05106b1eeb4859cb0442fede876818f","abstract_canon_sha256":"afadd8af1557a70ea153309f53fec6e9ca4984fdd6759101a9b9fa51d9341ea0"},"schema_version":"1.0"},"canonical_sha256":"05efe5255b7ee38fe76e420e39e73c7e9302357ab26cf20cf57761eae884f164","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:15.859643Z","signature_b64":"jbMLru2X8c16dDbiKxQyYEvvr1/qin/Te4DyZQWUqyHRC4k/7ubYpJ6ZqNaH/uqxeTA/V2Rb60XEgfPvEml1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05efe5255b7ee38fe76e420e39e73c7e9302357ab26cf20cf57761eae884f164","last_reissued_at":"2026-05-17T23:55:15.859069Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:15.859069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.10204","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:55:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G9zasCXIc7zOWWixGXzxVw1fRRxtwMTywGdAXAh3+p+aDWNtUl/ACLKMuzmOt79thB8Wqu2/maCrP2/o/ofMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:41:54.591812Z"},"content_sha256":"ea21988e6a3c3a8a534637d897ee0f469cc849960867d6a88e5c5262a3012fed","schema_version":"1.0","event_id":"sha256:ea21988e6a3c3a8a534637d897ee0f469cc849960867d6a88e5c5262a3012fed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AXX6KJK3P3RY7Z3OIIHDTZZ4P2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Spectral Clustering via Sampling: a Review","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andreas Loukas, Nicolas Tremblay","submitted_at":"2019-01-29T10:27:30Z","abstract_excerpt":"Spectral clustering refers to a family of unsupervised learning algorithms that compute a spectral embedding of the original data based on the eigenvectors of a similarity graph. This non-linear transformation of the data is both the key of these algorithms' success and their Achilles heel: forming a graph and computing its dominant eigenvectors can indeed be computationally prohibitive when dealing with more that a few tens of thousands of points. In this paper, we review the principal research efforts aiming to reduce this computational cost. We focus on methods that come with a theoretical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10204","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:55:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4tC3XeDTQX/ZKDXFBNFZlR2tEEM0Cs4ubZH4EuwXimcyqeObroiJX8sZ5KJ8/71ewxv8/V6X9rkTXKnb4yJEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:41:54.592501Z"},"content_sha256":"74f447ff08d6f9a6373ce09baec75d3629e117841e0dc7251af384c2551902a2","schema_version":"1.0","event_id":"sha256:74f447ff08d6f9a6373ce09baec75d3629e117841e0dc7251af384c2551902a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AXX6KJK3P3RY7Z3OIIHDTZZ4P2/bundle.json","state_url":"https://pith.science/pith/AXX6KJK3P3RY7Z3OIIHDTZZ4P2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AXX6KJK3P3RY7Z3OIIHDTZZ4P2/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-05-27T14:41:54Z","links":{"resolver":"https://pith.science/pith/AXX6KJK3P3RY7Z3OIIHDTZZ4P2","bundle":"https://pith.science/pith/AXX6KJK3P3RY7Z3OIIHDTZZ4P2/bundle.json","state":"https://pith.science/pith/AXX6KJK3P3RY7Z3OIIHDTZZ4P2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AXX6KJK3P3RY7Z3OIIHDTZZ4P2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AXX6KJK3P3RY7Z3OIIHDTZZ4P2","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":"afadd8af1557a70ea153309f53fec6e9ca4984fdd6759101a9b9fa51d9341ea0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-29T10:27:30Z","title_canon_sha256":"8d0da1da74a4295f0bf558c669a6bd27c05106b1eeb4859cb0442fede876818f"},"schema_version":"1.0","source":{"id":"1901.10204","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10204","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10204v1","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10204","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"pith_short_12","alias_value":"AXX6KJK3P3RY","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AXX6KJK3P3RY7Z3O","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AXX6KJK3","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:74f447ff08d6f9a6373ce09baec75d3629e117841e0dc7251af384c2551902a2","target":"graph","created_at":"2026-05-17T23:55:15Z","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 refers to a family of unsupervised learning algorithms that compute a spectral embedding of the original data based on the eigenvectors of a similarity graph. This non-linear transformation of the data is both the key of these algorithms' success and their Achilles heel: forming a graph and computing its dominant eigenvectors can indeed be computationally prohibitive when dealing with more that a few tens of thousands of points. In this paper, we review the principal research efforts aiming to reduce this computational cost. We focus on methods that come with a theoretical ","authors_text":"Andreas Loukas, Nicolas Tremblay","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-29T10:27:30Z","title":"Approximating Spectral Clustering via Sampling: a Review"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10204","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:ea21988e6a3c3a8a534637d897ee0f469cc849960867d6a88e5c5262a3012fed","target":"record","created_at":"2026-05-17T23:55:15Z","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":"afadd8af1557a70ea153309f53fec6e9ca4984fdd6759101a9b9fa51d9341ea0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-29T10:27:30Z","title_canon_sha256":"8d0da1da74a4295f0bf558c669a6bd27c05106b1eeb4859cb0442fede876818f"},"schema_version":"1.0","source":{"id":"1901.10204","kind":"arxiv","version":1}},"canonical_sha256":"05efe5255b7ee38fe76e420e39e73c7e9302357ab26cf20cf57761eae884f164","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05efe5255b7ee38fe76e420e39e73c7e9302357ab26cf20cf57761eae884f164","first_computed_at":"2026-05-17T23:55:15.859069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:15.859069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jbMLru2X8c16dDbiKxQyYEvvr1/qin/Te4DyZQWUqyHRC4k/7ubYpJ6ZqNaH/uqxeTA/V2Rb60XEgfPvEml1Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:15.859643Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.10204","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea21988e6a3c3a8a534637d897ee0f469cc849960867d6a88e5c5262a3012fed","sha256:74f447ff08d6f9a6373ce09baec75d3629e117841e0dc7251af384c2551902a2"],"state_sha256":"db3a32e476a8b511323671e6adeaa3121babed1fe4ed36b0d4393ef997eafd95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ITitlM69SFliLlDPnmZx2RhSwkLXKAUA+kokCv7Kim+pMjyKdwaOllgNeVNwOqhaN6Ke3oeUUW9JClw5kgdtCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:41:54.596107Z","bundle_sha256":"55d43bb890746f61ead0150fdf74ea5e9e5dc6704b07167d5b44e4da9abd31ed"}}