ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “HodgePhaseNet”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.LGcs.CLTheoreticalRecentOct 10, 2026

HodgePhaseNet: Discrete Hodge Decomposition of Semantic Flows in Transformer Attention

Kiyotaka Kasubuchi, Kazuo Fukiya

HodgePhaseNet introduces a new representation for semantic transitions as an antisymmetric real-valued 1-cochain on a finite oriented simplicial complex.

View →
math.ATcs.CGmath-phRecentMay 27, 2026

Gauge Geometry of Hodge Zero-Mode Transport in Parameter-Dependent Topological Data Analysis

Satoshi Kanno, Rei Nishimura, Hiroshi Yamauchi, Yoshi-aki Shimada

The paper introduces a computational framework using Hodge zero-modes to track the geometry of topological features in parameter-dependent data, providing metrics like curvature and holonomy to quanti…

View →
math.COcs.DMmath.CTTheoreticalRecentJul 9, 2026

Subword representations and weak hypercube dimension for acyclic categories

Isaac Carcacía-Campos

This paper introduces a new way to represent finite posets as subwords of finite words in categories, and characterizes the monic categories that admit this representation.

View →
cs.SEcs.AIEmpiricalRecentJun 22, 2026

JupOtter: Cell-Level Bug Detection in Jupyter Notebooks

Lukas Ottenhof, Thibaud Lutellier

The paper introduces JupOtter, a bug detection system for Jupyter Notebooks with three contributions: notebook-specific tokenization, cell-level bug prediction, and a labeled dataset called OtterDatas…

View →
cs.PLcs.MSTheoreticalRecentOct 30, 2026

Grassmann: The Coordinate-Independent Linear Algebra Programming Language

Theadora Fields Collin, Gilbert Bernstein, Oded Stein, Saman Amarasinghe

The paper proposes a language called Grassmann that bridges coordinate-independent linear algebra and coordinate-dependent implementations.

View →
cs.CCTheoreticalRecentJun 14, 2026

Quiet Planting for $k$-SAT, Multiple Solutions of Arbitrary Geometry

Ali Ahmadi, Kiarash Banihashem, Iman Gholami, Mohammad Taghi Hajiaghayi +1 more

This paper proposes a method to construct quiet planting distributions for k-SAT formulas with an arbitrary number of solutions.

View →
cs.CLcs.IREmpiricalRecentOct 20, 2026

DeclineCraft: A RAG Abstention Benchmark for Jointly Measuring Combined Retrieval and Parametric Knowledge

Atharva Thakur, Abulhair Saparov, Bruno Ribeiro

The paper introduces DeclineCraft, a dynamic abstention benchmark to evaluate models' ability to recognize when they lack knowledge.

View →
cs.CLcs.IREmpiricalRecentJun 24, 2026

Three Buddhist Vocabularies: Computational Stylometry of the English Pali Canon across Sutta, Vinaya, and Abhidhamma

Joy Bose

This paper performs a computational stylometric analysis of the Tipitaka across all three Pitakas in English translation.

View →
cs.LGcs.AIphysics.comp-phEmpiricalRecentOct 27, 2026

Attention as Lattice Gauge Theory: Relations Interact Only Through Wilson Loops

Aakash Sarkar, Ananya Mukherjee, Motoshige Sato

This paper introduces a novel method for inferring relations in graphs using holonomy attention, which outperforms existing methods on certain tasks.

View →
cs.CLcs.AIEmpiricalRecentJul 17, 2026

Loop the Loopies!

Zitian Gao, Yilong Chen, Yihao Xiao, Xinyu Yang +3 more

The paper introduces Loopie, two Mixture-of-Experts models that outperform vanilla Transformer baselines in looped Transformers, with extensive ablation studies and a strong reasoning pipeline.

View →
cs.ITmath.GTTheoreticalRecentJun 9, 2026

A New Invariant for Prime Alternating Knots From Error-Correcting Codes

Altan B. Kilic, Ruud Pellikaan, Alberto Ravagnan

This paper introduces a new invariant that distinguishes prime alternating knots using the Alexander-Briggs code.

View →
eess.ASEmpiricalRecentJun 23, 2026

SphereVBx: Spherical Variational Bayes Clustering for Simplified EEND-VC Diarization

Petr Pálka, Jiangyu Han, Prachi Singh, Marc Delcroix +2 more

SphereVBx improves clustering accuracy in diarization pipelines

View →
math.COcs.CCTheoreticalRecentJul 10, 2026

Cut-homotopies and the complexity of edge-coloring problems

Alexey Barsukov, Roman Feller, Maximilian Hadek, Davide Perinti

The paper shows that every problem asking if a given graph has an edge-coloring without an edge-colored clique from a fixed family is poly-time equivalent to a Constraint Satisfaction Problem, resulti…

View →
math.NTcs.DScs.SCTheoreticalRecentJun 22, 2026

Faster enumeration of primes

David Harvey

This paper introduces new algorithms for finding prime numbers up to a given bound, achieving a speedup of log N over the sieve of Eratosthenes.

View →
cs.CCmath.NTTheoreticalRecentAug 12, 2026

Euclidean SVP is deterministically NP-hard to approximate within any constant factor

Daqing Wan

The Euclidean shortest vector problem is deterministically NP-hard to approximate within any constant factor for arbitrary constants.

View →