{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2ZZUTFAR5BM2USJQH65LWSCABV","short_pith_number":"pith:2ZZUTFAR","schema_version":"1.0","canonical_sha256":"d673499411e859aa49303fbabb48400d407929f5f2de8a3cc3756468554ad237","source":{"kind":"arxiv","id":"1512.07349","version":4},"attestation_state":"computed","paper":{"title":"Incremental Method for Spectral Clustering of Increasing Orders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.ML"],"primary_cat":"cs.SI","authors_text":"Alfred O. Hero, Baichuan Zhang, Mohammad Al Hasan, Pin-Yu Chen","submitted_at":"2015-12-23T03:55:24Z","abstract_excerpt":"The smallest eigenvalues and the associated eigenvectors (i.e., eigenpairs) of a graph Laplacian matrix have been widely used for spectral clustering and community detection. However, in real-life applications the number of clusters or communities (say, $K$) is generally unknown a-priori. Consequently, the majority of the existing methods either choose $K$ heuristically or they repeat the clustering method with different choices of $K$ and accept the best clustering result. The first option, more often, yields suboptimal result, while the second option is computationally expensive. In this wor"},"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":"1512.07349","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-12-23T03:55:24Z","cross_cats_sorted":["cs.NA","stat.ML"],"title_canon_sha256":"46a41b3c38d98e1a2e47dad47a0f7c05583f6354b8fd7a71b60721b481b3b353","abstract_canon_sha256":"d4cb3e43247909417cf078ca4ce5eb7f30d4fd1b7f590d2ec24f543e88ed2bb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:21.549180Z","signature_b64":"L7ocEGfVvFVsT4w6hE7tIYa3LE6/+h/0a2UNiXHoRvYifibYBO2o3gowUusQjbc6xilYAOBmI0zeu5A3F15aDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d673499411e859aa49303fbabb48400d407929f5f2de8a3cc3756468554ad237","last_reissued_at":"2026-05-18T00:25:21.548725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:21.548725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incremental Method for Spectral Clustering of Increasing Orders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.ML"],"primary_cat":"cs.SI","authors_text":"Alfred O. Hero, Baichuan Zhang, Mohammad Al Hasan, Pin-Yu Chen","submitted_at":"2015-12-23T03:55:24Z","abstract_excerpt":"The smallest eigenvalues and the associated eigenvectors (i.e., eigenpairs) of a graph Laplacian matrix have been widely used for spectral clustering and community detection. However, in real-life applications the number of clusters or communities (say, $K$) is generally unknown a-priori. Consequently, the majority of the existing methods either choose $K$ heuristically or they repeat the clustering method with different choices of $K$ and accept the best clustering result. The first option, more often, yields suboptimal result, while the second option is computationally expensive. In this wor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07349","kind":"arxiv","version":4},"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":"1512.07349","created_at":"2026-05-18T00:25:21.548795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.07349v4","created_at":"2026-05-18T00:25:21.548795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07349","created_at":"2026-05-18T00:25:21.548795+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ZZUTFAR5BM2","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ZZUTFAR5BM2USJQ","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ZZUTFAR","created_at":"2026-05-18T12:29:02.477457+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/2ZZUTFAR5BM2USJQH65LWSCABV","json":"https://pith.science/pith/2ZZUTFAR5BM2USJQH65LWSCABV.json","graph_json":"https://pith.science/api/pith-number/2ZZUTFAR5BM2USJQH65LWSCABV/graph.json","events_json":"https://pith.science/api/pith-number/2ZZUTFAR5BM2USJQH65LWSCABV/events.json","paper":"https://pith.science/paper/2ZZUTFAR"},"agent_actions":{"view_html":"https://pith.science/pith/2ZZUTFAR5BM2USJQH65LWSCABV","download_json":"https://pith.science/pith/2ZZUTFAR5BM2USJQH65LWSCABV.json","view_paper":"https://pith.science/paper/2ZZUTFAR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.07349&json=true","fetch_graph":"https://pith.science/api/pith-number/2ZZUTFAR5BM2USJQH65LWSCABV/graph.json","fetch_events":"https://pith.science/api/pith-number/2ZZUTFAR5BM2USJQH65LWSCABV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ZZUTFAR5BM2USJQH65LWSCABV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ZZUTFAR5BM2USJQH65LWSCABV/action/storage_attestation","attest_author":"https://pith.science/pith/2ZZUTFAR5BM2USJQH65LWSCABV/action/author_attestation","sign_citation":"https://pith.science/pith/2ZZUTFAR5BM2USJQH65LWSCABV/action/citation_signature","submit_replication":"https://pith.science/pith/2ZZUTFAR5BM2USJQH65LWSCABV/action/replication_record"}},"created_at":"2026-05-18T00:25:21.548795+00:00","updated_at":"2026-05-18T00:25:21.548795+00:00"}