Papers for

document processing engineers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Long-document visual question answering tasks and future research directions

A Task-Centric Survey of Long-Document Visual Question Answering: Taxonomy, Evolution, and Future Directions

Abstract: Visual document understanding is essential for acquiring knowledge from visually rich documents and is attracting growing research interest. Existing surveys emphasize architectures or technical approaches, with limited attention to how task bottlenecks shape technical choices and research priorities. We present a task-centric survey that decomposes long-document visual question answering (VQA) into four components: document parsing, evidence organization and retrieval, generator organization and learning, and evaluation. For each, we develop a fine-grained taxonomy and trace motivations, technical responses, and cross-component connections. We focus on explicit retrieval while covering direct reading. Our temporal analysis traces expanding priorities from multimodal content understanding to sufficient, high-fidelity evidence acquisition and sustained evidence management. We outline future directions in evidence sufficiency, verifiable and correctable understanding, and budget-aware coordination, with an outlook on continual document understanding.

Thu 22 OctComputer Vision and Pattern RecognitionComputation and LanguageInformation Retrieval
The gist
Understanding long documents that contain both images and text is tricky, especially when answering questions about them. The authors review how research breaks down the process into parts such as reading, finding evidence, generating answers, and checking accuracy. They show how research priorities have shifted towards managing lots of evidence and making answers reliable. The paper also suggests future work on improving the quality of evidence, verifying understanding, and handling limited resources.
Open → 2610.31385v1

Scientific figure benchmark reveals vision language model limits

SciFigBench: A Benchmark for Scientific Method Figure Understanding

Abstract: Scientific method figures often provide researchers with a clear visual entry point into a paper's methodology and core contributions, yet their dense layouts and complex information flows are difficult for Vision Language Models (VLMs) to interpret. Existing benchmarks predominantly focus on coarse-grained tasks, such as context-based retrieval or holistic comprehension, overlooking the fine-grained content and inter-module relations within complex methodological diagrams. To address these overlooked aspects, we introduce Scientific Figure Benchmark (SciFigBench), a benchmark for evaluating core capabilities required for scientific method figure understanding. Specifically, it targets three capabilities: dense content perception, visual relation comprehension, and information-flow tracing. For this purpose, we curate 4,352 scientific method figures from real-world research papers and construct 40,670 QA pairs to operationalize these capabilities as measurable question-answering tasks. All annotations are generated by dedicated pipelines and then manually verified. We further propose SciFigCue, a training-free visual prompting module that externalizes arrow-induced dependencies as visual relational evidence for method-figure reasoning. Experiments across open-source and proprietary VLMs show that even strong models remain substantially limited in visual relation comprehension, while SciFigCue improves performance across several tasks without parameter updates. The code and related resources are available at https://github.com/LeNcyer/SciFigBench.

Mon 19 OctComputer Vision and Pattern RecognitionComputation and Language
The gist
Scientific papers often include complex diagrams that show their methods visually, which helps readers understand the research quickly. However, current AI models that read images and text together struggle with these dense scientific figures because they miss detailed parts and the flow of information. The authors created a new test called SciFigBench with thousands of real scientific method figures and questions to measure how well AI can understand them. They also made a tool, SciFigCue, that helps AI models follow arrows and relationships in these figures to improve reasoning, without needing to retrain the models. Their experiments show that even strong AI models still find visual relationships challenging, but SciFigCue helps them do better.
Open → 2610.27087v1

Korean court judgment de-identification model improves wider sensitive text privacy

Thunder-DeID+: Boundary-Aware Korean De-identification from Court Judgments to Broader Sensitive Documents

Abstract: This study examines the transferability of a de-identification model developed for Korean court judgments to a broader range of sensitive documents, focusing on boundary precision, label granularity, and recall. The agglutinative structure of Korean causes Byte Pair Encoding (BPE) tokenizers to frequently merge Personally Identifiable Information (PII) with adjacent particles, which complicates accurate span recovery. Furthermore, current PII taxonomies lack sufficient granularity for legal texts. To address these issues, this study introduces Thunder-DeID+, which integrates a refined three-tier PII taxonomy with a boundary-aware tokenizer. The tokenizer enhances a pretrained BPE vocabulary by incorporating N-gram and boundary-scoring components to better align token and PII span boundaries. The proposed approach is evaluated using a tokenizer-independent word-segment-level protocol. On full-length judgments, the tokenizer consistently improves W. Strict Typed F1-score from 0.76-0.77 to 0.87-0.88 across four model sizes (150M, 395M, 750M, and 1B), mainly by increasing precision rather than model scale. With fine-tuning on 1,000 broader sensitive documents, the judgment-trained model further achieves 0.93 W. Strict Typed F1-score, indicating effective transfer beyond court judgments.

Thu 15 OctComputation and Language
The gist
The study looked at how a computer model that hides personal information in Korean court documents can work well on other types of sensitive texts. Korean language features make it tricky for computers to exactly find personal data boundaries. To fix this, the authors created Thunder-DeID+, which uses a smarter way to split words and a detailed classification system for personal data. This approach made the model much better at correctly finding personal info, even after training on just a small amount of new data.
Open → 2610.22733v1

Detectors rely on formatting cues to spot machine generated scientific texts

Measuring Artifact Reliance in Machine-Generated Text Detectors

Abstract: Detectors of machine-generated text score almost perfectly on scientific-literature benchmarks, implying we can reliably distinguish with these detectors human and machine-generated documents. We looked at ten scientific-document subsets from six popular resources, and on several of them that apparent ease is a side effect of how the documents were put together. A logistic regression using 27 superficial features reached 0.833-0.997 macro-F1, and on the three arXiv subsets it outperformed every detector we evaluate with F1-scores 0.951-0.997. The strongest cue to the detector is the PDF extraction artifact: human texts retain their original line breaks, whereas generated texts are extracted as a single block of prose. This cue, together with three other formatting features, tell the classes apart at 0.996 AUC. To distinguish benchmarks that contain such a signal from detectors that rely on one, we introduce format counterfactuals: just re-wrapping a machine-written abstract without changing a single word reverses 20-27% of a public detector's correct decisions. Normalizing formatting before training reduces the generalization gap from 0.32 to 0.22. On format-clean benchmarks, it also raises out-of-domain macro-F1 from 0.33 to 0.65 for detectors trained on artifact-containing subsets.

Fri 9 OctComputation and Language
The gist
It looks like computer programs can reliably tell if scientific papers are written by humans or machines. But this study found that many detectors are actually noticing small formatting differences, like how line breaks appear after extracting text from PDFs, rather than the writing itself. When the researchers fixed these formatting quirks, the detectors became less accurate. This means that some tools might be fooled if the formatting changes, not the content.
Open → 2610.13583v1

Image based prototypes improve document classification accuracy moderately

ProtoSemImage: Image-Valued Prototypes with Deformable Row Alignment for Interpretable Document Classification

Abstract: Prototypes in classification models are almost always vectors, and a vector has no readable form. This paper asks what happens when a prototype is an image. Documents give the question a natural form, because a document can be rendered as a multi-channel image in which every token becomes a pixel, so a class representative can take the same shape and the same channel semantics as the inputs it stands for. ProtoSemImage represents each class by one or more visual archetypes: prototype images in a four-channel HSV space whose channels carry named linguistic factors. A Skip-Gram objective learns that color space end to end through a four-dimensional bottleneck, discourse boundary rows become differentiable typed difference rows, and classification reduces to 2D visual template matching: a deformable row alignment between a document image and the archetype bank, in the spirit of dynamic time warping. Because the match is a spatial pattern comparison rather than a linear readout, the model reports where an input departs from its archetype and along which channel, and a generative head decodes each archetype back into text. The image representation works: it beats an otherwise identical model with vector prototypes in all three paired seeds, by between 4.3 and 11.8 points on a ten-class task. The distance-based matching does not. A diagnostic that keeps the representation fixed and swaps only the classifier recovers the sequence baselines, which locates a 20.6-point shortfall in the matching rather than in the color compression, and a benchmark built so that a pair of documents shares a bag of words and differs only in arrangement confirms the layout-preservation it was designed for. We report both directions, because for a representation whose whole purpose is inspect ability, the failure modes are as informative as the gains.

Thu 8 OctComputer Vision and Pattern RecognitionArtificial Intelligence
The gist
Classifiers usually use vectors that are hard to understand as examples. This paper shows how using little images made from document text can represent categories more naturally and understandably. These image prototypes let the model compare documents spatially and explain where a document differs from its typical category. Their approach improved accuracy on a ten-category task compared to vector methods but also revealed areas where the matching method could be better. The authors provide both the successes and failures to highlight insights about explainable document classification.
Open → 2610.11460v1