{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WU3GWAT3O4DLRF23OU57YYDR7R","short_pith_number":"pith:WU3GWAT3","schema_version":"1.0","canonical_sha256":"b5366b027b7706b8975b753bfc6071fc41ab7be25ba12dfaa96421e377f18764","source":{"kind":"arxiv","id":"2405.11801","version":1},"attestation_state":"computed","paper":{"title":"LSEnet: Lorentz Structural Entropy Neural Network for Deep Graph Clustering","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chunyang Liu, Hao Peng, Li Sun, Philip S. Yu, Yujie Wang, Zhenhao Huang","submitted_at":"2024-05-20T05:46:41Z","abstract_excerpt":"Graph clustering is a fundamental problem in machine learning. Deep learning methods achieve the state-of-the-art results in recent years, but they still cannot work without predefined cluster numbers. Such limitation motivates us to pose a more challenging problem of graph clustering with unknown cluster number. We propose to address this problem from a fresh perspective of graph information theory (i.e., structural information). In the literature, structural information has not yet been introduced to deep clustering, and its classic definition falls short of discrete formulation and modeling"},"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":"2405.11801","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-20T05:46:41Z","cross_cats_sorted":[],"title_canon_sha256":"704cd858dd0d51deddc2fe96ea015b09d9ef04816a1728d19ba97470beb1ef55","abstract_canon_sha256":"766b1c496800862cddbcba91bfcc598c46412e100abbf62ba26e60a6e2c021c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:20:56.098397Z","signature_b64":"wpMhEdRX0lux/Bt8ZKb4YuzXmCxx0CF9Jqn8zFpBY9ZvOYDvsKDdu5cM1prvhk+oJcJ326rU72HgEdaaKp28Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5366b027b7706b8975b753bfc6071fc41ab7be25ba12dfaa96421e377f18764","last_reissued_at":"2026-07-05T08:20:56.096919Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:20:56.096919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LSEnet: Lorentz Structural Entropy Neural Network for Deep Graph Clustering","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chunyang Liu, Hao Peng, Li Sun, Philip S. Yu, Yujie Wang, Zhenhao Huang","submitted_at":"2024-05-20T05:46:41Z","abstract_excerpt":"Graph clustering is a fundamental problem in machine learning. Deep learning methods achieve the state-of-the-art results in recent years, but they still cannot work without predefined cluster numbers. Such limitation motivates us to pose a more challenging problem of graph clustering with unknown cluster number. We propose to address this problem from a fresh perspective of graph information theory (i.e., structural information). In the literature, structural information has not yet been introduced to deep clustering, and its classic definition falls short of discrete formulation and modeling"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.11801","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/2405.11801/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":"2405.11801","created_at":"2026-07-05T08:20:56.097021+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.11801v1","created_at":"2026-07-05T08:20:56.097021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.11801","created_at":"2026-07-05T08:20:56.097021+00:00"},{"alias_kind":"pith_short_12","alias_value":"WU3GWAT3O4DL","created_at":"2026-07-05T08:20:56.097021+00:00"},{"alias_kind":"pith_short_16","alias_value":"WU3GWAT3O4DLRF23","created_at":"2026-07-05T08:20:56.097021+00:00"},{"alias_kind":"pith_short_8","alias_value":"WU3GWAT3","created_at":"2026-07-05T08:20:56.097021+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06007","citing_title":"Transformers versus the EM Algorithm in Multi-class Clustering","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WU3GWAT3O4DLRF23OU57YYDR7R","json":"https://pith.science/pith/WU3GWAT3O4DLRF23OU57YYDR7R.json","graph_json":"https://pith.science/api/pith-number/WU3GWAT3O4DLRF23OU57YYDR7R/graph.json","events_json":"https://pith.science/api/pith-number/WU3GWAT3O4DLRF23OU57YYDR7R/events.json","paper":"https://pith.science/paper/WU3GWAT3"},"agent_actions":{"view_html":"https://pith.science/pith/WU3GWAT3O4DLRF23OU57YYDR7R","download_json":"https://pith.science/pith/WU3GWAT3O4DLRF23OU57YYDR7R.json","view_paper":"https://pith.science/paper/WU3GWAT3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.11801&json=true","fetch_graph":"https://pith.science/api/pith-number/WU3GWAT3O4DLRF23OU57YYDR7R/graph.json","fetch_events":"https://pith.science/api/pith-number/WU3GWAT3O4DLRF23OU57YYDR7R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WU3GWAT3O4DLRF23OU57YYDR7R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WU3GWAT3O4DLRF23OU57YYDR7R/action/storage_attestation","attest_author":"https://pith.science/pith/WU3GWAT3O4DLRF23OU57YYDR7R/action/author_attestation","sign_citation":"https://pith.science/pith/WU3GWAT3O4DLRF23OU57YYDR7R/action/citation_signature","submit_replication":"https://pith.science/pith/WU3GWAT3O4DLRF23OU57YYDR7R/action/replication_record"}},"created_at":"2026-07-05T08:20:56.097021+00:00","updated_at":"2026-07-05T08:20:56.097021+00:00"}