✓✓ Beats tuned baseline
2026
Represent each input graph by a short ordered sequence of topological tokens rather than a persistence diagram. For each overlapping interval on a shared filtration grid, compute the number of connected components and independent one-dimensional cycles, concatenate these counts with inexpensive graph summary statistics, and process the resulting sequence with a small Transformer. The representation should retain multiscale structural information while avoiding pairwise persistence-diagram…
Useful7/10
Difficulty6/10
Novelty6/10
Unverified
2026
Compute each graph node's discrete curvature from the numbers of simplices in its neighbor-induced unit sphere, then inject this scalar into message-passing or attention logits. Add an optional topology-aware feature channel so that nodes with identical degree but different local clique structure receive different representations.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Compute a compact multiscale interaction signature between colored point clouds and append it to a point-cloud or multimodal neural network as a learned interaction token. The signature captures separated, overlapping, and higher-order enclosing configurations while remaining invariant to rigid transformations.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Compute one-dimensional persistent homology and minimum-norm harmonic representatives, then use their absolute edge coefficients as topology-aware saliency in a graph transformer. Add the saliency to attention logits or use it as a soft regularizer so the model preferentially propagates information along edges that are essential to persistent cycles.
Useful6/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a standard permutation-invariant object pool with a latent state on an unordered configuration together with a fiber vector transported along the observed object trajectories. The instantaneous state remains invariant to reordering, but loops and exchanges of objects act through learned monodromy matrices, allowing the network to represent path-dependent interactions without assigning arbitrary permanent object indices.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Turn attention weights into a Boolean support scenario and prune edges using local-surjectivity constraints rather than independently thresholding each row. Preserve at least one compatible continuation for every local window, then favor a strongly connected support graph so pruning removes redundant mixtures while maintaining a globally coherent sparse attention pattern.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Build a differentiable assignment layer whose rows represent tokens and whose columns represent experts, memory slots, or attention slots. Each row has unit probability mass, but no column receives positive mass from two rows; maintaining at least one vacant column makes assignments continuously deformable through elementary vacancy moves instead of abrupt softmax switches.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Treat learned features on a mesh as differential forms and pool them against oriented chains using wedge or cap products instead of ordinary coordinate averaging. Couple forward and boundary features with the signed chain differential so that pooling commutes with differentiation, preserving local conservation and orientation information.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace unconstrained directed attention logits by observables that are one-sided 1-Lipschitz under a learned quasi-metric: an observable may increase from node j to node i by at most the directed cost from j to i, while the reverse direction can behave differently. Apply this constraint at several subsampled resolutions and penalize the Hausdorff mismatch between observable families of two augmented views, preserving directed structure while making attention stable under perturbations.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct a filtration from learned directed edge or transition weights, compute persistent path homology, and feed compact persistence features into a graph or sequence neural network. Because the paper proves stability under network-distance perturbations, these features should be less sensitive to small changes in edge scores than raw adjacency statistics, while retaining orientation-sensitive information that ordinary undirected topology loses.
Useful5/10
Difficulty7/10
Novelty6/10
Unverified
2026
Construct p shared neural replicas of the same token or feature set, quotient their outputs by the cyclic group C_p, and train a power head to agree with the representation obtained from a jointly processed p-fold input. Add a filtration score whose value is nondecreasing under the power map and strictly increases on deliberately nontrivial replica combinations. The experiment tests whether this algebraically structured consistency signal is better than ordinary pairwise augmentation…
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an ordinary token aggregation step with a p-replica cyclic-equivariant block. Features are copied into p replicas, processed by shared operators, coupled through a cap-like bilinear interaction, and projected onto cyclic invariants. An auxiliary commutation loss enforces that applying the operator before or after the p-fold lift gives similar outputs.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Add a fixed or weakly learned interface-localized branch to a sequence model. Set the critical mass term to zero and make the transport coefficient change sign across a learnable interface, producing a localized mode that pools information near a detected transition rather than averaging uniformly over the sequence.
Useful4/10
Difficulty5/10
Novelty8/10