{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ODB5M6LJ4QGWICPILRDZ3O6C4A","short_pith_number":"pith:ODB5M6LJ","schema_version":"1.0","canonical_sha256":"70c3d67969e40d6409e85c479dbbc2e03016fcc28ada10cbe8631fe6091a38f3","source":{"kind":"arxiv","id":"1510.08110","version":1},"attestation_state":"computed","paper":{"title":"Spectral Convergence Rate of Graph Laplacian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Xu Wang","submitted_at":"2015-10-27T22:05:30Z","abstract_excerpt":"Laplacian Eigenvectors of the graph constructed from a data set are used in many spectral manifold learning algorithms such as diffusion maps and spectral clustering. Given a graph constructed from a random sample of a $d$-dimensional compact submanifold $M$ in $\\mathbb{R}^D$, we establish the spectral convergence rate of the graph Laplacian. It implies the consistency of the spectral clustering algorithm via a standard perturbation argument. A simple numerical study indicates the necessity of a denoising step before applying spectral algorithms."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1510.08110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-10-27T22:05:30Z","cross_cats_sorted":[],"title_canon_sha256":"f8175325b6e71ff83305f9f226d4669fdacf40e0a172738e365691d72537f4cf","abstract_canon_sha256":"cd5b844ade3656ed50387f101ee3ea2d9d459399507d671746eb229254b36c78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:37.445821Z","signature_b64":"JR/lYL9oA+PooL8f1UuXxz0A0I/Yd8w467Hxu2t/kpc7aNN2UzVJ+i2V+jIcNC26mB6Q66B2+mpPqxr249FNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70c3d67969e40d6409e85c479dbbc2e03016fcc28ada10cbe8631fe6091a38f3","last_reissued_at":"2026-05-18T01:28:37.445059Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:37.445059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral Convergence Rate of Graph Laplacian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Xu Wang","submitted_at":"2015-10-27T22:05:30Z","abstract_excerpt":"Laplacian Eigenvectors of the graph constructed from a data set are used in many spectral manifold learning algorithms such as diffusion maps and spectral clustering. Given a graph constructed from a random sample of a $d$-dimensional compact submanifold $M$ in $\\mathbb{R}^D$, we establish the spectral convergence rate of the graph Laplacian. It implies the consistency of the spectral clustering algorithm via a standard perturbation argument. A simple numerical study indicates the necessity of a denoising step before applying spectral algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08110","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.08110","created_at":"2026-05-18T01:28:37.445188+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.08110v1","created_at":"2026-05-18T01:28:37.445188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08110","created_at":"2026-05-18T01:28:37.445188+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODB5M6LJ4QGW","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODB5M6LJ4QGWICPI","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODB5M6LJ","created_at":"2026-05-18T12:29:34.919912+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.03992","citing_title":"How well behaved is finite dimensional Diffusion Maps?","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ODB5M6LJ4QGWICPILRDZ3O6C4A","json":"https://pith.science/pith/ODB5M6LJ4QGWICPILRDZ3O6C4A.json","graph_json":"https://pith.science/api/pith-number/ODB5M6LJ4QGWICPILRDZ3O6C4A/graph.json","events_json":"https://pith.science/api/pith-number/ODB5M6LJ4QGWICPILRDZ3O6C4A/events.json","paper":"https://pith.science/paper/ODB5M6LJ"},"agent_actions":{"view_html":"https://pith.science/pith/ODB5M6LJ4QGWICPILRDZ3O6C4A","download_json":"https://pith.science/pith/ODB5M6LJ4QGWICPILRDZ3O6C4A.json","view_paper":"https://pith.science/paper/ODB5M6LJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.08110&json=true","fetch_graph":"https://pith.science/api/pith-number/ODB5M6LJ4QGWICPILRDZ3O6C4A/graph.json","fetch_events":"https://pith.science/api/pith-number/ODB5M6LJ4QGWICPILRDZ3O6C4A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODB5M6LJ4QGWICPILRDZ3O6C4A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODB5M6LJ4QGWICPILRDZ3O6C4A/action/storage_attestation","attest_author":"https://pith.science/pith/ODB5M6LJ4QGWICPILRDZ3O6C4A/action/author_attestation","sign_citation":"https://pith.science/pith/ODB5M6LJ4QGWICPILRDZ3O6C4A/action/citation_signature","submit_replication":"https://pith.science/pith/ODB5M6LJ4QGWICPILRDZ3O6C4A/action/replication_record"}},"created_at":"2026-05-18T01:28:37.445188+00:00","updated_at":"2026-05-18T01:28:37.445188+00:00"}