遇见数据集

Reproducibility package for "Transport-Free Lower Bounds for Ollivier–Ricci Curvature in Higher-Order Networks: Scope, Tightness, and Computational Applications"

收藏
Zenodo2026-10-30 更新2026-11-05 收录
官方服务:

资源简介:

This reproducibility package accompanies the manuscript “Transport-Free Lower Bounds for Ollivier–Ricci Curvature in Higher-Order Networks: Scope, Tightness, and Computational Applications” by Wonwoo Kang and Heehyun Park. It supports the manuscript’s new computational studies of transport-free curvature bounds, budgeted short-detour refinements, and curvature-threshold screening in hypergraphs. The package includes Python implementations, selected public inputs from the ORCHID archive, the pinned RS-LB baseline source, numerical outputs, dependency specifications, experiment settings and seeds, and scripts for generating tables and figures. The archived results cover 42,940 finite pairwise transport comparisons, 128,820 detour-budget checks, 64,620 public-hypergraph comparisons on SHA, MUS, and NDC-PC data, and 50 complete-workload pipeline runs. Reproduction commands create separate working copies to preserve the archived results. File checksums, input provenance, and verification reports are included. These reports distinguish freshly executed checks from audits of previously recorded results. A documented repair restores an incomplete detour-output CSV; the original file is preserved for traceability. Coverage limitation: The package reproduces the new finite checks and public-hypergraph experiments. The supplied figures from the inherited studies are retained, but their original raw records and plotting scripts are not included. The public inputs originate from the ORCHID artifact at https://doi.org/10.5281/zenodo.7624573. Third-party license and attribution notices are preserved. Consult README.md for installation and reproduction instructions, and docs/COVERAGE.md for the precise experimental scope.

提供机构:
Zenodo
创建时间:
2026-10-30
二维码
社区交流群
二维码
科研交流群
商业服务