Expert attention map

The Who's Who of AI

What credible people across AI noticed, why it matters, and where the field is converging or disagreeing.

2,397 searchable experts 4,280 tracked across all sources
Build my stream Create my edition
Filter the conversation Who is saying what?

Combine a professional role with a reaction lens. Both must match the same attributed contribution.

Clear all
New Network reaction maps

See how experts are reacting—not just what they shared.

Posts are grouped by conversation and tone. Select a lens to filter the stream; these are never permanent labels on people.

0 live reaction maps in this view

No development in this filter has enough independent reactions yet. The maps appear as soon as the evidence supports them.

Showing signals surfaced by Anupam Gupta ×
Most important

The developments commanding sustained expert attention

One card per development. Sources are clustered; reaction bundles describe these posts, never the people behind them.

Established AI research Research 15d ago
⚡ 10 h early
maximum flow without outer IPM paper

Maximum Flow Without the Outer IPM

2 directory members surfaced this signal.

2 experts 1 community 1 sources clustered
Gautam Kamath Anupam Gupta

“Another amazing result by Jason Li: an almost linear-time algorithm for maximum flows on capacitated directed graphs, avoiding the interior-point approach behind many of the recent max-flow results. arxiv.org/abs/2608.17384”

Primary source arxiv.org ↗
Established AI field signal Signal 15d ago

arxiv.org

1 directory member surfaced this signal.

1 expert 1 community 1 sources clustered
Anupam Gupta

“The [BNW22] approach uses scaling on the lengths. Then Jeremy Fineman's STOC 2024 paper gave an algorithm for real edge weights with sub-O(mn) runtime, using hop-limited shortest paths, betweenness reductions, and the delicious-but-spicy negative sandwiches…”

Primary source arxiv.org ↗
Established Models & releases Research 15d ago
Bellman-Ford almost-linear time paper

Bellman-Ford in Almost-Linear Time

1 directory member surfaced this signal.

1 expert 1 community 1 sources clustered
Anupam Gupta

“This follows close on the heels of work by Jason and Isaac Hair, George Li, and Junkai Zhang, which shows an almost-linear time algorithm for the "Bellman-Ford" problem: shortest paths in graphs with arbitrary real weights. arxiv.org/abs/2607.19346 (3/n)”

Primary source arxiv.org ↗