Web This site Trusted
25 result(s) for “okapi bm25 site hotchips pp site github com site was github if site shear libon fr site:arxiv.org” · 847 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.
Did you mean okapi bm25 site hotchips pp site github com site was github if site shear lion fr site:arxiv.org?
Freshness: no result on this page carries a fetch time yet (indexed before the fetch epoch was stored beside the doc)
” Gold: “Pooja was dealing with some wild stuff at her dig site and complaining about Tesla parts taking forever
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/html/2407.16741v3
OpenHands has gained significant traction, with 32K GitHub stars and more than 2
https://arxiv.org/list/cs.AI/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
Artificial Intelligence
New submissions
Cross-lists
Replacements
See recent
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/2607.22511v2
The source code, formal library, and run records are available at https://github
https://arxiv.org/html/2508.16279v1
Applications
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
https://arxiv.org/html/2407.02518v2
111We released our code at https://github
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/list/cs.DB/new
Previously, query performance was bound by memory bandwidth, but the increase in memory bandwidth has not resulted in a proportional speedup of cuDF kernels
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/list/cond-mat.mes-hall/new
Together with metallic transport and a crystal-site density much lower than the doped carrier density, this supports metallic electron crystals in which a subset of carriers crystallizes
https://arxiv.org/list/cond-mat.stat-mech/new
Skip to main content Search Submit Donate Log in
Search arXiv
Press Enter to search · Advanced search
Statistical Mechanics
New submissions
Cross-lists
Replacements
See recent articles
Showing new listings for Friday, 7 August 2026
https://arxiv.org/list/physics.ao-ph/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
Atmospheric and Oceanic Physics
Authors and titles for recent submissions
Wed, 5
https://arxiv.org/list/cond-mat.stat-mech/2022-10
Skip to main content Search Submit Donate Log in
Search arXiv
Press Enter to search · Advanced search
Statistical Mechanics
Authors and titles for October 2022
Total of 298 entries : 1-50 51-100 101-150 151-200 ... 251-298
Showing up
https://arxiv.org/list/astro-ph.CO/recent
02755 [pdf, other]
Title: Weak-lensing Shear-Selected Galaxy Clusters from the Hyper Suprime-Cam Subaru Strategic Program: III
https://arxiv.org/list/nucl-th/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
Nuclear Theory
New submissions
Cross-lists
Replacements
See recent articles
https://arxiv.org/html/2508.20105v2
Turbulence
A Introduction
A.1 Stock Market and Turbulence
A.2 Market dynamics and Computational Approach
B Research Gap
C Research objective
D Proposition
E Research Methods
E.1 Tools and Techniques
E.2 Extended Fourier Transform
E.3
https://arxiv.org/list/hep-ph/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
High Energy Physics - Phenomenology
New submissions
Cross-lists
Replacements
See
https://arxiv.org/list/cond-mat/new
The mixed anomaly between these is accommodated by the not-on-site action of the symmetries
https://arxiv.org/list/math/new
It is natural to expect that if many pairs $(x_i,x_j)$ lie at distance close to $1$ from each other, then some clustering phenomenon must occur, implying that a significant number of these pairs are also very close to each other