- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes Galois Closure Curvature (GCC), a curvature for hypergraphs defined through the perturbation response of Galois closure states. Given two closure states, the method applies a shared perturbation and measures whether the states contract or expand, summarizing the response as a scalar curvature plus a three-component profile (positive response, negative response, variability). The authors prove that the profile can distinguish hypergraphs with identical degree and pairwise co-occurrence statistics, and even identical scalar curvature. Experiments cover hypergraph classification on Hy-WL, constructed twin collections designed to isolate set-level implications, and computation time on larger hypergraphs.
Critical strengths
-
The core observation is real and cleanly demonstrated. Proposition 2 constructs two hypergraphs with identical B-transpose-B and identical scalar curvature, yet different profiles. This is a valid demonstration that scalar aggregation loses information, and it is not a contrived trick — the cancellation of contraction and expansion is a genuine phenomenon.
-
The computational advantage over transport-based curvatures is concrete. GCC avoids optimal transport and computes responses by set operations. The timing results on the larger hypergraphs show a substantial speedup over ORCHID, HRCD, and ETR, which is a meaningful practical property.
Critical weaknesses
-
The paper shows that the profile is discriminative, but not that it is useful beyond the diagnostic setting. The twin collections differ only in implication structure by construction, so high accuracy there mainly confirms that the profile detects the signal it was designed to capture. On the real Hy-WL collections the advantage is smaller, and on the two IMDB writer collections the method underperforms. The message-passing gains in the appendix (0.1–0.4 points) are within noise for most GNN benchmarks. A real task where implication structure is known to matter would strengthen the practical case.
-
The relationship to existing curvatures is not fully clarified. GCC is compared against ORCHID, HFRC, and ETR, but the paper does not argue that the implication information it captures is absent from these descriptors. ORCHID's random-walk formulation operates on hyperedge transitions, a different object from closure perturbation, but the two may overlap in what they encode about intersection structure. A short discussion or ablation would clarify whether GCC's increment is orthogonal to these baselines.
-
The scale of the validation is small relative to the claim. Hy-WL hypergraphs have roughly 10 to 35 nodes. The twin collections are synthetic. The larger hypergraphs are used only for timing, not for any downstream task. For a paper whose motivation is that higher-order implication structure matters in real data, there is no real large-scale task where that structure is shown to matter.
-
The three profile components are not well interpreted. Contraction and expansion have clear readings, but variability does not: what does a high-variance response mean structurally, and when is it signal rather than noise? The paper reports an 8.6-point gain on RHG-10 from variability but does not explain why.
Questions for authors
-
The twin collections isolate implication structure by construction. Can you provide a real hypergraph task, ideally at larger scale, where implication structure is known to matter and GCC outperforms existing descriptors? This would help establish the practical value of the profile.
-
ORCHID's random-walk formulation involves transitions between hyperedges, which may relate to the intersection structure behind implications. Can you show empirically or analytically that GCC captures information not already present in ORCHID?
-
What does a high-variability node pair or hyperedge correspond to structurally? Can you give a concrete example from one of the real collections where variability is the discriminating signal?
-
The gains in Appendix E are small. Are these differences statistically significant under the same corrected resampled t-test used for the classification results? If not, what should a reader conclude about the practical utility of GCC as a structural encoding?
5 comments
Higher-Order Expressivity and Structural Distinctions from ORCHID
W2 & Q2. Relation to ORCHID.
ORCHID's probability measures are determined by statistics of node pairs, whereas GCC also uses statistics of node triples. GCC can therefore distinguish hypergraphs whose pair statistics coincide, and its gain over ORCHID on Hy-WL comes from this difference.
ORCHID's pair statistics. ORCHID's probability measures are one step of a random walk from node to node (Coupette et al., 2023, Eqs. 5–7). With the number of hyperedges that contain both and , they can be written for as:
- EN (equal nodes): ;
- WE (weighted edges): ;
- EE (equal edges): .
All three weights are statistics of node pairs: whether and share a hyperedge (EN), how many hyperedges they share (WE) and how large these are (EE). A step of the walk may pass through a hyperedge, but records only where the step ends and therefore sums over every hyperedge that contains and . Which further nodes such a hyperedge contains does not enter the measure. On intersection structure, the ORCHID paper itself notes that "hyperedge intersections can vary in cardinality, but this variation is not currently reflected in our probability measures" (Section 5).
GCC's triple statistics. GCC uses pair statistics as well, in its closure states and in the feasible perturbations of our Eq. (5). A node belongs to iff , and is a feasible perturbation for iff and . Triples enter through the perturbed states of our Eq. (4): for , consists of the nodes that lie in every hyperedge containing and . These are the nodes implied by , and GCC compares them with the nodes implied by .
The following constructed example isolates this distinction under identical pair statistics:
and .
Both are 3-uniform and have identical pairwise co-occurrence counts; hence their EN, WE and EE measures and their ORCHID node-pair curvatures coincide. Their hyperedge-curvature distributions also coincide under exact with mean or max aggregation. Yet GCC assigns different profiles to : in and in . Perturbing both closure states by yields distinct sets (, ) in but the same set () in . GCC detects this higher-order difference despite identical ORCHID measures.
On Hy-WL the GCC profile of 64% of the node pairs on average changes when only the co-occurrence graph is kept. The table below shows that GCC given only pair statistics performs at the level of ORCHID on average (71.4% vs. 71.0%) and gains 3.1 points with triple statistics.
| Descriptor | Hy-WL mean accuracy (%) |
|---|---|
| ORCHID | 71.0 |
| GCC (pair statistics only) | 71.4 |
| GCC (w/ triple statistics) | 74.5 |
This suggests that the gain of GCC over ORCHID comes from the structure of the hyperedges beyond pairs, which ORCHID's measures do not use.
Revision. We will clarify the distinction between ORCHID's pairwise random-walk measures and GCC's triple-dependent closure perturbations, include the constructed example demonstrating their different expressivity under identical pair statistics, and add the Hy-WL ablation quantifying the contribution of higher-order information.
Structural Interpretation and Empirical Validation of Variability
W4 & Q3. Structural Meaning of Variability
High-variability pairs and hyperedges. A high-variability node pair is one whose common neighbours disagree: some separate and , others do not. A high-variability hyperedge is one whose node pairs are of this kind on average, since is the mean of over its node pairs (Eq. 8). This reading follows from the definition. For a node pair , the shared perturbations are typically the two nodes themselves and their common neighbours. With and , the response is and
where are independent feasible perturbations. Contraction and expansion say how much the perturbations pull the two closure states together or push them apart on average; variability says whether they agree: iff every perturbation changes the distance by the same amount. A common neighbour can bind the pair (: adding sends both states to the same closed set, e.g. when , and lie together in a hyperedge), split it (: meets and in different hyperedges and sends the states into different sets; the larger these are, the more negative ), or leave it unchanged. Geometrically, averages the response over perturbations as Ricci curvature averages sectional curvatures over directions, and measures the anisotropy: a pair can be flat in every direction, or saddle-like, with the same mean.
Signal versus noise. Variability carries structural information that and do not determine. The same average pull and push can come from one strong perturbation or from several weak ones, and only tells these apart. For example, in IMDB-Wri-Genre two node pairs of one hypergraph both have , but one is pushed apart by two perturbations of equal strength (; ) and the other by a single stronger one (; ). This is frequent: in four of the six real collections, 53–96% of the node pairs with a non-zero profile share their exact with a pair of different (6–7% in the two IMDB writer collections). It is also signal in a checkable sense: if no perturbation pushes the states apart, all and hence , so certifies a splitting neighbour.
Clarification on the 8.6-point gain on RHG-10. The 8.6 points compare the full profile (89.8%) with the scalar (81.2%), not a profile with and without . They arise because the scalar cannot separate two of the ten classes, whose mean responses coincide (AUC 0.50) while their spread differs; these two classes account for 8.4 of the 8.6 points. The ablation below shows the contribution of directly: adding it to , and raises the accuracy in every column. On the real collections the gain is clearest for IMDB-Wri-Genre (+4.0 points over ) and IMDB-Dir-Genre (+2.9 over ), both significant.
| Descriptor | RHG-10 | Hy-WL mean | Twins K=3 | Twins K=5 |
|---|---|---|---|---|
| [ξ] | 82.7 | 72.7 | 75.7 | 96.1 |
| [κ⁺] | 78.5 | 72.4 | 82.5 | 96.6 |
| [κ⁺, ξ] | 89.8 | 74.3 | 86.8 | 99.0 |
| [κ⁻] | 80.5 | 71.8 | 72.8 | 93.0 |
| [κ⁻, ξ] | 86.7 | 73.4 | 80.4 | 97.9 |
| [κ⁺, κ⁻] | 88.6 | 74.3 | 86.5 | 98.2 |
| [κ⁺, κ⁻, ξ] (GCC) | 89.8 | 74.5 | 88.6 | 99.3 |
Revision. We will expand Section 4.2 to explain variability as disagreement among shared perturbations, including its geometric interpretation and structural implications. We will also add the component-wise ablation results and clarify that the 8.6-point gain on RHG-10 reflects the full curvature profile rather than variability alone.
Empirical Validation and Task-Dependent Effectiveness of GCC
We thank the reviewer for their feedback. We conducted analyses, direct comparisons, experiments and statistical tests to clarify GCC's higher-order expressivity, distinction from existing curvatures, structural interpretation, effectiveness, and limitations.
W1 & W3 & Q1. Real-World Evaluation and Structural Validation
Real-World Hyperedge Prediction. We evaluated GCC on hyperedge prediction across eight hypergraphs: four metabolic networks (node = metabolite, hyperedge = reaction; 2,746–8,346 nodes), where implications distinguish real from false reactions, and four citation hypergraphs from our timing study (node = paper, hyperedge = papers cited by one paper or written by one author; 2,708–19,717 nodes).
Table R3.1. Hyperedge prediction, AUC-PR (25-run mean). Rank: mean rank among twelve curvatures.
Following Yoon et al. (WWW 2020), all methods share 13 pairwise features; each row below Majority measures a descriptor's contribution. Majority, Size, and Degree are unranked controls (Table 1). Negatives replace one member of a held-out hyperedge. We conduct 25 runs with Appendix B's tests. Metabolic networks were selected using a separate split.
ETR ranks first among curvatures (2.00) but averages 189 s and 1,658 MB; GCC ranks second (2.25) at 0.45 s and 130 MB. GCC outperforms scalar GCC-κ, computed from the same closures and perturbations, on all eight hypergraphs.
Motivation for Twin Collection. Hypergraphs with identical degrees and pairwise co-occurrence can differ in higher-order implications. Testing requires (C1) whole-hypergraph labels and (C2) matched pairwise statistics.
Hy-WL satisfies C1, where GCC ranks first (2.80; next: 4.40), but not C2: hyperedge size alone achieves 99.9% on RHG-3. We enumerated 1,800 hypergraph pairs with identical B⊤B and hyperedge sizes across five structural types (Appendix C). Descriptors based solely on matched statistics cannot distinguish these pairs, whereas GCC achieves 99.3%, versus 74.4% for the strongest curvature baseline.
GCC does not lead on IMDB writer collections, which have the lowest implication prevalence (7.9% and 7.0%, versus ≥27% elsewhere), consistent with its dependence on higher-order implications.
Q4. Significance of the Gains in Appendix E
Under Appendix B's corrected resampled t-test, neither GCC nor any of eight existing curvature encodings in Table 6 significantly improves over the backbone. This aligns with prior findings: structural encodings yield no significant gains on these datasets (Pellegrin et al., 2025), while curvature encodings benefit graph classification more than node classification (Fesser & Weber, 2024).
Curvature descriptors appear more effective for whole-hypergraph or node-set tasks (Tables 1 and R3.1) than node classification (Table 6). Table 6 predicts paper topics, where no encoding improves the backbone; in contrast, several curvatures including GCC outperform controls in Table R3.1. Message passing may capture much of the label-relevant structure in Table 6, leaving little benefit from encoding. The backbone is 7–16 points more accurate on nodes within hyperedges, with encoding changes limited to −0.07 to +0.08 points.
Revision. We will add the eight real-world hyperedge prediction results with runtime and memory comparisons, clarify the Twin collection's matched pairwise controls, and report corrected significance tests. We will also discuss GCC's task-dependent effectiveness and limitations.