A formal query-rewriting approach aims to let graph databases handle ontology-mediated questions. Its correctness result is narrower than its practical challenge: some rewrites could not be completed, and many evaluations timed out.
An arXiv preprint reports that Daedalus-150M’s CPU decoding advantage grew with context length while preserving comparable benchmark quality. The model remained behind Peer-135M on the five-task score, and its 4-bit release showed quantization and pruning trade-offs.
An arXiv methods preprint tests POT-IM, which keeps unresolved event order instead of forcing every trace into one sequence. It reports lower sensitivity to timestamp tie-breaking, a large computational cost gap against all-linearization, and earlier perfect-fit coverage in a controlled simulation.
An arXiv preprint evaluates ways to retrieve answer-bearing passages from an Arabic Islamic jurisprudence collection. Fiqh-specific fine-tuning was associated with higher retrieval scores, while legal-school filtering was associated with the largest reported gains on school-specific questions. The evaluation stopped before testing generated-answer quality.
A seven-policy preprint comparison found LFU hard to beat under its controlled protocol, while a quality audit showed that raw semantic-cache hits often failed to represent answer-substitutable reuse.
A methods preprint reports that a fixed agentic-search test recorded lower accuracy and evidence recall on a ClimbMix-based benchmark than on the original corpus, while the strongest agent answered all 57 questions when relevance judgments were supplied.