arXiv:2609.36550v1 Announce Type: new
Abstract: Retrieval-augmented generation is widely used in professional writing, yet whether retrieval grounds revision or merely injects templates is rarely tes...
By Josepha Michiko Leo, Hyun-seok Min, Yehoon Jang, Irvan Zidny, Jin-Woo Chung, Sungchul Choi
arXiv:2609.15015v1 Announce Type: new
Abstract: Synthetic perturbations appear to offer inexpensive calibration data for LLM evaluators in biomedical ML, where expert review is scarce. Yet a planted...
By Sidi Chang, Peiying Zhu
arXiv:2605. 04135v2 Announce Type: replace-cross Abstract: Readers of applied-domain LLM capability evaluations want to know what AI systems can currently do.
By David Gringras, Misha Salahshoor
arXiv:2607. 29539v1 Announce Type: cross Abstract: Standard AI-text detection benchmarks compare human-written text against text generated directly by large language models (LLMs).
By Gaetano Perrone, Simon Pietro Romano
The paper evaluates unsupervised embedding geometries for patent claim classification, comparing hyperbolic and Euclidean Variational Autoencoders trained on 45,000 US patents. Hyperbolic embeddings retrieve cross-category prior art 52% more often than Euclidean embeddings (18.76% vs. 12.34% of top‑10 results across 3,000 queries). The study also links classification breadth and patents per subgroup to model performance, offering a practical signal for when the method is most useful.
By Sujith Subramanian, P N Bhargav Teja, Susen Sarkar, Rajasekhara Reddy Duvvuru Muni
BLANC (Blank Landscape Analysis through NPMI Conditioning) is a three‑phase pipeline that uses multi‑view neural topic modeling across application/use, novelty, and inventive step, computes Normalized Pointwise Mutual Information (NPMI) to measure cross‑dimensional cluster association, and introduces a conditional detection step that flags combinations whose NPMI drops when the corpus is filtered by a keyword. The drop is quantified by a new metric, ΔNPMI, which identifies combinations that are established globally but unexplored locally. BLANC was evaluated on two USPTO corpora—machine learning/AI and glass compositions—by artificially depleting known technology combinations; it recovered 34.1% and 27.3% of the depleted pairs, respectively, while random removals rarely recovered the target, and it successfully identified a fluorine surface‑treatment × warpage‑suppression candidate in a proprietary float‑glass case.
By Shuichi Miyazawa, Kensuke Fujii
arXiv:2606. 28353v1 Announce Type: cross Abstract: Linking FDA-approved medical devices to their underlying United States Patent and Trademark Office (USPTO) patents enables critical applications such as recall root-cause analysis, M&A-driven IP discovery, and technology trajectory mapping.
By Yang Qingqing, Liu Haijiang, Li Moyan
arXiv:2607. 18360v1 Announce Type: cross Abstract: Large language models (LLMs) now routinely draft literature reviews and assist with academic writing, which means a higher risk of fabricated references: GPTZero found 53 papers with hallucinated citations among NeurIPS 2025's accepted set.
By Patrik Reizinger, Wieland Brendel
The paper evaluates nine on‑device named‑entity recognition models ranging from classical taggers to large language models, measuring not only accuracy but also latency and output validity. Using a silver‑gold benchmark derived from an LLM judge panel and a human‑validated corpus, the study shows that encoder‑based models achieve comparable accuracy to a 4 B instruct LLM while being much smaller, faster, and producing no malformed output. Confidence calibration of GLiNER is analyzed, revealing over‑confidence but improved reliability after temperature scaling and thresholding.
By Vinay Kumar Chaganti
The study examines how the rapid turnover of large language models (LLMs) undermines the effectiveness of AI‑detectors used to screen scientific manuscripts. By comparing 4,000 PNAS abstracts rewritten by 23 different LLM versions released between June 2023 and August 2026, the authors show that detectors trained on past versions can fail dramatically at generation boundaries, missing up to 96% of rewrites just after a sharp transition. Even detectors updated to newer versions can overlook rewrites of older models, and a commercial detector missed most rewrites of the newest version while flagging few human‑written abstracts.
By Kazuki Nakajima, Takayuki Mizuno
The paper introduces ClaimReceipt, a specification and verifier that checks whether a claim in an agent evaluation can be recomputed from retained evidence (sufficiency) and whether the evidence covers the entire experiment set (coverage). Using the CR‑2 verifier on 1,392 historical records, the authors demonstrate accurate reproduction of audit verdicts, non‑redundant field groups, and zero false positives on semantic faults. In a prospective CR‑3 run, the system correctly flags missing receipts and preserves coverage when private evidence is withheld, while adding minimal overhead to inference time and transaction size.
By Peiying Zhu, Sidi Chang
arXiv:2608.21249v1 Announce Type: new
Abstract: While recent large language models (LLMs) have achieved promising results on individual patent drafting tasks, they fundamentally fail to investigate t...
By Lekang Jiang, Wenjun Sun, Stephan Goetz