{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DHKQVOFG3LZ3ELQ7CNHZ77DACH","short_pith_number":"pith:DHKQVOFG","schema_version":"1.0","canonical_sha256":"19d50ab8a6daf3b22e1f134f9ffc6011ed8e907086dd6a3094ace7730d02703c","source":{"kind":"arxiv","id":"1406.1880","version":2},"attestation_state":"computed","paper":{"title":"Spectral Clustering of Graphs with the Bethe Hessian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph","stat.ML"],"primary_cat":"cond-mat.dis-nn","authors_text":"Alaa Saade, Florent Krzakala, Lenka Zdeborov\\'a","submitted_at":"2014-06-07T10:03:12Z","abstract_excerpt":"Spectral clustering is a standard approach to label nodes on a graph by studying the (largest or lowest) eigenvalues of a symmetric real matrix such as e.g. the adjacency or the Laplacian. Recently, it has been argued that using instead a more complicated, non-symmetric and higher dimensional operator, related to the non-backtracking walk on the graph, leads to improved performance in detecting clusters, and even to optimal performance for the stochastic block model. Here, we propose to use instead a simpler object, a symmetric real matrix known as the Bethe Hessian operator, or deformed Lapla"},"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":"1406.1880","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2014-06-07T10:03:12Z","cross_cats_sorted":["cs.SI","physics.soc-ph","stat.ML"],"title_canon_sha256":"ca1678035efca2fa5f8812526824cf2eeda30fbbffbcb61620f1d3133c241eaa","abstract_canon_sha256":"044be88fbd28c8c36adee456f974e1ae12b34c547cf73dbbfe72ae6052597916"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:33.792494Z","signature_b64":"QkDyRUdXkIdiPGMPXfXg1lFToLvN3JTM742glxDA5kddP6zplPAqHmTHalrJJq1twTNub4LqUUFuD+F/qi6TCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19d50ab8a6daf3b22e1f134f9ffc6011ed8e907086dd6a3094ace7730d02703c","last_reissued_at":"2026-05-18T02:17:33.791737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:33.791737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral Clustering of Graphs with the Bethe Hessian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph","stat.ML"],"primary_cat":"cond-mat.dis-nn","authors_text":"Alaa Saade, Florent Krzakala, Lenka Zdeborov\\'a","submitted_at":"2014-06-07T10:03:12Z","abstract_excerpt":"Spectral clustering is a standard approach to label nodes on a graph by studying the (largest or lowest) eigenvalues of a symmetric real matrix such as e.g. the adjacency or the Laplacian. Recently, it has been argued that using instead a more complicated, non-symmetric and higher dimensional operator, related to the non-backtracking walk on the graph, leads to improved performance in detecting clusters, and even to optimal performance for the stochastic block model. Here, we propose to use instead a simpler object, a symmetric real matrix known as the Bethe Hessian operator, or deformed Lapla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1880","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":""},"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":"1406.1880","created_at":"2026-05-18T02:17:33.791859+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.1880v2","created_at":"2026-05-18T02:17:33.791859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1880","created_at":"2026-05-18T02:17:33.791859+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHKQVOFG3LZ3","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHKQVOFG3LZ3ELQ7","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHKQVOFG","created_at":"2026-05-18T12:28:25.294606+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/DHKQVOFG3LZ3ELQ7CNHZ77DACH","json":"https://pith.science/pith/DHKQVOFG3LZ3ELQ7CNHZ77DACH.json","graph_json":"https://pith.science/api/pith-number/DHKQVOFG3LZ3ELQ7CNHZ77DACH/graph.json","events_json":"https://pith.science/api/pith-number/DHKQVOFG3LZ3ELQ7CNHZ77DACH/events.json","paper":"https://pith.science/paper/DHKQVOFG"},"agent_actions":{"view_html":"https://pith.science/pith/DHKQVOFG3LZ3ELQ7CNHZ77DACH","download_json":"https://pith.science/pith/DHKQVOFG3LZ3ELQ7CNHZ77DACH.json","view_paper":"https://pith.science/paper/DHKQVOFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.1880&json=true","fetch_graph":"https://pith.science/api/pith-number/DHKQVOFG3LZ3ELQ7CNHZ77DACH/graph.json","fetch_events":"https://pith.science/api/pith-number/DHKQVOFG3LZ3ELQ7CNHZ77DACH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHKQVOFG3LZ3ELQ7CNHZ77DACH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHKQVOFG3LZ3ELQ7CNHZ77DACH/action/storage_attestation","attest_author":"https://pith.science/pith/DHKQVOFG3LZ3ELQ7CNHZ77DACH/action/author_attestation","sign_citation":"https://pith.science/pith/DHKQVOFG3LZ3ELQ7CNHZ77DACH/action/citation_signature","submit_replication":"https://pith.science/pith/DHKQVOFG3LZ3ELQ7CNHZ77DACH/action/replication_record"}},"created_at":"2026-05-18T02:17:33.791859+00:00","updated_at":"2026-05-18T02:17:33.791859+00:00"}