{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YX5L5S2J5BCEHPXI33Q5QC2HP3","short_pith_number":"pith:YX5L5S2J","schema_version":"1.0","canonical_sha256":"c5fabecb49e84443bee8dee1d80b477edae6ac22ad46d5dd5df69340a4eacf17","source":{"kind":"arxiv","id":"2105.00987","version":2},"attestation_state":"computed","paper":{"title":"Spectral clustering under degree heterogeneity: a case for the random walk Laplacian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Alexander Modell, Patrick Rubin-Delanchy","submitted_at":"2021-05-03T16:36:27Z","abstract_excerpt":"This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. Under a generalised random dot product graph, the embedding provides uniformly consistent estimates of degree-corrected latent positions, with asymptotically Gaussian error. In the special case of a degree-corrected stochastic block model, the embedding concentrates about K distinct points, representing communities. These can be recovered perfectly, asymptotically, through a subsequent clustering step, without spherical projection, as co"},"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":"2105.00987","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2021-05-03T16:36:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"be49b5e50a28d9d65a712af85f382fd25c7a0aa5c69cd6be5ccb3f529f2c7834","abstract_canon_sha256":"c5f1168079e092d65481573781208cb2ab43b835022c638f3b9b52da0e765b41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:37:13.271811Z","signature_b64":"9NF7LTNgkNe3srO3o64kmmzkKY5HfqmTmSmyo/Br8gyiaq++AoIbXGfZ9BBzCrU4xED08s4xYx0W0787U7uQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5fabecb49e84443bee8dee1d80b477edae6ac22ad46d5dd5df69340a4eacf17","last_reissued_at":"2026-07-05T02:37:13.271338Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:37:13.271338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral clustering under degree heterogeneity: a case for the random walk Laplacian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Alexander Modell, Patrick Rubin-Delanchy","submitted_at":"2021-05-03T16:36:27Z","abstract_excerpt":"This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. Under a generalised random dot product graph, the embedding provides uniformly consistent estimates of degree-corrected latent positions, with asymptotically Gaussian error. In the special case of a degree-corrected stochastic block model, the embedding concentrates about K distinct points, representing communities. These can be recovered perfectly, asymptotically, through a subsequent clustering step, without spherical projection, as co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.00987","kind":"arxiv","version":2},"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/2105.00987/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":"2105.00987","created_at":"2026-07-05T02:37:13.271397+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.00987v2","created_at":"2026-07-05T02:37:13.271397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.00987","created_at":"2026-07-05T02:37:13.271397+00:00"},{"alias_kind":"pith_short_12","alias_value":"YX5L5S2J5BCE","created_at":"2026-07-05T02:37:13.271397+00:00"},{"alias_kind":"pith_short_16","alias_value":"YX5L5S2J5BCEHPXI","created_at":"2026-07-05T02:37:13.271397+00:00"},{"alias_kind":"pith_short_8","alias_value":"YX5L5S2J","created_at":"2026-07-05T02:37:13.271397+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.22346","citing_title":"The ASE-LSE Disagreement Landscape: An End-to-End Characterisation of Extremes and Structural Drivers","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.22346","citing_title":"The ASE-LSE Disagreement Landscape: An End-to-End Characterisation of Extremes and Structural Drivers","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YX5L5S2J5BCEHPXI33Q5QC2HP3","json":"https://pith.science/pith/YX5L5S2J5BCEHPXI33Q5QC2HP3.json","graph_json":"https://pith.science/api/pith-number/YX5L5S2J5BCEHPXI33Q5QC2HP3/graph.json","events_json":"https://pith.science/api/pith-number/YX5L5S2J5BCEHPXI33Q5QC2HP3/events.json","paper":"https://pith.science/paper/YX5L5S2J"},"agent_actions":{"view_html":"https://pith.science/pith/YX5L5S2J5BCEHPXI33Q5QC2HP3","download_json":"https://pith.science/pith/YX5L5S2J5BCEHPXI33Q5QC2HP3.json","view_paper":"https://pith.science/paper/YX5L5S2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.00987&json=true","fetch_graph":"https://pith.science/api/pith-number/YX5L5S2J5BCEHPXI33Q5QC2HP3/graph.json","fetch_events":"https://pith.science/api/pith-number/YX5L5S2J5BCEHPXI33Q5QC2HP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YX5L5S2J5BCEHPXI33Q5QC2HP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YX5L5S2J5BCEHPXI33Q5QC2HP3/action/storage_attestation","attest_author":"https://pith.science/pith/YX5L5S2J5BCEHPXI33Q5QC2HP3/action/author_attestation","sign_citation":"https://pith.science/pith/YX5L5S2J5BCEHPXI33Q5QC2HP3/action/citation_signature","submit_replication":"https://pith.science/pith/YX5L5S2J5BCEHPXI33Q5QC2HP3/action/replication_record"}},"created_at":"2026-07-05T02:37:13.271397+00:00","updated_at":"2026-07-05T02:37:13.271397+00:00"}