{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:Q4ENHJCJHWTHOWJE5EQWNKQMFZ","short_pith_number":"pith:Q4ENHJCJ","schema_version":"1.0","canonical_sha256":"8708d3a4493da6775924e92166aa0c2e4875cab16fc8893ea347d3cac5297d60","source":{"kind":"arxiv","id":"2306.06474","version":2},"attestation_state":"computed","paper":{"title":"Augmentations of Forman's Ricci Curvature and their Applications in Community Detection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.MG"],"primary_cat":"math.CO","authors_text":"Karel Devriendt, Lukas Fesser, Melanie Weber, Renaud Lambiotte, Sergio Serrano de Haro Iv\\'a\\~nez","submitted_at":"2023-06-10T16:20:05Z","abstract_excerpt":"The notion of curvature on graphs has recently gained traction in the networks community, with the Ollivier-Ricci curvature (ORC) in particular being used for several tasks in network analysis, such as community detection. In this work, we choose a different approach and study augmentations of the discretization of the Ricci curvature proposed by Forman (AFRC). We empirically and theoretically investigate its relation to the ORC and the un-augmented Forman-Ricci curvature. In particular, we provide evidence that the AFRC frequently gives sufficient insight into the structure of a network to be"},"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":"2306.06474","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-06-10T16:20:05Z","cross_cats_sorted":["cs.DM","math.MG"],"title_canon_sha256":"5bc8ae7bdef941ce585e1c4ed3ae8218421ccc5c8f67473aa8fb6743bbb3392b","abstract_canon_sha256":"b45015b0b9cadc2bf34311cb7b7f01c286c62bb6cdaea04b34a76cc2a1153b23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:57:51.794565Z","signature_b64":"qpZHi5OyWQfwgS0YtK3aR2ce6D9J5l8zGrxvvqWoRee0VW5Hn79UeXu0k8zu/WXS5QGbKxJK+L+IG52J1S+1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8708d3a4493da6775924e92166aa0c2e4875cab16fc8893ea347d3cac5297d60","last_reissued_at":"2026-07-05T08:57:51.794117Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:57:51.794117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Augmentations of Forman's Ricci Curvature and their Applications in Community Detection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.MG"],"primary_cat":"math.CO","authors_text":"Karel Devriendt, Lukas Fesser, Melanie Weber, Renaud Lambiotte, Sergio Serrano de Haro Iv\\'a\\~nez","submitted_at":"2023-06-10T16:20:05Z","abstract_excerpt":"The notion of curvature on graphs has recently gained traction in the networks community, with the Ollivier-Ricci curvature (ORC) in particular being used for several tasks in network analysis, such as community detection. In this work, we choose a different approach and study augmentations of the discretization of the Ricci curvature proposed by Forman (AFRC). We empirically and theoretically investigate its relation to the ORC and the un-augmented Forman-Ricci curvature. In particular, we provide evidence that the AFRC frequently gives sufficient insight into the structure of a network to be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.06474","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/2306.06474/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":"2306.06474","created_at":"2026-07-05T08:57:51.794171+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.06474v2","created_at":"2026-07-05T08:57:51.794171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.06474","created_at":"2026-07-05T08:57:51.794171+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q4ENHJCJHWTH","created_at":"2026-07-05T08:57:51.794171+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q4ENHJCJHWTHOWJE","created_at":"2026-07-05T08:57:51.794171+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q4ENHJCJ","created_at":"2026-07-05T08:57:51.794171+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23467","citing_title":"S$^3$GNN: Efficient Global Mixing and Local Message Passing for Long-Range Graph Learning","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q4ENHJCJHWTHOWJE5EQWNKQMFZ","json":"https://pith.science/pith/Q4ENHJCJHWTHOWJE5EQWNKQMFZ.json","graph_json":"https://pith.science/api/pith-number/Q4ENHJCJHWTHOWJE5EQWNKQMFZ/graph.json","events_json":"https://pith.science/api/pith-number/Q4ENHJCJHWTHOWJE5EQWNKQMFZ/events.json","paper":"https://pith.science/paper/Q4ENHJCJ"},"agent_actions":{"view_html":"https://pith.science/pith/Q4ENHJCJHWTHOWJE5EQWNKQMFZ","download_json":"https://pith.science/pith/Q4ENHJCJHWTHOWJE5EQWNKQMFZ.json","view_paper":"https://pith.science/paper/Q4ENHJCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.06474&json=true","fetch_graph":"https://pith.science/api/pith-number/Q4ENHJCJHWTHOWJE5EQWNKQMFZ/graph.json","fetch_events":"https://pith.science/api/pith-number/Q4ENHJCJHWTHOWJE5EQWNKQMFZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q4ENHJCJHWTHOWJE5EQWNKQMFZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q4ENHJCJHWTHOWJE5EQWNKQMFZ/action/storage_attestation","attest_author":"https://pith.science/pith/Q4ENHJCJHWTHOWJE5EQWNKQMFZ/action/author_attestation","sign_citation":"https://pith.science/pith/Q4ENHJCJHWTHOWJE5EQWNKQMFZ/action/citation_signature","submit_replication":"https://pith.science/pith/Q4ENHJCJHWTHOWJE5EQWNKQMFZ/action/replication_record"}},"created_at":"2026-07-05T08:57:51.794171+00:00","updated_at":"2026-07-05T08:57:51.794171+00:00"}