{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:SZO3ZYFY7FJIOVB6VHQRXOP2RZ","short_pith_number":"pith:SZO3ZYFY","schema_version":"1.0","canonical_sha256":"965dbce0b8f95287543ea9e11bb9fa8e562ea40ca21eb5ebf56817e3ed8cf690","source":{"kind":"arxiv","id":"2001.00801","version":3},"attestation_state":"computed","paper":{"title":"Scalability and robustness of spectral embedding: landmark diffusion is all you need","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Chao Shen, Hau-Tieng Wu","submitted_at":"2020-01-03T12:27:26Z","abstract_excerpt":"While spectral embedding is a widely applied dimension reduction technique in various fields, so far it is still challenging to make it scalable to handle ``big data''. On the other hand, the robustness property is less explored and there exists only limited theoretical results. Motivated by the need of handling such data, recently we proposed a novel spectral embedding algorithm, which we coined Robust and Scalable Embedding via Landmark Diffusion (ROSELAND). In short, we measure the affinity between two points via a set of landmarks, which is composed of a small number of points, and ``diffu"},"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":"2001.00801","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2020-01-03T12:27:26Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"28294b6e95c4d5374bb21968eafe041a72b5e8f6c6279b707565b4b7c7d289e3","abstract_canon_sha256":"84f01ab772c6d04f16db7b959c9843ee750d40109a852cc6900206fb3f897cea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:30:36.413519Z","signature_b64":"LFWTfjFY07K9lfs9QyQtQ98qYl2rB3nwh6GyK7qFgjK4nRDIE7aEP5c6lUD7y/cDQbOe7gCuLfBC1UfCJynNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"965dbce0b8f95287543ea9e11bb9fa8e562ea40ca21eb5ebf56817e3ed8cf690","last_reissued_at":"2026-07-05T04:30:36.413174Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:30:36.413174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalability and robustness of spectral embedding: landmark diffusion is all you need","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Chao Shen, Hau-Tieng Wu","submitted_at":"2020-01-03T12:27:26Z","abstract_excerpt":"While spectral embedding is a widely applied dimension reduction technique in various fields, so far it is still challenging to make it scalable to handle ``big data''. On the other hand, the robustness property is less explored and there exists only limited theoretical results. Motivated by the need of handling such data, recently we proposed a novel spectral embedding algorithm, which we coined Robust and Scalable Embedding via Landmark Diffusion (ROSELAND). In short, we measure the affinity between two points via a set of landmarks, which is composed of a small number of points, and ``diffu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.00801","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.00801/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2001.00801","created_at":"2026-07-05T04:30:36.413228+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.00801v3","created_at":"2026-07-05T04:30:36.413228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.00801","created_at":"2026-07-05T04:30:36.413228+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZO3ZYFY7FJI","created_at":"2026-07-05T04:30:36.413228+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZO3ZYFY7FJIOVB6","created_at":"2026-07-05T04:30:36.413228+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZO3ZYFY","created_at":"2026-07-05T04:30:36.413228+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SZO3ZYFY7FJIOVB6VHQRXOP2RZ","json":"https://pith.science/pith/SZO3ZYFY7FJIOVB6VHQRXOP2RZ.json","graph_json":"https://pith.science/api/pith-number/SZO3ZYFY7FJIOVB6VHQRXOP2RZ/graph.json","events_json":"https://pith.science/api/pith-number/SZO3ZYFY7FJIOVB6VHQRXOP2RZ/events.json","paper":"https://pith.science/paper/SZO3ZYFY"},"agent_actions":{"view_html":"https://pith.science/pith/SZO3ZYFY7FJIOVB6VHQRXOP2RZ","download_json":"https://pith.science/pith/SZO3ZYFY7FJIOVB6VHQRXOP2RZ.json","view_paper":"https://pith.science/paper/SZO3ZYFY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.00801&json=true","fetch_graph":"https://pith.science/api/pith-number/SZO3ZYFY7FJIOVB6VHQRXOP2RZ/graph.json","fetch_events":"https://pith.science/api/pith-number/SZO3ZYFY7FJIOVB6VHQRXOP2RZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZO3ZYFY7FJIOVB6VHQRXOP2RZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZO3ZYFY7FJIOVB6VHQRXOP2RZ/action/storage_attestation","attest_author":"https://pith.science/pith/SZO3ZYFY7FJIOVB6VHQRXOP2RZ/action/author_attestation","sign_citation":"https://pith.science/pith/SZO3ZYFY7FJIOVB6VHQRXOP2RZ/action/citation_signature","submit_replication":"https://pith.science/pith/SZO3ZYFY7FJIOVB6VHQRXOP2RZ/action/replication_record"}},"created_at":"2026-07-05T04:30:36.413228+00:00","updated_at":"2026-07-05T04:30:36.413228+00:00"}