{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:A32KRSWUQV77ERO327SSVB6U7R","short_pith_number":"pith:A32KRSWU","schema_version":"1.0","canonical_sha256":"06f4a8cad4857ff245dbd7e52a87d4fc4d919d1a9c391e056181f2a22d8ce026","source":{"kind":"arxiv","id":"2307.10155","version":1},"attestation_state":"computed","paper":{"title":"Curvature-based Clustering on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG","math.CO","stat.ML"],"primary_cat":"cs.SI","authors_text":"Melanie Weber, Yu Tian, Zachary Lubberts","submitted_at":"2023-07-19T17:35:08Z","abstract_excerpt":"Unsupervised node clustering (or community detection) is a classical graph learning task. In this paper, we study algorithms, which exploit the geometry of the graph to identify densely connected substructures, which form clusters or communities. Our method implements discrete Ricci curvatures and their associated geometric flows, under which the edge weights of the graph evolve to reveal its community structure. We consider several discrete curvature notions and analyze the utility of the resulting algorithms. In contrast to prior literature, we study not only single-membership community dete"},"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":"2307.10155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-07-19T17:35:08Z","cross_cats_sorted":["cs.DM","cs.LG","math.CO","stat.ML"],"title_canon_sha256":"a1f7a5515aa3bab0a84fee2def554a209fa9d688e7b969570f42ab375bc34fe6","abstract_canon_sha256":"db274af6b14d8bec782bba92030d8fb8b5c616bc957e40ed86b6bd889f3f19c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:32:51.275724Z","signature_b64":"2tP+QxHsgndNpxjo30zf+A952pVI0ZiW4MaNtp0N0RtQP5Iq9+pydOjqzALNX4yrl7kYwDGh1TTXl/flt2XOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06f4a8cad4857ff245dbd7e52a87d4fc4d919d1a9c391e056181f2a22d8ce026","last_reissued_at":"2026-07-05T06:32:51.275312Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:32:51.275312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Curvature-based Clustering on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG","math.CO","stat.ML"],"primary_cat":"cs.SI","authors_text":"Melanie Weber, Yu Tian, Zachary Lubberts","submitted_at":"2023-07-19T17:35:08Z","abstract_excerpt":"Unsupervised node clustering (or community detection) is a classical graph learning task. In this paper, we study algorithms, which exploit the geometry of the graph to identify densely connected substructures, which form clusters or communities. Our method implements discrete Ricci curvatures and their associated geometric flows, under which the edge weights of the graph evolve to reveal its community structure. We consider several discrete curvature notions and analyze the utility of the resulting algorithms. In contrast to prior literature, we study not only single-membership community dete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.10155","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/2307.10155/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":"2307.10155","created_at":"2026-07-05T06:32:51.275379+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.10155v1","created_at":"2026-07-05T06:32:51.275379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.10155","created_at":"2026-07-05T06:32:51.275379+00:00"},{"alias_kind":"pith_short_12","alias_value":"A32KRSWUQV77","created_at":"2026-07-05T06:32:51.275379+00:00"},{"alias_kind":"pith_short_16","alias_value":"A32KRSWUQV77ERO3","created_at":"2026-07-05T06:32:51.275379+00:00"},{"alias_kind":"pith_short_8","alias_value":"A32KRSWU","created_at":"2026-07-05T06:32:51.275379+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2404.15261","citing_title":"Resistance Distance and Linearized Optimal Transport on Graphs","ref_index":83,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A32KRSWUQV77ERO327SSVB6U7R","json":"https://pith.science/pith/A32KRSWUQV77ERO327SSVB6U7R.json","graph_json":"https://pith.science/api/pith-number/A32KRSWUQV77ERO327SSVB6U7R/graph.json","events_json":"https://pith.science/api/pith-number/A32KRSWUQV77ERO327SSVB6U7R/events.json","paper":"https://pith.science/paper/A32KRSWU"},"agent_actions":{"view_html":"https://pith.science/pith/A32KRSWUQV77ERO327SSVB6U7R","download_json":"https://pith.science/pith/A32KRSWUQV77ERO327SSVB6U7R.json","view_paper":"https://pith.science/paper/A32KRSWU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.10155&json=true","fetch_graph":"https://pith.science/api/pith-number/A32KRSWUQV77ERO327SSVB6U7R/graph.json","fetch_events":"https://pith.science/api/pith-number/A32KRSWUQV77ERO327SSVB6U7R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A32KRSWUQV77ERO327SSVB6U7R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A32KRSWUQV77ERO327SSVB6U7R/action/storage_attestation","attest_author":"https://pith.science/pith/A32KRSWUQV77ERO327SSVB6U7R/action/author_attestation","sign_citation":"https://pith.science/pith/A32KRSWUQV77ERO327SSVB6U7R/action/citation_signature","submit_replication":"https://pith.science/pith/A32KRSWUQV77ERO327SSVB6U7R/action/replication_record"}},"created_at":"2026-07-05T06:32:51.275379+00:00","updated_at":"2026-07-05T06:32:51.275379+00:00"}