Guideline2Graph: Profile-Aware Multimodal Parsing for Executable Clinical Decision Graphs

• URL: http://arxiv.org/abs/2604.02477v1
• Date: Thu, 02 Apr 2026 19:21:31 GMT
• Title: Guideline2Graph: Profile-Aware Multimodal Parsing for Executable Clinical Decision Graphs
• Abstract summary: We present a decomposition-first pipeline that converts full-guideline evidence into an executable clinical decision graph.<n>We evaluate on an adjudicated prostate-guideline benchmark with matched inputs and the same underlying VLM backbone.
• Score: 3.459382629188014
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Clinical practice guidelines are long, multimodal documents whose branching recommendations are difficult to convert into executable clinical decision support (CDS), and one-shot parsing often breaks cross-page continuity. Recent LLM/VLM extractors are mostly local or text-centric, under-specifying section interfaces and failing to consolidate cross-page control flow across full documents into one coherent decision graph. We present a decomposition-first pipeline that converts full-guideline evidence into an executable clinical decision graph through topology-aware chunking, interface-constrained chunk graph generation, and provenance-preserving global aggregation. Rather than relying on single-pass generation, the pipeline uses explicit entry/terminal interfaces and semantic deduplication to preserve cross-page continuity while keeping the induced control flow auditable and structurally consistent. We evaluate on an adjudicated prostate-guideline benchmark with matched inputs and the same underlying VLM backbone across compared methods. On the complete merged graph, our approach improves edge and triplet precision/recall from $19.6\%/16.1\%$ in existing models to $69.0\%/87.5\%$, while node recall rises from $78.1\%$ to $93.8\%$. These results support decomposition-first, auditable guideline-to-CDS conversion on this benchmark, while current evidence remains limited to one adjudicated prostate guideline and motivates broader multi-guideline validation.

Related papers

• One Step, One Lead: Mitigating Higher-Order Interference in Multi-Domain Reinforcement Learning via Cross-Step Control [62.82372407840088]
  We show that same-point domain gradients may remain nearly even when consecutive realized updates partially reverse one another in output space.<n>We propose OSOL, which designates a focus domain at each iteration, to rank token-level rebound risk.<n>OSOL reaches a domain-macro average of 0.4822, improving by 5.7% over the strongest compared baseline, without explicit higher-order differentiation.
  arXiv  Detail & Related papers  (2026-09-06T08:32:59Z)
• GrOIL: Graph-Grounded Domain Ontology Induction with Constrained LLM Mediation [1.029029220360574]
  We present a seven-stage graph-grounded pipeline that converts domain documents into a complete Web Ontology Language (OWL) Terminological Box (TBox) without any unconstrained generation step.<n>Ontology growth analysis provides evidence consistent with vocabulary saturation at scale, demonstrating that the pipeline produces stable, reusable domain representations from large document corpora.
  arXiv  Detail & Related papers  (2026-08-22T23:15:47Z)
• TELLER: Non-intrusive Cross-Layer Root-Cause Analysis for LLM Inference [47.62941623025392]
  We present TELLER, a non-intrusive and Log-aware LLM inference Root-cause analysis framework.<n>TELLER collects NVTX/CUPTI traces and service logs without modifying model binaries.<n>It reconstructs per-request call-chain trees and aligns log lines with corresponding execution steps.<n>On top of these representations, TELLER combines numeric candidate localization with a multimodal root-cause model.
  arXiv  Detail & Related papers  (2026-08-03T09:39:11Z)
• Hierarchical Evidence-Driven Reasoning for Long Document Understanding [95.51688464037096]
  We introduce HIEVI-RAG, a hierarchical, evidence-driven multimodal RAG framework for closed-domain document understanding.<n>Our framework significantly outperforms existing open-source baselines and exceeds the strongest reported baseline by an average of 8.05% in accuracy.
  arXiv  Detail & Related papers  (2026-07-06T03:08:28Z)
• Beyond the Reranker: Do RAG Retrieval Enhancements Help Once a Strong Reranker Is Present? [3.77661940418406]
  Methods for query expansion, hierarchical and cross-document summarization, graph-based expansion, per-query routing, rank fusion, and corrective re-retrieval are studied.<n>We show that a strong cross-encoder reranker accounts for most of the pipeline's quality.<n>The remaining reranking and pool-expansion methods in common use, among them hierarchical summarization, graph expansion, routing, and rank fusion, give no reliable gain once that reranker is present.
  arXiv  Detail & Related papers  (2026-06-14T20:50:41Z)
• StainFlow: Entity-Stain Tracking and Evidence Linking for Process Rewards in GUI Agents [67.03593791535786]
  Reinforcement Learning (RL) has become a promising approach for improving GUI Agents in long-horizon, digital environments.<n>To mitigate this issue, recent studies introduce Process Reward Models (PRMs)<n>PRMs provide finer-grained training feedback through global milestone verification or local step-level evaluation.<n>We propose StainFlow, an entity-stain-flow process reward model for GUI Agents.
  arXiv  Detail & Related papers  (2026-06-05T08:17:28Z)
• TraversalBench: Challenging Paths to Follow for Vision Language Models [11.032462608031922]
  Vision-language models (VLMs) perform strongly on multimodal benchmarks, but the ability to follow complex visual paths is under-tested.<n>We introduce TraversalBench, a benchmark for exact visual path traversal.<n>We find that self-intersections are the dominant source of difficulty.
  arXiv  Detail & Related papers  (2026-04-13T04:58:52Z)
• Hardware-Agnostic Modeling of Quantum Side-Channel Leakage via Conditional Dynamics and Learning from Full Correlation Data [0.0]
  We study a sequential side-channel model in which an adversarial probe qubit interacts with a target qubit during a hidden gate sequence.<n>Repeating the same hidden sequence for $N$ shots yields an empirical full-correlation record.<n>Experiments over broad coupling and noise grids show that strict sequence recovery concentrates near the predicted coupling band.
  arXiv  Detail & Related papers  (2026-02-17T19:33:23Z)
• $G^2$-Reader: Dual Evolving Graphs for Multimodal Document QA [53.491241153213565]
  $G2$-Reader is a dual-graph system for multimodal question answering.<n>$G2$-Reader with Qwen3-VL-32B-Instruct reaches 66.21% average accuracy, outperforming strong baselines and a standalone GPT-5 (53.08%)<n>On VisDoMBench across five multimodal domains, $G2$-Reader with Qwen3-VL-32B-Instruct reaches 66.21% average accuracy, outperforming strong baselines and a standalone GPT-5 (53.08%)
  arXiv  Detail & Related papers  (2026-01-29T17:52:54Z)
• Reasoning by Superposition: A Theoretical Perspective on Chain of Continuous Thought [64.43689151961054]
  We prove that a two-layer transformer with $D$ steps of continuous CoTs can solve the directed graph reachability problem.<n>In our construction, each continuous thought vector is a superposition state that encodes multiple search frontiers simultaneously.
  arXiv  Detail & Related papers  (2025-05-18T18:36:53Z)
• GraphCheck: Multipath Fact-Checking with Entity-Relationship Graphs [11.316299961548415]
  GraphCheck is a framework that transforms claims into entity-relationship graphs for structured and systematic fact-checking.<n>GraphCheck excels in complex scenarios, but it may be unnecessarily elaborate for simpler claims.<n>We introduce DP-GraphCheck, a variant that employs a lightweight strategy selector to choose between direct prompting and GraphCheck adaptively.
  arXiv  Detail & Related papers  (2025-02-28T07:06:19Z)
• Generalized Relation Modeling for Transformer Tracking [13.837171342738355]
  One-stream trackers let the template interact with all parts inside the search region throughout all the encoder layers. This could potentially lead to target-background confusion when the extracted feature representations are not sufficiently discriminative. We propose a generalized relation modeling method based on adaptive token division. Our method is superior to the two-stream and one-stream pipelines and achieves state-of-the-art performance on six challenging benchmarks with a real-time running speed.
  arXiv  Detail & Related papers  (2023-03-29T10:29:25Z)
• SOLD2: Self-supervised Occlusion-aware Line Description and Detection [95.8719432775724]
  We introduce the first joint detection and description of line segments in a single deep network. Our method does not require any annotated line labels and can therefore generalize to any dataset. We evaluate our approach against previous line detection and description methods on several multi-view datasets.
  arXiv  Detail & Related papers  (2021-04-07T19:27:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.