<?xml version='1.0' encoding='UTF-8'?>
<feed xmlns:opensearch="http://a9.com/-/spec/opensearch/1.1/" xmlns:arxiv="http://arxiv.org/schemas/atom" xmlns="http://www.w3.org/2005/Atom">
  <id>https://arxiv.org/api/jzd0qEz9wD5LdXhTbE7dLOoG9bk</id>
  <title>arXiv Query: search_query=abs:"document editing"&amp;id_list=&amp;start=0&amp;max_results=20</title>
  <updated>2026-10-04T02:39:53Z</updated>
  <link href="https://arxiv.org/api/query?search_query=abs:%22document+editing%22&amp;start=0&amp;max_results=20&amp;id_list=" type="application/atom+xml"/>
  <opensearch:itemsPerPage>20</opensearch:itemsPerPage>
  <opensearch:totalResults>33</opensearch:totalResults>
  <opensearch:startIndex>0</opensearch:startIndex>
  <entry>
    <id>http://arxiv.org/abs/2609.02170v1</id>
    <title>DMRL: Document-Mediated Reinforcement Learning for Skill Optimization in Advertising Recommendation</title>
    <updated>2026-09-02T06:32:48Z</updated>
    <link href="https://arxiv.org/abs/2609.02170v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2609.02170v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Advertising recommendation requires continuously tuning complex system parameters while balancing commercial returns and user experience. Recent work has introduced large language models (LLMs) with skill documents to assist this labor-intensive process, but skill optimization remains largely prompt-driven, lacking a principled mechanism to attribute rewards to specific document edits. To address this limitation, we propose Document-Mediated Reinforcement Learning (DMRL), a skill self-evolution framework that models skill document optimization as a sequence of structured editing actions. In DMRL, an upper-level agent performs controlled document edits, while a frozen lower-level task agent evaluates their effects through A/B testing. To address credit assignment and long-term outcomes, we introduce two key components: (1) Dual-Relative Policy Optimization (DRPO), a post-training policy optimization method for robust and risk-aware advantage estimation; and (2) Long-term Reward Predictor (LRP), which estimates long-term outcomes by modeling population heterogeneity with disentangled representation learning and cross-attention transfer. DMRL was deployed on a large-scale short-video ads platform and extensive empirical evaluation shows that DMRL outperforms state-of-the-art baselines across key advertising metrics</summary>
    <category term="cs.LG" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-09-02T06:32:48Z</published>
    <arxiv:primary_category term="cs.LG"/>
    <author>
      <name>Wei Zhang</name>
    </author>
    <author>
      <name>Hongji Li</name>
    </author>
    <author>
      <name>Song Sun</name>
    </author>
    <author>
      <name>Peng Yu</name>
    </author>
    <author>
      <name>Xue Yang</name>
    </author>
    <author>
      <name>Lei Zhao</name>
    </author>
    <author>
      <name>Peng Jiang</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.02687v3</id>
    <title>PolicyGuard: Prompt-Configurable Semantic DLP for LLM Coding Agents</title>
    <updated>2026-08-06T01:19:44Z</updated>
    <link href="https://arxiv.org/abs/2608.02687v3" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.02687v3" rel="related" type="application/pdf" title="pdf"/>
    <summary>AI coding agents accept free-form natural language prompts that may inadvertently contain credentials, personally identifiable information (PII), or proprietary business data. Existing data loss prevention (DLP) solutions rely on rigid regex patterns, model fine-tuning, or vendor-managed classifiers with limited customizability. We present PolicyGuard, a pre-model interception framework that classifies user prompts using an LLM guided by a natural language policy file. Our key contributions are: (1) the policy-as-prompt paradigm, where DLP classification criteria are defined entirely in a plaintext policy document editable by non-engineers without code changes or model retraining; (2) a sealed evaluation protocol with template-family-level data splits, hidden holdouts, and frozen test sets to rigorously assess generalization; and (3) a comprehensive empirical evaluation across 2,000 multilingual prompts demonstrating 96.5% effective block rate (EBR) with only 3.0% false positive rate (FPR) on a frozen test set of 927 prompts, and perfect 100% accuracy on a 217-prompt hidden holdout. Information-matched baseline experiments show that PolicyGuard's natural language format significantly outperforms equivalent content in JSON format (McNemar chi-squared = 31.58, p &lt; 0.001) and dramatically outperforms zero-shot classification (Cohen's h = 0.915). Cross-model portability experiments demonstrate that the same policy achieves 86.4-96.5% EBR across four different LLMs without modification.</summary>
    <category term="cs.CR" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.SE" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-03T08:10:15Z</published>
    <arxiv:comment>This paper is being withdrawn because it was submitted prior to completion of a required institutional review process. The authors intend to resubmit after the review is complete</arxiv:comment>
    <arxiv:primary_category term="cs.CR"/>
    <author>
      <name>Kyutae Park</name>
    </author>
    <author>
      <name>Jungwon Kim</name>
    </author>
    <author>
      <name>Daeyeol Shim</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2606.32014v1</id>
    <title>Scalable Behaviour Cloning on Browser Using via Skill Distillation</title>
    <updated>2026-06-30T17:46:23Z</updated>
    <link href="https://arxiv.org/abs/2606.32014v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2606.32014v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Internet users collectively perform an enormous range of skilled work through web browsers, from software development and document editing to search, forms, and enterprise workflows, making human browsing a highly scalable but under-exploited source of reusable browser skills. We argue that the bottleneck for browser agents is decision-making under incomplete information rather than low-level operation, and that the priors agents lack are already implicit in human interaction traces. We therefore study scalable behavior cloning for browser agents via skill distillation, converting user interaction trajectories into compact natural-language skills that agents can read, retrieve, reuse, and compose directly. We further organize the distilled skills into a skill graph so that growth proceeds through consolidation rather than unbounded accumulation. This suggests that the scalability of browser agents may come less from manually designed tasks and more from the collective skills already expressed by internet users. Our project is available at: https://lab.einsia.ai/browserbc/.</summary>
    <category term="cs.CL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-06-30T17:46:23Z</published>
    <arxiv:primary_category term="cs.CL"/>
    <author>
      <name>Kaisen Yang</name>
    </author>
    <author>
      <name>Zheng Jiang</name>
    </author>
    <author>
      <name>Yuzhao Peng</name>
    </author>
    <author>
      <name>Houde Qian</name>
    </author>
    <author>
      <name>Boshi Zhang</name>
    </author>
    <author>
      <name>Youjie Zheng</name>
    </author>
    <author>
      <name>Shijin Hong</name>
    </author>
    <author>
      <name>Qingle Liu</name>
    </author>
    <author>
      <name>Ruoyu Han</name>
    </author>
    <author>
      <name>Bohan Lyu</name>
    </author>
    <author>
      <name>Bingxiang He</name>
    </author>
    <author>
      <name>Eren Cai</name>
    </author>
    <author>
      <name>Calvin Xiao</name>
    </author>
    <author>
      <name>Qinhuai Na</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2606.30783v1</id>
    <title>Security--Fidelity Tradeoffs: The Hidden Cost of Prompt Injection Defense</title>
    <updated>2026-06-29T18:11:17Z</updated>
    <link href="https://arxiv.org/abs/2606.30783v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2606.30783v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>We identify a security-fidelity tradeoff in defending LLMs against indirect prompt injection: defenses resist injected instructions largely by suppressing untrusted text, which corrupts tasks that must preserve it, such as translation and document editing. Attack-success metrics cannot see this, because a model that ignores an injection and one that faithfully processes it as data score identically. We introduce SecFid, a benchmark built so that executing an injection, processing it as data, and ignoring it produce distinguishable outputs. This makes fidelity measurable and exposes a frontier: across 1,168 examples and 48 configurations, no model or defense achieves both objectives. The highest-fidelity model reaches 96.5% fidelity at 47.8% security, while the most secure defenses invert this, at 99.3% security but only 71.0%-73.9% fidelity. Even defenses with identical security differ in how they earn it: some repair hijacks into faithful processing, others simply suppress benign content. A decision-theoretic analysis shows why no fixed choice can be right everywhere: the correct behavior is not a property of the defense but of the deployment, set by its relative cost of a hijack versus a dropped span. Security alone therefore measures only half of robustness, and reporting it without fidelity hides the price at which it was bought.</summary>
    <category term="cs.CR" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.AI" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-06-29T18:11:17Z</published>
    <arxiv:comment>Accepted at the 43rd International Conference on Machine Learning (ICML 2026). 34 pages, 4 figures</arxiv:comment>
    <arxiv:primary_category term="cs.CR"/>
    <author>
      <name>Mitchell Hermon</name>
    </author>
    <author>
      <name>Rahul Gupta</name>
    </author>
    <author>
      <name>Weitong Ruan</name>
    </author>
    <author>
      <name>Ekraam Sabir</name>
    </author>
    <author>
      <name>Haohan Wang</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2606.28480v1</id>
    <title>TUA-Bench: A Benchmark for General-Purpose Terminal-Use Agents</title>
    <updated>2026-06-26T17:59:51Z</updated>
    <link href="https://arxiv.org/abs/2606.28480v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2606.28480v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>As large language models and harness frameworks continue to advance, agents operating in terminals are increasingly capable of performing a broader range of general computer-use tasks beyond coding. However, existing benchmarks do not adequately evaluate general-purpose terminal computer-use agents (TUAs): general computer-use benchmarks primarily target graphical user interfaces (GUIs), whereas terminal-based benchmarks largely emphasize technical and programming-centric workflows historically native to the shell. We introduce TUA-Bench, a general-purpose benchmark for terminal-use agents. TUA-Bench includes 120 real-world tasks across five task families, covering routine digital activities-including document editing, email management, and live-web information seeking-as well as scientific and engineering workflows co-designed with PhD-level domain experts that require specialized software. This breadth distinguishes TUA-Bench from prior shell-focused or domain-specific benchmarks. Each task is manually designed, runs in a real terminal with a deterministic setup script, and is evaluated by an execution-based scoring protocol. We find that the strongest frontier agent, Claude Code with Claude Opus 4.8 max reasoning effort, achieves 65.8% overall performance, with substantial gaps across both tracks. By providing a broad and realistic evaluation of terminal-use capabilities, TUA-Bench aims to accelerate the transition from narrow, task-specific assistants to general-purpose agents capable of operating reliably across diverse digital environments.</summary>
    <category term="cs.SE" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.AI" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-06-26T17:59:51Z</published>
    <arxiv:comment>Website: https://www.tuabench.ai</arxiv:comment>
    <arxiv:primary_category term="cs.SE"/>
    <author>
      <name>Shoufa Chen</name>
    </author>
    <author>
      <name>Luyuan Wang</name>
    </author>
    <author>
      <name>Xuan Yang</name>
    </author>
    <author>
      <name>Zhiheng Liu</name>
    </author>
    <author>
      <name>Yuren Cong</name>
    </author>
    <author>
      <name>Yuanfeng Ji</name>
    </author>
    <author>
      <name>Feiyan Zhou</name>
    </author>
    <author>
      <name>Xiaohui Zhang</name>
    </author>
    <author>
      <name>Fanny Yang</name>
    </author>
    <author>
      <name>Belinda Zeng</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2606.28379v1</id>
    <title>LEDGER: Scaling Agentic Document Editing with Dependency-aware Graph Retrieval</title>
    <updated>2026-06-19T17:35:05Z</updated>
    <link href="https://arxiv.org/abs/2606.28379v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2606.28379v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>We introduce LEDGER to tackle the novel context engineering challenge of agentic document editing, where localized edits to long, structured documents must be applied efficiently without breaking cross-references or semantic consistency. LEDGER constructs a lightweight dependency graph that explicitly models document structure, including hierarchical organization, explicit references, implicit dependencies, and semantic relationships. For each edit, graph-guided retrieval selects only the necessary context, avoiding full-document processing while preserving consistency. We evaluate LEDGER on a curated benchmark of 1.9k test cases with various document types and lengths, spanning six state-of-the-art models: LEDGER improves consistency from 56% to 76% across all six models and test scenarios while reducing token usage. Notably, LEDGER with low reasoning effort matches baseline performance at high reasoning effort using fewer tokens, showing that explicit dependency representations can partially substitute for expensive internal reasoning in agentic document editing.</summary>
    <category term="cs.IR" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.AI" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.CL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-06-19T17:35:05Z</published>
    <arxiv:comment>ACL 2026</arxiv:comment>
    <arxiv:primary_category term="cs.IR"/>
    <author>
      <name>Mike Hang Wang</name>
    </author>
    <author>
      <name>Utkarsh Garg</name>
    </author>
    <author>
      <name>Reza Davari</name>
    </author>
    <author>
      <name>Huitian Jiao</name>
    </author>
    <author>
      <name>Hao Cheng</name>
    </author>
    <author>
      <name>Baolin Peng</name>
    </author>
    <author>
      <name>Tao Ge</name>
    </author>
    <author>
      <name>Si-Qing Chen</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2609.01610v1</id>
    <title>Making Revisions Understandable: A Survey of Edit Intentions, Methods, and Applications</title>
    <updated>2026-06-05T03:40:00Z</updated>
    <link href="https://arxiv.org/abs/2609.01610v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2609.01610v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Text revision is a core process in document creation, capturing how authors iteratively refine, reorganize, and improve written content. With the increasing availability of large-scale revision histories from platforms such as Wikipedia and arXiv, NLP research has begun to move beyond modeling what changes are made to understanding why they are made, i.e., the underlying edit intentions. To our knowledge, this is the first survey that synthesizes text revision research through the lens of edit intentions, providing a unified view of datasets, taxonomies, identification methods, and applications. We review prior work across the full revision workflow, including revision corpus construction, edit intention taxonomy design, and edit intention identification. We further categorize representative datasets and methods, summarize downstream applications such as writing assistance and document edit summarization, and highlight key open research directions.</summary>
    <category term="cs.IR" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-06-05T03:40:00Z</published>
    <arxiv:comment>17 pages, 6 figures, 4 tables, accepted by Findings of ACL 2026</arxiv:comment>
    <arxiv:primary_category term="cs.IR"/>
    <author>
      <name>Fangping Lan</name>
    </author>
    <author>
      <name>Qi Zhang</name>
    </author>
    <author>
      <name>Eduard Dragut</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2605.14091v2</id>
    <title>Venus-DeFakerOne: Unified Fake Image Detection &amp; Localization</title>
    <updated>2026-06-03T07:29:59Z</updated>
    <link href="https://arxiv.org/abs/2605.14091v2" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2605.14091v2" rel="related" type="application/pdf" title="pdf"/>
    <summary>In recent years, the rapid evolution of generative AI has fundamentally reshaped the paradigm of image forgery, breaking the traditional boundaries between document editing, natural image manipulation, DeepFake generation, and full-image AIGC synthesis. Despite this shift toward unified forgery generation, existing research in Fake Image Detection and Localization (FIDL) remains fragmented. This creates a mismatch between increasingly unified forgery generation mechanisms and the domain-specific detection paradigm. Bridging this mismatch poses two key challenges for FIDL: understanding cross-domain artifacts transfer and interference, and building a high-capacity unified foundation model for joint detection and localization. To address these challenges, we propose DeFakerOne, a data-centric, unified FIDL foundation model integrating InternVL2 and SAM2. DeFakerOne enables simultaneous image-level detection and pixel-level forgery localization across diverse scenarios. Extensive experiments demonstrate that DeFakerOne achieves state-of-the-art performance, outperforming baselines on 39 forgery detection benchmarks and 9 localization benchmarks. Furthermore, the model exhibits superior robustness against real-world perturbations and state-of-the-art generators such as GPT-Image-2. Finally, we provide a systematic analysis of data scaling laws, cross-domain artifacts transfer-interference patterns, the necessity of fine-grained supervision, and the original resolution artifacts preservation, highlighting the design principles for scalable, robust, and unified FIDL.</summary>
    <category term="cs.CV" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-05-13T20:20:33Z</published>
    <arxiv:primary_category term="cs.CV"/>
    <author>
      <name> GuangJian Team</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2604.15597v1</id>
    <title>LLMs Corrupt Your Documents When You Delegate</title>
    <updated>2026-04-17T00:33:32Z</updated>
    <link href="https://arxiv.org/abs/2604.15597v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2604.15597v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Large Language Models (LLMs) are poised to disrupt knowledge work, with the emergence of delegated work as a new interaction paradigm (e.g., vibe coding). Delegation requires trust - the expectation that the LLM will faithfully execute the task without introducing errors into documents. We introduce DELEGATE-52 to study the readiness of AI systems in delegated workflows. DELEGATE-52 simulates long delegated workflows that require in-depth document editing across 52 professional domains, such as coding, crystallography, and music notation. Our large-scale experiment with 19 LLMs reveals that current models degrade documents during delegation: even frontier models (Gemini 3.1 Pro, Claude 4.6 Opus, GPT 5.4) corrupt an average of 25% of document content by the end of long workflows, with other models failing more severely. Additional experiments reveal that agentic tool use does not improve performance on DELEGATE-52, and that degradation severity is exacerbated by document size, length of interaction, or presence of distractor files. Our analysis shows that current LLMs are unreliable delegates: they introduce sparse but severe errors that silently corrupt documents, compounding over long interaction.</summary>
    <category term="cs.CL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.HC" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-04-17T00:33:32Z</published>
    <arxiv:primary_category term="cs.CL"/>
    <author>
      <name>Philippe Laban</name>
    </author>
    <author>
      <name>Tobias Schnabel</name>
    </author>
    <author>
      <name>Jennifer Neville</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2603.13058v1</id>
    <title>Dynamic direct (ranked) access of MSO query evaluation over SLP-compressed strings</title>
    <updated>2026-03-13T15:07:21Z</updated>
    <link href="https://arxiv.org/abs/2603.13058v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2603.13058v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>We present an algorithm that, given an index $t$, produces the $t$-th (lexicographically ordered) answer of an MSO query over a string. The algorithm requires linear-time preprocessing, and builds a data structure that answers each of these calls in logarithmic time. We then show how to extend this algorithm for a string that is compressed by a straight-line program (SLP), also with linear-time preprocessing in the (compressed encoding of the) string, and maintaining direct access in logtime of the original string. Lastly, we extend the algorithm by allowing complex edits on the SLP after the direct-access data structure has been processsed, which are translated into the data structure in logtime. We do this by adapting a document editing framework introduced by Schmid and Schweikardt (PODS 2022). This work improves on a recent result of dynamic direct access of MSO queries over strings (Bourhis et. al., ICDT 2025) by a log-factor on the access procedure, and by extending the results to SLPs.</summary>
    <category term="cs.DS" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DB" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.FL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.LO" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-03-13T15:07:21Z</published>
    <arxiv:primary_category term="cs.DS"/>
    <author>
      <name>Martín Muñoz</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2602.00364v4</id>
    <title>"Someone Hid It": Query-Agnostic Black-Box Attacks on LLM-Based Retrieval</title>
    <updated>2026-05-15T06:16:27Z</updated>
    <link href="https://arxiv.org/abs/2602.00364v4" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2602.00364v4" rel="related" type="application/pdf" title="pdf"/>
    <summary>Large language models (LLMs) have been serving as effective backbones for retrieval systems, including Retrieval-Augmentation-Generation (RAG), Dense Information Retriever (IR), and Agent Memory Retrieval. Recent studies have demonstrated that such LLM-based Retrieval (LLMR) is vulnerable to adversarial attacks, which manipulates documents by token-level injections and enables adversaries to either boost or diminish these documents in retrieval tasks. However, existing attack studies mainly (1) presume a known query is given to the attacker, and (2) highly rely on access to the victim model's parameters or interactions, which are hardly accessible in real-world scenarios, leading to limited validity. To further explore the secure risks of LLMR, we propose a practical black-box attack method that generates transferable injection tokens based on zero-shot surrogate LLMs without need of victim queries or victim models knowledge. The effectiveness of our attack raises such a robustness issue that similar effects may arise from benign or unintended document edits in the real world. To achieve our attack, we first establish a theoretical framework of LLMR and empirically verify it. Under the framework, we simulate the transferable attack as a min-max problem, and propose an adversarial learning mechanism that finds optimal adversarial tokens with learnable query samples. Our attack is validated to be effective on benchmark datasets across popular LLM retrievers.</summary>
    <category term="cs.CR" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-01-30T22:28:04Z</published>
    <arxiv:primary_category term="cs.CR"/>
    <author>
      <name>Jiate Li</name>
    </author>
    <author>
      <name>Defu Cao</name>
    </author>
    <author>
      <name>Li Li</name>
    </author>
    <author>
      <name>Wei Yang</name>
    </author>
    <author>
      <name>Yuehan Qin</name>
    </author>
    <author>
      <name>Chenxiao Yu</name>
    </author>
    <author>
      <name>Tiannuo Yang</name>
    </author>
    <author>
      <name>Ryan A. Rossi</name>
    </author>
    <author>
      <name>Yan Liu</name>
    </author>
    <author>
      <name>Xiyang Hu</name>
    </author>
    <author>
      <name>Yue Zhao</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2601.22139v2</id>
    <title>Reasoning While Asking: Transforming Reasoning Large Language Models from Passive Solvers to Proactive Inquirers</title>
    <updated>2026-05-28T17:57:34Z</updated>
    <link href="https://arxiv.org/abs/2601.22139v2" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2601.22139v2" rel="related" type="application/pdf" title="pdf"/>
    <summary>Reasoning-oriented Large Language Models (LLMs) have achieved remarkable progress with Chain-of-Thought (CoT) prompting, yet they remain fundamentally limited by a \emph{blind self-thinking} paradigm: performing extensive internal reasoning even when critical information is missing or ambiguous. We propose Proactive Interactive Reasoning (PIR), a new reasoning paradigm that transforms LLMs from passive solvers into proactive inquirers that interleave reasoning with clarification. Unlike existing search- or tool-based frameworks that primarily address knowledge uncertainty by querying external environments, PIR targets premise- and intent-level uncertainty through direct interaction with the user. PIR is implemented via two core components: (1) an uncertainty-aware supervised fine-tuning procedure that equips models with interactive reasoning capability, and (2) a user-simulator-based policy optimization framework driven by a composite reward that aligns model behavior with user intent. Extensive experiments on mathematical reasoning, code generation, and document editing demonstrate that PIR consistently outperforms strong baselines, achieving up to 32.70\% higher accuracy, 22.90\% higher pass rate, and 41.36 BLEU improvement, while reducing nearly half of the reasoning computation and unnecessary interaction turns. Further reliability evaluations on factual knowledge, question answering, and missing-premise scenarios confirm the strong generalization and robustness of PIR. Model and code are publicly available at: \href{https://github.com/SUAT-AIRI/Proactive-Interactive-R1}</summary>
    <category term="cs.CL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.AI" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-01-29T18:56:12Z</published>
    <arxiv:comment>ACL Main Conference</arxiv:comment>
    <arxiv:primary_category term="cs.CL"/>
    <author>
      <name>Xin Chen</name>
    </author>
    <author>
      <name>Feng Jiang</name>
    </author>
    <author>
      <name>Yiqian Zhang</name>
    </author>
    <author>
      <name>Hardy Chen</name>
    </author>
    <author>
      <name>Shuo Yan</name>
    </author>
    <author>
      <name>Wenya Xie</name>
    </author>
    <author>
      <name>Min Yang</name>
    </author>
    <author>
      <name>Shujian Huang</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2601.20171v1</id>
    <title>Who Writes the Docs in SE 3.0? Agent vs. Human Documentation Pull Requests</title>
    <updated>2026-01-28T02:11:34Z</updated>
    <link href="https://arxiv.org/abs/2601.20171v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2601.20171v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>As software engineering moves toward SE3.0, AI agents are increasingly used to carry out development tasks and contribute changes to software projects. It is therefore important to understand the extent of these contributions and how human developers review and intervene, since these factors shape the risks of delegating work to AI agents. While recent studies have examined how AI agents support software development tasks (e.g., code generation, issue resolution, and PR automation), their role in documentation tasks remains underexplored-even though documentation is widely consumed and shapes how developers understand and use software.
  Using the AIDev, we analyze 1,997 documentation-related pull requests (PRs) authored by AI agents and human developers, where documentation PRs are those that create or modify project documentation artifacts. We find that AI agents submit substantially more documentation-related PRs than humans in the studied repositories. We further observe that agent-authored documentation edits are typically integrated with little follow-up modification from humans, raising concerns about review practices and the reliability of agent-generated documentation. Overall, while AI agents already contribute substantially to documentation workflows, our results suggest concerns for emerging challenges for documentation quality assurance and human-AI collaboration in SE3.0.</summary>
    <category term="cs.SE" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-01-28T02:11:34Z</published>
    <arxiv:comment>Comments: 5 pages, 5 figures. To appear in MSR 2026 Mining Challenge (April 2026). Code available at https://github.com/NAIST-SE/msr2026-docs-prs-replication</arxiv:comment>
    <arxiv:primary_category term="cs.SE"/>
    <author>
      <name>Kazuma Yamasaki</name>
    </author>
    <author>
      <name>Joseph Ayobami Joshua</name>
    </author>
    <author>
      <name>Tasha Settewong</name>
    </author>
    <author>
      <name>Mahmoud Alfadel</name>
    </author>
    <author>
      <name>Kazumasa Shimari</name>
    </author>
    <author>
      <name>Kenichi Matsumoto</name>
    </author>
    <arxiv:doi>10.1145/3793302.3793612</arxiv:doi>
    <link rel="related" href="https://doi.org/10.1145/3793302.3793612" title="doi"/>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2602.00122v3</id>
    <title>VDE Bench: Evaluating The Capability of Image Editing Models to Modify Visual Documents</title>
    <updated>2026-06-11T07:53:49Z</updated>
    <link href="https://arxiv.org/abs/2602.00122v3" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2602.00122v3" rel="related" type="application/pdf" title="pdf"/>
    <summary>In recent years, image editing models have made significant progress, enabling users to manipulate visual content in a flexible and interactive manner through natural language instructions. However, an important yet underexplored research direction remains dense visual document image editing, which involves modifying textual content within images while faithfully preserving the original text style and background context. Existing methods primarily focus on English scenarios and images with relatively sparse text, and thus cannot adequately address dense, structurally complex documents or non-Latin scripts such as Chinese. To bridge this gap, we propose VDE Bench (Visual Doc Edit Bench), a rigorously human annotated and evaluated benchmark specifically designed to assess the performance of image editing models on bilingual Chinese-English and complex visual document editing tasks. The benchmark comprises a high quality dataset of 942 instruction based image editing samples, whose seed images encompass dense Chinese and English text documents including academic papers, posters, presentation slides, examination materials, and newspapers. Furthermore, we introduce a novel evaluation framework that systematically quantifies editing performance at the OCR parsing level, thereby enabling fine grained assessment of text modification accuracy. Based on this benchmark, we conduct a comprehensive evaluation of representative image editing models. Human verification demonstrates a high degree of consistency between human judgments and automated evaluation metrics. VDE Bench constitutes the first systematic benchmark for evaluating the performance of image editing models on bilingual dense text visual documents.</summary>
    <category term="cs.CV" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.AI" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.MM" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-01-27T16:51:05Z</published>
    <arxiv:primary_category term="cs.CV"/>
    <author>
      <name>Hongzhu Yi</name>
    </author>
    <author>
      <name>Yujia Yang</name>
    </author>
    <author>
      <name>Yuanxiang Wang</name>
    </author>
    <author>
      <name>Tong Li</name>
    </author>
    <author>
      <name>Zhenyu Guan</name>
    </author>
    <author>
      <name>Tianyu Zong</name>
    </author>
    <author>
      <name>Jiahuan Chen</name>
    </author>
    <author>
      <name>Chenxi Bao</name>
    </author>
    <author>
      <name>Tiankun Yang</name>
    </author>
    <author>
      <name>Haopeng Jin</name>
    </author>
    <author>
      <name>Yixuan Yuan</name>
    </author>
    <author>
      <name>Xinming Wang</name>
    </author>
    <author>
      <name>Tao Yu</name>
    </author>
    <author>
      <name>Ruilin Gao</name>
    </author>
    <author>
      <name>Ruiwen Tao</name>
    </author>
    <author>
      <name>Haijin Liang</name>
    </author>
    <author>
      <name>Jin Ma</name>
    </author>
    <author>
      <name>Jinwen Luo</name>
    </author>
    <author>
      <name> Yeshani</name>
    </author>
    <author>
      <name>Xinyu Zuo</name>
    </author>
    <author>
      <name>Jungang Xu</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2601.12740v1</id>
    <title>TreeWriter: AI-Assisted Hierarchical Planning and Writing for Long-Form Documents</title>
    <updated>2026-01-19T05:39:35Z</updated>
    <link href="https://arxiv.org/abs/2601.12740v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2601.12740v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Long documents pose many challenges to current intelligent writing systems. These include maintaining consistency across sections, sustaining efficient planning and writing as documents become more complex, and effectively providing and integrating AI assistance to the user. Existing AI co-writing tools offer either inline suggestions or limited structured planning, but rarely support the entire writing process that begins with high-level ideas and ends with polished prose, in which many layers of planning and outlining are needed. Here, we introduce TreeWriter, a hierarchical writing system that represents documents as trees and integrates contextual AI support. TreeWriter allows authors to create, save, and refine document outlines at multiple levels, facilitating drafting, understanding, and iterative editing of long documents. A built-in AI agent can dynamically load relevant content, navigate the document hierarchy, and provide context-aware editing suggestions. A within-subject study (N=12) comparing TreeWriter with Google Docs + Gemini on long-document editing and creative writing tasks shows that TreeWriter improves idea exploration/development, AI helpfulness, and perceived authorial control. A two-month field deployment (N=8) further demonstrated that hierarchical organization supports collaborative writing. Our findings highlight the potential of hierarchical, tree-structured editors with integrated AI support and provide design guidelines for future AI-assisted writing tools that balance automation with user agency.</summary>
    <category term="cs.HC" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.AI" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-01-19T05:39:35Z</published>
    <arxiv:primary_category term="cs.HC"/>
    <author>
      <name>Zijian Zhang</name>
    </author>
    <author>
      <name>Fangshi Du</name>
    </author>
    <author>
      <name>Xingjian Liu</name>
    </author>
    <author>
      <name>Pan Chen</name>
    </author>
    <author>
      <name>Oliver Huang</name>
    </author>
    <author>
      <name>Runlong Ye</name>
    </author>
    <author>
      <name>Michael Liut</name>
    </author>
    <author>
      <name>Alán Aspuru-Guzik</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2601.04589v2</id>
    <title>MiLDEdit: Reasoning-Based Multi-Layer Design Document Editing</title>
    <updated>2026-01-28T20:06:03Z</updated>
    <link href="https://arxiv.org/abs/2601.04589v2" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2601.04589v2" rel="related" type="application/pdf" title="pdf"/>
    <summary>Real-world design documents (e.g., posters) are inherently multi-layered, combining decoration, text, and images. Editing them from natural-language instructions requires fine-grained, layer-aware reasoning to identify relevant layers and coordinate modifications. Prior work largely overlooks multi-layer design document editing, focusing instead on single-layer image editing or multi-layer generation, which assume a flat canvas and lack the reasoning needed to determine what and where to modify. To address this gap, we introduce the Multi-Layer Document Editing Agent (MiLDEAgent), a reasoning-based framework that combines an RL-trained multimodal reasoner for layer-wise understanding with an image editor for targeted modifications. To systematically benchmark this setting, we introduce the MiLDEBench, a human-in-the-loop corpus of over 20K design documents paired with diverse editing instructions. The benchmark is complemented by a task-specific evaluation protocol, MiLDEEval, which spans four dimensions including instruction following, layout consistency, aesthetics, and text rendering. Extensive experiments on 14 open-source and 2 closed-source models reveal that existing approaches fail to generalize: open-source models often cannot complete multi-layer document editing tasks, while closed-source models suffer from format violations. In contrast, MiLDEAgent achieves strong layer-aware reasoning and precise editing, significantly outperforming all open-source baselines and attaining performance comparable to closed-source models, thereby establishing the first strong baseline for multi-layer document editing.</summary>
    <category term="cs.CV" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-01-08T04:38:07Z</published>
    <arxiv:primary_category term="cs.CV"/>
    <author>
      <name>Zihao Lin</name>
    </author>
    <author>
      <name>Wanrong Zhu</name>
    </author>
    <author>
      <name>Jiuxiang Gu</name>
    </author>
    <author>
      <name>Jihyung Kil</name>
    </author>
    <author>
      <name>Christopher Tensmeyer</name>
    </author>
    <author>
      <name>Lin Zhang</name>
    </author>
    <author>
      <name>Shilong Liu</name>
    </author>
    <author>
      <name>Ruiyi Zhang</name>
    </author>
    <author>
      <name>Lifu Huang</name>
    </author>
    <author>
      <name>Vlad I. Morariu</name>
    </author>
    <author>
      <name>Tong Sun</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2509.16128v1</id>
    <title>AnchoredAI: Contextual Anchoring of AI Comments Improves Writer Agency and Ownership</title>
    <updated>2025-09-19T16:25:30Z</updated>
    <link href="https://arxiv.org/abs/2509.16128v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2509.16128v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Generative AI is increasingly integrated into writing support, yet current chat-based interfaces often obscure referential context and risk amplifying automation bias and overreliance. We introduce AnchoredAI, a novel system that anchors AI feedback directly to relevant text spans. AnchoredAI implements two key mechanisms: (1) an Anchoring Context Window (ACW) that maintains unique, context-rich references, and (2) an update-aware context retrieval method that preserves the intent of prior comments after document edits. In a controlled user study, we compared AnchoredAI to a chat-based LLM interface. Results show that AnchoredAI led to more targeted revisions while fostering a stronger agency metrics (e.g., control and ownership) among writers. These findings highlight how interface design shapes AI-assisted writing, suggesting that anchoring can mitigate overreliance and enable more precise, user-driven revision practices.</summary>
    <category term="cs.HC" scheme="http://arxiv.org/schemas/atom"/>
    <published>2025-09-19T16:25:30Z</published>
    <arxiv:primary_category term="cs.HC"/>
    <author>
      <name>Martin Lou</name>
    </author>
    <author>
      <name>Jackie Crowley</name>
    </author>
    <author>
      <name>Samuel Dodson</name>
    </author>
    <author>
      <name>Dongwook Yoon</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2509.11295v2</id>
    <title>The Prompt Engineering Report Distilled: Quick Start Guide for Life Sciences</title>
    <updated>2026-04-29T13:18:01Z</updated>
    <link href="https://arxiv.org/abs/2509.11295v2" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2509.11295v2" rel="related" type="application/pdf" title="pdf"/>
    <summary>Developing effective prompts demands significant cognitive investment to generate reliable, high-quality responses from Large Language Models (LLMs). By deploying case-specific prompt engineering techniques that streamline frequently performed life sciences workflows, researchers could achieve substantial efficiency gains that far exceed the initial time investment required to master these techniques. The Prompt Report published in 2025 outlined 58 different text-based prompt engineering techniques, highlighting the numerous ways prompts could be constructed. To provide actionable guidelines and reduce the friction of navigating these various approaches, we distil this report to focus on 6 core techniques: zero-shot, few-shot approaches, thought generation, ensembling, self-criticism, and decomposition. We breakdown the significance of each approach and ground it in use cases relevant to life sciences, from literature summarization and data extraction to editorial tasks. We provide detailed recommendations for how prompts should and shouldn't be structured, addressing common pitfalls including multi-turn conversation degradation, hallucinations, and distinctions between reasoning and non-reasoning models. We examine context window limitations, agentic tools like Claude Code, while analyzing the effectiveness of Deep Research tools across OpenAI, Google, Anthropic and Perplexity platforms, discussing current limitations. We demonstrate how prompt engineering can augment rather than replace existing established individual practices around data processing and document editing. Our aim is to provide actionable guidance on core prompt engineering principles, and to facilitate the transition from opportunistic prompting to an effective, low-friction systematic practice that contributes to higher quality research.</summary>
    <category term="cs.CL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2025-09-14T14:39:35Z</published>
    <arxiv:primary_category term="cs.CL"/>
    <author>
      <name>Valentin Romanov</name>
    </author>
    <author>
      <name>Steven A Niederer</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2508.07021v1</id>
    <title>DocRefine: An Intelligent Framework for Scientific Document Understanding and Content Optimization based on Multimodal Large Model Agents</title>
    <updated>2025-08-09T15:32:52Z</updated>
    <link href="https://arxiv.org/abs/2508.07021v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2508.07021v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>The exponential growth of scientific literature in PDF format necessitates advanced tools for efficient and accurate document understanding, summarization, and content optimization. Traditional methods fall short in handling complex layouts and multimodal content, while direct application of Large Language Models (LLMs) and Vision-Language Large Models (LVLMs) lacks precision and control for intricate editing tasks. This paper introduces DocRefine, an innovative framework designed for intelligent understanding, content refinement, and automated summarization of scientific PDF documents, driven by natural language instructions. DocRefine leverages the power of advanced LVLMs (e.g., GPT-4o) by orchestrating a sophisticated multi-agent system comprising six specialized and collaborative agents: Layout &amp; Structure Analysis, Multimodal Content Understanding, Instruction Decomposition, Content Refinement, Summarization &amp; Generation, and Fidelity &amp; Consistency Verification. This closed-loop feedback architecture ensures high semantic accuracy and visual fidelity. Evaluated on the comprehensive DocEditBench dataset, DocRefine consistently outperforms state-of-the-art baselines across various tasks, achieving overall scores of 86.7% for Semantic Consistency Score (SCS), 93.9% for Layout Fidelity Index (LFI), and 85.0% for Instruction Adherence Rate (IAR). These results demonstrate DocRefine's superior capability in handling complex multimodal document editing, preserving semantic integrity, and maintaining visual consistency, marking a significant advancement in automated scientific document processing.</summary>
    <category term="cs.CV" scheme="http://arxiv.org/schemas/atom"/>
    <published>2025-08-09T15:32:52Z</published>
    <arxiv:primary_category term="cs.CV"/>
    <author>
      <name>Kun Qian</name>
    </author>
    <author>
      <name>Wenjie Li</name>
    </author>
    <author>
      <name>Tianyu Sun</name>
    </author>
    <author>
      <name>Wenhong Wang</name>
    </author>
    <author>
      <name>Wenhan Luo</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2505.10598v1</id>
    <title>Enhancing Collaboration Through Google Workspace: Assessing and Strengthening Current Practices</title>
    <updated>2025-05-15T11:18:25Z</updated>
    <link href="https://arxiv.org/abs/2505.10598v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2505.10598v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>This study investigates the effectiveness of Google Workspace in fostering collaboration within academic settings, specifically at the University of Makati. The aim is to evaluate its role in enhancing blended learning practices and identify areas for improvement among faculty, staff, and students. A survey was conducted with 50 participants, including academic staff, faculty, and students at the University of Makati who regularly use Google Workspace for academic and collaborative activities. Participants were selected through purposive sampling to ensure familiarity with the platform. The study employed a quantitative research design using structured surveys to assess user experiences with key features such as real-time document editing, communication tools, etc. The study found that Google Workspace and rated as "Very Effective" (mean score of 4.61) in promoting teamwork. Key advantages included improved collaboration, enhanced communication, and efficient management of group projects. However, several challenges were also noted, including low user adoption rates, limited Google Drive storage capacity, the need for better technical support, and limited offline functionality. Google Workspace significantly supports academic collaboration in the normal practices within the University of Makati, however, it faces challenges that impact its overall effectiveness. Addressing these issues could improve user experience and platform efficiency in educational contexts. It is recommended to enhance user adoption through targeted training and improve offline capabilities. Additionally, providing more advanced technical support could mitigate existing challenges.</summary>
    <category term="cs.CY" scheme="http://arxiv.org/schemas/atom"/>
    <published>2025-05-15T11:18:25Z</published>
    <arxiv:primary_category term="cs.CY"/>
    <arxiv:journal_ref>International Journal of Computing Sciences Research 2025 Vol. 9, pp. 3602-3617</arxiv:journal_ref>
    <author>
      <name>Alexander Pahayahay</name>
    </author>
    <arxiv:doi>10.25147/ijcsr.2017.001.1.235</arxiv:doi>
    <link rel="related" href="https://doi.org/10.25147/ijcsr.2017.001.1.235" title="doi"/>
  </entry>
</feed>
