THE INTERNET IS THINKING

Earlier sources: Artificial Intelligence

Artificial intelligence covers systems that learn from data, generate content, perceive their surroundings, or act toward a goal. Follow model research, agent tooling, evaluation, and the infrastructure used to build and run these systems.

SYMTRI organizes observations from public sources into a living map. Connections reflect shared subject matter; they do not establish causation or endorse a source.

Open in the map ↗
Share this page ↗

6044 classified signals in the fourteen-day window. Recent momentum: steady. These counts include signals awaiting readable evidence.

Earlier sources

Up to ten sources with readable evidence, ordered by their feed timestamp. These archive sources can be older than the live fourteen-day window. This list is a sample, not a measure of total activity. Dates distinguish paper publication, repository creation, model/dataset activity, Hacker News posts, and KEV catalog additions. “First archived” records when SYMTRI first stored the signal.

  1. Hacker News · Posted on Hacker News · First archived

    WSP WordPress MCP – Connect AI Agents to WordPress ↗

    Hacker News discussion.

  2. arXiv · Published · First archived

    VisionMX: Unlocking Microscaling Post-Training Quantization for Vision Models ↗

    Microscaling (MX) formats are emerging as a hardware-supported approach to efficient training and inference. They combine low-precision elements with shared block scales, but their impact on vision models remains underexplored. We systematically investigate post-training MX quantization across vision models and tasks. An analysis of direct conversion identifies three sources of error: block-scale representation, the poor alignment of some small convolutional weight tensors with nonuniform element grids, and the underuse of signed codes by nonnegative activations. These findings motivate Vision…

  3. arXiv · Published · First archived

    Kernel Singular Value Decomposition with Extension to Multiple Data Sources ↗

    Kernel Singular Value Decomposition (KSVD) learns a pair of singular vectors w.r.t. an asymmetric kernel matrix, which can be induced by two data sources, e.g., the queries and keys in self-attention or the rows and columns of a given matrix. In this work, we extend KSVD to multiple data sources, namely eKSVD, which conducts joint nonlinear feature learning upon asymmetric kernels. In the primal formulation, the projections associated with each data source are jointly learned to capture maximal information, while incorporating pair-wise couplings. With the Lagrangian and its Karush-Kuhn-Tucker…

  4. arXiv · Published · First archived

    StanceEval 2026: The Second Stance Detection Shared Task ↗

    StanceEval 2026 is the second edition of the StanceEval shared task series on stance detection in Arabic social media text. Stance detection aims to identify a writer's stance toward a given topic. Given a tweet and a target, participating systems must determine whether the writer's stance is Favor, Against, or None. This edition focuses on cross-target generalization across two distinct evaluation tracks: Track 1 evaluates thematically related cross-target transfer (testing on Women Driving, related to Women Empowerment from training data), while Track 2 evaluates cross-domain transfer to com…

  5. arXiv · Published · First archived

    Toward SLM-based agentic task-tool intent matching ↗

    Tool-equipped AI agents use tool calls to access data and act on external systems. Horizontal growth of agentic systems increases the number of these interactions, and further motivates the need for automated, per-call oversight that can operate at low latency and/or on-prem. Conventional authorization schemes can determine whether an agent is allowed to invoke a tool, but cannot assess the agent's underlying cognition, specifically, whether the tool selection represents a logical, relevant step toward satisfying the intent of the task or not. Consequently, an allowed call may still deviate fr…

  6. arXiv · Published · First archived

    HyperFuse: Fast Self-Supervised Node Embeddings for Attributed Hypergraphs ↗

    Self-supervised hypergraph representation learning can produce informative node embeddings, but existing methods often require deep encoders trained for hundreds of epochs, making embedding generation costly even for hypergraphs with a few thousand nodes. This limits applications requiring embeddings for many or evolving hypergraphs. We present HyperFuse, a label-free pipeline for fast hypergraph representation learning. HyperFuse (i) computes structural node coordinates by maximizing a spectral relaxation of hypergraph modularity using Banerjee's hypergraph adjacency and a matrix-free operato…

  7. arXiv · Published · First archived

    Hamiltonian locality testing and certification do not achieve the Heisenberg limit ↗

    We establish lower bounds for Hamiltonian property testing with access to the time-evolution operator but not its inverse. Each experiment may query the time-evolution operator multiple times, and distances between Hamiltonians are measured in the normalized Frobenius norm. In this model, we show that testing whether a Hamiltonian is $k$-local or $\varepsilon$-far from every $k$-local Hamiltonian requires $Ω(1/\varepsilon^2)$ total evolution time, matching the upper bound of Kallaugher and Liang (TQC'25). We also prove that testing whether an unknown Hamiltonian equals a target Hamiltonian or…

  8. arXiv · Published · First archived

    Contextual Flow Matching: Adaptive Step Selection in Flow Models for Efficient Visual Generation ↗

    Flow Matching enables high-quality visual generation via continuous-time dynamics, but inference remains costly due to multiple sequential function evaluations. Existing acceleration methods reduce the number of function evaluations but often introduce additional training overhead, degrade quality, or fail to account for input-dependent variability. We propose COFLOW, an inference-time method that adaptively selects the step counts each generation based on the prompt features. Our context-aware COFLOW is trained online with an unsupervised reward that balances inference efficiency and generati…

  9. Hacker News · Posted on Hacker News · First archived

    Most recent AI-assisted coder makes first AI-assisted coder run again ↗

    Hacker News discussion.

  10. arXiv · Published · First archived

    Predictively Oriented Gaussian Process Posteriors ↗

    Gaussian Processes (GPs) are a powerful tool for modelling and quantifying uncertainty in functional relationships. However, they require practitioners to make a number of design decisions, such as the choice of the kernel and the observation model. Suboptimal choices can produce misspecified models that do not capture the underlying data generating process. We introduce Predictively Oriented Gaussian Processes (PrO-GPs), which treat predictive uncertainty as the primary inferential target and provide a robust alternative to standard GPs. Although direct computation of a PrO posterior for nonp…

Live window recorded . This is the ingestion observation time, not the publication or discovery date of each source.

How to assess evidence about Artificial Intelligence

Check each original source for its methods, release status, limitations, and supporting data. A repository announcement, a preprint, and a published study provide different kinds of evidence. SYMTRI’s subject classification helps discovery; it does not independently validate the source’s claims.

See the collection and counting methodology ↗ · Read the weekly synthesis ↗

Follow a thread

Explore related regions

These navigation suggestions are part of the map’s editorial structure, rather than measured evidence of a connection.