<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
  <title>Ahbar — All Technical, Scientific &amp; Strategic Dispatches</title>
  <subtitle>Daily curated dispatches across computer science, AI, mathematics, physics, systems, biotech, cryptography, economics, geopolitics, and philosophy of science.</subtitle>
  <link href="https://latifkedi.github.io/ahbar/feed/all.xml" rel="self" type="application/atom+xml"/>
  <link href="https://latifkedi.github.io/ahbar/"/>
  <id>https://latifkedi.github.io/ahbar/feed/all.xml</id>
  <updated>2026-11-15T12:20:19.629677126+00:00</updated>
  <entry>
    <title>Discord Patch Notes: November 9, 2026. Check out the finer details of the more technical fixes implemented into Discord recently.</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-02-discord-patch-notes-november-9"/>
    <link rel="related" href="https://discord.com/blog/discord-patch-notes-november-9-2026"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-02-discord-patch-notes-november-9</id>
    <updated>2026-11-09T00:00:00+00:00</updated>
    <summary type="html">&lt;p&gt;Check out the finer details of the more technical fixes implemented into Discord recently.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://discord.com/blog/discord-patch-notes-november-9-2026&quot;&gt;Discord Systems &amp;amp; Database Engineering&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #rust #databases&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Show HN: An e-ink frame that hears birds and draws them as 1800s illustrations</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-01-show-hn-an-e-ink"/>
    <link rel="related" href="https://github.com/arnegiacomo/fugleramme"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-01-show-hn-an-e-ink</id>
    <updated>2026-09-15T12:31:10Z</updated>
    <summary type="html">&lt;p&gt;Published via Show HN (Trending Repos &amp;amp; Tools) in Computer Science &amp;amp; Software. Primary discussion and technical specification available at the linked source.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://github.com/arnegiacomo/fugleramme&quot;&gt;Show HN (Trending Repos &amp;amp; Tools)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #trending-repo #open-source&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Show HN: Can’t afford Bloomberg Terminal? No prob, I built the next best thing</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-03-show-hn-can-t-afford"/>
    <link rel="related" href="https://github.com/DidierRLopes/GamestonkTerminal"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-03-show-hn-can-t-afford</id>
    <updated>2021-02-25T01:47:30Z</updated>
    <summary type="html">&lt;p&gt;Published via Show HN (Trending Repos &amp;amp; Tools) in Computer Science &amp;amp; Software. Primary discussion and technical specification available at the linked source.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://github.com/DidierRLopes/GamestonkTerminal&quot;&gt;Show HN (Trending Repos &amp;amp; Tools)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #trending-repo #open-source&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>TTB: Test-time Baking for Efficient Rendering of Decoder-only View Synthesis Models</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-10-ttb-test-time-baking-for"/>
    <link rel="related" href="https://arxiv.org/abs/2611.17331"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-10-ttb-test-time-baking-for</id>
    <updated>2026-11-11T19:00:00.000Z</updated>
    <summary type="html">&lt;p&gt;Decoder-only Large View Synthesis Models (LVSMs) with KV-cache have recently achieved state-of-the-art quality by regressing novel views from neural networks without reconstructing 3D geometry, while Test-Time Training (TTT) layers save computation but sacrifice quality. We propose Test-Time Baking (TTB), a strategy that learns to bake global scene information from cross-view attention into a lightweight MLP, enabling fast and high-fidelity novel-view decoding. The first key is to repurpose the fast-weight MLP of TTT to learn the cross-view attention mapping explicitly from its input-output pairs, rather than replacing attention entirely, achieving the same rendering efficiency as TTT while delivering substantially higher quality.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.17331&quot;&gt;Hugging Face Daily Papers&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #llm #open-weights #neuroscience&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Show HN: This up votes itself</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-04-show-hn-this-up-votes"/>
    <link rel="related" href="http://news.ycombinator.com/vote?for=3742902&amp;dir=up&amp;whence=%6e%65%77%65%73%74"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-04-show-hn-this-up-votes</id>
    <updated>2012-03-23T00:40:39Z</updated>
    <summary type="html">&lt;p&gt;Published via Show HN (Trending Repos &amp;amp; Tools) in Computer Science &amp;amp; Software. Primary discussion and technical specification available at the linked source.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;http://news.ycombinator.com/vote?for=3742902&amp;amp;dir=up&amp;amp;whence=%6e%65%77%65%73%74&quot;&gt;Show HN (Trending Repos &amp;amp; Tools)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #trending-repo #open-source&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Show HN: Gemini Pro 3 imagines the HN front page 10 years from now</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-05-show-hn-gemini-pro-3"/>
    <link rel="related" href="https://dosaygo-studio.github.io/hn-front-page-2035/news"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-05-show-hn-gemini-pro-3</id>
    <updated>2025-12-09T15:00:38Z</updated>
    <summary type="html">&lt;p&gt;Published via Show HN (Trending Repos &amp;amp; Tools) in Computer Science &amp;amp; Software. Primary discussion and technical specification available at the linked source.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://dosaygo-studio.github.io/hn-front-page-2035/news&quot;&gt;Show HN (Trending Repos &amp;amp; Tools)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #trending-repo #open-source&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Show HN: I made an open-source laptop from scratch</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-06-show-hn-i-made-an"/>
    <link rel="related" href="https://www.byran.ee/posts/creation/"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-06-show-hn-i-made-an</id>
    <updated>2025-01-22T20:41:52Z</updated>
    <summary type="html">&lt;p&gt;Published via Show HN (Trending Repos &amp;amp; Tools) in Computer Science &amp;amp; Software. Primary discussion and technical specification available at the linked source.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://www.byran.ee/posts/creation/&quot;&gt;Show HN (Trending Repos &amp;amp; Tools)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #trending-repo #open-source&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Show HN: If YouTube had actual channels</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-07-show-hn-if-youtube-had"/>
    <link rel="related" href="https://ytch.xyz"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-07-show-hn-if-youtube-had</id>
    <updated>2024-08-14T15:10:06Z</updated>
    <summary type="html">&lt;p&gt;Published via Show HN (Trending Repos &amp;amp; Tools) in Computer Science &amp;amp; Software. Primary discussion and technical specification available at the linked source.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://ytch.xyz&quot;&gt;Show HN (Trending Repos &amp;amp; Tools)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #trending-repo #open-source&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Show HN: A retro video game console I&apos;ve been working on in my free time</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-08-show-hn-a-retro-video"/>
    <link rel="related" href="https://internalregister.github.io/2019/03/14/Homebrew-Console.html"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-08-show-hn-a-retro-video</id>
    <updated>2019-03-14T20:25:03Z</updated>
    <summary type="html">&lt;p&gt;Published via Show HN (Trending Repos &amp;amp; Tools) in Computer Science &amp;amp; Software. Primary discussion and technical specification available at the linked source.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://internalregister.github.io/2019/03/14/Homebrew-Console.html&quot;&gt;Show HN (Trending Repos &amp;amp; Tools)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #trending-repo #open-source&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Show HN: Redbean – Single-file distributable web server</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-09-show-hn-redbean-single-file"/>
    <link rel="related" href="https://justine.lol/redbean/index.html"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-09-show-hn-redbean-single-file</id>
    <updated>2021-02-26T03:33:56Z</updated>
    <summary type="html">&lt;p&gt;Published via Show HN (Trending Repos &amp;amp; Tools) in Computer Science &amp;amp; Software. Primary discussion and technical specification available at the linked source.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://justine.lol/redbean/index.html&quot;&gt;Show HN (Trending Repos &amp;amp; Tools)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #trending-repo #open-source&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Open Vision Banana: A Fully Open Recipe for Generative Visual Perception. Recent work suggests that pretrained image generators encode real-world understanding beyond image synthesis.</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-11-open-vision-banana-a-fully"/>
    <link rel="related" href="https://arxiv.org/abs/2611.15844"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-11-open-vision-banana-a-fully</id>
    <updated>2026-11-10T19:00:00.000Z</updated>
    <summary type="html">&lt;p&gt;Recent work suggests that pretrained image generators encode real-world understanding beyond image synthesis. Vision Banana exploits this by framing vision tasks as conditional image editing. However, its data, weights, code, and implementation details are not public.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.15844&quot;&gt;Hugging Face Daily Papers&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #llm #open-weights #infosec&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Actor, Judge, or Teacher? Understanding Decision Models in Long-Horizon Agents</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-12-actor-judge-or-teacher-understanding"/>
    <link rel="related" href="https://arxiv.org/abs/2611.17167"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-12-actor-judge-or-teacher-understanding</id>
    <updated>2026-11-11T19:00:00.000Z</updated>
    <summary type="html">&lt;p&gt;Decision models answer a question with a typed output, such as a choice among options with a probability for each, so one model can choose an agent&amp;apos;s actions, evaluate actions already taken, or score every action to teach a policy with reinforcement learning. Prior work has studied them mainly as actors, judging their usefulness by how well they act. We ask whether a decision model that acts poorly can still teach well.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.17167&quot;&gt;Hugging Face Daily Papers&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #llm #open-weights #agents #reinforcement-learning&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Ropedia Xperience 2: A Gold Standard for Scaling Physical AI Environments and Behaviors</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-13-ropedia-xperience-2-a-gold"/>
    <link rel="related" href="https://arxiv.org/abs/2611.17060"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-13-ropedia-xperience-2-a-gold</id>
    <updated>2026-11-11T19:00:00.000Z</updated>
    <summary type="html">&lt;p&gt;Large foundation models such as GPT-6 Astra and Claude Fable 5.1 have recently been shown to control robots directly from visual observations. They nevertheless remain brittle on long-horizon, contact-rich tasks in real-world environments. Further progress depends on two complementary resources: demonstrations of human behavior that supervise how tasks are performed, and interactive environments in which policies can be rolled out, evaluated, and improved in closed loop.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.17060&quot;&gt;Hugging Face Daily Papers&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #llm #open-weights #robotics&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Unbundling Multimodal Vision Encoding. How multimodal language models should encode visual input remains up for debate.</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-14-unbundling-multimodal-vision-encoding"/>
    <link rel="related" href="https://arxiv.org/abs/2611.17334"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-14-unbundling-multimodal-vision-encoding</id>
    <updated>2026-11-11T19:00:00.000Z</updated>
    <summary type="html">&lt;p&gt;How multimodal language models should encode visual input remains up for debate. Most models use a pretrained vision encoder, while some recent recipes train the encoder from scratch with the language model or remove it entirely. Vision encoders bundle together three design choices: a visual prior from upstream pretraining, dedicated vision capacity, and pre-fusion placement of that capacity (i.e., before the multimodal backbone).&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.17334&quot;&gt;Hugging Face Daily Papers&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #llm #open-weights #clean-tech&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Factored One-sided Adam-Moment for Practical and Scalable SOAP</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-15-factored-one-sided-adam-moment"/>
    <link rel="related" href="https://arxiv.org/abs/2611.16905"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-15-factored-one-sided-adam-moment</id>
    <updated>2026-11-11T19:00:00.000Z</updated>
    <summary type="html">&lt;p&gt;Second-order optimizers (e.g., Shampoo, SOAP) have emerged as compelling alternatives to Adam/AdamW and promise faster per-step convergence than AdamW in transformer training. However, they still remain costly in practice, and even SOAP still pays substantial optimizer-state memory and eigendecomposition overhead. We ask whether the benefits of SOAP can be retained at nearly the efficiency of AdamW.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.16905&quot;&gt;Hugging Face Daily Papers&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #llm #open-weights&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Back to Pixels: Lifting Latent Video Diffusion into Pixel Space. Frontier video generation models work in a VAE latent space that compresses video in both space and time.</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-18-back-to-pixels-lifting-latent"/>
    <link rel="related" href="https://arxiv.org/abs/2611.17336"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-18-back-to-pixels-lifting-latent</id>
    <updated>2026-11-11T19:00:00.000Z</updated>
    <summary type="html">&lt;p&gt;Frontier video generation models work in a VAE latent space that compresses video in both space and time. This compression made training tractable, but now limits high-resolution, controllable, and interactive generation -- doubling resolution quadruples token count, conditions apply to groups of frames rather than individual ones, and each response must wait for the rest of its multi-frame block. We present PixVid, a simple yet effective method that lifts a pretrained latent video model to directly generate every frame in pixel space.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.17336&quot;&gt;Hugging Face Daily Papers&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #llm #open-weights #clean-tech #computer-vision&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>The Value of Thinking: Learning When to Reason in Hybrid Decision Models</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-16-the-value-of-thinking-learning"/>
    <link rel="related" href="https://arxiv.org/abs/2611.16961"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-16-the-value-of-thinking-learning</id>
    <updated>2026-11-11T19:00:00.000Z</updated>
    <summary type="html">&lt;p&gt;Existing adaptive-reasoning methods shorten the explicit reasoning a model writes, or skip it by switching modes; either way the answer is still written out token by token. Rather than deciding how much to think, we explore a different paradigm, zero-or-T thinking: a single model either answers from the implicit thinking inside one forward pass, generating no token, or performs full autoregressive reasoning at a cost of T tokens when that is worth paying. We realise it in a hybrid decision model (HDM), where one frozen backbone serves both modes and a lightweight self-routing block chooses between them.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.16961&quot;&gt;Hugging Face Daily Papers&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #llm #open-weights #agents&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Agent-R^2: Scaling Agents for Realistic Productivity Work via Real-Source Data Synthesis</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-17-agent-r-2-scaling-agents"/>
    <link rel="related" href="https://arxiv.org/abs/2611.08219"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-17-agent-r-2-scaling-agents</id>
    <updated>2026-11-04T19:00:00.000Z</updated>
    <summary type="html">&lt;p&gt;Large language models have made rapid progress in agentic reasoning and tool use, raising expectations for agents that can take over realistic productivity work from humans. However, current agents still struggle to finish such tasks, where success requires following long-horizon professional workflows, understanding heterogeneous file contexts, and producing usable deliverables under fine-grained requirements. A key bottleneck is the lack of scalable post-training data that reflects real work intent, authentic file environments, and deliverable-level evaluation.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.08219&quot;&gt;Hugging Face Daily Papers&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #llm #open-weights #agents #reinforcement-learning&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Accuracy Is Not Welfare: Evaluating AI Buyers under Strategic Price Complexity in a Synthetic Duopoly</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-64-accuracy-is-not-welfare-evaluating"/>
    <link rel="related" href="https://arxiv.org/abs/2611.16471v1"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-64-accuracy-is-not-welfare-evaluating</id>
    <updated>2026-11-12T08:28:49+00:00</updated>
    <summary type="html">&lt;p&gt;AI buying agents may alter sellers&amp;apos; incentives as well as consumers&amp;apos; decisions. In a synthetic duopoly, we evaluate price-comparison pipelines on a fixed menu and in empirical correlated-equilibrium games. Calculator assistance selects an optimal offer 84.00% of the time, versus 68.57% under verified-total disclosure, yet disclosure has a 20.14-unit higher consumer-worst equilibrium surplus.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.16471v1&quot;&gt;arXiv Economics (econ.EM, econ.GN, econ.TH)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #econometrics #macroeconomics #decision-theory #quant-finance&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Long-lived light-driven bimagnons at finite momentum in NiO. Light can manipulate magnetic order and its excitations on ultrafast timescales, including through resonantly driven phonons.</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-28-long-lived-light-driven-bimagnons"/>
    <link rel="related" href="https://arxiv.org/abs/2611.17335v1"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-28-long-lived-light-driven-bimagnons</id>
    <updated>2026-11-12T18:59:55+00:00</updated>
    <summary type="html">&lt;p&gt;Light can manipulate magnetic order and its excitations on ultrafast timescales, including through resonantly driven phonons. In antiferromagnets, light can also create correlated magnon pairs, or bimagnons. Unlike single magnons, whose damping has been measured and modeled in detail, little is known about the lifetime, interactions and decay of such correlated pairs: prior two-magnon measurements show broad linewidths or coherences that dephase within 200 fs.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.17335v1&quot;&gt;arXiv Quantum &amp;amp; Condensed Matter (quant-ph, cond-mat)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #quantum-computing #condensed-matter #materials-science #optics-photonics&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Possible futures of the Ethereum protocol, part 6: The Splurge</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-55-possible-futures-of-the-ethereum"/>
    <link rel="related" href="https://vitalik.ca/general/2024/10/29/futures6.html"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-55-possible-futures-of-the-ethereum</id>
    <updated>2024-10-29T00:00:00+00:00</updated>
    <summary type="html">&lt;p&gt;Published via Vitalik Buterin&amp;apos;s Blog in Cryptography, Web3 &amp;amp; Protocols. Primary discussion and technical specification available at the linked source.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://vitalik.ca/general/2024/10/29/futures6.html&quot;&gt;Vitalik Buterin&amp;apos;s Blog&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #zkp #consensus&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Verifiable Settlement and Pricing for Local Energy Markets: Architecture and Deployment on Hyperledger Besu</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-56-verifiable-settlement-and-pricing-for"/>
    <link rel="related" href="https://arxiv.org/abs/2611.16495v1"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-56-verifiable-settlement-and-pricing-for</id>
    <updated>2026-11-12T09:02:06+00:00</updated>
    <summary type="html">&lt;p&gt;We implement privacy-preserving local electricity exchanges using an automated market maker on the Hyperledger Besu network under QBFT consensus. The proposed protocol operator collects individual electricity positions off-chain and publishes aggregate supply and demand on the blockchain, where smart contracts compute market prices every fifteen minutes. Individual positions remain off-chain; Poseidon2 commitments and UltraHonk zeroknowledge proofs, generated from Noir circuits, verify aggregation, payments, and daily balance updates.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.16495v1&quot;&gt;arXiv Cryptography &amp;amp; Security (cs.CR)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #cryptography #zkp #decision-theory #quant-finance&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Security updates for Friday</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-37-security-updates-for-friday"/>
    <link rel="related" href="https://lwn.net/Articles/1107472/"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-37-security-updates-for-friday</id>
    <updated>2026-11-13T14:25:42+00:00</updated>
    <summary type="html">&lt;p&gt;Security updates have been issued by AlmaLinux (.NET 10.0, .NET 8.0, .NET 9.0, firefox, gcc, grafana, grafana-pcp, gstreamer1, gstreamer1-plugins-base, java-1.8.0-openjdk, kernel, kernel-rt, libimobiledevice, mingw-libpng, nginx:1.24, nodejs:22, nodejs:24, perl-CGI, perl-DBI, qt5-qtbase, tigervnc, vim, and xorg-x11-server), Debian (apache2, c-ares, linux-6.12, node-shell-quote, nova, parted, postgresql-17,…&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://lwn.net/Articles/1107472/&quot;&gt;LWN.net (Linux &amp;amp; Kernel Engineering)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #kernel-os #performance #rust #databases&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Hot Chips 2026: Intel’s Crescent Island. All about making things affordable</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-38-hot-chips-2026-intel-s"/>
    <link rel="related" href="https://chipsandcheese.com/p/hot-chips-2026-intels-crescent-island"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-38-hot-chips-2026-intel-s</id>
    <updated>2026-08-27T05:12:31+00:00</updated>
    <summary type="html">&lt;p&gt;All about making things affordable&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://chipsandcheese.com/p/hot-chips-2026-intels-crescent-island&quot;&gt;Chips and Cheese (Microarchitecture Deep-Dives)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #computer-architecture #semiconductors&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Doom GPU Flame Graphs</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-39-doom-gpu-flame-graphs"/>
    <link rel="related" href="http://www.brendangregg.com/blog//2025-05-01/doom-gpu-flame-graphs.html"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-39-doom-gpu-flame-graphs</id>
    <updated>2025-04-30T14:00:00+00:00</updated>
    <summary type="html">&lt;p&gt;Imagine halving the resource costs of AI and what that could mean for the planet and the industry -- based on extreme estimates such savings could reduce the total US power usage by over 10% by 2030 1 . At Intel we&amp;apos;ve been creating a new analyzer tool to help reduce AI costs called AI Flame Graphs : a visualization that shows an AI accelerator or GPU hardware profile along with the full software stack, based on my CPU flame graphs . Our first version is available to customers in the Intel Tiber AI Cloud as a preview for the Intel Data Center GPU Max Series (previously called Ponte Vecchio).&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;http://www.brendangregg.com/blog//2025-05-01/doom-gpu-flame-graphs.html&quot;&gt;Brendan Gregg (Systems Performance &amp;amp; eBPF)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #kernel-os #performance #compilers #combinatorics&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Toward the abelian category of positive Lagrangians</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-19-toward-the-abelian-category-of"/>
    <link rel="related" href="https://arxiv.org/abs/2611.17282v1"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-19-toward-the-abelian-category-of</id>
    <updated>2026-11-12T18:51:25+00:00</updated>
    <summary type="html">&lt;p&gt;We introduce a geometric construction whose terminal configuration determines the kernel and cokernel of a morphism between positive Lagrangian branes in the derived Fukaya category of a Calabi-Yau manifold. Thus, if the construction always terminates, the full subcategory of positive Lagrangian branes is abelian, as conjectured by Joyce. We show that this abelian category admits Harder-Narasimhan filtrations with respect to the central charge defined by the holomorphic volume form.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.17282v1&quot;&gt;arXiv Mathematics (NT, CO, AG, LO, AT, GR)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #number-theory #combinatorics #high-energy #algebra-geometry&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Sowing the Seeds of Intractability: Kalah is PSPACE-complete. Kalah is a classic two-player game in the mancala family of sowing games.</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-20-sowing-the-seeds-of-intractability"/>
    <link rel="related" href="https://arxiv.org/abs/2611.17252v1"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-20-sowing-the-seeds-of-intractability</id>
    <updated>2026-11-12T18:38:34+00:00</updated>
    <summary type="html">&lt;p&gt;Kalah is a classic two-player game in the mancala family of sowing games. Computers have solved several standard-size starting positions, but the complexity of the game on boards of growing size has remained open. We study the natural generalization in which the number of pits per side is part of the input and an arbitrary position is given, with the stone counts given in unary.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.17252v1&quot;&gt;arXiv Mathematics (NT, CO, AG, LO, AT, GR)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #number-theory #combinatorics #algorithms #decision-theory&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Dimension drop for superlevel sets of the uniform Littlewood constant</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-21-dimension-drop-for-superlevel-sets"/>
    <link rel="related" href="https://arxiv.org/abs/2611.17189v1"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-21-dimension-drop-for-superlevel-sets</id>
    <updated>2026-11-12T17:54:36+00:00</updated>
    <summary type="html">&lt;p&gt;For $(x,y)\in\mathbb{R}^2$ and $Q\ge 1$, set $F_Q(x,y)=Q\min_{1\le q\le Q}\lVert qx\rVert\lVert qy\rVert$, where $q$ ranges over positive integers and $\lVert\cdot\rVert$ denotes distance to the nearest integer. The set on which the uniform Littlewood constant $L=\limsup_{Q\to\infty}F_Q$ is positive has full Hausdorff dimension. We prove that for every fixed $c&amp;gt;0$ the superlevel set $\{L\ge c\}$ has Hausdorff dimension strictly less than two.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.17189v1&quot;&gt;arXiv Mathematics (NT, CO, AG, LO, AT, GR)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #number-theory #combinatorics #analysis-pde #post-quantum&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Learning Dynamics of the Influencer&apos;s Game in Resource Landscapes</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-65-learning-dynamics-of-the-influencer"/>
    <link rel="related" href="https://arxiv.org/abs/2611.17148v1"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-65-learning-dynamics-of-the-influencer</id>
    <updated>2026-11-12T17:33:27+00:00</updated>
    <summary type="html">&lt;p&gt;Across domains as varied as ecology, economics, and online platforms, individuals are incentivized to position themselves within resource-rich strategy spaces. In this work we introduce a new spatial game framework called the influencer&amp;apos;s game. Within this new framework players&amp;apos; strategies are represented as positions within a trait space.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.17148v1&quot;&gt;arXiv Economics (econ.EM, econ.GN, econ.TH)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #econometrics #macroeconomics #decision-theory #market-design&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Unequal Rewards and the Direction of Scientific Work: Evidence from U.S. Public Universities</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-66-unequal-rewards-and-the-direction"/>
    <link rel="related" href="https://arxiv.org/abs/2611.16747v1"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-66-unequal-rewards-and-the-direction</id>
    <updated>2026-11-12T12:58:45+00:00</updated>
    <summary type="html">&lt;p&gt;Research on pay dispersion has long asked whether unequal rewards increase or depress performance. Tournament theory expects stronger effort, while social comparison accounts expect withdrawal. Both perspectives, however, treat performance as a single scale on which workers can be ranked.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.16747v1&quot;&gt;arXiv Economics (econ.EM, econ.GN, econ.TH)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #econometrics #macroeconomics #complex-systems&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Designing Information in a Forest: Algorithmic Aspects. The Bayesian persuasion framework models strategic information revelation by a sender to one or more receivers.</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-67-designing-information-in-a-forest"/>
    <link rel="related" href="https://arxiv.org/abs/2611.16327v1"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-67-designing-information-in-a-forest</id>
    <updated>2026-11-12T05:49:55+00:00</updated>
    <summary type="html">&lt;p&gt;The Bayesian persuasion framework models strategic information revelation by a sender to one or more receivers. We study an intricate version of the multi-receiver persuasion setting in which the communication hierarchy is a forest - i.e., some receivers observe more informative signals than others, and the partial ordering of the receivers according to the information they get is represented by a pre-specified directed forest. This model naturally captures interactions in hierarchical organizations, and it lies in between the two most commonly studied versions of Bayesian persuasion: private persuasion and public persuasion.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.16327v1&quot;&gt;arXiv Economics (econ.EM, econ.GN, econ.TH)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #econometrics #macroeconomics #decision-theory #market-design&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>A deployed four-city entanglement-based QKD network with real-time key delivery, benchmarked against finite-key security bounds</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-31-a-deployed-four-city-entanglement"/>
    <link rel="related" href="https://arxiv.org/abs/2611.17265v1"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-31-a-deployed-four-city-entanglement</id>
    <updated>2026-11-12T18:45:08+00:00</updated>
    <summary type="html">&lt;p&gt;Quantum key distribution (QKD) generates shared secret keys whose security rests on the laws of physics rather than on computational assumptions. We report the entanglement-based segment of the Slovak national quantum communication infrastructure, connecting four cities in western Slovakia over deployed telecommunication fiber. Polarization-entangled photons generated at a central node are passively routed by wavelength to form a trusted-node-free, fully meshed sub-network of three cities, with the fourth connected through the central node and all links operated simultaneously.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.17265v1&quot;&gt;arXiv Quantum &amp;amp; Condensed Matter (quant-ph, cond-mat)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #quantum-computing #condensed-matter #optics-photonics #rust&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Non-interferometric tests of gravitational decoherence models with mechanical oscillators</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-32-non-interferometric-tests-of-gravitational"/>
    <link rel="related" href="https://arxiv.org/abs/2611.17260v1"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-32-non-interferometric-tests-of-gravitational</id>
    <updated>2026-11-12T18:43:12+00:00</updated>
    <summary type="html">&lt;p&gt;Phenomenological models of quantum-gravity-induced decoherence can leave observable effects even in experiments that do not rely on interferometric measurements. We study three such models, based respectively on deformed relativistic symmetries, stochastic metric fluctuations, and a stochastic generalized uncertainty principle, all of which induce decoherence in the momentum basis. For a free particle, the models preserve momentum distribution and mean energy but produce position diffusion and momentum-space decoherence with model-specific momentum dependences.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.17260v1&quot;&gt;arXiv Quantum &amp;amp; Condensed Matter (quant-ph, cond-mat)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #quantum-computing #condensed-matter #astrophysics #clean-tech&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Implementation of a 1D Gaussian-modulated CV-QKD under finite-size parameter estimation</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-33-implementation-of-a-1d-gaussian"/>
    <link rel="related" href="https://arxiv.org/abs/2611.17250v1"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-33-implementation-of-a-1d-gaussian</id>
    <updated>2026-11-12T18:37:36+00:00</updated>
    <summary type="html">&lt;p&gt;Continuous-variable quantum key distribution (CV-QKD) is a promising technology for quantum-secure communications, offering high secret-key rates and straightforward integration with coherent optical communication systems. Conventional Gaussian-modulated CV-QKD encodes information in both optical-field quadratures, increasing requirements for state preparation, modulation, and calibration, while potentially introducing additional preparation imperfections. Unidimensional (1D) Gaussian modulation offers a simpler alternative by encoding information in only one quadrature, while the conjugate quadrature constrains the protocol&amp;apos;s security.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.17250v1&quot;&gt;arXiv Quantum &amp;amp; Condensed Matter (quant-ph, cond-mat)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #quantum-computing #condensed-matter #optics-photonics&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Lattice response theory for subsystem symmetry-protected topological phases</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-34-lattice-response-theory-for-subsystem"/>
    <link rel="related" href="https://arxiv.org/abs/2611.17182v1"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-34-lattice-response-theory-for-subsystem</id>
    <updated>2026-11-12T17:50:53+00:00</updated>
    <summary type="html">&lt;p&gt;We develop a framework to study subsystem symmetry-protected topological (SSPT) phases using lattice response theory. We begin with a systematic construction of spacetime lattice gauge fields from general microscopic $X$-type symmetry actions on qudit systems, including global symmetries, subsystem symmetries, and more general modulated symmetries. Given a gauge-invariant response action, we then construct a corresponding entangler and explicitly show that it implements stacking with the SSPT phase described by the response action.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.17182v1&quot;&gt;arXiv Quantum &amp;amp; Condensed Matter (quant-ph, cond-mat)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #quantum-computing #condensed-matter #high-energy #post-quantum&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Fictitious Play When Agents Are Not Expected-Utility Maximizers: A Geometric Analysis in $2$-Action Games</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-22-fictitious-play-when-agents-are"/>
    <link rel="related" href="https://arxiv.org/abs/2611.17286v1"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-22-fictitious-play-when-agents-are</id>
    <updated>2026-11-12T18:52:14+00:00</updated>
    <summary type="html">&lt;p&gt;Fictitious play (FP) is one of the earliest and most fundamental learning procedures in games, where each agent independently chooses a best response to the empirical distribution of opponents&amp;apos; past actions by maximizing the expected payoff with respect to it. However, learning agents may not always be expected-utility maximizers: they may use nonlinear evaluation functionals to account for the uncertainty induced by the opponents, e.g., via risk measures. In this work, we study nonlinear fictitious play (NL-FP), in which each pure action is evaluated by a general, possibly nonlinear functional of the payoff distribution induced by the opponent&amp;apos;s empirical belief.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.17286v1&quot;&gt;arXiv Analysis, PDEs &amp;amp; Probability (AP, PR, NA, OC)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #analysis-pde #probability-stats #decision-theory #optimization&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Price-impact Martingale optimal transport</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-23-price-impact-martingale-optimal-transport"/>
    <link rel="related" href="https://arxiv.org/abs/2611.17247v1"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-23-price-impact-martingale-optimal-transport</id>
    <updated>2026-11-12T18:35:02+00:00</updated>
    <summary type="html">&lt;p&gt;Martingale optimal transport (MOT) provides model-independent bounds for option prices calibrated to vanilla options, assuming frictionless trading in the underlying. In this work, we consider the case where dynamic trading incurs quadratic temporary price impact. First, we prove a duality result for the superhedging price.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.17247v1&quot;&gt;arXiv Analysis, PDEs &amp;amp; Probability (AP, PR, NA, OC)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #analysis-pde #probability-stats #quant-finance&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Structure-Preserving Leaky Integrate-and-Fire Dynamics on Arbitrary Time Scales</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-24-structure-preserving-leaky-integrate-and"/>
    <link rel="related" href="https://arxiv.org/abs/2611.17219v1"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-24-structure-preserving-leaky-integrate-and</id>
    <updated>2026-11-12T18:16:14+00:00</updated>
    <summary type="html">&lt;p&gt;The leaky integrate-and-fire (LIF) neuron combines a passive membrane law with threshold-triggered firing and reset. We formulate this hybrid neuron model, under constant input, on an arbitrary Hilger time scale $\mathbb{T}$. Our central result is that, after the first spike, the firing times satisfy $t_{n+1}=Π_{\mathbb{T}}^{+}(t_n+T_c)$, where $T_c$ is the classical reset-to-threshold travel time.&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://arxiv.org/abs/2611.17219v1&quot;&gt;arXiv Analysis, PDEs &amp;amp; Probability (AP, PR, NA, OC)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #analysis-pde #probability-stats #neuroscience #post-quantum&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Dana’s talk on OpenAI’s proof of the Unique Games Conjecture, now on YouTube!</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-29-dana-s-talk-on-openai"/>
    <link rel="related" href="https://scottaaronson.blog/?p=10318"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-29-dana-s-talk-on-openai</id>
    <updated>2026-11-10T20:27:28+00:00</updated>
    <summary type="html">&lt;p&gt;In my “Mathocalypse” post, I mentioned that my wife Dana—who’s been working on Subhash Khot’s Unique Games Conjecture since ~2009, for the entire time I’ve known her—has for the past few weeks (while on sabbatical at the Simons Institute in Berkeley) been spending essentially all of her time laboring to understand OpenAI’s recent proof of […]&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://scottaaronson.blog/?p=10318&quot;&gt;Shtetl-Optimized (Scott Aaronson)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #quantum-computing #algorithms&lt;/p&gt;</summary>
  </entry>
  <entry>
    <title>Podcasts about the Topic: Part III, with Brian Greene. As always, I strongly recommend 2x speed, which compensates somewhat for my verbal infelicities!</title>
    <link href="https://latifkedi.github.io/ahbar/?item=2026-11-15-30-podcasts-about-the-topic-part"/>
    <link rel="related" href="https://scottaaronson.blog/?p=10270"/>
    <id>https://latifkedi.github.io/ahbar/item/2026-11-15-30-podcasts-about-the-topic-part</id>
    <updated>2026-10-31T21:40:33+00:00</updated>
    <summary type="html">&lt;p&gt;As always, I strongly recommend 2x speed, which compensates somewhat for my verbal infelicities! New! More podcasts keep dropping! This one is with the AI alignment researcher Roman Yampolskiy, about … well, AI alignment, plus the Mathocalypse, plus quantum computing, plus whether the universe is a simulation, and I forget what else!&lt;/p&gt;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;https://scottaaronson.blog/?p=10270&quot;&gt;Shtetl-Optimized (Scott Aaronson)&lt;/a&gt; · &lt;strong&gt;Tags:&lt;/strong&gt; #quantum-computing #algorithms&lt;/p&gt;</summary>
  </entry>
</feed>
