← Back to all news
arXiv Machine Learning By Elisabeth Fink

Learning the Word Problem: Geodesic Lengths and Cryptographic Applications

Read the original on arXiv Machine Learning →

arXiv:2607. 26241v1 Announce Type: cross Abstract: The Word Problem has been a subject of intensive mathematical study for over a century, initially driving advances in combinatorial group theory and more recently emerging as a foundational hardness assumption in post-quantum cryptography (PQC).

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv AI
Aug 24

Continuous-Time Quantum Walks based Graph Neural Network

The paper introduces CTQW-GNN, a graph neural network that uses Continuous‑Time Quantum Walks (CTQW) to address two common GNN problems: low‑pass bias on heterophilic graphs and over‑smoothing with deep layers. By exploiting the unitary nature of the CTQW propagator, the model preserves high‑frequency signals and maintains feature norms across layers. Three aggregation modules—CTQW‑based, CTQW‑attention, and a low‑pass GAT branch—combine to handle both heterophilic and homophilic graph structures, supported by spectral‑gap analysis and a Lieb–Robinson‑type bound for walk‑time selection.

By Yuliang Zhan, Zefeng Gao, Jian Li, Yang Liu, Hao sun
safety
More like this →