{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ETRJZRQB4EXEI5UCH73NFDHGHB","short_pith_number":"pith:ETRJZRQB","schema_version":"1.0","canonical_sha256":"24e29cc601e12e4476823ff6d28ce6385070ce263f4e6cb05c2aeceae1dc21d4","source":{"kind":"arxiv","id":"2506.03943","version":1},"attestation_state":"computed","paper":{"title":"Lower Ricci Curvature for Hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Can Chen, Didong Li, Shiyi Yang","submitted_at":"2025-06-04T13:32:09Z","abstract_excerpt":"Networks with higher-order interactions, prevalent in biological, social, and information systems, are naturally represented as hypergraphs, yet their structural complexity poses fundamental challenges for geometric characterization. While curvature-based methods offer powerful insights in graph analysis, existing extensions to hypergraphs suffer from critical trade-offs: combinatorial approaches such as Forman-Ricci curvature capture only coarse features, whereas geometric methods like Ollivier-Ricci curvature offer richer expressivity but demand costly optimal transport computations. To addr"},"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":"2506.03943","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-04T13:32:09Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d717b5f6548fb41f27d03836093b52adf7f61046a37ad9d4b5c392c802dc1aa1","abstract_canon_sha256":"409723a1ba63b21889ea3f1fcd8fa4e1055c9aa0e6223643e6a1724a3d4ab1aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:54.315089Z","signature_b64":"waCGBVXIlDr8+C6gK6sirP6wwHV2AS+dkJaBJBX7w2CBUxfJnBPFeXIDhZ4ccZdfx7OO4GkJMO9aGRoDIo/VDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24e29cc601e12e4476823ff6d28ce6385070ce263f4e6cb05c2aeceae1dc21d4","last_reissued_at":"2026-07-05T11:15:54.314684Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:54.314684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Ricci Curvature for Hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Can Chen, Didong Li, Shiyi Yang","submitted_at":"2025-06-04T13:32:09Z","abstract_excerpt":"Networks with higher-order interactions, prevalent in biological, social, and information systems, are naturally represented as hypergraphs, yet their structural complexity poses fundamental challenges for geometric characterization. While curvature-based methods offer powerful insights in graph analysis, existing extensions to hypergraphs suffer from critical trade-offs: combinatorial approaches such as Forman-Ricci curvature capture only coarse features, whereas geometric methods like Ollivier-Ricci curvature offer richer expressivity but demand costly optimal transport computations. To addr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03943","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/2506.03943/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":"2506.03943","created_at":"2026-07-05T11:15:54.314746+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.03943v1","created_at":"2026-07-05T11:15:54.314746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03943","created_at":"2026-07-05T11:15:54.314746+00:00"},{"alias_kind":"pith_short_12","alias_value":"ETRJZRQB4EXE","created_at":"2026-07-05T11:15:54.314746+00:00"},{"alias_kind":"pith_short_16","alias_value":"ETRJZRQB4EXEI5UC","created_at":"2026-07-05T11:15:54.314746+00:00"},{"alias_kind":"pith_short_8","alias_value":"ETRJZRQB","created_at":"2026-07-05T11:15:54.314746+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/ETRJZRQB4EXEI5UCH73NFDHGHB","json":"https://pith.science/pith/ETRJZRQB4EXEI5UCH73NFDHGHB.json","graph_json":"https://pith.science/api/pith-number/ETRJZRQB4EXEI5UCH73NFDHGHB/graph.json","events_json":"https://pith.science/api/pith-number/ETRJZRQB4EXEI5UCH73NFDHGHB/events.json","paper":"https://pith.science/paper/ETRJZRQB"},"agent_actions":{"view_html":"https://pith.science/pith/ETRJZRQB4EXEI5UCH73NFDHGHB","download_json":"https://pith.science/pith/ETRJZRQB4EXEI5UCH73NFDHGHB.json","view_paper":"https://pith.science/paper/ETRJZRQB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.03943&json=true","fetch_graph":"https://pith.science/api/pith-number/ETRJZRQB4EXEI5UCH73NFDHGHB/graph.json","fetch_events":"https://pith.science/api/pith-number/ETRJZRQB4EXEI5UCH73NFDHGHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ETRJZRQB4EXEI5UCH73NFDHGHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ETRJZRQB4EXEI5UCH73NFDHGHB/action/storage_attestation","attest_author":"https://pith.science/pith/ETRJZRQB4EXEI5UCH73NFDHGHB/action/author_attestation","sign_citation":"https://pith.science/pith/ETRJZRQB4EXEI5UCH73NFDHGHB/action/citation_signature","submit_replication":"https://pith.science/pith/ETRJZRQB4EXEI5UCH73NFDHGHB/action/replication_record"}},"created_at":"2026-07-05T11:15:54.314746+00:00","updated_at":"2026-07-05T11:15:54.314746+00:00"}