Research papers and global crypto regulation, at a glance

1. ★★★★★AI & Machine LearningOct 22, 2026arXiv
   A Sharp Dynamic Haussler Lemma
   A Sharp Dynamic Haussler Lemma (a tight sequential covering bound for learning classes)
   WhyProves a sharp global dynamic covering bound for bounded real classes, removing logarithmic overhead and resolving several open questions with complete proofs.
2. ★★★★★Other Computer ScienceOct 27, 2026arXiv
   Explicit Reed-Solomon Subspace Designs: Optimal List and Line Decoding
   Explicit Reed-Solomon codes with optimal list and line decoding
   WhyGives explicit Reed-Solomon codes with near-optimal constant list size via subspace designs, with rigorous proofs and new line-decoding reduction.
3. ★★★★★Quantum ComputingOct 26, 2026arXiv
   Exact Identification of Quantum Correlations in the Minimal Bell Scenario
   Exactly Identifying Quantum Correlations in the Simplest Bell Setup
   WhyGives a computable necessary-and-sufficient criterion for the quantum boundary, proving each quantum-advantage Bell functional has a unique quantum maximizer, resolving a long-open problem.
4. ★★★★★Cryptography & SecurityOct 23, 2026arXiv
   The Entire Quantum Computer on a Classical Leash
   A classical client uses an untrusted quantum server as a virtual quantum computer
   WhyClassical client gains virtual quantum computing via untrusted server, resolving two open problems using a maliciously secure LWE-based protocol construction.
5. ★★★★★Crypto & BlockchainOct 27, 2026arXiv
   Tight Characterizations of AMM Mechanism Design under Weak Efficiency
   Tight limits on fair AMM mechanism design under weak efficiency
   WhyProves impossibility of IC and wLE for deterministic anonymous batch AMMs under plain consensus, with tight characterization of strategy restrictions.
6. ★★★★★Other Computer ScienceOct 24, 2026arXiv
   When Multiple-Unicast Feasibility Is Equivalent to Single-Sink Routability
   Proof of the Langberg-Médard Conjecture on Network Coding Versus Fractional Routing
   WhyResolves a long-open multi-unicast coding versus routing conjecture with complete proof and necessary-sufficient cut condition, a significant theoretical advance.
7. ★★★★★Cryptography & SecurityOct 27, 2026IACR ePrint
   HELLO, GOODBYE: Concurrent General Composition From Super-Rushing Security
   HELLO, GOODBYE: Concurrent Composition with Fewer Extra Rounds
   WhyReduces concurrent general composition overhead from doubling rounds to adding two, with rigorous security reductions improving Kushilevitz-Lindell-Rabin.
8. ★★★★★AI & Machine LearningOct 27, 2026arXiv
   Right Click, Wrong Box: Grading GUI Grounding by What a Click Does
   Right Click, Wrong Box: Judging GUI Clicks by Their Outcomes
   WhyProposes outcome-based grading of GUI clicks, validated via live execution probes and a blind audit on ScreenSpot-v2.

Stars are a rough AI assessment based on the title and abstract: each paper is scored for novelty, strength of evidence and breadth of impact, then mapped to 1–5 stars (about 2% get five stars and 10% get four). The site only marks four- and five-star papers as Notable, with a one-line reason; no mark does not mean a paper is weak. The full text is not read, so treat the stars as a reading aid, not a verdict on quality. "Code" means the abstract states that code, data or tools are released.