Trending AI papers (weekly)
Weekly velocity ranking of trending AI papers announced on arXiv. Four category queries against the official keyless arXiv query API (cat:cs.AI, cs.CL, cs.CV, cs.LG; announced in the trailing 7 complete days; 3 s between requests per the API Terms of Use) are merged and deduplicated on the base arXiv id, keeping the earliest announcement and the union of categories. Each paper is scored for interest — breadth-weighted recency: n_categories * exp(-age_days / 4) — and ranked fastest first, with deterministic first-match-wins AI-subtopic tags (agents, reasoning, evals, llm, finetuning, rl, quantization, multimodal, vision, audio, nlp, robotics, ml-theory, data, education, other), extractive two-sentence summaries of the abstract (LaTeX stripped, never generated prose), lead author + unioned affiliations, and an is_update flag (version > 1). Columns: ISO week, fetch timestamp (day-granular, UTC midnight), base arXiv id, version, is_update, title, extractive summary, AI subtopic, comma-joined categories, category count, authors, lead author, author count, pipe-joined distinct affiliations, announcement timestamp, days since announced, interest score, velocity rank, canonical arXiv URL, arXiv comment. Primary key: (week, arxiv_id). Cadence: weekly; each snapshot is the full trailing-7-day announcement universe, ranked freshest-and-broadest first. Nullability: comment, lead_affiliation and affiliations may be empty when the author supplied none; velocity_rank and interest_score are never null. Caveats: subtopic tags are keyword rules, not a classifier; affiliations are author-supplied strings; the interest score is an attention proxy, not a quality measure. Only descriptive metadata is stored (no full text), under the arXiv API Terms of Use (CC0 1.0 for metadata), so commercial_use = yes. Sample use: order by velocity_rank for the week's highest-interest AI papers, or filter ai_subtopic = 'agents'.
Les titres et les descriptions proviennent des sources de données, en anglais.
- Lignes
- 2 332
- Colonnes
- 20
- Cadence de la source
- Hebdomadaire
- Dernière actualisation
- 25 sept. 2026
- Thème
- technology
| Colonne | Type | Description |
|---|---|---|
| week | string | ISO week of the fetch (e.g. 2026-W39); the snapshot's trailing-7-day announcement window. (unit: ISO week) |
| fetched_at | string | Fetch timestamp, day-granular: the UTC date of the fetch at midnight. Same-day re-runs produce identical snapshots; a new day always yields a new content-hashed snapshot. (unit: ISO datetime) |
| arxiv_id | string | Base arXiv id without the version suffix (e.g. 2609.12345); the primary row identity. (unit: id) |
| version | integer | arXiv version number of the paper as announced. (unit: count) |
| is_update | integer | 1 when version > 1 (an updated e-print), 0 for a first announcement. (unit: flag) |
| title | string | — |
| summary | string | Extractive summary of the abstract: LaTeX math and commands stripped, whitespace collapsed, first two sentences kept, truncated to 320 characters; emails removed. Reproducible extraction, never generated prose. |
| ai_subtopic | string | Deterministic rule-based AI-subtopic tag from title + abstract (agents, reasoning, evals, llm, finetuning, rl, quantization, multimodal, vision, audio, nlp, robotics, ml-theory, data, education, other); first matching rule wins. Indicative, not a classifier. |
| categories | string | Comma-joined arXiv categories from the entry (the union of all categories the paper was announced in). |
| n_categories | integer | Number of categories in `categories`; the breadth factor of the interest score. (unit: count) |
| authors | string | — |
| lead_author | string | — |
| n_authors | integer | — |
| affiliations | string | Pipe-joined distinct author affiliation strings, in first-seen order; author-supplied, unnormalized. Empty when no author supplied one. |
| announced | string | — |
| days_since_announced | float | Whole days from announcement to the as-of date; the recency factor of the interest score. Day granularity keeps the snapshot stable across same-day re-runs. (unit: days) |
| interest_score | float | Breadth-weighted recency score: n_categories * exp(-age_days / 4). An attention proxy for ranking — not a peer-review or quality signal. (unit: score) |
| velocity_rank | integer | Rank by interest_score descending (1 = highest interest); ties broken by announcement recency, then arXiv id. (unit: rank) |
| arxiv_url | string | Canonical paper page (https://arxiv.org/abs/<arxiv_id>); never null; per-row provenance. (unit: url) |
| comment | string | Author-supplied arXiv comment field (pages, figures, venue). Empty when the author supplied none. |
10 premières lignes d’exemple — un aperçu, pas le jeu de données complet.
| week | fetched_at | arxiv_id | version | is_update | title | summary | ai_subtopic | categories | n_categories | authors | lead_author | n_authors | affiliations | announced | days_since_announced | interest_score | velocity_rank | arxiv_url | comment |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2026-W39 | 2026-09-25T00:00:00+00:00 | 2609.29958 | 1 | 0 | Multi-Dimensional Matching | We study a matching mechanism where agents and objects are described by features rather than complete rankings. A single spectral projection reduces the problem to a one-dimensional sort, computable in O(N log N) time. | agents | cs.GT,cs.LG,cs.MA,econ.EM,econ.TH | 5 | Irene Aldridge | Irene Aldridge | 1 | — | 2026-09-24T15:14:18+0000 | 1 | 3,894 | 1 | https://arxiv.org/abs/2609.29958 | 20 pages |
| 2026-W39 | 2026-09-25T00:00:00+00:00 | 2609.29145 | 1 | 0 | Claim-Gated Source-Risk Auditing for Generative Search | A generative search answer can cite a supported passage yet omit a source relationship that changes its interpretation. We specify a claim-gated audit of the query-source-answer tuple. | evals | cs.AI,cs.CC,cs.CE,cs.ET,cs.IR | 5 | Kainan Zhou; Chuhong Xu; Gangzhen Qian; Zhaoyi Li | Kainan Zhou | 4 | — | 2026-09-24T07:22:14+0000 | 1 | 3,894 | 2 | https://arxiv.org/abs/2609.29145 | International Conference on Artificial Intelligence, Automation and Algorithms (AI2A 2026) |
| 2026-W39 | 2026-09-25T00:00:00+00:00 | 2609.30227 | 1 | 0 | To Trust or Not to Trust: Retrieval-Augmented Fact Checking in Speech | Online misinformation increasingly appears in spoken formats such as news clips, podcasts, interviews, political speeches, and social media videos, creating a need for fact-checking systems that can verify claims directly from speech. We introduce VeriSpeak, a probe benchmark for studying speech-based fact… | reasoning | cs.AI,cs.CL,cs.LG,cs.SD | 4 | Debajyoti Mazumder; Mamta; Abhirama Subramanyam Penamakuri | Debajyoti Mazumder | 3 | — | 2026-09-24T17:50:40+0000 | 1 | 3,115 | 3 | https://arxiv.org/abs/2609.30227 | Accepted to EMNLP (Main) 2026 |
| 2026-W39 | 2026-09-25T00:00:00+00:00 | 2609.30226 | 1 | 0 | PoEM: Predicting RL Outcomes from Existing Policies | Foundation models are post-trained with reinforcement learning (RL) to maximize specific rewards, such as human alignment, correctness, or instruction following. This post-training process is computationally intensive, sometimes unstable, and has to be run from scratch every time the reward model changes or when we… | llm | cs.AI,cs.CL,cs.CV,cs.LG | 4 | Kimia Hamidieh; Giannis Daras; Antonio Torralba | Kimia Hamidieh | 3 | — | 2026-09-24T17:50:25+0000 | 1 | 3,115 | 4 | https://arxiv.org/abs/2609.30226 | — |
| 2026-W39 | 2026-09-25T00:00:00+00:00 | 2609.30215 | 1 | 0 | A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies in the Membership Oracle Model | We prove nearly quadratic lower bounds for randomized algorithms for linear optimization and uniform sampling over convex bodies in the membership oracle model. For linear optimization, this matches the known nearly quadratic upper bound up to a polylog factor in the dimension. | ml-theory | cs.DS,cs.LG,math.FA,math.OC | 4 | Santosh S. Vempala | Santosh S. Vempala | 1 | — | 2026-09-24T17:45:58+0000 | 1 | 3,115 | 5 | https://arxiv.org/abs/2609.30215 | — |
| 2026-W39 | 2026-09-25T00:00:00+00:00 | 2609.30167 | 1 | 0 | Do Audio Language Models Hear and Read Distinctive Features Alike? | Audio language models pass speech and text through a single decoder. We ask whether that decoder represents a distinctive feature in the same direction when a phoneme is heard and when it is read. | llm | cs.CL,cs.LG,cs.SD,stat.AP | 4 | Yuanhao Chen; Peter Chin | Yuanhao Chen | 2 | — | 2026-09-24T17:21:16+0000 | 1 | 3,115 | 6 | https://arxiv.org/abs/2609.30167 | — |
| 2026-W39 | 2026-09-25T00:00:00+00:00 | 2609.30147 | 1 | 0 | GRASP: Generating, Revising, and Assessing for Strategic Planning with Agentic AI | Large Language Models (LLMs) typically exhibit a performance profile where reliability degrades as task complexity increases. We address the challenge of generating high-quality natural language executable plans for complex tasks by introducing , a strategy-aware, multi-stage planning framework. | agents | cs.AI,cs.CL,cs.LG,cs.MA | 4 | Arunabh Srivastava; Mohammad A.; Khojastepour; Srimat Chakradhar; Sennur Ulukus | Arunabh Srivastava | 5 | Amir | 2026-09-24T17:11:35+0000 | 1 | 3,115 | 7 | https://arxiv.org/abs/2609.30147 | Accepted at the Second Workshop for Research on Agent Language Models (REALM) at EMNLP 2026 |
| 2026-W39 | 2026-09-25T00:00:00+00:00 | 2609.30104 | 1 | 0 | MQSS-Selector: RL-Guided Pass Selection for an MLIR Compilation Pipeline | High Performance Computing (HPC) and Quantum Computing (QC) systems are increasingly converging towards unified High Performance Computing-Quantum Computing (HPCQC) infrastructures, driven by a growing need to bridge classical and quantum workflows, which affects all levels of the system stack, from the hardware to… | rl | cs.DC,cs.LG,cs.PL,quant-ph | 4 | Andre Youssefi; Ercüment Kaya; Minh Chung; Jorge Echavarria; Laura B. Schulz; Martin Schulz | Andre Youssefi | 6 | Leibniz Supercomputing Centre|Munich Quantum Valley|Argonne National Laboratory | 2026-09-24T16:46:49+0000 | 1 | 3,115 | 8 | https://arxiv.org/abs/2609.30104 | 11 pages, 5 figures, 1 table |
| 2026-W39 | 2026-09-25T00:00:00+00:00 | 2609.30058 | 1 | 0 | Can Labor Markets Function in the Age of AI? The Evaluation Bottleneck in Hiring | AI-assisted job-search tools have become increasingly popular by making it easier to find and apply to jobs. But by making it easier for applicants to generate and tailor application materials, they can also reduce how informative those materials are about applicant fit. | evals | cs.AI,cs.CY,cs.GT,econ.TH | 4 | Itai Ashlagi; Ramesh Johari; Jon Kleinberg; Anushka Murthy | Itai Ashlagi | 4 | — | 2026-09-24T16:16:05+0000 | 1 | 3,115 | 9 | https://arxiv.org/abs/2609.30058 | — |
| 2026-W39 | 2026-09-25T00:00:00+00:00 | 2609.30037 | 1 | 0 | AERIAL: Adversarial Evaluation of Robustness in Accuracy-Preserving Low-Precision EEG Decoders | Deployment-oriented compression is attractive for resource-constrained brain--computer interfaces (BCIs), but whether it changes adversarial vulnerability remains unclear. On BCI Competition IV-2a, we compare 32-bit floating-point (FP32) EEGNet and ShallowConvNet models with global magnitude pruning and simulated INT8… | evals | cs.CR,cs.CV,cs.LG,eess.SP | 4 | Saim Rehman; Muhammad Shafique | Saim Rehman | 2 | — | 2026-09-24T16:07:01+0000 | 1 | 3,115 | 10 | https://arxiv.org/abs/2609.30037 | Submitted to IEEE ICASSP 2027, 5 pages |
Profilé le 25 sept. 2026 à partir de l’instantané 20260925T022231Z-fe6cab95e414
Mesuré- Complétude
- 100 %
- Lignes
- 2 332
- Colonnes
- 20
- Colonnes incomplètes
- 0
| Colonne | Manquant | Distinctes | Plage | Distribution |
|---|---|---|---|---|
| weekvarchar | 0 % | 1 | — |
|
| fetched_atvarchar | 0 % | 1 | — |
|
| arxiv_idvarchar | 0 % | 2 476 | — |
|
| versionbigint | 0 % | 3 | 1 → 3médiane 1 | 3 hors du 1er–99e centile |
| is_updatebigint | 0 % | 2 | 0 → 1médiane 0 | |
| titlevarchar | 0 % | 2 094 | — |
|
| summaryvarchar | 0 % | 1 934 | — |
|
| ai_subtopicvarchar | 0 % | 17 | — |
|
| categoriesvarchar | 0 % | 444 | — |
|
| n_categoriesbigint | 0 % | 5 | 1 → 5médiane 2 | 17 hors du 1er–99e centile |
| authorsvarchar | 0 % | 2 142 | — |
|
| lead_authorvarchar | 0 % | 1 957 | — |
|
| n_authorsbigint | 0 % | 38 | 1 → 83médiane 4 | 21 hors du 1er–99e centile |
| affiliationsvarchar | 0 % | 47 | — |
|
| announcedvarchar | 0 % | 2 149 | — |
|
| days_since_announceddouble | 0 % | 7 | 1 → 7médiane 4 | |
| interest_scoredouble | 0 % | 33 | 0,1738 → 3,89médiane 0,7358 | 20 hors du 1er–99e centile |
| velocity_rankbigint | 0 % | 2 434 | 1 → 2 332médiane 1 167 | 48 hors du 1er–99e centile |
| arxiv_urlvarchar | 0 % | 2 233 | — |
|
| commentvarchar | 0 % | 970 | — |
|
- Actuelle
20260925T022231Z-fe6cab95e414 · sha256 fe6cab95e414…
2 332 lignes · +0 lignes par rapport à la précédente
20260925T021556Z-25eb72abe845 · sha256 25eb72abe845…
2 332 lignes · +0 lignes par rapport à la précédente
20260925T021312Z-757e32d7c6e8 · sha256 757e32d7c6e8…
2 332 lignes · premier instantané
Dirigez n’importe quel LLM vers le point d’accès des métadonnées — la documentation ci-dessus est aussi lisible par machine (JSON-LD + Croissant).
curl "https://datazimuts.com/v1/datasets/arxiv_ai_signals/arxiv_ai_papers_weekly" | jq '{title, rows, columns_count, license}'import requests
ds = requests.get("https://datazimuts.com/v1/datasets/arxiv_ai_signals/arxiv_ai_papers_weekly").json()
print(ds["title"], ds["rows"], "rows")
# Sample rows for an LLM context window
for row in ds.get("sample_rows", [])[:5]:
print(row)Point d’accès API : https://datazimuts.com/v1/datasets/arxiv_ai_signals/arxiv_ai_papers_weekly
Astuce : récupérez /llms.txt pour le catalogue complet lisible par machine.
D’où viennent ces données et ce qui en a été fait. Le travail des autres apparaît sous forme de décomptes ; seuls les projets partagés sont nommés.
Citer cet instantané
Épinglé à l’instantané 20260925T022231Z-fe6cab95e414 et à son empreinte, pour que vos lecteurs obtiennent exactement les données utilisées.
Trending AI papers on arXiv (agent-curated). (2026). Trending AI papers (weekly) [Data set, snapshot 20260925T022231Z-fe6cab95e414, sha256 fe6cab95e414]. Datazimuts. Retrieved 2026-09-25, from https://datazimuts.com/fr/datasets/arxiv_ai_signals/arxiv_ai_papers_weekly?snapshot=20260925T022231Z-fe6cab95e414
@misc{dz_arxiv_ai_signals_arxiv_ai_papers_weekly_fe6cab95,
title = {{Trending AI papers (weekly)}},
author = {{Trending AI papers on arXiv (agent-curated)}},
year = {2026},
publisher = {Datazimuts},
howpublished = {\url{https://datazimuts.com/fr/datasets/arxiv_ai_signals/arxiv_ai_papers_weekly?snapshot=20260925T022231Z-fe6cab95e414}},
note = {Snapshot 20260925T022231Z-fe6cab95e414, sha256 fe6cab95e414b36f84b9a2e701708ac4395ee915d57f95c74209a41a29565483; accessed 2026-09-25}
}Intégrer un tableau ou un graphique
Collez ce code dans n’importe quelle page. L’intégration est épinglée au même instantané, suit le thème clair ou sombre du lecteur et affiche toujours la source, la licence et un lien de retour.
<iframe src="https://datazimuts.com/embed/chart?dataset=arxiv_ai_signals%2Farxiv_ai_papers_weekly&lang=fr&theme=auto&snapshot=20260925T022231Z-fe6cab95e414&x=is_update&y=version&agg=avg" title="Trending AI papers (weekly)" width="100%" height="380" style="border:0" loading="lazy"></iframe>
Posez une question sur ce jeu de données. Les réponses viennent uniquement de sa fiche, de son profil mesuré et de son historique, et citent les faits utilisés.