Unverified50% confidenceBenchmarkExact time
For eight of the ten problems, at least one record still asymptotically lags behind the best bounds published in the literature.
1
Sources
50%
Confidence
Medium-term (~90 days)
Relevance
10/12/2026
First Seen
Valid until: 1/10/2027
Sources
Related Entities
Related Claims
UnverifiedThe cost of a key query going from correct to incorrect can far outweigh the marginal improvement of ten edge-case queries.65% similarUnverifiedThe answers to multi-hop reasoning queries cannot be derived directly from a single passage but require chained inference across two or more document segments, making standard single-round retrieval largely unsuccessful for such queries.62% similarUnverified语义搜索和关键词搜索单独使用时约每4个结果漏检1个，两者结合漏检率降到约十分之一59% similarUnverified作者引入约束：每个窗口最多允许8次选择性查询，超过后该窗口只能作为历史证据保留，不能再用于筛选新候选模型59% similarUnverifiedMulti-hop queries need to traverse multiple information nodes in a step-by-step manner, and vector retrieval is ill-suited for such scenarios due to its lack of a relational dimension.56% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1001189API
curl https://kongchang.com/api/v1/knowledge/claims/1001189MCP
get_claim(id=1001189)