chore(rss): auto-generate feed.xml

Author: github-actions[bot]

feed.xml

@@ -5,12 +5,26 @@
   <link>https://kadubon.github.io/github.io/</link>
   <description>Research preprints and theoretical works by K. Takahashi</description>
   <language>en</language>
-  <lastBuildDate>Sun, 08 Mar 2026 08:00:28 +0900</lastBuildDate>
+  <lastBuildDate>Tue, 10 Mar 2026 14:05:23 +0900</lastBuildDate>
   <atom:link rel="self" type="application/rss+xml" href="https://kadubon.github.io/github.io/feed.xml" />
   <atom:author>
     <atom:name>K. Takahashi</atom:name>
     <atom:uri>https://orcid.org/0009-0004-4273-3365</atom:uri>
   </atom:author>
+  <item>
+    <title>When Should Inference Be Split? A Fixed-Budget Theory of Predictable Multi-Agent Advantage under Local Context Ceilings</title>
+    <link>https://doi.org/10.5281/zenodo.18932509</link>
+    <guid isPermaLink="true">https://doi.org/10.5281/zenodo.18932509</guid>
+    <pubDate>Tue, 10 Mar 2026 00:00:00 +0900</pubDate>
+    <dc:creator>K. Takahashi</dc:creator>
+    <atom:author>
+      <atom:name>K. Takahashi</atom:name>
+      <atom:uri>https://orcid.org/0009-0004-4273-3365</atom:uri>
+    </atom:author>
+    <description><![CDATA[
+      Preprint — DOI: 10.5281/zenodo.18932509
+    ]]></description>
+  </item>
   <item>
     <title>Search Stability under Finite Context: A Minimal Theory of Adequacy Preservation, Compression, and Reset in Long-Running Agents</title>
     <link>https://doi.org/10.5281/zenodo.18905242</link>