Web This site Trusted
16 result(s) for “okapi bm25 site terms com pp site www postgresql org site web developed com site non site:arxiv.org” · 1023 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: no result on this page carries a fetch time yet (indexed before the fetch epoch was stored beside the doc)
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
4 Permission-Aware Access: Why Non-Leaks Are Not Refusals
A
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/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/list/cs.AI/new
The implemented contract fixes evidence non-overwrite, branch isolation, grounded multi-subject timers, guarded state change, and declaration-ranked event ordering over time and space; an external runner still decides whether evidence becomes an authoritative move
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
CL)
Existing deep-research agents use a search-visit workflow that retrieves and reads whole pages, without considering the addressable structure that web sources expose through titles, headings, sections, and metadata
https://arxiv.org/list/cs.CL/new
Prior work enables one-way, scholar-oriented translation from Akkadian to English, but offers no path in the reverse direction: non-specialist users cannot compose new content in cuneiform, and therefore remain passive consumers of ancient culture rather than active participants
https://arxiv.org/html/2407.16741v3
com/All-Hands-AI/OpenHands
Slack http://bit
https://arxiv.org/html/2608.03118v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/html/2508.20105v2
, Fama’s theory of Efficient Market Hypothesis is still relevant and is important to analyze the stages of market patterns and fluctuations to discover the quantitative aspect of the information in terms of price dynamics
https://arxiv.org/html/2401.02063v2
org that the field of high-frequency GWs will go from the discovery of the first stellar-mass binary black hole merger in 2015 [9]
https://arxiv.org/html/2407.01757v1
Opportunities and Technology Feasibility
1 Introduction
1.1 What is a distributed instrument?
1.1.1 Distributed Instruments and Sensor Networks
1.1.2 Distributed Instruments and Swarms
1.2 Contribution and Organization
2 State of the Art
https://arxiv.org/list/math/new
CO)
In a graph $G=(V,E)$, let $S$ be a non empty subset of $V$