<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>arXiv Explorer - Recent Papers</title>
    <link>https://arxivexplorer.arxivexplorer.workers.dev</link>
    <description>Latest research papers with AI-powered summaries</description>
    <language>en</language>
    <lastBuildDate>Sun, 14 Jun 2026 09:20:52 GMT</lastBuildDate>
    <atom:link href="https://arxivexplorer.arxivexplorer.workers.dev/rss.xml" rel="self" type="application/rss+xml" />
    
    <item>
      <title>Learning to Reason by Analogy via Retrieval-Augmented Reinforcement Fine-Tuning</title>
      <link>https://arxivexplorer.arxivexplorer.workers.dev/paper/2606.13680</link>
      <guid isPermaLink="true">https://arxivexplorer.arxivexplorer.workers.dev/paper/2606.13680</guid>
      <description>This paper proposes a post-training framework called Retrieval-Augmented Reinforcement Fine-Tuning (RA-RFT) to teach language models to reason by analogy.</description>
      <pubDate>Thu, 11 Jun 2026 00:00:00 GMT</pubDate>
      <category>cs.CL</category><category>cs.AI</category>
    </item>
    <item>
      <title>Mana: Dexterous Manipulation of Articulated Tools</title>
      <link>https://arxivexplorer.arxivexplorer.workers.dev/paper/2606.13677</link>
      <guid isPermaLink="true">https://arxivexplorer.arxivexplorer.workers.dev/paper/2606.13677</guid>
      <description>This paper presents Mana, a sim-to-real framework for dexterous articulated tool manipulation.</description>
      <pubDate>Thu, 11 Jun 2026 00:00:00 GMT</pubDate>
      <category>cs.RO</category><category>cs.AI</category><category>cs.CV</category><category>cs.LG</category>
    </item>
    <item>
      <title>SpatialClaw: Rethinking Action Interface for Agentic Spatial Reasoning</title>
      <link>https://arxivexplorer.arxivexplorer.workers.dev/paper/2606.13673</link>
      <guid isPermaLink="true">https://arxivexplorer.arxivexplorer.workers.dev/paper/2606.13673</guid>
      <description>This paper proposes SpatialClaw, a training-free framework for spatial reasoning that enables open-ended, complex 3D/4D spatial reasoning.</description>
      <pubDate>Thu, 11 Jun 2026 00:00:00 GMT</pubDate>
      <category>cs.CV</category><category>cs.AI</category>
    </item>
    <item>
      <title>Automated reproducibility assessments in the social and behavioral sciences using large language models</title>
      <link>https://arxivexplorer.arxivexplorer.workers.dev/paper/2606.13670</link>
      <guid isPermaLink="true">https://arxivexplorer.arxivexplorer.workers.dev/paper/2606.13670</guid>
      <description>This paper shows that large language models can automate reproducibility assessments in the social and behavioral sciences.</description>
      <pubDate>Thu, 11 Jun 2026 00:00:00 GMT</pubDate>
      <category>cs.AI</category>
    </item>
    <item>
      <title>Agents-K1: Towards Agent-native Knowledge Orchestration</title>
      <link>https://arxivexplorer.arxivexplorer.workers.dev/paper/2606.13669</link>
      <guid isPermaLink="true">https://arxivexplorer.arxivexplorer.workers.dev/paper/2606.13669</guid>
      <description>This paper introduces Agents-K1, an end-to-end knowledge orchestration pipeline that converts raw documents into agent-native scientific knowledge graphs.</description>
      <pubDate>Thu, 11 Jun 2026 00:00:00 GMT</pubDate>
      <category>cs.AI</category>
    </item>
    <item>
      <title>EurekAgent: Agent Environment Engineering is All You Need For Autonomous Scientific Discovery</title>
      <link>https://arxivexplorer.arxivexplorer.workers.dev/paper/2606.13662</link>
      <guid isPermaLink="true">https://arxivexplorer.arxivexplorer.workers.dev/paper/2606.13662</guid>
      <description>This paper presents EurekAgent, an environment-engineered agent system for metric-driven autonomous scientific discovery.</description>
      <pubDate>Thu, 11 Jun 2026 00:00:00 GMT</pubDate>
      <category>cs.AI</category><category>cs.CL</category>
    </item>
    <item>
      <title>SkMTEB: Slovak Massive Text Embedding Benchmark and Model Adaptation</title>
      <link>https://arxivexplorer.arxivexplorer.workers.dev/paper/2606.13647</link>
      <guid isPermaLink="true">https://arxivexplorer.arxivexplorer.workers.dev/paper/2606.13647</guid>
      <description>This paper introduces SkMTEB, a comprehensive text embedding benchmark for Slovak, and develops efficient, locally-deployable Slovak embeddings.</description>
      <pubDate>Thu, 11 Jun 2026 00:00:00 GMT</pubDate>
      <category>cs.CL</category><category>cs.AI</category><category>cs.LG</category>
    </item>
    <item>
      <title>CRAFTIIF: Cross-Resolution Analytic Four-Type Interpretable Isolation Forest for Multivariate Time Series Anomaly Detection</title>
      <link>https://arxivexplorer.arxivexplorer.workers.dev/paper/2606.13486</link>
      <guid isPermaLink="true">https://arxivexplorer.arxivexplorer.workers.dev/paper/2606.13486</guid>
      <description>This paper presents a fully unsupervised framework called CRAFTIIF for detecting four types of anomalies in multivariate time series data.</description>
      <pubDate>Thu, 11 Jun 2026 00:00:00 GMT</pubDate>
      <category>cs.LG</category><category>cs.AI</category>
    </item>
    <item>
      <title>Extended Frege proofs, circuits and rewriting</title>
      <link>https://arxivexplorer.arxivexplorer.workers.dev/paper/2606.13367</link>
      <guid isPermaLink="true">https://arxivexplorer.arxivexplorer.workers.dev/paper/2606.13367</guid>
      <description>This paper proves several properties about Extended Frege proof systems and circuit equivalence.</description>
      <pubDate>Thu, 11 Jun 2026 00:00:00 GMT</pubDate>
      <category>math.LO</category><category>cs.CC</category>
    </item>
    <item>
      <title>Sketching Intersection Profiles: A Simple Proof and Three Applications</title>
      <link>https://arxivexplorer.arxivexplorer.workers.dev/paper/2606.13182</link>
      <guid isPermaLink="true">https://arxivexplorer.arxivexplorer.workers.dev/paper/2606.13182</guid>
      <description>This paper settles the complexity of three sketching problems in graphs and distributions.</description>
      <pubDate>Thu, 11 Jun 2026 00:00:00 GMT</pubDate>
      <category>cs.DS</category><category>cs.CC</category>
    </item>
  </channel>
</rss>