<?xml version="1.0" encoding="UTF-8"?>
<article article-type="Research Article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher">journal-of-discrete-mathematical-sciences-and-cryptography</journal-id>
      <journal-title-group>
        <journal-title>Journal of Discrete Mathematical Sciences and Cryptography</journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2169-0065</issn>
      <issn publication-format="print">0972-0529</issn>
      <publisher>
        <publisher-name>Taru Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.47974/JDMSC-2825</article-id>
      <title-group>
        <article-title>Graph-KAN : Bridging accuracy and interpretability in student performance prediction</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Gupta</surname>
            <given-names>Jitendra  Kumar</given-names>
          </name>
          <aff>Department of Information Technology and Computer Science, Dr. C. V. Raman University, Bilaspur, Chhattisgarh, 495113, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Shukla</surname>
            <given-names>Abhinav</given-names>
          </name>
          <aff>Department of Information Technology and Computer Science, Dr. C. V. Raman University, Bilaspur, Chhattisgarh, 495113, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Yadav</surname>
            <given-names>Aryan</given-names>
          </name>
          <aff>Faculty of Technology, University of Delhi, Delhi, 110007, India</aff>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Jain</surname>
            <given-names>Vanita</given-names>
          </name>
          <aff>Faculty of Technology, University of Delhi, Delhi, 110007, India</aff>
        </contrib>
      </contrib-group>
      <volume>29</volume>
      <issue>7</issue>
      <fpage>2807</fpage>
      <lpage>2820</lpage>
      <pub-date date-type="pub">
        <day>31</day>
        <month>07</month>
        <year>2026</year>
      </pub-date>
      <abstract>
        <p>The sudden growth in digital learning environments has aided the rise of student datasets that provide a great opportunity to predict and explain complex student behaviour and their performance. However, the goal of predicting academic performance remains very difficult because educational interactions are inherently very complex, multimodal, nonlinear, and imbalanced. To overcome limitations of current state-of-the-art (SOTA) models, this study proposes a Graph-KAN, a paradigm that integrates Kolmogorov- Arnold Networks (KANs) within a heterogeneous graph framework. Instead of relying on fixed activation functions, like in traditional Multi-Layer Perceptrons (MLPs), Graph-KAN takes advantage of the Kolmogorov-Arnold representation theorem to learn polynomial splines along the graph edges, allowing the model to dynamically approximate complex nonlinear education functions. We trained and validated Graph-KAN against standard baselines (GraphSAGE, GATv2, and Transformer-Conv) on the Open University Learning Analytics Dataset (OULAD). Our experimental results show that the hybrid Graph-KAN achieves a Macro F1-score of 0.536, outperforming Transformer-based architectures by about 4% and requires comparatively lower computational resources. The hybrid Graph-KAN also overcomes the limitation of class imbalance, which enhances the identification of “Distinction” students, achieving an AUC of 0.78 compared to 0.73 for Transformers. Along with high accuracy, the model offers explainability as the learned activation functions show a “diminishing returns” phenomenon in student engagement. Thus, providing educators with mathematically proven insights for personalised intervention. While basic binary prediction tasks on OULAD often yield high accuracy and F1-score, this study is based on a more complex 4-class task, which remains a challenge. This study proposes Graph-KAN as a new paradigm for such a complex setting. This work establishes KAN-based message passing as a sparingly, interpretable alternative to attention mechanisms in Educational Data Mining.</p>
      </abstract>
      <kwd-group>
        <kwd>Graph neural networks</kwd>
        <kwd>Kolmogorov-Arnold networks</kwd>
        <kwd>Explainable AI</kwd>
        <kwd>Interpretability</kwd>
        <kwd>Educational data mining</kwd>
        <kwd>Student performance prediction</kwd>
      </kwd-group>
      <custom-meta-group>
        <custom-meta>
          <meta-name>access</meta-name>
          <meta-value>open</meta-value>
        </custom-meta>
        <custom-meta>
          <meta-name>retracted</meta-name>
          <meta-value>no</meta-value>
        </custom-meta>
      </custom-meta-group>
    </article-meta>
  </front>
</article>
