{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:A2HPJXR2UQQ5KTZKW3LKNQHWJS","short_pith_number":"pith:A2HPJXR2","schema_version":"1.0","canonical_sha256":"068ef4de3aa421d54f2ab6d6a6c0f64caf96ec3b2100a535d477d13b4869b8c1","source":{"kind":"arxiv","id":"2412.03008","version":2},"attestation_state":"computed","paper":{"title":"Local Clustering on Complex Graphs and Complex Hypergraphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.SI","authors_text":"Dongqi Fu, Hengyu Liu, Jingrui He, Zihao Li","submitted_at":"2024-12-04T03:56:14Z","abstract_excerpt":"Local/seeded clustering aims to find a compact cluster near the given starting instances. While most existing studies on graph clustering assume a discrete graph setting (i.e., unweighted, undirected graphs without self-loops), real-world graphs can be more complex. In this paper, we extend the classic non-approximating Andersen-Chung-Lang (ACL) clustering algorithm beyond discrete graphs and generalize its quadratic optimality to a wider range of complex graphs, including weighted, directed, and self-looped graphs and hypergraphs with edge-dependent vertex weights. Specifically, by leveraging"},"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":"2412.03008","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SI","submitted_at":"2024-12-04T03:56:14Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"e89c7c7e5dc1cf21bc2cdb613e6bc93f58713146ff128dd51d8ed96c6ea74f76","abstract_canon_sha256":"cf7b6c08106bfc53a4b23dd57645d2e09f717e9601ec8d51a8ac11e9e1571527"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:08:26.826415Z","signature_b64":"0JmV9078OxV+/sVRCTvk81zFB4ATRD9FS40lyjXIAh2Qvt35IpU77GH65b/CQOATUwmc2zfwSJcvYM8HjXD/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"068ef4de3aa421d54f2ab6d6a6c0f64caf96ec3b2100a535d477d13b4869b8c1","last_reissued_at":"2026-06-04T01:08:26.825625Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:08:26.825625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Clustering on Complex Graphs and Complex Hypergraphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.SI","authors_text":"Dongqi Fu, Hengyu Liu, Jingrui He, Zihao Li","submitted_at":"2024-12-04T03:56:14Z","abstract_excerpt":"Local/seeded clustering aims to find a compact cluster near the given starting instances. While most existing studies on graph clustering assume a discrete graph setting (i.e., unweighted, undirected graphs without self-loops), real-world graphs can be more complex. In this paper, we extend the classic non-approximating Andersen-Chung-Lang (ACL) clustering algorithm beyond discrete graphs and generalize its quadratic optimality to a wider range of complex graphs, including weighted, directed, and self-looped graphs and hypergraphs with edge-dependent vertex weights. Specifically, by leveraging"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03008","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.03008/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":"2412.03008","created_at":"2026-06-04T01:08:26.825748+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.03008v2","created_at":"2026-06-04T01:08:26.825748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03008","created_at":"2026-06-04T01:08:26.825748+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2HPJXR2UQQ5","created_at":"2026-06-04T01:08:26.825748+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2HPJXR2UQQ5KTZK","created_at":"2026-06-04T01:08:26.825748+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2HPJXR2","created_at":"2026-06-04T01:08:26.825748+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/A2HPJXR2UQQ5KTZKW3LKNQHWJS","json":"https://pith.science/pith/A2HPJXR2UQQ5KTZKW3LKNQHWJS.json","graph_json":"https://pith.science/api/pith-number/A2HPJXR2UQQ5KTZKW3LKNQHWJS/graph.json","events_json":"https://pith.science/api/pith-number/A2HPJXR2UQQ5KTZKW3LKNQHWJS/events.json","paper":"https://pith.science/paper/A2HPJXR2"},"agent_actions":{"view_html":"https://pith.science/pith/A2HPJXR2UQQ5KTZKW3LKNQHWJS","download_json":"https://pith.science/pith/A2HPJXR2UQQ5KTZKW3LKNQHWJS.json","view_paper":"https://pith.science/paper/A2HPJXR2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.03008&json=true","fetch_graph":"https://pith.science/api/pith-number/A2HPJXR2UQQ5KTZKW3LKNQHWJS/graph.json","fetch_events":"https://pith.science/api/pith-number/A2HPJXR2UQQ5KTZKW3LKNQHWJS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2HPJXR2UQQ5KTZKW3LKNQHWJS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2HPJXR2UQQ5KTZKW3LKNQHWJS/action/storage_attestation","attest_author":"https://pith.science/pith/A2HPJXR2UQQ5KTZKW3LKNQHWJS/action/author_attestation","sign_citation":"https://pith.science/pith/A2HPJXR2UQQ5KTZKW3LKNQHWJS/action/citation_signature","submit_replication":"https://pith.science/pith/A2HPJXR2UQQ5KTZKW3LKNQHWJS/action/replication_record"}},"created_at":"2026-06-04T01:08:26.825748+00:00","updated_at":"2026-06-04T01:08:26.825748+00:00"}