<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>The Tech Gazette · Papers · Journals and labs</title>
    <link>https://techgazette.com.br/research/#journals</link>
    <atom:link href="https://techgazette.com.br/research/journals/feed.xml" rel="self" type="application/rss+xml"/>
    <description>This week's papers in Journals and labs, each with what its authors did and found, in sentences from its own abstract.</description>
    <language>en</language>
    <ttl>180</ttl>
    <lastBuildDate>Fri, 16 Oct 2026 17:29:00 GMT</lastBuildDate>
    <item>
      <title>Designing more efficient quantum circuits with Claude</title>
      <link>https://www.anthropic.com/research/designing-efficient-quantum-circuits</link>
      <guid isPermaLink="true">https://www.anthropic.com/research/designing-efficient-quantum-circuits</guid>
      <pubDate>Fri, 16 Oct 2026 17:29:00 GMT</pubDate>
      <dc:creator>Anthropic Research</dc:creator>
      <category>Journals and labs</category>
      <description>Anthropic Research — Did: Working largely on its own, Claude designed quantum circuits that improve on the best published versions, in some cases by an order of magnitude or more.</description>
    </item>
    <item>
      <title>AI and Communications of the ACM</title>
      <link>https://dl.acm.org/doi/10.1145/3850128</link>
      <guid isPermaLink="true">https://dl.acm.org/doi/10.1145/3850128</guid>
      <pubDate>Fri, 16 Oct 2026 12:00:00 GMT</pubDate>
      <dc:creator>Communications of the ACM</dc:creator>
      <category>Journals and labs</category>
      <description>Communications of the ACM</description>
    </item>
    <item>
      <title>Is Recursive Self-Improvement Really Here?</title>
      <link>https://dl.acm.org/doi/10.1145/3849084</link>
      <guid isPermaLink="true">https://dl.acm.org/doi/10.1145/3849084</guid>
      <pubDate>Fri, 16 Oct 2026 12:00:00 GMT</pubDate>
      <dc:creator>Communications of the ACM</dc:creator>
      <category>Journals and labs</category>
      <description>Communications of the ACM — Did: Frontier labs say their AI models now help build their own successors.</description>
    </item>
    <item>
      <title>Imitation Learning of Avoidance Modes for Efficient Multimodal Model Predictive Control</title>
      <link>https://research.nvidia.com/publication/2026-12_imitation-learning-avoidance-modes-efficient-multimodal-model-predictive</link>
      <guid isPermaLink="true">https://research.nvidia.com/publication/2026-12_imitation-learning-avoidance-modes-efficient-multimodal-model-predictive</guid>
      <pubDate>Fri, 16 Oct 2026 06:50:00 GMT</pubDate>
      <dc:creator>NVIDIA Research</dc:creator>
      <category>Journals and labs</category>
      <description>NVIDIA Research</description>
    </item>
    <item>
      <title>EdgeWise: Bringing Long-Horizon Agents to the Edge via Selective Cloud Delegation</title>
      <link>https://research.nvidia.com/publication/2026-12_edgewise-bringing-long-horizon-agents-edge-selective-cloud-delegation</link>
      <guid isPermaLink="true">https://research.nvidia.com/publication/2026-12_edgewise-bringing-long-horizon-agents-edge-selective-cloud-delegation</guid>
      <pubDate>Fri, 16 Oct 2026 06:45:00 GMT</pubDate>
      <dc:creator>NVIDIA Research</dc:creator>
      <category>Journals and labs</category>
      <description>NVIDIA Research — Did: EdgeWise: Bringing Long-Horizon Agents to the Edge via Selective Cloud Delegation Complex and long-horizon agent tasks often rely on frontier models deployed in the cloud to achieve strong performance.</description>
    </item>
    <item>
      <title>History’s long-secret codes are being cracked by amateurs using AI</title>
      <link>https://www.nature.com/articles/d41586-026-03338-y</link>
      <guid isPermaLink="true">https://www.nature.com/articles/d41586-026-03338-y</guid>
      <pubDate>Fri, 16 Oct 2026 00:00:00 GMT</pubDate>
      <dc:creator>Nature: Computer Science</dc:creator>
      <category>Journals and labs</category>
      <description>Nature: Computer Science</description>
    </item>
    <item>
      <title>LIBERO-PeRM: Benchmarking Personalized Robotic Manipulation</title>
      <link>https://arxiv.org/abs/2610.22372</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2610.22372</guid>
      <pubDate>Thu, 15 Oct 2026 17:59:00 GMT</pubDate>
      <dc:creator>arXiv cs.RO</dc:creator>
      <category>Journals and labs</category>
      <description>arXiv cs.RO — Did: We introduce LIBERO-PeRM, a benchmark for preference learning in embodied agents. Found: Mixed training achieves better no-preference retention than sequential adaptation and improves performance with contextual prompts compared with preference-only training, but can weaken motion-preference learning; preference generalization, decomposition, and conflict handling remain difficult. By Zhixu Li, Keqian Tang, Litian Gong, Jingyu Yao, Wenqian Zhang, Tianze Xu.</description>
    </item>
    <item>
      <title>Discovering state-of-the-art quantum circuits with large language models</title>
      <link>https://arxiv.org/abs/2610.22367</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2610.22367</guid>
      <pubDate>Thu, 15 Oct 2026 17:59:00 GMT</pubDate>
      <dc:creator>arXiv quant-ph</dc:creator>
      <category>Journals and labs</category>
      <description>arXiv quant-ph — Did: Here we introduce an evolutionary framework in which large language models (LLMs) propose circuit designs and an independent evaluator verifies and scores them. Found: By handling reversibility differently, the architecture makes divsteps -- a classical algorithm previously impractical for reversible integer arithmetic -- viable and substantially improves the Toffoli-qubit trade-off for modular inversion. By Andi Gu, Alek H. Kemeny, Susanne F. Yelin, Mikhail D. Lukin.</description>
    </item>
    <item>
      <title>T2-z: Test-Time Optimization of Environment Latents for Robotic World Models</title>
      <link>https://arxiv.org/abs/2610.22364</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2610.22364</guid>
      <pubDate>Thu, 15 Oct 2026 17:59:00 GMT</pubDate>
      <dc:creator>arXiv cs.RO</dc:creator>
      <category>Journals and labs</category>
      <description>arXiv cs.RO — Did: We introduce T2-Z for test-time optimization of environment latents, which augments a robotic world model with a learnable environment latent to condition world predictions. Found: Ablations further show that T2-Z can efficiently infer environment latents from as little as a single test-time interaction trajectory. By Chenyuan Zhou, Yining Hong, Huang Huang, Yunfan Jiang, Wenlong Huang, David Held.</description>
    </item>
    <item>
      <title>CoDA: Co-Evolution of Data Engines and Action Policies</title>
      <link>https://arxiv.org/abs/2610.22362</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2610.22362</guid>
      <pubDate>Thu, 15 Oct 2026 17:59:00 GMT</pubDate>
      <dc:creator>arXiv cs.RO</dc:creator>
      <category>Journals and labs</category>
      <description>arXiv cs.RO — Did: We introduce CoDA, a framework in which a simulation data engine and an action policy co-evolve through a shared heterogeneous memory of environment construction, policy failures, and learning progress. Found: On LIBERO-Pro, 15 rounds of generation and training raise success from 25% to 84% under position perturbations and from 1% to 76% under instruction perturbations. By Tianjiao Yu, Zhilin Ou, Yifan Shen, Xinzhuo Li, Yuanzhe Liu, Onkar Kishor Susladkar.</description>
    </item>
    <item>
      <title>Dexterity from Supervised Play</title>
      <link>https://arxiv.org/abs/2610.22340</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2610.22340</guid>
      <pubDate>Thu, 15 Oct 2026 17:55:00 GMT</pubDate>
      <dc:creator>arXiv cs.RO</dc:creator>
      <category>Journals and labs</category>
      <description>arXiv cs.RO — Did: We present DSP: Dexterity from supervised play, a framework in which a robot learns a play policy from minutes of human play through behavior cloning, then deploys it autonomously to collect hours of interaction data to train a world model. Found: These results demonstrate that supervised play can autonomously collect interaction data, guide model-based planning, and enable policy learning without any task-specific demonstrations or sim-to-real transfer. By Botao He, Yiming Dou, Yiannis Aloimonos, Jitendra Malik, Akash Sharma, Ruoshi Liu.</description>
    </item>
    <item>
      <title>Backward Compatibility in Zero-Bit Neural Audio Watermarking</title>
      <link>https://arxiv.org/abs/2610.22296</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2610.22296</guid>
      <pubDate>Thu, 15 Oct 2026 17:45:00 GMT</pubDate>
      <dc:creator>arXiv cs.SD</dc:creator>
      <category>Journals and labs</category>
      <description>arXiv cs.SD — Did: In this paper the concept of backward compatibility in zero-bit audio watermarking is formalized. By Admir Krnić, Kosta Pavlović, Petar Nedić, Željko Bolević, Slavko Kovačević, Igor Djurović.</description>
    </item>
    <item>
      <title>Asking Smarter Questions: Targeted Active Preference Learning for Underspecified Rewards</title>
      <link>https://arxiv.org/abs/2610.22285</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2610.22285</guid>
      <pubDate>Thu, 15 Oct 2026 17:41:00 GMT</pubDate>
      <dc:creator>arXiv cs.RO</dc:creator>
      <category>Journals and labs</category>
      <description>arXiv cs.RO — Did: We propose shifting this burden to the robot. Found: In simulation, the informed prior beats the standard active preference learning baseline by up to $30.8\%$ in the low-query regime, where reducing human effort matters most. By Helena Merker, Nick Walker, Andreea Bobu.</description>
    </item>
    <item>
      <title>Subgraph Counting with Local Node Differential Privacy</title>
      <link>https://arxiv.org/abs/2610.22278</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2610.22278</guid>
      <pubDate>Thu, 15 Oct 2026 17:39:00 GMT</pubDate>
      <dc:creator>arXiv (systems &amp; security) cs.DS</dc:creator>
      <category>Journals and labs</category>
      <description>arXiv (systems &amp; security) cs.DS — Did: We study the problem of approximately counting subgraphs under local node differential privacy (LNDP), a recently introduced model that enforces strong privacy guarantees in analyses of distributed social networks. Found: Thus, our algorithm achieves optimal error for counting constant-size subgraphs, up to $\mathrm{poly}(1/\varepsilon)$ factors. By Sofya Raskhodnikova, Adam Smith, Connor Wagaman, Anatoly Zavyalov.</description>
    </item>
    <item>
      <title>Denoising Textures is a Different Ballgame Altogether!</title>
      <link>https://arxiv.org/abs/2610.22258</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2610.22258</guid>
      <pubDate>Thu, 15 Oct 2026 17:27:00 GMT</pubDate>
      <dc:creator>arXiv (vision, retrieval &amp; HCI) eess.IV</dc:creator>
      <category>Journals and labs</category>
      <description>arXiv (vision, retrieval &amp; HCI) eess.IV — Did: In this paper, we analyze the behavior of state-of-the-art (SOTA) denoisers on texture datasets and show that performance improvements are possible only by fine-tuning the denoisers on the texture datasets. By Saptarshi Mandal, Oindrila Haldar, Chirayata Bhattacharya, Chandra Sekhar Seelamantula, Zhiwei Xu, Thrasyvoulos N. Pappas.</description>
    </item>
    <item>
      <title>Decentralized LLM Workflows via Sequential Auctions</title>
      <link>https://arxiv.org/abs/2610.22201</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2610.22201</guid>
      <pubDate>Thu, 15 Oct 2026 16:52:00 GMT</pubDate>
      <dc:creator>arXiv cs.GT</dc:creator>
      <category>Journals and labs</category>
      <description>arXiv cs.GT — Did: We present a scalable framework for solving multi-step tasks through a decentralized market of self-interested agents. Found: Across a diverse set of domains, we demonstrate that imperfect competition successfully sustains necessary agent profit margins while maintaining high task success rates at low costs. By Ian Gemp, Shubhendu Trivedi, Adam Fisch, Fantine Huot, Michael Kaisers, Mirella Lapata.</description>
    </item>
    <item>
      <title>Robust Multi-Agent Pursuit with Preemptive Communication via Reachability-Based Control Barrier Functions</title>
      <link>https://arxiv.org/abs/2610.22198</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2610.22198</guid>
      <pubDate>Thu, 15 Oct 2026 16:50:00 GMT</pubDate>
      <dc:creator>arXiv (vision, retrieval &amp; HCI) eess.SY</dc:creator>
      <category>Journals and labs</category>
      <description>arXiv (vision, retrieval &amp; HCI) eess.SY — Did: In this work, we propose a unified control/communication strategy that provides safe control to guarantee inter-agent safety under intermittent communication and demonstrate its effectiveness in a pursuit-evasion scenario. Found: We implement and simulate a variety of pursuit-evasion scenarios and show that preemptive communication reduces messages by 77.5% compared to periodic and event-triggered baselines with zero collisions. By Madison Book, Justin Bradley.</description>
    </item>
    <item>
      <title>Attention over noisy examples: generalization and memorization in the exponential Hopfield network</title>
      <link>https://arxiv.org/abs/2610.22191</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2610.22191</guid>
      <pubDate>Thu, 15 Oct 2026 16:43:00 GMT</pubDate>
      <dc:creator>arXiv cond-mat.dis-nn</dc:creator>
      <category>Journals and labs</category>
      <description>arXiv cond-mat.dis-nn — Did: In Hebbian learning from examples a Hopfield network of $N$ neurons is not supplied with the $K$ archetypes it has to retrieve but with $M$ blurred examples of each, of quality $r$, and whether it can infer them depends on the load $α=K/N$ (interference among them) and on the dataset entropy $ρ=(1-r^2)/(Mr^2)$ (how little the examples… By Francesco Alemanno.</description>
    </item>
    <item>
      <title>Whole-Body Dexterity</title>
      <link>https://arxiv.org/abs/2610.22184</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2610.22184</guid>
      <pubDate>Thu, 15 Oct 2026 16:40:00 GMT</pubDate>
      <dc:creator>arXiv cs.RO</dc:creator>
      <category>Journals and labs</category>
      <description>arXiv cs.RO — Did: We introduce Whole-Body Dexterity (WBD), a general framework that uses the robot's body and appendages as contact surfaces to grasp and manipulate objects. Found: Across real-world whole-body manipulation tasks, the distilled controller completes 90% of trials, compared with 18% for direct retargeting and 4% for a generalist whole-body controller. By Conor Mc Gartoll, An Dang, Pranay Thangeda, Arjun Gupta, Carolina Higuera, Nima Fazeli.</description>
    </item>
    <item>
      <title>REKI: Registering Knowledge in VLAs</title>
      <link>https://arxiv.org/abs/2610.22178</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2610.22178</guid>
      <pubDate>Thu, 15 Oct 2026 16:34:00 GMT</pubDate>
      <dc:creator>arXiv cs.RO</dc:creator>
      <category>Journals and labs</category>
      <description>arXiv cs.RO — Did: We introduce REKI, a 2.4B vision-language-action model (VLA) pretrained exclusively on public data that sets a new Pareto frontier between performance and model size: on LIBERO-Plus, RoboTwin Clean2Rand and RoboCasa365, it is outperformed only by models about twice its size. Found: This memory improves success in simulation and on real robots, and makes oscillations between poses about four times rarer. By Juliette Marrie, Paul Pacaud, Adrien Ramanana Rahary, Shizhe Chen, Moritz Böhle.</description>
    </item>
    <item>
      <title>Facial Expression and Behavior Modeling from Digital Avatars to Expressive Humanoid Robots: A Review</title>
      <link>https://dl.acm.org/doi/10.1145/3856804</link>
      <guid isPermaLink="true">https://dl.acm.org/doi/10.1145/3856804</guid>
      <pubDate>Thu, 15 Oct 2026 12:00:00 GMT</pubDate>
      <dc:creator>ACM Computing Surveys</dc:creator>
      <category>Journals and labs</category>
      <description>ACM Computing Surveys — Did: Endowing humanoid robots with expressive, controllable, and robust facial expressions and behaviors is essential for advancing human-like humanoid-human interaction across social, healthcare, and service domains.</description>
    </item>
    <item>
      <title>Tailoring Elective Courses to Enhance Women’s Participation in Computing</title>
      <link>https://dl.acm.org/doi/10.1145/3793868</link>
      <guid isPermaLink="true">https://dl.acm.org/doi/10.1145/3793868</guid>
      <pubDate>Thu, 15 Oct 2026 12:00:00 GMT</pubDate>
      <dc:creator>Communications of the ACM</dc:creator>
      <category>Journals and labs</category>
      <description>Communications of the ACM — Did: Women remain underrepresented in computing programs globally, despite the growing relevance and reach of the field.</description>
    </item>
    <item>
      <title>Pricing the Unprovable: Ambiguity, Turnstile Runs, and the Verifiability Discount in Crypto Protocols</title>
      <link>https://arxiv.org/abs/2610.21540</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2610.21540</guid>
      <pubDate>Thu, 15 Oct 2026 09:06:00 GMT</pubDate>
      <dc:creator>arXiv (systems &amp; security) q-fin.TR</dc:creator>
      <category>Journals and labs</category>
      <description>arXiv (systems &amp; security) q-fin.TR — Did: We introduce VDISC, a reproducible framework that records reported loss, exposed value, public evidence, returns, and pool flows separately. By Doohwi Cha, Hanhee Kim, Hyeonjun Yeo, Minsuk Sung, Minjae Lee, Seunghan Son.</description>
    </item>
    <item>
      <title>NEST: Stale-Robust Tokenized-Stock Measurement for a Crypto-Treasury LETF Stack</title>
      <link>https://arxiv.org/abs/2610.21491</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2610.21491</guid>
      <pubDate>Thu, 15 Oct 2026 08:28:00 GMT</pubDate>
      <dc:creator>arXiv (systems &amp; security) q-fin.TR</dc:creator>
      <category>Journals and labs</category>
      <description>arXiv (systems &amp; security) q-fin.TR — Did: We develop NEST, a stale-robust protocol that separates this shared-history fit from conditional measurement value. Found: A trade-level reconstruction on Gate gives 25.2%; NVDAX and AAPLX clear their frontiers, whereas TSLAX does not. By Doohwi Cha, Minsuk Sung, Minjae Lee, Hyeonjun Yeo, Hanhee Kim, Seunghan Son.</description>
    </item>
    <item>
      <title>Smoothness of Shortest Isogenies to Frobenius Conjugates</title>
      <link>https://arxiv.org/abs/2610.21488</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2610.21488</guid>
      <pubDate>Thu, 15 Oct 2026 08:25:00 GMT</pubDate>
      <dc:creator>arXiv (systems &amp; security) math.NT</dc:creator>
      <category>Journals and labs</category>
      <description>arXiv (systems &amp; security) math.NT — Did: Let $E$ be chosen uniformly from the geometric isomorphism classes of supersingular elliptic curves over $\overline{\mathbb{F}}_p$ and $δ_E$ be the minimum degree of isogenies from $E$ to its Frobenius conjugate $E^{(p)}$. By Yi Ouyang, Wei Wei, Zheng Xu.</description>
    </item>
  </channel>
</rss>
