# Computer science

Computer science is the foundational discipline of computing that studies the use of computers to systematically solve problems.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## How Hough Transforms Enable Computers to See

DevFeed: [How Hough Transforms Enable Computers to See](<https://devfeed.tech/articles/how-hough-transforms-enable-computers-to-see-141981.md>)

Original publisher: [Read original article](<https://hackaday.com/2026/11/18/how-hough-transforms-enable-computers-to-see/>)

Author: Maya Posch

Published: 2026-11-19T03:00:48Z

Content type: article

Language: en

Sources: [Hackaday](<https://devfeed.tech/sources/hackaday.md>)

Topics: [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [artificial-intelligence](<https://devfeed.tech/tags/artificial-intelligence.md>), [cognition](<https://devfeed.tech/tags/cognition.md>), [computer-vision](<https://devfeed.tech/tags/computer-vision.md>), [detection](<https://devfeed.tech/tags/detection.md>), [hough-transform](<https://devfeed.tech/tags/hough-transform.md>), [lidar](<https://devfeed.tech/tags/lidar.md>), [noise](<https://devfeed.tech/tags/noise.md>), [optimizations](<https://devfeed.tech/tags/optimizations.md>), [radar](<https://devfeed.tech/tags/radar.md>)

### AI overview

The Hough Transform helps computers detect lines and object borders in images by finding scene points that may form them, relying on edge detection. Paul Hough developed the original method in the 1960s to analyze bubble-chamber photographs. Checking every possible line is too slow for complex real-world scenes, so later optimizations reduce processing time and improve tolerance to pixel noise. Detection alone does not identify what an object means or what action to take; the excerpt notes that sensors such as radar or Lidar can provide additional scene information for systems such as cars.

### Source excerpt

Although identifying what we can see with our eyes feels like the most natural thing in the world, the responsible cognitive processes running on our brain's wetware are quite a ...read more

## Carnegie Mellon is putting computer science courses on YouTube for free

DevFeed: [Carnegie Mellon is putting computer science courses on YouTube for free](<https://devfeed.tech/articles/carnegie-mellon-is-putting-computer-science-courses-on-youtube-for-free-141105.md>)

Original publisher: [Read original article](<https://blog.adafruit.com/2026/11/18/carnegie-mellon-is-putting-computer-science-courses-on-youtube-for-free/>)

Author: Anne Barela

Published: 2026-11-18T19:38:41Z

Content type: news

Language: en

Sources: [Adafruit Industries](<https://devfeed.tech/sources/adafruit-industries-makers-hackers-artists-designers-and-engineers.md>)

Topics: [Computer science](<https://devfeed.tech/topics/computer-science.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Robotics](<https://devfeed.tech/topics/robotics.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [ai-tutoring](<https://devfeed.tech/tags/ai-tutoring.md>), [artificial-intelligence](<https://devfeed.tech/tags/artificial-intelligence.md>), [biology](<https://devfeed.tech/tags/biology.md>), [carnegie-mellon](<https://devfeed.tech/tags/carnegie-mellon.md>), [computer](<https://devfeed.tech/tags/computer.md>), [computer-science](<https://devfeed.tech/tags/computer-science.md>), [computers](<https://devfeed.tech/tags/computers.md>), [courses](<https://devfeed.tech/tags/courses.md>), [free](<https://devfeed.tech/tags/free.md>), [history](<https://devfeed.tech/tags/history.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [multimodal](<https://devfeed.tech/tags/multimodal.md>), [robotics](<https://devfeed.tech/tags/robotics.md>), [software](<https://devfeed.tech/tags/software.md>), [software-engineering](<https://devfeed.tech/tags/software-engineering.md>), [systems](<https://devfeed.tech/tags/systems.md>), [youtube](<https://devfeed.tech/tags/youtube.md>)

### AI overview

Carnegie Mellon is making full, campus-taught computer science lectures freely watchable on YouTube, with courses from seven departments spanning areas including AI, robotics, systems, software engineering and biology. The excerpt names courses such as 15-442 (machine learning systems), 11-777 (multimodal machine learning), 17-645 (machine learning in production) and introductory course 15-110. CMU says it also plans interactive lessons based on the courses, with instant feedback and a badge, plus AI tutoring in the courseware. Graded work and an official credential are available through CMU Online.

### Source excerpt

Carnegie Mellon University is posting full classroom lectures from its computer science faculty on YouTube, free to watch. The courses come from seven departments and cover AI, robotics, systems, software engineering and biology. The first batch premieres in November. The lineup is a list of real course numbers and the people who teach them. 15-442, [...]

## The Intel 4004 55th anniversary

DevFeed: [The Intel 4004 55th anniversary](<https://devfeed.tech/articles/the-intel-4004-55th-anniversary-140783.md>)

Original publisher: [Read original article](<https://blog.adafruit.com/2026/11/18/the-intel-4004-55th-anniversary/>)

Author: Anne Barela

Published: 2026-11-18T15:40:03Z

Content type: news

Language: en

Sources: [Adafruit Industries](<https://devfeed.tech/sources/adafruit-industries-makers-hackers-artists-designers-and-engineers.md>)

Topics: [Electrical engineering and computer science (EECS)](<https://devfeed.tech/topics/electrical-engineering-and-computer-science-eecs.md>), [intel](<https://devfeed.tech/topics/intel.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>)

Tags: [2026](<https://devfeed.tech/tags/2026.md>), [4004](<https://devfeed.tech/tags/4004.md>), [anniversary](<https://devfeed.tech/tags/anniversary.md>), [birthday](<https://devfeed.tech/tags/birthday.md>), [busicom](<https://devfeed.tech/tags/busicom.md>), [chip](<https://devfeed.tech/tags/chip.md>), [computer](<https://devfeed.tech/tags/computer.md>), [computer-science](<https://devfeed.tech/tags/computer-science.md>), [computers](<https://devfeed.tech/tags/computers.md>), [digital](<https://devfeed.tech/tags/digital.md>), [electronics](<https://devfeed.tech/tags/electronics.md>), [family](<https://devfeed.tech/tags/family.md>), [first](<https://devfeed.tech/tags/first.md>), [history](<https://devfeed.tech/tags/history.md>), [intel](<https://devfeed.tech/tags/intel.md>), [intel-4004](<https://devfeed.tech/tags/intel-4004.md>), [international](<https://devfeed.tech/tags/international.md>), [microprocessor](<https://devfeed.tech/tags/microprocessor.md>), [museum](<https://devfeed.tech/tags/museum.md>), [project](<https://devfeed.tech/tags/project.md>), [science](<https://devfeed.tech/tags/science.md>), [site](<https://devfeed.tech/tags/site.md>), [students](<https://devfeed.tech/tags/students.md>), [vintage-computing](<https://devfeed.tech/tags/vintage-computing.md>)

### AI overview

The 4004.com project documents the Intel 4004 and its family; a November 2025 update reports that Klaus Scheffler and Lajos Kintli completed a discrete-transistor MCS-4 4-bit computer. Its seven-chip design includes a 4004 CPU, 4001 ROM, three 4003 shift registers and two 4002 RAMs, plus an interactive Busicom 141-PF calculator panel replica. It implements the calculator logic in hardware and 4004 assembly, and runs at up to 1.5 MHz--twice the original 740 kHz clock, or 187,500 instructions per second after division by eight. Scheffler attributes the speed to low-capacitance, four-terminal RF FETs, contrasting them with modern discrete FETs typically built for power switching and having higher gate capacitance. This overview reflects the supplied excerpt.

### Source excerpt

The Intel 4004, the first microprocessor, shipped in 1971, which makes 2026 its 55th birthday. The site 4004.com is an international project that documents the chip and its family, with the goal of making computer science and digital electronics accessible to historians, students, hobbyists and museum visitors. A November 2025 update covers work by Klaus [...]

## Intesa Sanpaolo Finds Value Before Quantum Computers Are Ready

DevFeed: [Intesa Sanpaolo Finds Value Before Quantum Computers Are Ready](<https://devfeed.tech/articles/intesa-sanpaolo-finds-value-before-quantum-computers-are-ready-136937.md>)

Original publisher: [Read original article](<https://www.eetimes.com/intesa-sanpaolo-finds-value-before-quantum-computers-are-ready/>)

Author: Pat Brans

Published: 2026-11-17T09:16:07Z

Content type: news

Language: en

Sources: [EE Times](<https://devfeed.tech/sources/ee-times.md>)

Topics: [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>)

Tags: [airbus](<https://devfeed.tech/tags/airbus.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [analog](<https://devfeed.tech/tags/analog.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [asics](<https://devfeed.tech/tags/asics.md>), [atm](<https://devfeed.tech/tags/atm.md>), [banking](<https://devfeed.tech/tags/banking.md>), [business](<https://devfeed.tech/tags/business.md>), [business-continuity](<https://devfeed.tech/tags/business-continuity.md>), [cash-flow](<https://devfeed.tech/tags/cash-flow.md>), [cfd](<https://devfeed.tech/tags/cfd.md>), [combinatorial-optimization](<https://devfeed.tech/tags/combinatorial-optimization.md>), [community](<https://devfeed.tech/tags/community.md>), [computational-fluid-dynamics](<https://devfeed.tech/tags/computational-fluid-dynamics.md>), [cost-savings](<https://devfeed.tech/tags/cost-savings.md>), [credit-risk](<https://devfeed.tech/tags/credit-risk.md>), [data-preparation](<https://devfeed.tech/tags/data-preparation.md>), [designline](<https://devfeed.tech/tags/designline.md>), [digital](<https://devfeed.tech/tags/digital.md>), [education](<https://devfeed.tech/tags/education.md>), [ee-times](<https://devfeed.tech/tags/ee-times.md>), [ee-times-university](<https://devfeed.tech/tags/ee-times-university.md>), [eelife](<https://devfeed.tech/tags/eelife.md>), [eelive-electronic-design](<https://devfeed.tech/tags/eelive-electronic-design.md>), [eet](<https://devfeed.tech/tags/eet.md>), [electrical-engineering](<https://devfeed.tech/tags/electrical-engineering.md>), [electronic-components](<https://devfeed.tech/tags/electronic-components.md>), [electronic-engineering-times](<https://devfeed.tech/tags/electronic-engineering-times.md>), [electronics](<https://devfeed.tech/tags/electronics.md>), [embedded-systems](<https://devfeed.tech/tags/embedded-systems.md>), [encoding](<https://devfeed.tech/tags/encoding.md>), [engineering](<https://devfeed.tech/tags/engineering.md>), [fundamentals-courses](<https://devfeed.tech/tags/fundamentals-courses.md>), [gpus](<https://devfeed.tech/tags/gpus.md>), [intesa-sanpaolo](<https://devfeed.tech/tags/intesa-sanpaolo.md>), [learning](<https://devfeed.tech/tags/learning.md>), [mixed-signal](<https://devfeed.tech/tags/mixed-signal.md>), [news](<https://devfeed.tech/tags/news.md>), [opinion](<https://devfeed.tech/tags/opinion.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [part-search](<https://devfeed.tech/tags/part-search.md>), [product-search](<https://devfeed.tech/tags/product-search.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-computers](<https://devfeed.tech/tags/quantum-computers.md>), [quantum-computing](<https://devfeed.tech/tags/quantum-computing.md>), [quantum-hardware](<https://devfeed.tech/tags/quantum-hardware.md>), [semiconductors](<https://devfeed.tech/tags/semiconductors.md>), [software](<https://devfeed.tech/tags/software.md>), [tech-papers](<https://devfeed.tech/tags/tech-papers.md>), [technology](<https://devfeed.tech/tags/technology.md>), [video](<https://devfeed.tech/tags/video.md>)

### AI overview

Intesa Sanpaolo reports double-digit cost reductions in ATM cash replenishment without compromising service levels, using a QUBO model and GPU-accelerated classical solvers. Tested on historical data from a network of hundreds of ATMs, the approach improved on the bank's previous operational and traditional optimization methods. The result demonstrates value from quantum-inspired modeling on classical hardware, not quantum computational advantage or proof that a quantum processor will outperform the strongest classical alternatives. For quantum hardware to be useful in banking, Intesa says gains must hold across the end-to-end workflow--including data preparation, encoding, system integration and usable results--and be reliable, available at sufficient capacity, and compatible with business continuity and regulatory requirements. The excerpt also notes a separate TU Delft engineering effort using matrix product states, while cautioning that the discussed CFD methods are not production-ready.

### Source excerpt

The banking group reports double-digit cost savings from quantum-inspired optimization, but useful quantum hardware faces a tougher test than faster calculations. The post Intesa Sanpaolo Finds Value Before Quantum Computers Are Ready appeared first on EE Times.

## Flex: A Foundational Proof-Producing Horn Solver

DevFeed: [Flex: A Foundational Proof-Producing Horn Solver](<https://devfeed.tech/articles/flex-a-foundational-proof-producing-horn-solver-137928.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2607.12226>)

Author: Jam Kabeer Ali Khan, Petros Markopoulos, Niki Vazou, Nico Lehmann, Ranjit Jhala

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Software Engineering](<https://devfeed.tech/sources/arxiv-software-engineering.md>)

Topics: [Lean](<https://devfeed.tech/topics/lean.md>), [Automated reasoning](<https://devfeed.tech/topics/automated-reasoning.md>), [Computing](<https://devfeed.tech/topics/computing.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>)

Tags: [abstraction](<https://devfeed.tech/tags/abstraction.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [cs-lo](<https://devfeed.tech/tags/cs-lo.md>), [cs-pl](<https://devfeed.tech/tags/cs-pl.md>), [cs-se](<https://devfeed.tech/tags/cs-se.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [faster](<https://devfeed.tech/tags/faster.md>), [flex](<https://devfeed.tech/tags/flex.md>), [hash](<https://devfeed.tech/tags/hash.md>), [invariants](<https://devfeed.tech/tags/invariants.md>), [lean](<https://devfeed.tech/tags/lean.md>), [proofs](<https://devfeed.tech/tags/proofs.md>), [ring](<https://devfeed.tech/tags/ring.md>), [rust](<https://devfeed.tech/tags/rust.md>), [synthesis](<https://devfeed.tech/tags/synthesis.md>), [trusted-computing](<https://devfeed.tech/tags/trusted-computing.md>), [typechecker](<https://devfeed.tech/tags/typechecker.md>)

### AI overview

Flex is a Lean metaprogram that synthesizes predicates for constrained Horn clauses (CHCs) and produces kernel-checked proofs. Its Zap tactic handles acyclic Horn variables by synthesizing strongest predicates and constructing elimination proofs without proof search. Fix uses predicate abstraction over templates built from Lean terms to infer inductive invariants for cyclic variables. A certifying pipeline uses external SMT solvers such as Spacer and Eldarica while keeping them outside the trusted computing base. The authors report verification of sorting algorithms, hash tables, Tock OS ring buffers, and Rust standard-library challenges. In their evaluation, Zap constructs elimination proofs 28.2x faster than grind and 44.6x faster than aesop, and Zap with Fix automatically proves 98.0% of the refinement-typechecker CHCs.

### Source excerpt

arXiv:2607.12226v2 Announce Type: replace-cross Abstract: Constrained Horn Clauses (CHCs) are a versatile intermediate representation for program verification, but leading CHC solvers rely on SMT-based reasoning over supported background theories. Specifications involving user-defined recursive functions or bespoke operators can require additional semantic encodings and reasoning beyond these theories. We observe that CHCs are existentially quantified propositions in a foundational logic, and so can be proved within an interactive theorem prover, where specifications can use native definitions, and users can complete proofs when automation stalls. However, in a foundational setting, every Horn variable solution must be justified by a kernel-checked proof. We present Flex, a proof-producing CHC solver implemented as a Lean metaprogram, that combines predicate synthesis with proof construction. Flex comprises a suite of tactics: Zap, which synthesizes strongest predicates for acyclic Horn variables and exploits their structure to construct elimination proofs without any proof search; Fix, which uses predicate abstraction over templates built from arbitrary Lean terms, discovered by scraping the CHCs and associated definitions, to infer inductive invariants for cyclic Horn variables; and a certifying pipeline that keeps external SMT-based solvers like Spacer and Eldarica outside the trusted computing base. We use Flex to verify the functional correctness of sorting algorithms, hash tables, ring buffers from the Tock OS kernel, and Rust std library challenges. We show that Zap constructs elimination proofs 28.2x and 44.6x faster than grind and aesop, respectively. With Zap and Fix, Flex automatically proves 98.0% of the refinement-typechecker CHCs in our evaluation.

## BBOWP-Bench: Evaluating LLMs on Black-Box Optimization Word Problems

DevFeed: [BBOWP-Bench: Evaluating LLMs on Black-Box Optimization Word Problems](<https://devfeed.tech/articles/bbowp-bench-evaluating-llms-on-black-box-optimization-word-problems-135707.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2608.02612>)

Author: Yutaro Yamada, Kei Hiroshima, Nozomu Yoshinari, Kento Uchida, Shinichi Shirakawa

Published: 2026-11-16T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>), [Combinatorial optimization](<https://devfeed.tech/topics/combinatorial-optimization.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>), [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [Hallucination detection](<https://devfeed.tech/topics/hallucination-detection.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [black-box](<https://devfeed.tech/tags/black-box.md>), [budget](<https://devfeed.tech/tags/budget.md>), [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cs-ne](<https://devfeed.tech/tags/cs-ne.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [design](<https://devfeed.tech/tags/design.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [framework](<https://devfeed.tech/tags/framework.md>), [large-language-models-llms](<https://devfeed.tech/tags/large-language-models-llms.md>), [llms](<https://devfeed.tech/tags/llms.md>), [natural-language](<https://devfeed.tech/tags/natural-language.md>), [observable](<https://devfeed.tech/tags/observable.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [search](<https://devfeed.tech/tags/search.md>), [spaces](<https://devfeed.tech/tags/spaces.md>)

### AI overview

BBOWP-Bench evaluates whether LLMs can turn natural-language black-box optimization tasks into both a search space and an optimization algorithm, where only objective values are observable and the functional form is unavailable. Each benchmark instance pairs a problem description with an executable evaluation environment and a human-designed reference formulation, enabling assessment of both choices across multiple BBO domains. The abstract reports that models vary their optimizer choice with the evaluation budget, but can struggle to identify important variables and set balanced ranges, especially when descriptions provide little information or the search space is highly problem-specific.

### Source excerpt

arXiv:2608.02612v2 Announce Type: replace-cross Abstract: Formulating an optimization problem strongly affects final solution quality, yet good formulations usually require substantial expertise. Recent studies have explored automatically deriving optimization problems from natural-language descriptions, but existing benchmarks focus on settings where objectives and constraints can be written explicitly as mathematical expressions. Many practically important problems are naturally treated as black-box optimization (BBO) problems, in which only objective values are observable, and the functional form is unavailable. In BBO, search space design (as part of problem formulation) and optimization algorithm selection are crucial for problem-solving. Automating these processes with large language models (LLMs) remains challenging. We introduce Black-Box Optimization Word Problems (BBOWP), a novel problem setting in which a system must infer both a search space and an optimization algorithm from a natural-language description of a black-box optimization task. To support research on this setting, we establish the BBOWP Benchmark Suite (BBOWP-Bench), a dataset and evaluation framework for BBOWP. Each instance combines a natural-language problem description, an executable evaluation environment, and a human-designed reference formulation, allowing evaluation of both search-space design and algorithm selection. Using this benchmark, we evaluate LLMs on the joint formulation of search spaces and optimizers from natural-language descriptions across multiple BBO domains. We show that current LLMs vary their optimizer choice with the evaluation budget, though they sometimes struggle with search space design, particularly in identifying important variables and balancing their ranges when the problem description is less informative or the search space is highly problem-specific. Our code and dataset are available at https://github.com/shiralab/bbowp-bench.

## Learning Motion-Appearance Coupling Priors for Solving Video Inverse Problems

DevFeed: [Learning Motion-Appearance Coupling Priors for Solving Video Inverse Problems](<https://devfeed.tech/articles/learning-motion-appearance-coupling-priors-for-solving-video-inverse-problems-132992.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.15420>)

Author: Anselm Krainovic, Reinhard Heckel

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Image processing](<https://devfeed.tech/topics/image-processing.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>)

Tags: [appearance](<https://devfeed.tech/tags/appearance.md>), [conditional](<https://devfeed.tech/tags/conditional.md>), [consistency](<https://devfeed.tech/tags/consistency.md>), [coupling](<https://devfeed.tech/tags/coupling.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [diffusion](<https://devfeed.tech/tags/diffusion.md>), [diffusion-models](<https://devfeed.tech/tags/diffusion-models.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [eess-iv](<https://devfeed.tech/tags/eess-iv.md>), [frame](<https://devfeed.tech/tags/frame.md>), [generative](<https://devfeed.tech/tags/generative.md>), [guidance](<https://devfeed.tech/tags/guidance.md>), [image](<https://devfeed.tech/tags/image.md>), [learning](<https://devfeed.tech/tags/learning.md>), [lighting](<https://devfeed.tech/tags/lighting.md>), [measurements](<https://devfeed.tech/tags/measurements.md>), [motion](<https://devfeed.tech/tags/motion.md>), [noise](<https://devfeed.tech/tags/noise.md>), [problems](<https://devfeed.tech/tags/problems.md>), [temporal](<https://devfeed.tech/tags/temporal.md>), [training](<https://devfeed.tech/tags/training.md>), [video](<https://devfeed.tech/tags/video.md>)

### AI overview

The paper proposes a learned motion-appearance prior for reconstructing video from degraded measurements. It uses a conditional diffusion model to learn motion-induced appearance residuals, then applies that distribution as a plug-in regularizer alongside image diffusion priors and existing appearance regularization. This addresses limits of photometric and warping constraints, which can fail with occlusions, lighting changes, and non-rigid deformation. The abstract reports better results than photometric-consistency and noise-warping baselines on dynamic video inverse problems, and transfer to cardiac MRI reconstruction.

### Source excerpt

arXiv:2611.15420v1 Announce Type: cross Abstract: Reconstructing video from degraded measurements requires priors that capture both frame appearance and temporal dynamics. Many recent approaches combine pretrained image diffusion priors with motion guidance, sidestepping the costs of training large video models. Temporal consistency is often enforced via photometric losses or warping-based constraints, which implicitly assume that motion explains frame-to-frame or latent-to-latent changes up to small deviations, an assumption that fails under occlusions, lighting changes, and non-rigid deformation. In this paper, we propose to learn the coupling between motion and frame appearance as a generative prior. We learn the distribution of motion-induced appearance residuals with a conditional diffusion model and use it to regularize reconstruction in video inverse problems. Our motion-appearance prior acts as a plug-in regularizer for diffusion-based video reconstruction, preserving the benefits of image diffusion models while remaining compatible with existing appearance regularization techniques. Experiments on dynamic video inverse problems show that reconstruction with a learnt motion-appearance coupling prior outperforms photometric-consistency and noise-warping baselines, and that the approach also transfers to cardiac MRI reconstruction.

## The ENIAC in context: 80 years of computing history

DevFeed: [The ENIAC in context: 80 years of computing history](<https://devfeed.tech/articles/the-eniac-in-context-80-years-of-computing-history-126642.md>)

Original publisher: [Read original article](<https://blog.adafruit.com/2026/11/10/the-eniac-in-context-80-years-of-computing-history/>)

Author: Anne Barela

Published: 2026-11-10T16:07:45Z

Content type: article

Language: en

Sources: [Adafruit Industries](<https://devfeed.tech/sources/adafruit-industries-makers-hackers-artists-designers-and-engineers.md>)

Topics: [Retrocomputing](<https://devfeed.tech/topics/retrocomputing.md>), [Computing](<https://devfeed.tech/topics/computing.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>)

Tags: [computers](<https://devfeed.tech/tags/computers.md>), [computing](<https://devfeed.tech/tags/computing.md>), [eniac](<https://devfeed.tech/tags/eniac.md>), [history](<https://devfeed.tech/tags/history.md>), [vacuum-tubes](<https://devfeed.tech/tags/vacuum-tubes.md>), [vintage-computing](<https://devfeed.tech/tags/vintage-computing.md>)

### AI overview

Brian L. Stuart's talk frames the ENIAC as marking the end of an era as much as the beginning of one, placing it among the computing work of its time. It describes the 30-ton, 150-kilowatt machine, demonstrates its panels and components in virtual reality, and explains how 10-stage ring counter accumulators stored decimal numbers and sign-bit discrimination enabled conditional branching. The talk also covers John Mauchly's early sketches and interest in weather prediction, Alan Turing's 1936 paper, and a simulation of a universal Turing machine on ENIAC hardware using vacuum-tube accumulators as tape cells. It runs just under 50 minutes; the excerpt mentions audience questions on wartime secrecy, declassification, number theory, and the Moore School lectures.

### Source excerpt

Brian L. Stuart, a computer science professor at Drexel University, gave a talk at Vintage Computer Festival Midwest, posted on the VCF Midwest YouTube channel. This year marks 80 years since the ENIAC was unveiled, and the talk places the machine in the context of the computing work going on around it. Stuart's argument is [...]

## Unmasking Four Knapsack Problems in the Traveling Thief Benchmark

DevFeed: [Unmasking Four Knapsack Problems in the Traveling Thief Benchmark](<https://devfeed.tech/articles/unmasking-four-knapsack-problems-in-the-traveling-thief-benchmark-126292.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.12597>)

Author: Mohammed Mizan Alanazi, Mahdi Khemakhem

Published: 2026-11-10T05:00:00Z

Content type: news

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Computer science](<https://devfeed.tech/topics/computer-science.md>), [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [Benchmark](<https://devfeed.tech/topics/benchmark.md>), [Open Source](<https://devfeed.tech/topics/open-source.md>)

Tags: [benchmark](<https://devfeed.tech/tags/benchmark.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [library](<https://devfeed.tech/tags/library.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [problems](<https://devfeed.tech/tags/problems.md>), [published](<https://devfeed.tech/tags/published.md>), [python](<https://devfeed.tech/tags/python.md>), [reference](<https://devfeed.tech/tags/reference.md>), [results](<https://devfeed.tech/tags/results.md>)

### AI overview

Four instances in the 9,720-instance Traveling Thief Problem benchmark reduce to 0-1 knapsack problems because their files round the renting rate to 0.00, removing the tour's effect on the objective. The issue affects one of 60 commonly categorized instances, where five of nine published methods report the same value; rounding may also shift rates by more than 1% in 949 other instances. The original rates cannot be recovered because the generator's tour and packing were not published. The authors define replacement rates using the generator's rule and a published, fully specified reference solution, then show with a published heuristic that the corrected instances again behave as TTP instances. They provide reference results and recommendations, and introduce ttplib, an open-source Python library for loading benchmark instances without downloading the full set.

### Source excerpt

arXiv:2611.12597v1 Announce Type: cross Abstract: The traveling thief problem (TTP) asks a thief to choose a tour and a packing together, and the benchmark of 9,720 instances of Polyakovskiy et al. (2014) is the standard test set for comparing TTP heuristics. We show that four of these instances are not TTP instances at all. Their files give a renting rate of 0.00, so the tour has no effect on the objective and each instance reduces to a 0-1 knapsack problem. One of them belongs to the 60 categorized instances on which new methods are usually compared, and on it five of nine published methods report exactly the same value. The cause is the format of the files, which keep the renting rate with two decimals, while the rule of the generator gives a rate close to 0.003 on these instances. The same rounding may shift the rate of 949 other instances by more than 1%. Since the tour and the packing used by the generator were not published, the original rates cannot be recovered. We therefore define new rates with the same rule, applied to a fully specified reference solution that we publish, and we show with a published heuristic that the corrected instances behave as TTP instances again. We also give reference results on the corrected instances and recommendations for future studies. Finally, we present ttplib, a new open-source Python library that loads any of the 9,720 instances, including the corrected ones, without downloading the whole benchmark.

## Fifty-Two Shades of Pig: What the UCR Archive Really Asks Classifiers to Do

DevFeed: [Fifty-Two Shades of Pig: What the UCR Archive Really Asks Classifiers to Do](<https://devfeed.tech/articles/fifty-two-shades-of-pig-what-the-ucr-archive-really-asks-classifiers-to-do-123463.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.09843>)

Author: Omar Swelam, Jaris K\\"uken, Shi Bin Hoo, Frank Hutter, Lennart Purucker

Published: 2026-11-09T05:00:00Z

Content type: opinion

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Computer science](<https://devfeed.tech/topics/computer-science.md>), [Dataset development](<https://devfeed.tech/topics/dataset-development.md>), [Audit-then-score](<https://devfeed.tech/topics/audit-then-score.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [archive](<https://devfeed.tech/tags/archive.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [audit](<https://devfeed.tech/tags/audit.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [classification](<https://devfeed.tech/tags/classification.md>), [classifiers](<https://devfeed.tech/tags/classifiers.md>), [critical](<https://devfeed.tech/tags/critical.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [deployment](<https://devfeed.tech/tags/deployment.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [experiment](<https://devfeed.tech/tags/experiment.md>), [https](<https://devfeed.tech/tags/https.md>), [original](<https://devfeed.tech/tags/original.md>), [outlier](<https://devfeed.tech/tags/outlier.md>), [problems](<https://devfeed.tech/tags/problems.md>), [question](<https://devfeed.tech/tags/question.md>), [recordings](<https://devfeed.tech/tags/recordings.md>), [sequences](<https://devfeed.tech/tags/sequences.md>)

### AI overview

The paper argues that scores across the UCR Time Series Classification Archive may not reflect performance on deployment-relevant classification tasks. It cites PigAirwayPressure, originally recorded to study whether airway pressure could reveal hemorrhage, but used in the archive to identify which of 52 pigs produced each trace. The authors report that some datasets are repurposed, toy setups, or have flawed test splits; they also question whether ordered non-temporal sequences represent real TSC problems and note potential downsides of decomposing multivariate problems. They call for more careful interpretation of archive-wide scores and greater attention to deployment-relevant evaluation.

### Source excerpt

arXiv:2611.09843v1 Announce Type: new Abstract: The pigs were bleeding. That was the point of the experiment: could airway pressure reveal hemorrhage before it became critical? In the UCR Time Series Classification Archive, the de facto benchmark for Time Series Classification (TSC), the same recordings ask a different question: "which of 52 pigs produced this trace?". The dataset PigAirwayPressure is not an outlier. Although the archive is the standard benchmark, whether its tasks resemble the problems TSC is meant to solve has rarely been examined. We find that several datasets are repurposed from their original task, built from toy setups, or have flawed test splits. We further question how representative the archive's ordered non-temporal sequences (e.g. spectra, shape outlines) are of real TSC, and the potential downsides from the decomposition of multivariate problems. Our findings call for more careful interpretation of archive-wide scores and greater attention to deployment-relevant evaluation. The audit is at https://github.com/automl/ucr-provenance-audit.

## Formalizing inverse problems in the age of AI: possibilities, pitfalls, and an invitation

DevFeed: [Formalizing inverse problems in the age of AI: possibilities, pitfalls, and an invitation](<https://devfeed.tech/articles/formalizing-inverse-problems-in-the-age-of-ai-possibilities-pitfalls-and-an-invitation-120141.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.06962>)

Author: Christian Clason, Tapio Helin, Medet Nursultanov, Lauri Oksanen

Published: 2026-11-06T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Lean](<https://devfeed.tech/topics/lean.md>), [Automated reasoning](<https://devfeed.tech/topics/automated-reasoning.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [ai-agents](<https://devfeed.tech/tags/ai-agents.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [functional-analysis](<https://devfeed.tech/tags/functional-analysis.md>), [lean](<https://devfeed.tech/tags/lean.md>), [mathematical-proofs](<https://devfeed.tech/tags/mathematical-proofs.md>), [tests](<https://devfeed.tech/tags/tests.md>)

### AI overview

AutoIP is a Lean library that uses AI agents to formalize classical linear regularization theory and its supporting functional analysis. Because a machine-checked proof certifies only the statement encoded, reviewers focus on checking each formal statement against its natural-language counterpart; they need not read the proof. The authors report that statement errors, rather than proof errors, are the main risk, and that simple automated tests can reveal issues in established literature. They cite a textbook theorem whose hypothesis is more restrictive than claimed and invite the inverse problems community to extend the library.

### Source excerpt

arXiv:2611.06962v1 Announce Type: new Abstract: Proof assistants such as Lean check mathematical proofs down to the axioms, and AI agents have recently made writing such proofs cheap. We describe AutoIP, a Lean library in which classical linear regularization theory, together with the functional analysis it rests on, has been autoformalized by AI agents. A machine-checked proof certifies only the formal statement it proves, so the remaining human task is to confirm that each formal statement says what was intended. We organize the library around this task: a reviewer compares the formal statements with their natural-language counterparts and never needs to read a proof. Our experience is that the risks lie in the statements rather than in the proofs, and that simple automated tests on the statements can expose problems even in the established literature. We illustrate this with a textbook theorem whose hypothesis is more restrictive than asserted. We invite the inverse problems community to extend and build on the library.

## Static Recovery Is Not Dynamic Stability: Dynamics-Aware Benchmarking of Protein Motif Scaffolding

DevFeed: [Static Recovery Is Not Dynamic Stability: Dynamics-Aware Benchmarking of Protein Motif Scaffolding](<https://devfeed.tech/articles/static-recovery-is-not-dynamic-stability-dynamics-aware-benchmarking-of-protein-motif-scaffolding-120656.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.07723>)

Author: Emile de Bruyn, Moritz Sch\\"affler, Jannik Schneider, Sebastian R. Schmidt, Chanwoong Hwang, Aleena Siji, Utkarsh Upadhyay, Stefan Bauer, Alexander Schug, Stefan Kesselheim, Artur Yakimovich, Alina Ba

Published: 2026-11-06T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Molecular Dynamics](<https://devfeed.tech/topics/molecular-dynamics.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>)

Tags: [benchmarking](<https://devfeed.tech/tags/benchmarking.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [molecular-dynamics](<https://devfeed.tech/tags/molecular-dynamics.md>), [q-bio-bm](<https://devfeed.tech/tags/q-bio-bm.md>), [recovery](<https://devfeed.tech/tags/recovery.md>), [static](<https://devfeed.tech/tags/static.md>)

### AI overview

The benchmark finds that static motif recovery does not establish dynamical stability of the full protein scaffold. BILBY-PRO expands evaluation to 220 cases from 174 PROSITE motif-pattern entries. Across six scaffold-generation models, RFDiffusion and Proteina solve more targets, while ESM3 yields more unique successful scaffolds on the targets it solves. BILBY-MD compares statically solved MotifBench designs with reference molecular-dynamics simulations using motif and scaffold drift, motif-contact preservation, and motif-dihedral free-energy landscapes. Of 55 statically solved model-problem pairs, 31 meet the MD-supported criterion and 8 pass all checks. Compact, self-contained motifs are often supported; interface-like or context-dependent motifs fail more frequently. The authors frame evaluation around target coverage, unique-solution yield, and MD-supported dynamical fidelity.

### Source excerpt

arXiv:2611.07723v1 Announce Type: new Abstract: Protein motif scaffolding benchmarks assess whether generative models can build scaffolds around functionally important residues. Their conclusions depend on which motifs are tested and which criteria define success. Existing benchmarks typically use small hand-curated motif sets and static refolding criteria, but protein function often depends on conformational ensembles and transitions. Here, we address both benchmark scope and success criteria. We introduce BILBY-PRO, a systematically derived benchmark of structurally conserved functional motifs from PROSITE-linked experimental structures, comprising 220 cases from 174 PROSITE motif-pattern entries. Evaluating six recent scaffold-generation models reveals distinct patterns in target coverage and unique-solution yield: RFDiffusion and Proteina solve more targets, whereas ESM3 produces more unique successful scaffolds on the targets it solves. We further introduce BILBY-MD, a reference-based all-atom molecular dynamics evaluation framework. Applied to statically solved designs from the original MotifBench benchmark, it compares motif drift, scaffold drift, motif-contact preservation, and motif-dihedral free-energy landscapes against reference simulations. Of 55 statically solved model-problem pairs, 31 satisfy our MD-supported criterion and only 8 pass all checks. Compact, self-contained motifs are often MD-supported, whereas interface-like or context-dependent motifs fail more frequently. Static refolding success therefore provides useful evidence of local motif recovery but does not establish dynamical fidelity of the full scaffold. BILBY highlights three complementary axes of motif-scaffolding evaluation: target coverage, unique-solution yield, and MD-supported dynamical fidelity.

## College Grads And AI

DevFeed: [College Grads And AI](<https://devfeed.tech/articles/college-grads-and-ai-118752.md>)

Original publisher: [Read original article](<https://semiengineering.com/college-grads-and-ai/>)

Author: Brian Bailey

Published: 2026-11-05T08:01:03Z

Content type: news

Language: en

Sources: [Semiconductor Engineering](<https://devfeed.tech/sources/semiconductor-engineering.md>)

Topics: [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Chip design](<https://devfeed.tech/topics/chip-design.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>), [software-development](<https://devfeed.tech/topics/software-development.md>), [Electrical engineering and computer science (EECS)](<https://devfeed.tech/topics/electrical-engineering-and-computer-science-eecs.md>), [Learning](<https://devfeed.tech/topics/learning.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>)

Tags: [2022](<https://devfeed.tech/tags/2022.md>), [2026](<https://devfeed.tech/tags/2026.md>), [3d](<https://devfeed.tech/tags/3d.md>), [3d-ics](<https://devfeed.tech/tags/3d-ics.md>), [about](<https://devfeed.tech/tags/about.md>), [abstraction](<https://devfeed.tech/tags/abstraction.md>), [accelerate](<https://devfeed.tech/tags/accelerate.md>), [adoption](<https://devfeed.tech/tags/adoption.md>), [after](<https://devfeed.tech/tags/after.md>), [ai](<https://devfeed.tech/tags/ai.md>), [apprentice](<https://devfeed.tech/tags/apprentice.md>), [breker-verification-systems](<https://devfeed.tech/tags/breker-verification-systems.md>), [cadence](<https://devfeed.tech/tags/cadence.md>), [chipagents](<https://devfeed.tech/tags/chipagents.md>), [college](<https://devfeed.tech/tags/college.md>), [computer](<https://devfeed.tech/tags/computer.md>), [computer-science](<https://devfeed.tech/tags/computer-science.md>), [design](<https://devfeed.tech/tags/design.md>), [disruption](<https://devfeed.tech/tags/disruption.md>), [eda](<https://devfeed.tech/tags/eda.md>), [education](<https://devfeed.tech/tags/education.md>), [ee](<https://devfeed.tech/tags/ee.md>), [employment](<https://devfeed.tech/tags/employment.md>), [engineering](<https://devfeed.tech/tags/engineering.md>), [fine](<https://devfeed.tech/tags/fine.md>), [first](<https://devfeed.tech/tags/first.md>), [formal](<https://devfeed.tech/tags/formal.md>), [graduates](<https://devfeed.tech/tags/graduates.md>), [internships](<https://devfeed.tech/tags/internships.md>), [iot-and-security](<https://devfeed.tech/tags/iot-and-security.md>), [llmda-ai](<https://devfeed.tech/tags/llmda-ai.md>), [productivity](<https://devfeed.tech/tags/productivity.md>), [round-tables](<https://devfeed.tech/tags/round-tables.md>), [science](<https://devfeed.tech/tags/science.md>), [semiconductor](<https://devfeed.tech/tags/semiconductor.md>), [semiconductor-engineering](<https://devfeed.tech/tags/semiconductor-engineering.md>), [skills](<https://devfeed.tech/tags/skills.md>), [software](<https://devfeed.tech/tags/software.md>), [southampton-university](<https://devfeed.tech/tags/southampton-university.md>), [space](<https://devfeed.tech/tags/space.md>), [students](<https://devfeed.tech/tags/students.md>), [synopsys](<https://devfeed.tech/tags/synopsys.md>), [top-stories](<https://devfeed.tech/tags/top-stories.md>), [verification](<https://devfeed.tech/tags/verification.md>)

### AI overview

The panel describes AI's effect on new graduates as uneven and difficult to isolate from broader hiring pressures. Several participants see software development hiring slowing as coding tools raise productivity, while reporting continued demand for chip design expertise. They identify a training risk: AI may take over junior tasks and reduce internships or mentoring, leaving graduates with less practical experience and weakening the pipeline to future experts. They also describe a mismatch between university training and employers' rising expectations that new hires use AI to tackle higher-level problems. Proposed educational approaches include preserving foundational learning in math, algorithms, and debugging while teaching AI use in professional work. Participants differ on how quickly graduates will gain AI expertise; some see younger engineers as useful guides, while others say graduates are still adapting. These are views in excerpts from a panel, not a quantified assessment of AI's employment impact.

### Source excerpt

Computer science majors may be in an awkward space; EE grads fine for now. The post College Grads And AI appeared first on Semiconductor Engineering.

## How Unbalanced Must a Latin Rectangle Be?

DevFeed: [How Unbalanced Must a Latin Rectangle Be?](<https://devfeed.tech/articles/how-unbalanced-must-a-latin-rectangle-be-118412.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.06003>)

Author: Zhengyu Li, Vijay Ganesh

Published: 2026-11-05T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Computer science](<https://devfeed.tech/topics/computer-science.md>)

Tags: [balance](<https://devfeed.tech/tags/balance.md>), [branch](<https://devfeed.tech/tags/branch.md>), [column](<https://devfeed.tech/tags/column.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-dm](<https://devfeed.tech/tags/cs-dm.md>), [identity](<https://devfeed.tech/tags/identity.md>), [invariant](<https://devfeed.tech/tags/invariant.md>), [kernel](<https://devfeed.tech/tags/kernel.md>), [lean](<https://devfeed.tech/tags/lean.md>), [lean-4](<https://devfeed.tech/tags/lean-4.md>), [library](<https://devfeed.tech/tags/library.md>), [lower-bound](<https://devfeed.tech/tags/lower-bound.md>), [math-co](<https://devfeed.tech/tags/math-co.md>), [mathlib](<https://devfeed.tech/tags/mathlib.md>), [pruning](<https://devfeed.tech/tags/pruning.md>), [search](<https://devfeed.tech/tags/search.md>), [specification](<https://devfeed.tech/tags/specification.md>)

### AI overview

The paper studies how closely a Latin rectangle can approach pairwise equal distances among its symbol points in the ℓ₁ metric. A simulated annealing method that moves symbols within rows and penalizes only column clashes improves 33 of 51 prior non-square values for 8≤n≤13, by as much as 39.4%, and matches the others; a row-group invariant shows the new examples cannot be reached by the earlier column-swapping search. Computer-assisted branch and bound establishes the previously open optimality of imbalance 56 for a 3x9 rectangle, with a sharper pruning bound reducing search trees by factors of 2.4-3.3 on solved cases with k>=3. The authors also prove Θ(n³) minimum imbalance for fixed k. For k=2, the normalized minimum has a limit between 4/375 and 0.1196. Two-minute annealing runs improve five of seven six-hour MIP upper bounds for 2xn rectangles at 14≤n≤20. Lean 4 checks every reported rectangle, and Mathlib formalizes the pigeonhole lower bound.

### Source excerpt

arXiv:2611.06003v1 Announce Type: cross Abstract: We view a $k\times n$ Latin rectangle as $n$ points in the grid $[n]^k$. Each symbol gives one point, whose coordinates are the columns it occupies. The rectangle is balanced when these points are pairwise equidistant in the $\ell_1$ metric. Its imbalance measures the distance from this ideal. We study the minimum imbalance from three sides. Constructively, we use a simulated annealing that moves symbols within rows and only penalises column clashes. Against the reference table of Voboril et al. (2025), it improves 33 of the 51 non-square values for $8\le n\le 13$, by up to 39.4%, and matches the rest. A cheap invariant, the row group, certifies that none of the 33 new rectangles is isotopic to rows of a group table, so the earlier column-swapping local search cannot reach any of them. Exactly, a computer-assisted branch and bound proves that the minimum imbalance of a $3\times 9$ rectangle is $56$. D\'iaz et al. found this value, but its optimality was open. A sharper pruning bound, derived from the identity $I=2\sum(d-t)^+$, reduces the search tree by a factor of $2.4$ to $3.3$ on the instances with $k\ge3$ that we solve. Asymptotically, the minimum imbalance is $\Theta(n^3)$ for every fixed $k$. A pigeonhole argument gives a lower constant of order $k\,4^{-k}$, and random rectangles give an upper constant of order $\sqrt k$. For $k=2$, the limit of $\min I/n^3$ exists, a permuton attains it, and it lies between $4/375$ and $0.1196$. Perfect balance is an $\ell_1$-equilateral problem, so it forces $k=\Omega(n/\log n)$ rows. For $2\times n$ rectangles, single two-minute annealing runs improve five of the seven six-hour MIP upper bounds for $14\le n\le 20$. Finally, the Lean 4 kernel checks every rectangle reported in this paper against a 74-line specification that imports only Lean's core library. We also prove the pigeonhole lower bound in Lean with Mathlib.

## Are We Just Applying LLMs? What SE Research Studies, Underexplores, and Could Do Next in the LLM Era

DevFeed: [Are We Just Applying LLMs? What SE Research Studies, Underexplores, and Could Do Next in the LLM Era](<https://devfeed.tech/articles/are-we-just-applying-llms-what-se-research-studies-underexplores-and-could-do-next-in-the-llm-era-116185.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.04206>)

Author: Zeinadsadat Saghi, Sadra Sabouri, Souti Chattopadhyay

Published: 2026-11-04T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Software Engineering](<https://devfeed.tech/sources/arxiv-software-engineering.md>)

Topics: [Large Language Model](<https://devfeed.tech/topics/llm.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>), [AI Chat](<https://devfeed.tech/topics/ai-chat.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [ai-research](<https://devfeed.tech/tags/ai-research.md>), [cs-se](<https://devfeed.tech/tags/cs-se.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [foundations](<https://devfeed.tech/tags/foundations.md>), [llms](<https://devfeed.tech/tags/llms.md>), [native](<https://devfeed.tech/tags/native.md>), [problems](<https://devfeed.tech/tags/problems.md>), [research](<https://devfeed.tech/tags/research.md>), [software-engineering](<https://devfeed.tech/tags/software-engineering.md>), [survey](<https://devfeed.tech/tags/survey.md>), [tools](<https://devfeed.tech/tags/tools.md>), [world](<https://devfeed.tech/tags/world.md>)

### AI overview

A census of 4,790 papers from three software engineering conferences (2018-2026) and responses from 244 researchers finds that AI is reorganizing the field unevenly, rather than simply replacing non-AI research. AI accounted for 93.1% of publication growth, while some venues and problem areas contracted. Most LLM-wave AI papers (92.6%) revisit established software engineering problems; most new problems concern using LLMs within the engineering process. Research engagement is largely downstream: 95.7% of AI papers apply AI or evaluate and support its use, while 4.3% examine the paradigm or develop alternatives. Although AI-driven change was a prominent concern in the survey (20.2%), only 7.0% of responses naming a community change mentioned AI. The authors propose cumulative research across technological waves, stronger evaluation and assurance, SE-native foundations, and study of software engineering transformed by AI.

### Source excerpt

arXiv:2611.04206v1 Announce Type: new Abstract: Is AI taking over software engineering research? By 2025, AI appeared in more than half of the research-track papers at ICSE, FSE, and ASE. Yet ubiquity alone cannot show whether AI expanded the publication portfolio, displaced other work, or redirected the intellectual agenda. We investigate this shift through a census of 4,790 research papers (three SE conferences; 2018--2026) and free-form responses from 244 SE researchers discussing the future of the SE research community (ICSE 2026 FoSE survey). We found that while AI is taking over, it is not simply replacing non-AI research; it is unevenly reorganizing SE research around its capabilities. AI accounted for 93.1% of publication growth, but expansion in some venues and problem areas concealed contraction in others. The LLM wave also changed the field's tools more than its problem boundaries: 92.6% of LLM-wave AI papers revisit established SE problems, while most new problems arise from the introduction of LLMs in the SE process themselves. Engagement with AI remains predominantly downstream: 95.7% of AI papers apply AI or evaluate and support its use, while only 4.3% interrogate the paradigm or develop alternatives. The FoSE survey reveals a similar imbalance between recognition and response. AI-driven change was the second-most frequent concern about the field's future 20.2%, yet only 7.0% of responses mentioned AI when researchers were asked to identify one change the community should make. Together, our findings reveal a field reorganizing an inherited agenda around AI faster than it is questioning that reorganization. We discuss how SE can respond by building cumulatively across technological waves, strengthening evaluation and assurance, developing SE-native foundations, and studying software engineering in an AI-transformed world.

## Accelerating posterior sampling in Bayesian inverse problems with diffusion models: an online-offline perspective

DevFeed: [Accelerating posterior sampling in Bayesian inverse problems with diffusion models: an online-offline perspective](<https://devfeed.tech/articles/accelerating-posterior-sampling-in-bayesian-inverse-problems-with-diffusion-models-an-online-offline-perspective-114519.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.01300>)

Author: Duc-Lam Duong

Published: 2026-11-03T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Computer science](<https://devfeed.tech/topics/computer-science.md>)

Tags: [bayesian](<https://devfeed.tech/tags/bayesian.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cs-na](<https://devfeed.tech/tags/cs-na.md>), [diffusion-models](<https://devfeed.tech/tags/diffusion-models.md>), [inference](<https://devfeed.tech/tags/inference.md>), [math-na](<https://devfeed.tech/tags/math-na.md>), [math-st](<https://devfeed.tech/tags/math-st.md>), [sampling](<https://devfeed.tech/tags/sampling.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [stat-th](<https://devfeed.tech/tags/stat-th.md>), [survey](<https://devfeed.tech/tags/survey.md>)

### AI overview

Score-based diffusion models offer expressive priors for Bayesian inverse problems, but posterior sampling is challenging because the score of a noised posterior generally cannot be recovered from the prior score alone. This selective survey reviews likelihood guidance, spectral and projection methods, sequential Monte Carlo corrections, and amortized conditional training. It organizes these approaches by how they divide computation between offline preparation and online inference, comparing their assumptions, advantages, limitations, and potential speedups. The available abstract does not provide method-specific results or detailed comparisons.

### Source excerpt

arXiv:2611.01300v1 Announce Type: new Abstract: Bayesian inverse problems require both informative prior models and computationally feasible posterior inference. Score-based diffusion models provide expressive learned priors, but their use for inversion introduces a conditioning problem: the score of a noised posterior is generally unavailable from a prior score alone. This selective survey reviews the principal approaches to that problem, including likelihood guidance, spectral and projection methods, sequential Monte Carlo corrections, and amortized conditional training. We organize methods by how they split cost between offline preparation and online inference, and compare their assumptions, advantages and limitations, with emphasis on computational speedups. Some ongoing directions and open questions are gathered at the end.

## Rethinking Computer Science Education: Why Students Should Build Before They Master Theory

DevFeed: [Rethinking Computer Science Education: Why Students Should Build Before They Master Theory](<https://devfeed.tech/articles/rethinking-computer-science-education-why-students-should-build-before-they-master-theory-112260.md>)

Original publisher: [Read original article](<https://hackernoon.com/rethinking-computer-science-education-why-students-should-build-before-they-master-theory?source=rss>)

Author: Sasha Apartsin

Published: 2026-11-02T07:00:03Z

Content type: opinion

Language: en

Sources: [HackerNoon](<https://devfeed.tech/sources/hackernoon.md>)

Topics: [Computer science](<https://devfeed.tech/topics/computer-science.md>), [Learning](<https://devfeed.tech/topics/learning.md>), [software-development](<https://devfeed.tech/topics/software-development.md>), [Electrical engineering and computer science (EECS)](<https://devfeed.tech/topics/electrical-engineering-and-computer-science-eecs.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [ai-assisted-programming](<https://devfeed.tech/tags/ai-assisted-programming.md>), [ai-coding-assistants](<https://devfeed.tech/tags/ai-coding-assistants.md>), [ai-in-education](<https://devfeed.tech/tags/ai-in-education.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [apis](<https://devfeed.tech/tags/apis.md>), [app](<https://devfeed.tech/tags/app.md>), [build](<https://devfeed.tech/tags/build.md>), [cloud](<https://devfeed.tech/tags/cloud.md>), [computer-science](<https://devfeed.tech/tags/computer-science.md>), [computer-science-education](<https://devfeed.tech/tags/computer-science-education.md>), [computer-science-fundamentals](<https://devfeed.tech/tags/computer-science-fundamentals.md>), [data](<https://devfeed.tech/tags/data.md>), [data-structures](<https://devfeed.tech/tags/data-structures.md>), [database](<https://devfeed.tech/tags/database.md>), [databases](<https://devfeed.tech/tags/databases.md>), [deployment](<https://devfeed.tech/tags/deployment.md>), [education](<https://devfeed.tech/tags/education.md>), [experience](<https://devfeed.tech/tags/experience.md>), [front-end](<https://devfeed.tech/tags/front-end.md>), [learning-to-code](<https://devfeed.tech/tags/learning-to-code.md>), [practical](<https://devfeed.tech/tags/practical.md>), [project-based-learning](<https://devfeed.tech/tags/project-based-learning.md>), [software](<https://devfeed.tech/tags/software.md>), [software-engineering-education](<https://devfeed.tech/tags/software-engineering-education.md>), [students](<https://devfeed.tech/tags/students.md>), [theory](<https://devfeed.tech/tags/theory.md>)

### AI overview

The article argues that computer science students should build useful software early, then learn theory as practical problems expose the need for it. AI, APIs, libraries, and cloud services let beginners ship working systems sooner, while entry-level jobs often ask for tool-specific building skills that a theory-first curriculum may not prepare graduates to demonstrate. The proposed learning loop is to build, hit a limit, understand why, study the relevant foundations, and build something harder. The author does not advocate dropping algorithms, mathematics, systems, or theory: these remain important for performance, scale, reliability, security, edge cases, and problems existing tools cannot solve. The excerpt questions whether those foundations must come first.

### Source excerpt

Computer science students learn theory before building real software. In the AI era, should we reverse the curriculum and teach through practical experience?

## Maximum Likelihood on the Joint (Data, Condition) Distribution for Solving Ill-Posed Problems with Conditional Flow Models

DevFeed: [Maximum Likelihood on the Joint (Data, Condition) Distribution for Solving Ill-Posed Problems with Conditional Flow Models](<https://devfeed.tech/articles/maximum-likelihood-on-the-joint-data-condition-distribution-for-solving-ill-posed-problems-with-conditional-flow-models-99366.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2208.11782>)

Author: John S. Hyatt

Published: 2026-10-26T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [AI Models](<https://devfeed.tech/topics/ai-models.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>)

Tags: [conditional](<https://devfeed.tech/tags/conditional.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [flow](<https://devfeed.tech/tags/flow.md>), [generate](<https://devfeed.tech/tags/generate.md>), [images](<https://devfeed.tech/tags/images.md>), [models](<https://devfeed.tech/tags/models.md>), [problems](<https://devfeed.tech/tags/problems.md>), [super-resolution](<https://devfeed.tech/tags/super-resolution.md>), [toy](<https://devfeed.tech/tags/toy.md>), [training](<https://devfeed.tech/tags/training.md>)

### AI overview

The paper proposes training conditional flow models with a computationally cheap proxy for maximum likelihood on the joint data-condition distribution. Under special conditions, the proxy shares the conditional likelihood's global minimum, despite the full joint or per-example true conditional being unavailable. The approach needs no explicit conditional distribution, auxiliary network, special architecture, or extra loss term. The authors demonstrate it on toy problems, class-conditional image generation, and reconstruction of semantically degraded images through super-resolution.

### Source excerpt

arXiv:2208.11782v2 Announce Type: replace Abstract: In the absence of conditioning information, normalizing flow models are trained using maximum likelihood. Previous extensions to conditional settings have abandoned the simple maximum-likelihood approach, as obtaining the full joint distribution of data and conditions for training purposes (or equivalently, the true conditional distribution for each point in the training dataset) is impossible. However, under special conditions that nevertheless apply to a wide class of useful problems, it is possible to obtain a simple, computationally cheap proxy with the same global minimum as the conditional likelihood. Conditional flow models trained using this proxy do not require explicit knowledge of the conditional distribution, auxiliary networks or other specific architecture, or additional loss terms beyond maximum likelihood. They provide a natural and powerful way to solve a class of ill-posed inverse problems. I demonstrate these properties on easily visualized toy problems, then use the method to successfully generate class-conditional images and to reconstruct semantically degraded images via super-resolution.

## We Were Never Asked to Write Code. We Were Asked to Solve Problems.

DevFeed: [We Were Never Asked to Write Code. We Were Asked to Solve Problems.](<https://devfeed.tech/articles/we-were-never-asked-to-write-code-we-were-asked-to-solve-problems-97419.md>)

Original publisher: [Read original article](<https://hackernoon.com/we-were-never-asked-to-write-code-we-were-asked-to-solve-problems?source=rss>)

Author: Sanya Kapoor

Published: 2026-10-23T09:48:35Z

Content type: opinion

Language: en

Sources: [HackerNoon](<https://devfeed.tech/sources/hackernoon.md>)

Topics: [AI-assisted coding](<https://devfeed.tech/topics/ai-assisted-coding.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [AI Trends](<https://devfeed.tech/topics/ai-trends.md>), [AI tools for developers](<https://devfeed.tech/topics/ai-tools-for-developers.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>)

Tags: [agentic-coding-assistants](<https://devfeed.tech/tags/agentic-coding-assistants.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-and-engineering-jobs](<https://devfeed.tech/tags/ai-and-engineering-jobs.md>), [ai-coding-assistants](<https://devfeed.tech/tags/ai-coding-assistants.md>), [ai-hype-vs-reality](<https://devfeed.tech/tags/ai-hype-vs-reality.md>), [code](<https://devfeed.tech/tags/code.md>), [crash](<https://devfeed.tech/tags/crash.md>), [cto](<https://devfeed.tech/tags/cto.md>), [dot-com-crash-lessons](<https://devfeed.tech/tags/dot-com-crash-lessons.md>), [future-of-software-engineering](<https://devfeed.tech/tags/future-of-software-engineering.md>), [good-company](<https://devfeed.tech/tags/good-company.md>), [problems](<https://devfeed.tech/tags/problems.md>), [richard-forss-exante](<https://devfeed.tech/tags/richard-forss-exante.md>), [solve](<https://devfeed.tech/tags/solve.md>), [write](<https://devfeed.tech/tags/write.md>)

### AI overview

Forss argues that AI is more likely to expand the problems engineers can solve than replace them. He draws a parallel with the dot-com crash: a real technological shift can survive inflated promises and market reversals. He cites radiology, where faster, cheaper imaging was followed by increased demand, and says coding assistants in 2025 began handling real tasks such as implementing issues and opening pull requests. His engineers ship faster with them, but the tools still require engineers to judge correctness and respond when systems fail. He frames coding as a means to solve problems, pointing to DeepMind's protein-folding work and the release of structures for 200 million proteins as an example of outcomes that matter more than lines of code.

### Source excerpt

EXANTE CTO Richard Forss draws on the dot-com crash and AI breakthroughs to explain why AI will help engineers solve bigger problems, not replace them.

## Where Polanyi Meets Galois: Tacit Knowing as an Algebro-Deterministic Operation, Toward Re-rooting AI-Generated Science

DevFeed: [Where Polanyi Meets Galois: Tacit Knowing as an Algebro-Deterministic Operation, Toward Re-rooting AI-Generated Science](<https://devfeed.tech/articles/where-polanyi-meets-galois-tacit-knowing-as-an-algebro-deterministic-operation-toward-re-rooting-ai-generated-science-97991.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.16102>)

Author: Hiroyuki Chuma, Kanji Otsuka, Yoichi Sato, Kodo Yamauchi

Published: 2026-10-23T04:00:00Z

Content type: opinion

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Computer science](<https://devfeed.tech/topics/computer-science.md>), [knowledge-engineering](<https://devfeed.tech/topics/knowledge-engineering.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [audit](<https://devfeed.tech/tags/audit.md>), [confidence](<https://devfeed.tech/tags/confidence.md>), [craft](<https://devfeed.tech/tags/craft.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-ne](<https://devfeed.tech/tags/cs-ne.md>), [dag](<https://devfeed.tech/tags/dag.md>), [generate](<https://devfeed.tech/tags/generate.md>), [knowledge](<https://devfeed.tech/tags/knowledge.md>), [llms](<https://devfeed.tech/tags/llms.md>), [memory](<https://devfeed.tech/tags/memory.md>), [mentor](<https://devfeed.tech/tags/mentor.md>), [science](<https://devfeed.tech/tags/science.md>), [student](<https://devfeed.tech/tags/student.md>), [tacit](<https://devfeed.tech/tags/tacit.md>), [trace](<https://devfeed.tech/tags/trace.md>), [transmission](<https://devfeed.tech/tags/transmission.md>), [valuation](<https://devfeed.tech/tags/valuation.md>)

### AI overview

The paper models tacit knowing as a memory's operating regime, using VaCoAl, an XOR-and-shift hyperdimensional memory over GF(2), implemented as CASRAM and PyVaCoAl. Its DAG offers two readings: Rescue repairs every collision for an exactly auditable trace but does not rank paths; Don't Care tolerates collisions and produces path confidence (CR₂), which favors direct routes. The authors use this audit-valuation tradeoff to distinguish query-revealed tacitness from regime-bound tacitness, which can be stated only after it is lost. For AI-generated science, they propose that LLMs generate results, VaCoAl/PyVaCoAl preserve traces and confidence, and people evaluate their value--a role they argue cannot be delegated. They characterize untraceable, checkable AI results as "rootless explicit knowledge" and frame their broader claims, including conviviality as a basis for evolvability, as conjectures or testable predictions.

### Source excerpt

arXiv:2610.16102v2 Announce Type: replace-cross Abstract: We argue that tacit knowing is better modelled as an operating regime of a memory than as a kind of content. Our substrate is VaCoAl, an algebro-deterministic XOR-and-shift hyperdimensional memory over GF(2), realized as CASRAM and PyVaCoAl. In it, a DAG reads two ways. Repairing every collision (Rescue) makes the trace exactly auditable but ranks no path higher; tolerating them (Don't Care) yields a path confidence, CR$_2$, silently favouring direct routes. This audit-valuation complementarity formalizes Polanyi's claim that tacit and explicit are not sharply divided. It separates contingent tacitness, which a new query brings out (AlphaGo's game tree), from regime-bound tacitness, statable only once it is gone (AlphaGo's hunches). (1) Polanyi's from-to structure reads as non-commutative binding. (2) Explicating the valuation destroys it, as with Polanyi's pianist, yet a closed-form law states it. Polanyi, Nonaka, Tsoukas and Collins each capture part of this, narrowly; even Nonaka and von Krogh's continuum cannot tell the classes apart. (3) Collins's three tacit knowledges become strata, one outside the substrate. (4) Our mentor-student DAG is a tacit-transmission graph. (5) Tao's remark that AI-solved problems spawn few follow-ups reveals rootless explicit knowledge: checkable results no one can trace or yet understands. To re-root them, LLMs generate, VaCoAl/PyVaCoAl keeps an auditable trace with its confidence, and people value, a role virtue epistemology shows cannot be offloaded. Art, craft and skill show the same decoupling of form from the maker's becoming. (6) On Mercier and Sperber's account an LLM is reason's arguing side set loose, a sophist; truth-seeking lies deeper, in Polanyi's conviviality, which we conjecture is the root of evolvability and, as the Buddhist idea that plants and lands attain buddhahood suggests, reaches beyond humans. Testable predictions follow.

## Solving a 31-year-old grand challenge in mathematics - the KLS conjecture

DevFeed: [Solving a 31-year-old grand challenge in mathematics - the KLS conjecture](<https://devfeed.tech/articles/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture-92996.md>)

Original publisher: [Read original article](<https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/>)

Author: Xinzhi Zhang

Published: 2026-10-21T16:00:00Z

Content type: news

Language: en

Sources: [Microsoft Research](<https://devfeed.tech/sources/microsoft-research.md>)

Topics: [Mathematics](<https://devfeed.tech/topics/mathematics.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>), [Parallel reasoning](<https://devfeed.tech/topics/parallel-reasoning.md>), [Automated reasoning](<https://devfeed.tech/topics/automated-reasoning.md>)

Tags: [2026](<https://devfeed.tech/tags/2026.md>), [agent](<https://devfeed.tech/tags/agent.md>), [agentic](<https://devfeed.tech/tags/agentic.md>), [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-agents](<https://devfeed.tech/tags/ai-agents.md>), [ai-collaboration](<https://devfeed.tech/tags/ai-collaboration.md>), [ai-models](<https://devfeed.tech/tags/ai-models.md>), [ai-systems](<https://devfeed.tech/tags/ai-systems.md>), [ai-tools](<https://devfeed.tech/tags/ai-tools.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [breakthrough](<https://devfeed.tech/tags/breakthrough.md>), [central](<https://devfeed.tech/tags/central.md>), [computing](<https://devfeed.tech/tags/computing.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [research](<https://devfeed.tech/tags/research.md>), [research-blog](<https://devfeed.tech/tags/research-blog.md>), [science](<https://devfeed.tech/tags/science.md>), [spaces](<https://devfeed.tech/tags/spaces.md>), [theoretical](<https://devfeed.tech/tags/theoretical.md>)

### AI overview

The authors report proving the Kannan-Lovász-Simonovits conjecture, showing that for log-concave distributions the best flat cut captures the narrowest bottleneck within a universal constant, independent of dimension. Their proof repeatedly applies a recursive refinement and shows that the errors remain bounded. AI agents explored more than 100 candidate approaches and helped with derivations and checks; researchers selected the promising ideas and built and verified the proof. Unguided attempts with leading models, using roughly the same total token budget, did not solve the problem. The text reports parallel independent proofs and a Lean 4 formalization as additional validation, and says the authors plan to release a streamlined proof after final review.

### Source excerpt

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan-Lovász-Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional [...] The post Solving a 31-year-old grand challenge in mathematics - the KLS conjecture appeared first on Microsoft Research.

## Gemini 4 Argon: Built to solve your hardest problems

DevFeed: [Gemini 4 Argon: Built to solve your hardest problems](<https://devfeed.tech/articles/gemini-4-argon-built-to-solve-your-hardest-problems-89449.md>)

Original publisher: [Read original article](<https://blog.google/innovation-and-ai/models-and-research/gemini-models/introducing-gemini-4-argon/>)

Author: Koray Kavukcuoglu

Published: 2026-10-13T16:00:00Z

Content type: release

Language: en

Sources: [Gemini Models](<https://devfeed.tech/sources/gemini-models.md>)

Topics: [AI Chat](<https://devfeed.tech/topics/ai-chat.md>), [llm-reasoning](<https://devfeed.tech/topics/llm-reasoning.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>)

Tags: [adk](<https://devfeed.tech/tags/adk.md>), [agent](<https://devfeed.tech/tags/agent.md>), [ai](<https://devfeed.tech/tags/ai.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [api](<https://devfeed.tech/tags/api.md>), [attack](<https://devfeed.tech/tags/attack.md>), [building](<https://devfeed.tech/tags/building.md>), [code-generation](<https://devfeed.tech/tags/code-generation.md>), [gemini](<https://devfeed.tech/tags/gemini.md>), [gemini-4-argon](<https://devfeed.tech/tags/gemini-4-argon.md>), [gemini-models](<https://devfeed.tech/tags/gemini-models.md>), [none](<https://devfeed.tech/tags/none.md>)

### AI overview

Google announces Gemini 4 Argon, a model available through its API and several Google products, aimed at complex coding, research, security, and professional tasks. The announcement highlights engineering examples, including codebase refactoring and performance optimization, and describes safety measures for agent use.

### Source excerpt

TBD

## Margaret Hamilton #ALD26 @findingada

DevFeed: [Margaret Hamilton #ALD26 @findingada](<https://devfeed.tech/articles/margaret-hamilton-ald26-findingada-86128.md>)

Original publisher: [Read original article](<https://blog.adafruit.com/2026/10/13/margaret-hamilton-ald26-findingada/>)

Author: Kelly

Published: 2026-10-13T13:07:25Z

Content type: news

Language: en

Sources: [Adafruit Industries](<https://devfeed.tech/sources/adafruit-industries-makers-hackers-artists-designers-and-engineers.md>)

Topics: [software-development](<https://devfeed.tech/topics/software-development.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>)

Tags: [ada-lovelace-day](<https://devfeed.tech/tags/ada-lovelace-day.md>), [ald](<https://devfeed.tech/tags/ald.md>), [ald26](<https://devfeed.tech/tags/ald26.md>), [holiday](<https://devfeed.tech/tags/holiday.md>), [margaret-hamilton](<https://devfeed.tech/tags/margaret-hamilton.md>), [software-engineering](<https://devfeed.tech/tags/software-engineering.md>), [women](<https://devfeed.tech/tags/women.md>), [women-in-stem](<https://devfeed.tech/tags/women-in-stem.md>)

### AI overview

Margaret Hamilton's conviction that computer science should be treated as engineering helped shape the idea of software engineering. The piece also notes that recognition of her work grew after a male hardware expert supported her in a meeting, and highlights women's contributions to science, technology, engineering, and math for Ada Lovelace Day.

### Source excerpt

Margaret Hamilton, who died last week at the age of 90, was writing code before it was cool. via The NYTimes: Ms. Hamilton's conviction that computer science was a form of engineering would augur the field's future. As computing left the rarefied world of the cosmos and came down to earth, the cachet, status and [...]

## OpenAI says internal model made 372 advances on mathematics and theoretical computer science problems

DevFeed: [OpenAI says internal model made 372 advances on mathematics and theoretical computer science problems](<https://devfeed.tech/articles/openai-unleashes-hundreds-more-math-results-upon-a-field-already-in-shock-77043.md>)

Original publisher: [Read original article](<https://science.slashdot.org/story/26/10/07/1653233/openai-unleashes-hundreds-more-math-results-upon-a-field-already-in-shock>)

Author: BeauHD

Published: 2026-10-08T07:00:00Z

Content type: news

Language: en

Sources: [Slashdot](<https://devfeed.tech/sources/slashdot.md>)

Topics: [Computer science](<https://devfeed.tech/topics/computer-science.md>), [Lean](<https://devfeed.tech/topics/lean.md>), [AI Agent](<https://devfeed.tech/topics/ai-agent.md>), [Algorithms](<https://devfeed.tech/topics/algorithms.md>)

Tags: [ai-agent](<https://devfeed.tech/tags/ai-agent.md>), [lean](<https://devfeed.tech/tags/lean.md>), [math](<https://devfeed.tech/tags/math.md>), [navier-stokes-problem](<https://devfeed.tech/tags/navier-stokes-problem.md>), [openai](<https://devfeed.tech/tags/openai.md>)

### AI overview

OpenAI says an unreleased internal model produced 372 results that resolve or substantially advance open problems in mathematics and theoretical computer science. The company says almost all came from one AI agent using a single prompt. Many proofs have been verified in Lean, while mathematicians still need to assess their novelty and significance.

### Source excerpt

OpenAI says an unreleased internal model has produced 372 results that either resolve or make substantial progress on open problems in mathematics and theoretical computer science. The company says almost all were generated by a single AI agent from a single prompt. "This would be a striking difference from OpenAI's earlier blockbuster solution to the Navier-Stokes problem, which was produced through the collective efforts of a 10,000-strong agentic swarm that cost millions of dollars in computing power," reports Scientific American. From the report: OpenAI revealed the results in a GitHub repository at 6 P.M. EDT. The deluge will take mathematicians months to parse through and understand -- including to determine whether the proofs contain novel and important ideas or are mostly mash-ups of existing techniques. But many of the results have already been verified in Lean -- a programming language that validates a proof's logic -- and are therefore all but certain to be correct. Among the results claimed are a solution to the four-dimensional Kakeya conjecture, improvements on some of the world's most important computer algorithms and actual progress toward math's scariest problem, the Riemann hypothesis. Read more of this story at Slashdot.

[Next page](<https://devfeed.tech/topics/computer-science.md?cursor=WyIyMDI2LTEwLTA4VDA3OjAwOjAwKzAwOjAwIiwgIjIzZmVhNGY5LTdlYjEtNDQyMC1hNjcwLWZmNWY5ODFlY2I0MSJd>)