Daily report — 2026-10-05
23 new papers screened · 10 analyzed · 0 reproduction runs · markdown
Reproductions
| status | paper | backend | claims matched |
|---|---|---|---|
| No reproduction runs today (opt-in). | |||
Top candidates
| score | paper | feasibility |
|---|---|---|
| 54.7 | Does Learning Protein Folding Generalize to Broader Reasoning? Large language models rely heavily on human text, which often conveys surface answers rather than the spatial and structural logic behind them. Protein folding is a natural testbed, because one solved structure yields thousands of exactly checkable spatial and topological statements. Claimed: accuracy 45.09% Evidence: - LLM-based ("Large language model"); + toy/synthetic experiments ("synthetic"); + small/synthetic data ("synthetic"); + public benchmarks ("benchmarks"); + code: https://github.com/GENTEL-lab/Fold2Reason; + 108 HF upvotes | 6/10 heuristic |
| 54.2 | MemFold: Learning Compact Soft Memory for Long-Context Personalization via On-Policy Optimization An assistant that serves the same user over a long horizon has to answer from what that user has revealed: which preferences still hold, which were revised, and which constraints apply now. Retaining that information is not the same as acting on it, and the two are usually optimized as if they were. Claimed: accuracy 32.0 Evidence: + explicit algorithm/pseudocode ("Algorithm 1"); + code: https://github.com/Johnny221B/memfold; + 7 HF upvotes | 5/10 heuristic |
| 53.7 | SimuVerity: Benchmarking Agents for Engineering-Grade Simulink Model Generation Existing Simulink benchmarks mainly evaluate whether generated models compile, execute, or resemble a reference model. These criteria do not establish whether a model satisfies its engineering requirements. Claimed: none extracted Evidence: + toy/synthetic experiments ("simulation"); + public benchmarks ("benchmarks"); + code: https://github.com/SimuVerity/SimuVerity; + 21 HF upvotes | 5/10 heuristic |
| 52.0 | From Retrieval to Typed Decisions: Calibrated System One Models from Biomedical Sentence Encoders Typed decision models answer schema-constrained questions about a text in one forward pass and return probabilities meant to be thresholded. We ask whether biomedical sentence encoders trained for retrieval are good starting points for such models. Claimed: none extracted Evidence: + claims simplicity ("simple"); + code: https://github.com/pritamdeka/sbert2s1; + keywords: retrieval; + 2 HF upvotes | 5/10 heuristic |
| 51.6 | Science Utopia? Closed-Loop LLM Simulation of Academic Research Ecosystems Scientific progress emerges from a longitudinal ecosystem in which researchers, institutions, funding agencies, collaboration networks, and the scientific literature co-evolve. As AI becomes increasingly involved throughout the scientific research cycle, understanding these interconnected and evolving processes becomes increasingly important. Claimed: none extracted Evidence: - LLM-based ("LLM"); + toy/synthetic experiments ("Simulation"); + small/synthetic data ("simulated"); - system/framework (many moving parts) ("framework"); + code: https://github.com/Ahren09/ScienceUtopia; + 10 HF upvotes | 5/10 heuristic |
| 50.4 | Triadic Linear Attention: Three-Dimensional Recurrent States for Long-Context Sequence Modeling Recurrent neural networks (RNNs) compress the historical context into a memory state of fixed size, thus allowing for constant-time inference. The memory state size is a crucial factor in their performance, as exemplified by the strong performance and resurgence of linear attention, which extends the vector-valued hidden states of ordinary RNNs to matrix-valued hidden states. Claimed: none extracted Evidence: + formal statement ("bound"); + code: https://github.com/OliverSieberling/TriadicLinearAttention; + 5 HF upvotes | 5/10 heuristic |
| 48.9 | World Embedding Benchmark Physical fidelity has received increasing attention in world models and video generation, yet how video representations encode physical information remains less understood. We introduce the World Embedding Benchmark, comprising 8,000 controlled simulation cases from 80 families spanning fluid mechanics, solid mechanics, dynamics, and optics & electromagnetism. Claimed: none extracted Evidence: - pretraining ("pre-trained"); - diffusion/video ("video generation"); + toy/synthetic experiments ("simulation"); + CPU-friendly ("lightweight"); + public benchmarks ("Benchmark"); + code: https://github.com/World-Representation-Lab/World-Embedding-Benchmark; + keywords: retrieval; + 16 HF upvotes | 4/10 heuristic |
| 46.3 | GTR: Gated Token Recurrence for Efficient Dense Prediction Self-attention-based vision backbones perform well on dense prediction, but the quadratic computational cost of global softmax attention limits their efficiency as image resolution increases. We introduce Gated Token Recurrence (GTR), a softmax-free recurrent vision backbone that combines gated linear attention, alternating spatial scan directions, and spatially enhanced SwiGLU blocks. Claimed: none extracted Evidence: - pretraining ("pre-training"); + public benchmarks ("benchmark"); + claims simplicity ("simple"); + code: https://github.com/Intellindust-AI-Lab/GTR; + keywords: kernel; + 4 HF upvotes | 4/10 heuristic |
| 43.6 | Language Models that Play Chess and Explain Their Moves Modern chess engines are silent experts: they play at a superhuman level, but do not offer explanations for their play. On the other hand, language models (LMs) can generate plausible-sounding explanations, but their weak playing strength limits the utility of their explanations. Claimed: none extracted Evidence: - system/framework (many moving parts) ("framework"); + code: https://github.com/queen-project/queen; + 2 HF upvotes | 4/10 heuristic |
| 41.6 | HyperBrowseComp: A Multilingual and Multimodal Stress Test for Web-Browsing Agents We introduce HyperBrowseComp, a multilingual and multimodal browsing benchmark comprising 423 manually authored and human-validated questions across 13 languages, written by native or highly proficient speakers. Questions are designed to be extremely challenging. Claimed: none extracted Evidence: + public benchmarks ("benchmark"); no public code found; + keywords: retrieval; + 18 HF upvotes | 4/10 heuristic |