Web This site Trusted
30 result(s) for “okapi bm25 site terms com pp site github com site led would site www even fr site:arxiv.org” of 38 matched · 741 ms
Scope: Nishi’s own index (our crawl + Common Crawl) — not the whole live web. Some sites block all automated crawlers (anti-bot walls), so their pages may be absent here even though we never filter lawful content.
Freshness: newest result fetched 25 d ago · median age of these results 25 d · 1 of 30 carry a fetch time
The query asks the model to recall the topic of an earlier conversation about Tesla; the gold answer is anchored in one specific session about Pooja’s dig site
from the top result below
https://arxiv.org/html/2608.02613v1
We evaluate five open-weight readers with Vanilla context, BM25-RAG, Oracle retrieval, Memobase, and MemSearch as memory backends
https://arxiv.org/list/cs.AI/new
CL)
Recent studies have identified an ``Artificial Hivemind'' effect in Large Language Models (LLMs) causing models to converge on a narrow, homogenized consensus even for open questions
https://arxiv.org/html/2608.03048v1
com/JetAstra/PI-Mem
Introduction
The ability to reason over long contexts is increasingly important for large language models (LLMs), supporting applications such as long-document question answering (Gemini Team 2025; Yang et al
https://arxiv.org/html/2501.13956v1
com
Abstract
We introduce Zep, a novel memory layer service for AI agents that outperforms the current state-of-the-art system, MemGPT, in the Deep Memory Retrieval (DMR) benchmark
https://arxiv.org/html/2407.16741v3
com/All-Hands-AI/OpenHands
Slack http://bit
https://arxiv.org/html/2608.02668v1
com/hazdzz/deep_connection \ncudata[Correspondence]Jie Zhang (),
Correspondence: Cheng-Fang Su ()
“Geometry is not true, it is advantageous
https://arxiv.org/list/cs.CL/new
We evaluate five open-weight readers with Vanilla context, BM25-RAG, Oracle retrieval, Memobase, and MemSearch as memory backends
https://arxiv.org/html/2510.03215v2
Report GitHub Issue
Description:
arXiv is now an independent nonprofit
https://arxiv.org/html/2608.02918v1
Miranda is also with LCTI, Télécom Paris, IP Paris, France
https://arxiv.org/html/2608.02616v1
com
Abstract
We present the first independent, systematic evaluation of OpenAI’s Privacy Filter (OPF), a 1
https://arxiv.org/html/2608.03063v1
8 pp in a production fraud detector serving billion-scale transaction traffic
https://arxiv.org/html/2608.03011v1
via Disentangled Audio Infilling
Report GitHub Issue
×
Title:
Content selection saved. Describe the issue below:
Description:
Submit without GitHub Submit in GitHub
arXiv is now an independent nonprofit! Learn more ×
Back to arXiv
https://arxiv.org/html/2407.04503v4
fr Inria, Flowers team, Université de Bordeaux, France Grgur Kovač Inria, Flowers team, Université de Bordeaux, France Corentin Léger Inria, Flowers team, Université de Bordeaux, France Cédric Colas Inria, Flowers team, Université de Bordeaux, France MIT, Computational Cognitive Science Lab, Cambridge, MA, USA
https://arxiv.org/abs/2608.03883
Our systems combine sparse BM25 retrieval, evidence-aware rescoring for self-referential symptom reports, embedding-based reranking, query-prototype expansion, and LLM-based reranking
https://arxiv.org/abs/2104.08663
Our results show BM25 is a robust baseline and re-ranking and late-interaction-based models on average achieve the best zero-shot performances, however, at high computational costs
https://arxiv.org/abs/2608.03860
The pipeline combines sentence-window chunking, BM25, BGE-M3 dense retrieval, reciprocal rank fusion, optional cross-encoder reranking, and grounded answer generation
https://arxiv.org/list/cs.IR/recent
Skip to main content
System maintenance August 4th and 5th Learn more ×
Search Submit Donate Log in
Search arXiv
Press Enter to search · Advanced search
Information Retrieval
Authors and titles for recent submissions
Wed, 5 Aug 2026
https://arxiv.org/list/cs.IR/new
Skip to main content
System maintenance August 4th and 5th Learn more ×
Search Submit Donate Log in
Search arXiv
Press Enter to search · Advanced search
Information Retrieval
New submissions
Cross-lists
Replacements
See recent
https://arxiv.org/html/2608.03486v1
At the same time, the recent theoretical work of Kolesár and Plagborg-Møller (2025) has demonstrated that statistical identification strategies developed under linearity may fail when the structural relationship between the reduced-form innovations and shocks is nonlinear, even if the shocks themselves satisfy
https://arxiv.org/html/2508.16279v1
, 2025) has led to remarkable progress in artificial intelligence
https://arxiv.org/html/2607.22511v2
The source code, formal library, and run records are available at https://github
https://arxiv.org/html/2608.02609v1
Code and pretrained model: https://github
https://arxiv.org/html/2608.02612v1
Our code and dataset are available at https://github
https://arxiv.org/html/2509.22186v2
com/opendatalab/MinerU \metadata[Model:]https://huggingface
https://arxiv.org/html/2608.03372v1
org GitHub
sourcecontextcandidatememoryalign claimscontent-word overlapseven checkspolarity ⋅\cdot condition ⋅\cdot temporalhedge ⋅\cdot attributionbrittle ⋅\cdot truncatedflagsevidence + citationverdict policyhard-codedpasspass_w_flagsrewriterejectuncheckablenever a passwitness (optional)one sentence, one
https://arxiv.org/html/2407.03956v3
Report GitHub Issue
×
Title:
Content selection saved. Describe the issue below:
Description:
Submit without GitHub Submit in GitHub
arXiv is now an independent nonprofit! Learn more ×
Back to arXiv
Why HTML? Report Issue Back to
https://arxiv.org/html/2608.03446v1
com/KathyHaem/cla-metrics
2 Background and Related Work
Cross-lingual alignment
https://arxiv.org/html/2407.17789v2
com/modelscope/agentscope/tree/main/examples/paper_large_scale_simulation to inspire further research and development in large-scale multi-agent simulations
https://arxiv.org/html/2607.26245v1
×
Title:
Content selection saved. Describe the issue below:
Description:
Submit without GitHub Submit in GitHub
arXiv is now an independent nonprofit! Learn more ×
Back to arXiv
Why HTML? Report Issue Back to Abstract Download PDF
https://arxiv.org/html/2210.00131v4
Code and open-source demos available at https://github