arXiv Computer Vision

Beyond Recognition: Compact Multi-Domain Arabic Manuscript HTR with Candidate-Selection Analysis and Evidence-Preserving Review

arXiv:2608. 19385v1 Announce Type: new Abstract: Historical Arabic manuscript transcription is not only a recognition problem.

arXiv Computation and Language
Aug 27

RefLAM: A Reference-Grounded Line Annotation Pipeline for Historical Arabic Manuscripts

RefLAM is a pipeline that converts manuscript page images and clean transcriptions into validated, line-level ground truth for Arabic handwritten text recognition. It combines a deep‑learning page‑segmentation model, a multimodal large language model for structured OCR, and a diacritic‑agnostic fuzzy alignment engine that assigns a confidence score to each line, with a provable correctness guarantee for perfect scores. Using RefLAM, the authors achieved a 75× speedup over manual annotation and released AraMS‑28k, a dataset of 14 historical Arabic manuscripts with detailed annotations.

By Mohamed Guechaoui, Mohamed Diaa Zellagui, Souleyman Chaib, Sahraoui Dhelim
arXiv Computation and Language
Aug 28

AraMS-28k: The Largest Publicly Released Line-Level Dataset of Historical Arabic Manuscripts with Margin and Insertion-Anchor Annotations

AraMS-28k is the largest publicly released line‑level dataset of genuine historical Arabic manuscripts, containing 14 books, 3,043 pages, and 28,600 annotated text lines (27,971 main‑text and 629 margin). The dataset spans three script traditions—Naskh, Ruq'ah, and Maghrebi—and includes a lithographed printed edition for format diversity. Each line is labeled as main‑text or margin, with margin lines that have a clear attachment point annotated with an insertion anchor to recover the manuscript’s true non‑linear reading order; both fully vocalized and diacritic‑normalized transcriptions are provided, and the data was produced via the RefLAM pipeline combining OCR, clean transcriptions, and human review. "whyItMatters":"The dataset’s comprehensive line‑level annotations, including reading‑order anchors and dual transcription formats, enable reproducible research on Arabic manuscript recognition, layout analysis, and reading‑order recovery under a CC BY‑NC‑SA 4.0 license."

By Mohamed Guechaoui, Mohamed Diaa Zellagui, Souleyman Chaib, Sahraoui Dhelim
arXiv Computer Vision
Sep 2

Can Scene Text Recognition Read Rare Compositions?

The paper reports that scene text recognition models, while achieving 89–97% accuracy on standard benchmarks, perform significantly worse on rare word–trigram combinations, with a 10–18 point drop in accuracy at the rare‑word/rare‑trigram corner across multiple languages and models. Scaling the vision backbone improves overall accuracy but does not alleviate this corner‑specific deficit. The authors identify the autoregressive decoder’s lexical prior as the root cause and show that architectural changes—specifically moving from autoregressive to CTC decoding—yield the largest improvement for these rare compositions.

By Genpei Zhang
arXiv Computation and Language
3d ago

Writerslogic at PAN 2026: Process over Content for Robust Detection under Domain Shift

The paper presents the Writerslogic systems for three PAN 2026 shared tasks—Reasoning Trajectory Detection, Voight‑Kampff Generative AI Detection, and Multi‑Author Writing Style Analysis—using a unified analytical framework that prioritizes feature robustness under distribution shift. The framework distinguishes domain‑anchored, domain‑portable, and domain‑invariant features, explaining why generator‑specific traits fail while vocabulary fingerprints, compression measures, and character n‑grams remain effective. The authors report first‑place source detection and third‑place safety classification on Reasoning Trajectory Detection, a top‑scoring ensemble for Voight‑Kampff, and a detailed design for Multi‑Author Writing Style Analysis that was not evaluated due to a platform mix‑up.

By David L. Condrey
arXiv Computation and Language
Oct 1

TRACE: Target-Aware Retrieval, Attributed Evidence, and Contract-Constrained Extraction for LitTraceQA

TRACE is a system designed to bridge the grounding contract gap in LitTraceQA by combining target-aware retrieval, independent typed evidence localization, multimodal table extraction, and schema-driven table construction. It indexes 27,487 papers using multiple representations while preserving question targets, predicts observation units for tables, and assembles rows with evaluator-compatible key normalization. On the official test set, TRACE achieves a 0.760613 overall score, with high paper F1, evidence F1, and multiple-choice accuracy, though table-row and macro cell performance remain lower.

By Sachin Gupta, Divya Godara
arXiv AI
Sep 18

Correct Now, Insufficient Later: Auditing Update Sufficiency in Context Compression

The paper investigates how memory systems can answer a current query correctly yet fail to retain distinctions needed for later updates. Using a paired‑history audit, the authors evaluate 24 history pairs across six synthetic mechanisms and two model backends, achieving perfect reveal accuracy on DeepSeek and high accuracy on GLM. Record‑level audits reveal specific failures in structured reveal memories and frontier late‑reference adequacy, and the authors test a label‑equivariant repair that only partially restores correctness.

By Guangzhe Zhang
arXiv AI
Sep 10

AtomCite: Verification and Correction of Supplied Page-Level Citations in Multi-Page Documents

AtomCite is an agentic framework that verifies and corrects page‑level citations in multi‑page documents by parsing answers into claims, checking each claim against the cited page image, and applying a deterministic repair policy. The authors introduce DocCite, the first benchmark for this task, built on MP‑DocVQA and DUDE, containing 928 injected instances and 1,909 verified natural errors. Across Gemini, Claude, and GPT models, AtomCite achieves about 93% verification accuracy and improves citation precision from 34% to 87‑90%, while also enhancing hallucination detection in open‑source models.

By Chen Qian, Yimeng Wang, Yu Chen, Lingfei Wu, Andreas Stathopoulos