paper-with-me

Papers

RFSeek and Ye Shall Find

2025-09-12 · Noga H. Rotman, Tiago Ferreira, Hila Peleg, Mark Silberstein, Alexandra Silva arxiv

Requests for Comments (RFCs) are extensive specification documents for network protocols, but their prose-based format and their considerable length often impede precise operational understanding. We present RFSeek, an interactive tool that automatically extracts visual summaries of protocol logic from RFCs. RFSeek leverages large language models (LLMs) to generate provenance-linked, explorable diagrams, surfacing both official state machines and additional logic found only in the RFC text. Compared to existing RFC visualizations, RFSeek's visual summaries are more transparent and easier to audit against their textual source. We showcase the tool's potential through a series of use cases, including guided knowledge extraction and semantic diffing, applied to protocols such as TCP, QUIC, PPTP, and DCCP. In practice, RFSeek not only reconstructs the RFC diagrams included in some specifications, but, more interestingly, also uncovers important logic such as nodes or edges described in the text but missing from those diagrams. RFSeek further derives new visualization diagrams for complex RFCs, with QUIC as a representative case. Our approach, which we term \emph{Summary Visualization}, highlights a promising direction: combining LLMs with formal, user-customized visualizations to enhance protocol comprehension and support robust implementations.

📄 PDF Abstract BibTeX arXiv:2509.10216

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Shallow Syntax in Deep Water

2019-08-29 · Swabha Swayamdipta, Matthew Peters, Brendan Roof, Chris Dyer 외

Shallow syntax provides an approximation of phrase-syntactic structure of sentences; it can be produced with high accuracy, and is computationally cheap to obtain. We investigate the role of shallow syntax-aware represen…

Any Deep ReLU Network is Shallow

2023-06-20 · Mattia Jacopo Villani, Nandi Schoots

We constructively prove that every deep ReLU network can be rewritten as a functionally identical three-layer network with weights valued in the extended reals. Based on this proof, we provide an algorithm that, given a …

Convolutional Neural Networks for Text Categorization: Shallow Word-level vs. Deep Character-level

2016-08-31 · Rie Johnson, Tong Zhang

This paper reports the performances of shallow word-level convolutional neural networks (CNN), our earlier work (2015), on the eight datasets with relatively large training data that were used for testing the very deep c…

Text Categorization

Representational Capacity of Deep Neural Networks -- A Computing Study

2019-07-19 · Bernhard Bermeitinger, Tomas Hrycej, Siegfried Handschuh

There is some theoretical evidence that deep neural networks with multiple hidden layers have a potential for more efficient representation of multidimensional mappings than shallow networks with a single hidden layer. T…

Using Shallow Semantic Parsing and Relation Extraction for Finding Contradiction in Text

2013-10-01 · IJCNLP 2013 10 · Minh Quang Nhat Pham, Minh Le Nguyen, Akira Shimazu
Document SummarizationMulti-Document SummarizationQuestion AnsweringRelation+3