<?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>Dimitri Lozeve's Blog</title>
        <link>https://lozeve.com</link>
        <description><![CDATA[Recent posts]]></description>
        <atom:link href="https://lozeve.com/rss.xml" rel="self"
                   type="application/rss+xml" />
        <lastBuildDate>Wed, 27 May 2026 00:00:00 UT</lastBuildDate>
        <item>
    <title>Two Types of Bureaucracy: Enabling and Coercive</title>
    <link>https://lozeve.com/posts/types-of-bureaucracy-enabling-and-coercive.html</link>
    <description><![CDATA[A summary of Adler and Borys's paper distinguishing enabling from coercive bureaucracy, and the features and factors that drive each form of formalization.]]></description>
    <pubDate>Wed, 27 May 2026 00:00:00 UT</pubDate>
    <guid>https://lozeve.com/posts/types-of-bureaucracy-enabling-and-coercive.html</guid>
    <dc:creator>Dimitri Lozeve</dc:creator>
</item>
<item>
    <title>Johnson's Rule: scheduling items in two machines</title>
    <link>https://lozeve.com/posts/johnsons-rule.html</link>
    <description><![CDATA[Johnson's rule finds the optimal schedule for processing jobs through two machines. An explanation of the method, its intuition, and code in Python and BQN.]]></description>
    <pubDate>Tue, 19 May 2026 00:00:00 UT</pubDate>
    <guid>https://lozeve.com/posts/johnsons-rule.html</guid>
    <dc:creator>Dimitri Lozeve</dc:creator>
</item>
<item>
    <title>Overengineering Dice Rolling</title>
    <link>https://lozeve.com/posts/diceroll.html</link>
    <description><![CDATA[A simple Dungeons and Dragons dice roller that grew into an over-engineered Rust tool with a parser, statistics, and a WebAssembly website.]]></description>
    <pubDate>Wed, 13 May 2026 00:00:00 UT</pubDate>
    <guid>https://lozeve.com/posts/diceroll.html</guid>
    <dc:creator>Dimitri Lozeve</dc:creator>
</item>
<item>
    <title>Why I built Leibniz: in defense of Gantt charts and project scheduling</title>
    <link>https://lozeve.com/posts/leibniz-product-vision.html</link>
    <description><![CDATA[The origin story behind Leibniz, a project scheduling tool, and a defense of Gantt charts done well.]]></description>
    <pubDate>Sun, 03 May 2026 00:00:00 UT</pubDate>
    <guid>https://lozeve.com/posts/leibniz-product-vision.html</guid>
    <dc:creator>Dimitri Lozeve</dc:creator>
</item>
<item>
    <title>A Mastodon bot for interesting integer sequences</title>
    <link>https://lozeve.com/posts/oeis-bot.html</link>
    <description><![CDATA[Building a Mastodon bot in Rust that posts a random interesting integer sequence from the OEIS every few hours to make its entries more discoverable.]]></description>
    <pubDate>Sat, 14 Feb 2026 00:00:00 UT</pubDate>
    <guid>https://lozeve.com/posts/oeis-bot.html</guid>
    <dc:creator>Dimitri Lozeve</dc:creator>
</item>
<item>
    <title>The Bulgarian Solitaire</title>
    <link>https://lozeve.com/posts/bulgarian-solitaire.html</link>
    <description><![CDATA[A discrete dynamical system on integer partitions that converges to triangular shapes, explained with Young diagrams and simulated in Python and BQN.]]></description>
    <pubDate>Sun, 08 Feb 2026 00:00:00 UT</pubDate>
    <guid>https://lozeve.com/posts/bulgarian-solitaire.html</guid>
    <dc:creator>Dimitri Lozeve</dc:creator>
</item>
<item>
    <title>Language models are injective and hence invertible</title>
    <link>https://lozeve.com/posts/language-models-are-injective.html</link>
    <description><![CDATA[How a recent paper proves Transformer language models are injective as functions from prompts to activations, and can be inverted to reconstruct inputs.]]></description>
    <pubDate>Tue, 25 Nov 2025 00:00:00 UT</pubDate>
    <guid>https://lozeve.com/posts/language-models-are-injective.html</guid>
    <dc:creator>Dimitri Lozeve</dc:creator>
</item>
<item>
    <title>Reading notes: Kolmogorov-Arnold Networks</title>
    <link>https://lozeve.com/posts/kolmogorov-arnold-networks.html</link>
    <description><![CDATA[Reading notes on Kolmogorov-Arnold Networks, which replace MLP node weights with learnable spline activations on edges, grounded in a representation theorem.]]></description>
    <pubDate>Sat, 08 Jun 2024 00:00:00 UT</pubDate>
    <guid>https://lozeve.com/posts/kolmogorov-arnold-networks.html</guid>
    <dc:creator>Dimitri Lozeve</dc:creator>
</item>
<item>
    <title>Randomness and Uncertainty: from random noise to predictable oscillations via differential equations</title>
    <link>https://lozeve.com/posts/randomness-and-uncertainty.html</link>
    <description><![CDATA[Exploring how a differential equation can turn random noise into stable bistable oscillations, replicating Trefethen's experiment in Python with Diffrax.]]></description>
    <pubDate>Fri, 20 Oct 2023 00:00:00 UT</pubDate>
    <guid>https://lozeve.com/posts/randomness-and-uncertainty.html</guid>
    <dc:creator>Dimitri Lozeve</dc:creator>
</item>
<item>
    <title>High reliability organizations</title>
    <link>https://lozeve.com/posts/high-reliability-organizations.html</link>
    <description><![CDATA[Notes on high reliability organizations, the five traits that let nuclear plants and air traffic control manage risk, and their relevance to robust AI.]]></description>
    <pubDate>Fri, 03 Jun 2022 00:00:00 UT</pubDate>
    <guid>https://lozeve.com/posts/high-reliability-organizations.html</guid>
    <dc:creator>Dimitri Lozeve</dc:creator>
</item>

    </channel>
</rss>
