A new open-source Python library, ChunkRank, derives text chunk boundaries from a target model's tokenizer and context window and selects answers among candidates produced per chunk. It ships a validated registry of 90 models across 15 providers and six answer-selection methods, with only three core dependencies. The paper also reports a negative result on answer ranking and releases code, the model registry, and an evaluation harness.
A new arXiv paper introduces Right Reset (RR), a method that uses causal language model hidden states to find chunk boundaries by measuring how much the right-hand trajectory changes when left context is removed. On flattened text of topically similar records, RR recovers 47.7% of original records as clean units, outperforming BGE embeddings (25.9%).
A new arXiv paper introduces Right Reset (RR), a method that uses causal language model hidden states to find chunk boundaries by measuring how much the right-hand trajectory changes when left context is removed. On flattened text of topically similar records, RR recovers 47.7% of original records as clean units, outperforming BGE embeddings (25.9%).
The developer of chunklet-py, a text/document/code chunker for RAG pipelines and LLM apps, announced a new version featuring SelfTuningChunker. It classifies inputs as document or code, maintains learned per-type profiles, and sizes chunks from learned metrics, removing manual tuning. Practitioners chunking mixed corpora can reuse learned state across runs via an initial_state parameter.
The developer of chunklet-py, a text/document/code chunker for RAG pipelines and LLM apps, announced a new version featuring SelfTuningChunker. It classifies inputs as document or code, maintains learned per-type profiles, and sizes chunks from learned metrics, removing manual tuning. Practitioners chunking mixed corpora can reuse learned state across runs via an initial_state parameter.
A new arXiv paper describes a structural failure mode in hard prompt compression, where independently scoring and retaining text units can split dependent evidence pairs, leaving answers without the context needed to interpret them. The authors demonstrate this 'referential dangling' in Beaver, a compression method using Qwen3-0.6B embeddings, and argue it is a paradigm-level issue.
A new arXiv paper describes a structural failure mode in hard prompt compression, where independently scoring and retaining text units can split dependent evidence pairs, leaving answers without the context needed to interpret them. The authors demonstrate this 'referential dangling' in Beaver, a compression method using Qwen3-0.6B embeddings, and argue it is a paradigm-level issue.
A developer reports that optimizing a RAG pipeline requires balancing three chunk-count variables: retrieved, reranked, and final chunks sent to the LLM. Limiting the LLM context to 10 chunks causes failures on global queries like 'List ALL names in the document' because relevant information is cut off.
A developer reports that optimizing a RAG pipeline requires balancing three chunk-count variables: retrieved, reranked, and final chunks sent to the LLM. Limiting the LLM context to 10 chunks causes failures on global queries like 'List ALL names in the document' because relevant information is cut off.
A developer built a hosted Context Compiler that ranks and deduplicates retrieved passages under a fixed token budget, and benchmarked it on 250 QASPER questions. The tool aims to prevent silent loss of evidence when retrievers return more material than the model's context window allows. The developer is seeking technical criticism from practitioners running real RAG and agent workflows.
A developer built a hosted Context Compiler that ranks and deduplicates retrieved passages under a fixed token budget, and benchmarked it on 250 QASPER questions. The tool aims to prevent silent loss of evidence when retrievers return more material than the model's context window allows. The developer is seeking technical criticism from practitioners running real RAG and agent workflows.