{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:W5PHNFJVOWAWL7XFCW5AWEC2A4","short_pith_number":"pith:W5PHNFJV","schema_version":"1.0","canonical_sha256":"b75e769535758165fee515ba0b105a073979f7116ad44da6707d6df2733ab652","source":{"kind":"arxiv","id":"2403.03666","version":3},"attestation_state":"computed","paper":{"title":"Provable Filter for Real-world Graph Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bingheng Li, Erlin Pan, Wenyu Chen, Xuanting Xie, Zhao Kang","submitted_at":"2024-03-06T12:37:49Z","abstract_excerpt":"Graph clustering, an important unsupervised problem, has been shown to be more resistant to advances in Graph Neural Networks (GNNs). In addition, almost all clustering methods focus on homophilic graphs and ignore heterophily. This significantly limits their applicability in practice, since real-world graphs exhibit a structural disparity and cannot simply be classified as homophily and heterophily. Thus, a principled way to handle practical graphs is urgently needed. To fill this gap, we provide a novel solution with theoretical support. Interestingly, we find that most homophilic and hetero"},"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":"2403.03666","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-03-06T12:37:49Z","cross_cats_sorted":[],"title_canon_sha256":"0f020b717ecadb4f566b0b25eece2157eb7af8b489d851512b64c6bea11d37a9","abstract_canon_sha256":"8c109d9ca0d72a1b7577e421e959093933c30c0aa8b65c2d4b5eac54f5703113"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:12.509810Z","signature_b64":"P4GB8L8h6QncmYFeGZZKPhSwbYWU/gZxNZrPDe8ozOJXJ7tLMW6g+2PrzCmDGVOZXbuAirIiMsXWLuvpmP8nAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b75e769535758165fee515ba0b105a073979f7116ad44da6707d6df2733ab652","last_reissued_at":"2026-06-23T02:13:12.509347Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:12.509347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provable Filter for Real-world Graph Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bingheng Li, Erlin Pan, Wenyu Chen, Xuanting Xie, Zhao Kang","submitted_at":"2024-03-06T12:37:49Z","abstract_excerpt":"Graph clustering, an important unsupervised problem, has been shown to be more resistant to advances in Graph Neural Networks (GNNs). In addition, almost all clustering methods focus on homophilic graphs and ignore heterophily. This significantly limits their applicability in practice, since real-world graphs exhibit a structural disparity and cannot simply be classified as homophily and heterophily. Thus, a principled way to handle practical graphs is urgently needed. To fill this gap, we provide a novel solution with theoretical support. Interestingly, we find that most homophilic and hetero"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.03666","kind":"arxiv","version":3},"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/2403.03666/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":"2403.03666","created_at":"2026-06-23T02:13:12.509408+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.03666v3","created_at":"2026-06-23T02:13:12.509408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.03666","created_at":"2026-06-23T02:13:12.509408+00:00"},{"alias_kind":"pith_short_12","alias_value":"W5PHNFJVOWAW","created_at":"2026-06-23T02:13:12.509408+00:00"},{"alias_kind":"pith_short_16","alias_value":"W5PHNFJVOWAWL7XF","created_at":"2026-06-23T02:13:12.509408+00:00"},{"alias_kind":"pith_short_8","alias_value":"W5PHNFJV","created_at":"2026-06-23T02:13:12.509408+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/W5PHNFJVOWAWL7XFCW5AWEC2A4","json":"https://pith.science/pith/W5PHNFJVOWAWL7XFCW5AWEC2A4.json","graph_json":"https://pith.science/api/pith-number/W5PHNFJVOWAWL7XFCW5AWEC2A4/graph.json","events_json":"https://pith.science/api/pith-number/W5PHNFJVOWAWL7XFCW5AWEC2A4/events.json","paper":"https://pith.science/paper/W5PHNFJV"},"agent_actions":{"view_html":"https://pith.science/pith/W5PHNFJVOWAWL7XFCW5AWEC2A4","download_json":"https://pith.science/pith/W5PHNFJVOWAWL7XFCW5AWEC2A4.json","view_paper":"https://pith.science/paper/W5PHNFJV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.03666&json=true","fetch_graph":"https://pith.science/api/pith-number/W5PHNFJVOWAWL7XFCW5AWEC2A4/graph.json","fetch_events":"https://pith.science/api/pith-number/W5PHNFJVOWAWL7XFCW5AWEC2A4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W5PHNFJVOWAWL7XFCW5AWEC2A4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W5PHNFJVOWAWL7XFCW5AWEC2A4/action/storage_attestation","attest_author":"https://pith.science/pith/W5PHNFJVOWAWL7XFCW5AWEC2A4/action/author_attestation","sign_citation":"https://pith.science/pith/W5PHNFJVOWAWL7XFCW5AWEC2A4/action/citation_signature","submit_replication":"https://pith.science/pith/W5PHNFJVOWAWL7XFCW5AWEC2A4/action/replication_record"}},"created_at":"2026-06-23T02:13:12.509408+00:00","updated_at":"2026-06-23T02:13:12.509408+00:00"}