Pith. sign in

REVIEW 1 cited by

Structured Neural Summarization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1811.01824 v4 pith:HZKSSXG3 submitted 2018-11-05 cs.LG cs.CLcs.SEstat.ML

classification cs.LGcs.CLcs.SEstat.ML
keywords graphmodelsstructuredsummarizationdataneuralpuresequence
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Summarization of long sequences into a concise statement is a core problem in natural language processing, requiring non-trivial understanding of the input. Based on the promising results of graph neural networks on highly structured data, we develop a framework to extend existing sequence encoders with a graph component that can reason about long-distance relationships in weakly structured data such as text. In an extensive evaluation, we show that the resulting hybrid sequence-graph models outperform both pure sequence models as well as pure graph models on a range of summarization tasks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Readability-Robust Code Summarization via Meta Curriculum Learning

    cs.SE 2026-01 conditional novelty 4.0 of 10

    A meta-curriculum fine-tuning method improves summary quality on obfuscated Python code while slightly improving quality on clean code.

Pith tools