{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:EBY3O3JYXLZCZ76DN5X7Y7NFHA","short_pith_number":"pith:EBY3O3JY","schema_version":"1.0","canonical_sha256":"2071b76d38baf22cffc36f6ffc7da53804cc5348db5c44129c371d4340e0cb8e","source":{"kind":"arxiv","id":"2004.03845","version":1},"attestation_state":"computed","paper":{"title":"Robust spectral clustering using LASSO regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Blaz\\`ere M\\'elanie (IMT), Burcelin R\\'emy (I2MC), Camille Champion (IMT), Loubes Jean-Michel (IMT), Risser Laurent (IMT)","submitted_at":"2020-04-08T07:12:56Z","abstract_excerpt":"Cluster structure detection is a fundamental task for the analysis of graphs, in order to understand and to visualize their functional characteristics. Among the different cluster structure detection methods, spectral clustering is currently one of the most widely used due to its speed and simplicity. Yet, there are few theoretical guarantee to recover the underlying partitions of the graph for general models. This paper therefore presents a variant of spectral clustering, called 1-spectral clustering, performed on a new random model closely related to stochastic block model. Its goal is to pr"},"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":"2004.03845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-04-08T07:12:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2145a25f662d74844696a5a937c8e2ab5e57f32faee3c13ed800a2593d3cba9c","abstract_canon_sha256":"4712a08feea8b5b633ea80c07618069e0bd5f4c3decbb11106d92ee87b3e60e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:53:56.900194Z","signature_b64":"h2wVLs5uVLHTi48k8GpfsVioffuvmSWd+RhOpFkla9jZh5uTtxmpwvAreuJ/qUH/8ULLjfyd3VsUQn/ttG6EDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2071b76d38baf22cffc36f6ffc7da53804cc5348db5c44129c371d4340e0cb8e","last_reissued_at":"2026-07-05T00:53:56.899729Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:53:56.899729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust spectral clustering using LASSO regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Blaz\\`ere M\\'elanie (IMT), Burcelin R\\'emy (I2MC), Camille Champion (IMT), Loubes Jean-Michel (IMT), Risser Laurent (IMT)","submitted_at":"2020-04-08T07:12:56Z","abstract_excerpt":"Cluster structure detection is a fundamental task for the analysis of graphs, in order to understand and to visualize their functional characteristics. Among the different cluster structure detection methods, spectral clustering is currently one of the most widely used due to its speed and simplicity. Yet, there are few theoretical guarantee to recover the underlying partitions of the graph for general models. This paper therefore presents a variant of spectral clustering, called 1-spectral clustering, performed on a new random model closely related to stochastic block model. Its goal is to pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.03845","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.03845/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":"2004.03845","created_at":"2026-07-05T00:53:56.899795+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.03845v1","created_at":"2026-07-05T00:53:56.899795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.03845","created_at":"2026-07-05T00:53:56.899795+00:00"},{"alias_kind":"pith_short_12","alias_value":"EBY3O3JYXLZC","created_at":"2026-07-05T00:53:56.899795+00:00"},{"alias_kind":"pith_short_16","alias_value":"EBY3O3JYXLZCZ76D","created_at":"2026-07-05T00:53:56.899795+00:00"},{"alias_kind":"pith_short_8","alias_value":"EBY3O3JY","created_at":"2026-07-05T00:53:56.899795+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.09415","citing_title":"The spectrum of dense kernel-based random graphs","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EBY3O3JYXLZCZ76DN5X7Y7NFHA","json":"https://pith.science/pith/EBY3O3JYXLZCZ76DN5X7Y7NFHA.json","graph_json":"https://pith.science/api/pith-number/EBY3O3JYXLZCZ76DN5X7Y7NFHA/graph.json","events_json":"https://pith.science/api/pith-number/EBY3O3JYXLZCZ76DN5X7Y7NFHA/events.json","paper":"https://pith.science/paper/EBY3O3JY"},"agent_actions":{"view_html":"https://pith.science/pith/EBY3O3JYXLZCZ76DN5X7Y7NFHA","download_json":"https://pith.science/pith/EBY3O3JYXLZCZ76DN5X7Y7NFHA.json","view_paper":"https://pith.science/paper/EBY3O3JY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.03845&json=true","fetch_graph":"https://pith.science/api/pith-number/EBY3O3JYXLZCZ76DN5X7Y7NFHA/graph.json","fetch_events":"https://pith.science/api/pith-number/EBY3O3JYXLZCZ76DN5X7Y7NFHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EBY3O3JYXLZCZ76DN5X7Y7NFHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EBY3O3JYXLZCZ76DN5X7Y7NFHA/action/storage_attestation","attest_author":"https://pith.science/pith/EBY3O3JYXLZCZ76DN5X7Y7NFHA/action/author_attestation","sign_citation":"https://pith.science/pith/EBY3O3JYXLZCZ76DN5X7Y7NFHA/action/citation_signature","submit_replication":"https://pith.science/pith/EBY3O3JYXLZCZ76DN5X7Y7NFHA/action/replication_record"}},"created_at":"2026-07-05T00:53:56.899795+00:00","updated_at":"2026-07-05T00:53:56.899795+00:00"}