Pith. sign in

REVIEW 1 cited by

DGoT: Dynamic Graph of Thoughts for Scientific Abstract Generation

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 2403.17491 v1 pith:O7TJHYIU submitted 2024-03-26 cs.CL

classification cs.CL
keywords graphdgotmodelsprompttrainingabstractabstractsapproach
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The method of training language models based on domain datasets has obtained significant achievements in the task of generating scientific paper abstracts. However, such models face problems of generalization and expensive training costs. The use of large language models (LLMs) to solve the task of generating paper abstracts saves the cost of model training. However, due to the hallucination problem of LLM, it is often necessary to improve the reliability of the results through multi-round query prompt approach such as Graph of Thoughts (GoT), which also brings additional reasoning costs. In this paper, we propose a Dynamic Graph of Thought (DGoT). It not only inherits the advantages of the existing GoT prompt approach, but also dynamically adjust the graph structure according to data characteristics while reducing model reasoning cost. Experimental results show that our method's cost-effectiveness in abstract generation tasks is only 43.7% to 56.4% of other multi-round query prompt approaches. Our code is available at https://github.com/JayceNing/DGoT.

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. Adaptive Graph of Thoughts: Test-Time Adaptive Reasoning Unifying Chain, Tree, and Graph Structures

    cs.AI 2025-02 conditional novelty 5.0 of 10

    AGoT is a recursive graph-based prompting framework that decomposes LLM queries into nested subgraphs and reports large relative gains on some benchmarks, though headline GPQA gains rely on a shuffled subset.

Pith tools