Conformability is NP-complete even for connected regular graphs of odd order with α(G)=3 and Δ(G)≥|V(G)|/2 via reduction from perfect triangle packing.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
FOXGLOVE dataset of 2340 comments shows LLMs and instructors align on feedback goals and positions but diverge on sentence selection, with LLMs using more complex language and fewer questions and higher quality ratings driven by comment length.
Sequential fine-tuning of LLaMA-3.1-8B on discourse elements in order outperforms independent and randomized curricula for AES on PERSUADE 2.0, with specific F1/accuracy gains and competitiveness vs. LLaMA-70B on conclusion scoring.
citing papers explorer
-
Conformability is NP-complete, even on connected regular graphs
Conformability is NP-complete even for connected regular graphs of odd order with α(G)=3 and Δ(G)≥|V(G)|/2 via reduction from perfect triangle packing.