{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JCNRD7XQVSITY6H4E2JXTH6KKE","short_pith_number":"pith:JCNRD7XQ","schema_version":"1.0","canonical_sha256":"489b11fef0ac913c78fc2693799fca513b6347204941ce43847f816731e75329","source":{"kind":"arxiv","id":"2212.01357","version":1},"attestation_state":"computed","paper":{"title":"Comparative analysis of Forman-Ricci curvature versions applied to the persistent homology of networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"Sergio Serrano de Haro Iv\\'a\\~nez","submitted_at":"2022-12-02T18:34:57Z","abstract_excerpt":"We provide an overview of Forman-Ricci curvature and persistent homology, and how their combination can be applied to the study of networks. We discuss how the usually employed augmented Forman-Ricci curvature formula, only valid for quasiconvex augmented networks, can be extended to the non-quasiconvex case. We apply three versions of quasiconvex Forman-Ricci curvature (plain, triangle-augmented, and pentagon-augmented) to build time filtrations on non-quasiconvex networks, both model and real-world. Our results suggest that triangle-augmented curvature should be used until the non-quasiconve"},"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":"2212.01357","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-02T18:34:57Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"27cdccee8c775ce99ed8073966174b7ba69f380e5301c92230e78835e6efebd3","abstract_canon_sha256":"86d0f3fc5acf0d91f2ad2cad222daf49fdbb56c534bec5c9df15cdaf0ec644b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:21:52.319296Z","signature_b64":"W79KQtsY/SeRSHXVMuqEfUQL0nx5b16Yfd8gv1yEAQTVh1a2du1F+Ee3EHeH+o4J7nIY5ZbdbTpaZQkNQ0dmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"489b11fef0ac913c78fc2693799fca513b6347204941ce43847f816731e75329","last_reissued_at":"2026-07-05T05:21:52.318959Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:21:52.318959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparative analysis of Forman-Ricci curvature versions applied to the persistent homology of networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"Sergio Serrano de Haro Iv\\'a\\~nez","submitted_at":"2022-12-02T18:34:57Z","abstract_excerpt":"We provide an overview of Forman-Ricci curvature and persistent homology, and how their combination can be applied to the study of networks. We discuss how the usually employed augmented Forman-Ricci curvature formula, only valid for quasiconvex augmented networks, can be extended to the non-quasiconvex case. We apply three versions of quasiconvex Forman-Ricci curvature (plain, triangle-augmented, and pentagon-augmented) to build time filtrations on non-quasiconvex networks, both model and real-world. Our results suggest that triangle-augmented curvature should be used until the non-quasiconve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.01357","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/2212.01357/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":"2212.01357","created_at":"2026-07-05T05:21:52.319014+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.01357v1","created_at":"2026-07-05T05:21:52.319014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.01357","created_at":"2026-07-05T05:21:52.319014+00:00"},{"alias_kind":"pith_short_12","alias_value":"JCNRD7XQVSIT","created_at":"2026-07-05T05:21:52.319014+00:00"},{"alias_kind":"pith_short_16","alias_value":"JCNRD7XQVSITY6H4","created_at":"2026-07-05T05:21:52.319014+00:00"},{"alias_kind":"pith_short_8","alias_value":"JCNRD7XQ","created_at":"2026-07-05T05:21:52.319014+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.19857","citing_title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","ref_index":67,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JCNRD7XQVSITY6H4E2JXTH6KKE","json":"https://pith.science/pith/JCNRD7XQVSITY6H4E2JXTH6KKE.json","graph_json":"https://pith.science/api/pith-number/JCNRD7XQVSITY6H4E2JXTH6KKE/graph.json","events_json":"https://pith.science/api/pith-number/JCNRD7XQVSITY6H4E2JXTH6KKE/events.json","paper":"https://pith.science/paper/JCNRD7XQ"},"agent_actions":{"view_html":"https://pith.science/pith/JCNRD7XQVSITY6H4E2JXTH6KKE","download_json":"https://pith.science/pith/JCNRD7XQVSITY6H4E2JXTH6KKE.json","view_paper":"https://pith.science/paper/JCNRD7XQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.01357&json=true","fetch_graph":"https://pith.science/api/pith-number/JCNRD7XQVSITY6H4E2JXTH6KKE/graph.json","fetch_events":"https://pith.science/api/pith-number/JCNRD7XQVSITY6H4E2JXTH6KKE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JCNRD7XQVSITY6H4E2JXTH6KKE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JCNRD7XQVSITY6H4E2JXTH6KKE/action/storage_attestation","attest_author":"https://pith.science/pith/JCNRD7XQVSITY6H4E2JXTH6KKE/action/author_attestation","sign_citation":"https://pith.science/pith/JCNRD7XQVSITY6H4E2JXTH6KKE/action/citation_signature","submit_replication":"https://pith.science/pith/JCNRD7XQVSITY6H4E2JXTH6KKE/action/replication_record"}},"created_at":"2026-07-05T05:21:52.319014+00:00","updated_at":"2026-07-05T05:21:52.319014+00:00"}