- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes CPNS for propagation-based fake news detection, aiming to make better use of informative deep nodes and reduce over-smoothing during aggregation. CPNS selects candidate nodes based on propagation morphology and weights them using LLM evidence scores. It progressively exposes propagation edges through a depth curriculum, uses multi-branch GraphSAGE routing, and applies consistency constraints across the main, low-frequency, and high-frequency residual views. The main graph representation is combined with the source-news embedding and morphology features to predict news veracity.
Critical strengths
- The research problem is relevant. The paper examines the use of deep propagation nodes and over-smoothing during aggregation, both of which may limit how effectively deeper propagation information contributes to fake news detection.
- The framework design is reasonable. Gradually exposing propagation edges introduces deeper information during training, while incorporating local consensus and node differences allows the model to consider shared information and variation among nodes.
- Multiple aspects are covered in the experiments. Comparisons include multiple baselines on two public datasets. Analyses of candidate selection, curriculum learning, routing signals, and robustness to feature noise help assess component contributions and performance under noisy conditions.
Critical weaknesses
- The methodological novelty is limited. The method mainly combines candidate node selection, LLM weighting, curriculum learning, multi-branch routing, and multi-frequency constraints, without clearly explaining the specific improvements over existing methods. The paper could explain more clearly how the modules work together and provide further evidence for the benefits of combining them.
- The evidence supporting the proposed mechanisms is not sufficient. Results do not directly show reduced reliance on depth, better use of deep-node evidence, or less over-smoothing. Further analysis is needed to assess deep-node contributions, the relationship between depth and node value, and over-smoothing with and without the multi-frequency constraints.
- LLM scoring reliability remains unvalidated. The paper does not explain how hallucinations or incorrect judgments are identified and controlled, and lacks explicit scoring criteria, comparisons with human annotations, and error analysis.
- The ablation studies could be more comprehensive. The paper does not clearly report ablations removing LLM weighting, isolating the contribution of adaptive multi-branch routing, or separately removing the low- and high-frequency constraints.
- Baseline descriptions are inconsistent, and some metric values require verification. Baselines in Section 4.2 do not fully match the result tables, including GAMC, CGAT, HCSL, SEE-GraphMAE, and Semantic-GMAE. In Table 3, UPFD-SAGE’s Macro-F1 (0.8591) exceeds its accuracy (0.8579), contradicting the formulas in Appendix B.3 for the same binary predictions. These values need checking.
Questions for authors
- What are the specific new mechanisms introduced beyond existing curriculum-learning and low-/high-frequency graph-learning methods?
- Could you provide analyses that directly support reduced reliance on depth, preservation of deep-node evidence, or mitigation of over-smoothing?
- What criteria does the LLM use to score node evidence value and reliability? How are hallucinations and incorrect judgments identified or controlled during scoring?
- Could you provide results removing LLM weighting, replacing adaptive routing with a single branch or a fixed mixture, and separately removing the low- and high-frequency constraints to isolate the contributions of these components?
- Please clarify the baseline discrepancies involving GAMC, CGAT, HCSL, SEE-GraphMAE, and Semantic-GMAE, and report UPFD-SAGE’s per-run Macro-F1 and accuracy in Table 3, including how they are computed and aggregated.
4 comments
Response to Reviewer g8ws — Critical Weaknesses(W4–W5)
W4 Response
Thank you for requesting separate ablations of LLM weighting, routing. We conducted new ablations of LLM weighting and multi-branch routing. Appendix G now adds a comparison with LLM scoring disabled.
(1) Isolate the effect of LLM weighting
Only the evidence coefficient is set to zero. The candidate-prior coefficient remains 0.25. Candidate weights become 1.25. Other node weights remain 1.
(2) Isolate the contribution of adaptive multi-branch routing
The manuscript compares training with and without the curriculum. It also compares candidate selection methods. Other comparisons examine depth and uncertainty signals. Appendix G reports the evidence-score control.
[Details]:
In Appendix G.
"The control disables LLM evidence scoring while retaining the other settings. The classifier receives no separate graph-level LLM statistics. Thus, no other input path supplies LLM assessment information when the coefficient is zero."
In Appendix D.5.
"Gains vary across external models, so the effect depends on encoder structure and data distribution. With MFC, the PolitiFact degradation at sigma=0.10 and 0.20 decreases from 20.09% and 45.85% to 5.22% and 17.68%, respectively."
W5 Response
Thank you for identifying inconsistent baseline descriptions and the UPFD-SAGE metric discrepancy in Table 3. Its reported Macro-F1 exceeds its accuracy. We checked the baseline descriptions and metric values, and reran the experiments. We revised Section 4.2 and Appendix D.4, and added HCSL results.
(1) Align baseline descriptions with the result tables
Baseline additions. We added a GAMC description. We removed the unmatched CGAT description.
(2) Clarify HCSL baseline descriptions and results
Tables 2–3 add overall results. Tables 4–5 add noise results.
[Details]:
In Section 4.2, Appendix D.4, and Tables 2--5.
"We compare CPNS with two categories of representative graph-structured fake news detection methods. Detailed descriptions of these baselines are provided in Appendix D.4. Detailed descriptions of these baselines are provided in Appendix D.4."
Response to Reviewer g8ws — Questions for Authors (Q1–Q3)
Q1 Response
Thank you for asking about mechanisms beyond existing curriculum and low-/high-frequency graph-learning methods. We do not present individual modules or methods as new contributions. Instead, we combine and adapt them to use deep-node evidence and preserve local differences. The original text inadequately distinguished established tools from their arrangement in our method. Section 3 now explains how the curriculum, weights, and frequency objectives connect.
(1) Explain the mechanisms beyond existing curriculum-learning methods
The depth curriculum gradually exposes propagation relations. Depth sets the learning order. It does not directly define node value. Evidence weights adjust node contributions. Multiple branches provide different aggregation paths. Routing determines their mixture.
(2) Explain the mechanisms beyond existing low-/high-frequency graph-learning methods
The low-frequency objective targets shared information. The high-frequency objective targets local differences. Both contribute during training.
[Details]:
In Section 3.
"The curriculum, evidence-aware node weighting, routing, and frequency objectives are described as connected components. The opening of Section 3 assigns the curriculum to information access, evidence weights to node contributions, and frequency learning to representation differences."
Q2 Response
Thank you for requesting direct analyses of depth reliance, deep-node evidence preservation, and oversmoothing. We used human verification to assess node value. The manuscript presents these assessment results. Appendix A describes human assessment, while Appendix F discusses oversmoothing.
(1) Analyze the preservation of deep-node evidence
Sampling groups cover datasets, splits, and depth levels. There are 12 groups. Each group contains 250 nodes. The total is 3,000 non-root nodes. Shallow nodes have depth one or two. Deep nodes have depth at least three. Five experts participated in assessment.
[Details]:
In Appendix A.
"Five experts assessed sampled nodes using whether each node helps determine the root news veracity. A valuable node must provide information useful for judging the root news; topic relevance alone is insufficient."
In Appendix F.
"The analysis describes a potential risk and does not establish preferential loss of evidence from deep valuable nodes. The appendix explicitly says this does not establish prediction degradation in the two-layer CPNS."
Q3 Response
Thank you for asking about node evidence value, reliability criteria, and control of hallucinations. We specify the evidence assessor’s inputs and outputs. Appendix B now defines criteria for node evidence value and reliability. It also specifies how these scores affect node weights. It also explains how hallucinations and incorrect judgments are identified or controlled during scoring.
(1) Specify the criteria for node evidence value and reliability
Evidence must help judge the root news. Topic overlap alone is insufficient. Fact-checking keywords alone are also insufficient. Outputs distinguish evidence, noise, and ambiguous information.
(2) Explain the identification and control of scoring errors
Requests exclude ground-truth labels. Reasons are not classifier inputs. Scores only affect bounded node weights. The assessor does not produce the final classification.
[Details]:
In Appendix B.
"Assessment uses the root news, candidate text, local context, and morphology summaries; the graph label is excluded. The assessor receives readable text and structural summaries, not only numerical feature vectors."
In Appendix B.
"Unavailable assessments map to a signed value of zero. The returned categories are evidence, noise, and ambiguous; unavailable assessments receive signed value zero."
Response to Reviewer g8ws — Questions for Authors (Q4–Q5)
Q4 Response
Thank you for requesting controls that separately isolate LLM weighting, routing, and frequency constraints. Appendix G now adds control settings and results with LLM evidence scoring disabled. The control retains candidate priors, node features, model structure, and other training objectives. It only disables the scores’ influence on node readout. Appendix D.5 further reports the overall effect of multi-frequency learning under noise. The low-frequency view describes shared propagation information, while high-frequency residuals describe local differences. Both receive separate label-conditioned contrastive supervision.
[Details]:
In Appendix G.
"The control disables the contribution of LLM evidence scores to node weights. Both conditions retain the same data splits, node features, candidate sets, and trainable parameter count."
In Appendix D.5.
"Gains vary across external models, so the effect depends on encoder structure and data distribution. Tables 4 and 5 report the complete per-backbone robustness results, making the cross-model pattern explicit."
Q5 Response
Thank you for identifying baseline discrepancies and requesting UPFD-SAGE’s per-run Macro-F1 and accuracy. We reran the experiments and obtained results. We acknowledge carelessness when entering the original metric values. We standardized baseline descriptions and added missing methods to the tables.
(1) Clarify baseline discrepancies involving GAMC, CGAT, HCSL, SEE-GraphMAE, and Semantic-GMAE
The manuscript adds a GAMC description. It removes the unmatched CGAT description. It standardizes the Semantic-GMAE name. Tables 2–3 include overall results. Tables 4–5 include noise results.
[Details]:
In Section 4.2, Appendix D.4, and Tables 2--5.
"We compare CPNS with two categories of representative graph-structured fake news detection methods. Detailed descriptions of these baselines are provided in Appendix D.4. Tables 3 and 4 compare CPNS with all baselines on two highly noisy datasets."
Response to Reviewer g8ws — Critical Weaknesses(W1–W3)
W1 Response
Thank you for questioning the specific improvements over existing methods. We acknowledge that the original description did not clearly explain how the modules work together. We revised the opening of Section 3 to explain the modules’ roles and connections.
[Details]:
In the opening of Section 3.
"The three components operate at the stages of information introduction, utilization, and representation learning, respectively. The opening explains that information is introduced, weighted, and represented through the three connected components."
W2 Response
Thank you for questioning reduced reliance on depth and better use of deep-node evidence. You also ask about oversmoothing with and without multi-frequency constraints. The manuscript analyzes deep-node contributions and the relationship between depth and node value. It also analyzes oversmoothing with and without multi-frequency constraints. Appendix A adds human assessment of node value. Appendix F explains the evidence concerning oversmoothing.
(1) Analyze the relationship between depth and node value
Sampling groups cover datasets, splits, and depth levels. There are 12 groups. Each group contains 250 nodes. The total is 3,000 non-root nodes. Shallow nodes have depth one or two. Deep nodes have depth at least three. Five experts participated in assessment. A valuable node must help judge the root news. Topic overlap alone is insufficient. This process is separate from LLM scoring.
[Details]:
In Appendix A.
"A valuable node must provide information useful for judging the root news. Topic relevance alone is insufficient. The sampling covers 12 dataset-split-depth groups, with 250 nodes per group and five expert assessors."
In Appendix F.
"The cited studies do not establish prediction degradation in our two-layer CPNS. The appendix describes the observation as a potential risk and says direct experiments are still needed."
W3 Response
Thank you for questioning the LLM scores. The original manuscript inadequately explained how hallucinations or incorrect judgments are identified and controlled. Appendix B therefore provides assessment criteria, output mappings, and usage limits.
(1) Define explicit scoring criteria
Evidence must help judge the root news. Topic overlap alone is insufficient. Fact-checking keywords alone are also insufficient. Outputs distinguish evidence, noise, and ambiguous information.
(2) Explain the identification and control of hallucinations and incorrect judgments
Requests exclude ground-truth labels. Reasons are not classifier inputs. Scores only affect bounded node weights. The assessor does not produce the final classification.
[Details]:
In Appendix B.
"The assessor distinguishes evidence, noise, and ambiguous information, and returns value and reliability scores. The output includes evidence, noise, or ambiguous labels, together with value and reliability scores."
In Appendix B.
"The classifier receives neither generated veracity judgments nor rationale text. The classifier uses supervised parameters to make final veracity predictions; rationales are not classifier inputs."