Skip to content
AI NEWS JOURNAL
AI, IN PERSPECTIVE

Search AI news

Search headlines, summaries and articles to connect the dots.

Newest first

Show HN: Overhead – the planes overhead, painted on an e-ink frame

Hi HN,I've been fascinated by aviation for some time now. Inspired by Fugleramme, I wanted a framed print of a cluster of aircraft over my house or a busy airport. So I built Overhead. (Photos in the README)The hero photo shows planes departing and landing in Changi, Singapore.How it worksFlight data for a location is gathered from adsb.lol and adsb.fi as a fallback. (you can also point it to your own ADS-B receiver).The photo of the exact aircraft is gathered from planespotters.net and the photographer is credited on the page.The photo is then handed to an AI image gen service via fal.ai using your own key.It's then cut out and packed into a cluster on the page with packers adapted from Fugleramme.It costs about US$0.04 a painting but images are painted once and kept for the next time that aircraft is seen.You can also choose to only show photos.This widget is built on my open source, self-hosted e-ink platform, Tesserae. It's a one click install from the widget catalog.I'm looking for feedback and contributors.https://github.com/arnegiacomo/fugleramme https://github.com/dmellok/tesserae Comments URL: https://news.ycombinator.com/item?id=50390605 Points: 1 # Comments: 0

Show HN: Repairer – close the breach when a Linux flaw goes public

As we've seen with the Ubuntu critical CVE-2026-98432 (CVSS 9.8), AI-dicovered zero day exploit are being reported at an exponential rate and we don't have the process for dealing with the flood of exploits in real time.What we need is an AI-based system for autopatching systems based on real time information. The vendor's fix can take days or weeks to be out (is the Ubuntu thing patched yet?) and meanwhile the grid is vulnerable to exploitation, especially AI worms.Repairer is a small program that runs on each of your servers. The day an exploit goes public it puts up a stopgap that blocks it, and once the real fix is up it takes the stopgap back off by itself.A stopgap only takes something away — drop certain packets, turn off a kernel module or service, remove a setuid bit. It never opens a port, installs or downloads anything, nor runs code. It arms an undo playbook before applying the stopgap, so the change reverts if affects any services.It only ever acts on rules you sign with a (hardware) crypto wallet.Let's go further: stopgaps are written and checked by a swarm of AI agents (gnosh.ai sessions) running on gno.land, each with bonded stake. Each stopgap is run on fresh machines, and whoever is caught lying loses their stake to whoever caught them.The agent is built and tested on Ubuntu and Debian, all open source, standard-library Go. More distros coming. Let's build repairer together.https://gno.security/repairer/ https://github.com/gnosecurity/repairer Comments URL: https://news.ycombinator.com/item?id=50388417 Points: 1 # Comments: 1

Show HN: Umbel – Remote-control agent CLIs over tmux

Been using this in all my sessions the last months. Opus 5.5 (over MCP) spawns Deepseek flash agents - and codex for audits etc. Very curious to hear what the HN crowd thinks/makes of it. Comments URL: https://news.ycombinator.com/item?id=50383189 Points: 1 # Comments: 0

Synthesizing symbolic models of human and machine reasoning at scale

arXiv:2611.07088v1 Announce Type: new Abstract: Symbolic models offer a powerful account of cognition, but their scope has historically been limited by the need for hand-engineering and computational tractability. We show how advances in artificial intelligence (AI) can scale symbolic modeling and help overcome these engineering limitations. We introduce Behavior-Conditioned Symbolic Synthesis (BCSS)---an approach for automated search of interpretable, deterministic symbolic programs that verifiably reproduce behavior---and apply it to model both human and machine behavior across hundreds of challenging reasoning problems. Analyzing these programs reveals that both people and machines tend to oversimplify, adopt rules that are partial explanations for their observations, and misinfer dependencies between problem features. These shared signatures are modulated by available resources, with reasoning effort predicting the extent to which machines simplify and explain their observations. Together, these results point to underlying mechanisms reminiscent of satisficing in both people and machines, and illustrate how BCSS offers a general approach for interpreting and comparing rule-based reasoning of humans and black-box AI systems.

The AI boom’s missing balance-sheet question: What has actually been verified?

Artificial intelligence infrastructure commitments are growing faster than the evidence connecting contracted capacity to sustained economic value. I spent 13 years on the floor of the New York Stock Exchange. One lesson stayed with me long after the trading jackets disappeared: A transaction could be executed, documented and perfectly valid while the assumptions that made […] The post The AI boom’s missing balance-sheet question: What has actually been verified? appeared first on SiliconANGLE.

University of Utah retains operational sovereignty as Redtail expands research access

Operational sovereignty gives universities authority over how shared computing resources are allocated, managed and secured. The University of Utah’s Redtail AI factory supercomputer brings advanced computing capabilities to a statewide community. Supporting researchers, students, administrators and external partners through that infrastructure requires more than computing capacity, according to Manish Parashar (pictured), chief AI officer of […] The post University of Utah retains operational sovereignty as Redtail expands research access appeared first on SiliconANGLE.

Usage metrics API adds code review details and addressed rate

The enterprise and organization repository-level Copilot usage metrics reports now show what happens to Copilot code review feedback. A new copilot_code_review object on each repos-1-day row reports how many Copilot-reviewed… The post Usage metrics API adds code review details and addressed rate appeared first on The GitHub Blog.

Vercel Schedules is now in public beta

Vercel Schedules is now available in public beta across all plans, enabling users to run tasks on a recurring basis or at a specific time in production, preview, or custom environments. It supports targeting private Vercel Functions, HTTP paths, or Queue topics, with schedules definable in vercel.json or created at runtime. Static schedules use cron expressions and require an experimental trigger to make functions private, while runtime schedules dispatch to Queue topics. Schedules replace Cron Jobs, with billing starting at $5 per 1M runs and $10 per 1M creations on Pro and Enterprise plans, and Hobby plan includes 500 schedule creations and 5,000 runs monthly.

Assurance-Conditioned Continuous Authorization for Autonomous AI Agents

arXiv:2611.05632v1 Announce Type: new Abstract: Autonomous software agents can act through tools, delegate work, and change their models or execution environments while earlier authorizations remain in flight. We present Assurance-Conditioned Continuous Authorization (ACCA), an approach designed to be harness-independent, for maintaining operational authority according to currently justified assurance. It distinguishes evidence validity from contextual applicability, derives assurance claims from eligible evidence, and resolves a multidimensional effective-authority envelope within a principal-declared ceiling and applicable policy. A typed dependency graph supports selective re-evaluation of authorization-relevant changes. An authority epoch changes when effective authority changes; a distinct optional authorization-basis version supports revalidation of action-specific authorization conditions. Protected effect-time enforcement can reject stale actions before a consequential resource change, subject to the available commit mechanism. A compositional Domain Governance Profile expresses domain-specific semantics without granting authority. Controlled scenario tests implemented as a regression suite using a trading profile exercise default-deny rules, evidence-conditioned contraction and recovery, policy divergence, selective non-response, and stale-action rejection at a local gateway before the simulated-broker boundary. The study establishes implementation-level evidence in one domain, not a cross-domain guarantee of harmful-behavior prevention.

b12114

Fixed get_max_size to return maxBufferSize and improved the memset shader to handle buffer sizes exceeding the maximum binding size, preventing issues with whole-buffer bindings in memset and clear operations.

b12121

A fix was implemented in llama.cpp to correct the calculation of on-device sequence state copy sizes for quantized key-value (KV) caches, ensuring accurate copying of data blocks and preventing crashes or incorrect state restoration. The update adjusts the element count computation using proper block size handling and removes redundant code elements.

Certinia brings AI into professional services workflows

Certinia Inc. is bringing AI into the software firms use to sell projects, assign staff, deliver work and bill clients. AI’s ability to instantaneously draw from a deep well of information and provide guidance in practically any field of expertise has changed the paradigm for professional services. For Certinia Inc., whose business facilitates 7.1 billion […] The post Certinia brings AI into professional services workflows appeared first on SiliconANGLE.

Clearing up a robot’s fuzzy memory

A new system identifies and corrects unreliable object descriptions stored in a robot’s memory, improving the robot’s ability to interact with its environment.

Discarded or Unreachable? Diagnosing and Repairing Spatial Relation Failure in Vision--Language Similarity

arXiv:2611.05565v1 Announce Type: new Abstract: Contrastive vision-language models score left/right relations near chance, but the symptom has two causes that call for opposite repairs: the relation may survive in the pooled embedding yet be unreachable by native image-text similarity, or pooling may discard it while the dense features retain it. On clean two object photographs, across ten encoders, the lateral polarity is linearly decodable from the flip odd component of the pooled vector at 0.77-0.99, yet a search over a million captions leaves nine of the ten at chance under native scoring: an access failure. On controlled C4 orbits, where the relation is the only thing that varies, pooling keeps the arrangement axis at 0.998-1.000 and loses its polarity, which the patch grid retains: a pooling failure. Both sit downstream of the dense features, so one readout covers both. Our zero parameter, query conditioned spatial moment recomputes the geometry from the patch grid and stores it as a vector beside the native embedding. On a 118,287 image index it raises left/right pairwise accuracy against reversed geometry negatives from 0.51-0.53 to 0.81-0.96 and conditional R@1 among 21 category matched candidates from 0.05 to 0.37-0.75, at under a millisecond per batched query, while reproducing the native ranking exactly for queries that name no relation.

Faster Retrieval for Better, More Efficient RAG

Maximum inner product search (MIPS) sits at the core of recommendation systems, search, and retrieval-augmented generation (RAG). Given a query vector, MIPS systems search within a database of millions of candidate key vectors for the one that best matches the query. The original data point associated with that best-matching key is then used to handle the query: in RAG, the document that is best suited to answer the question is typically prefixed to the query. As the number of keys grows to millions and vector dimensions reach thousands, the computational cost of running an exhaustive…