Crossref DOIMemberCiteFactoropen accessissn
SJIF Impact Factor 8.659 | ISSN: 2582-3930
IJSREM Logo

International Journal of Scientific Research in Engineering and Management

(Gateway to Global Scholars - An International, Scholarly, Multi-Disciplinary, Open Access Journal)

Peer-Reviewed Journal Designed to Meet UGC's Quality Parameters

HomeCurrent IssuePast IssuesPay OnlineConferencesEditorial BoardAbout UsContact Us
IJSREM

Loading article...

Follow Us

  • Google Scholar
  • ResearchGate
  • Academia.edu
  • Mendeley
  • LinkedIn
  • Facebook
  • Instagram

Journal Policies

  • Peer Review Policy
  • Publication Ethics
  • Copyright Infringement
  • Refund & Cancellation Policy
  • Terms and Conditions
  • Privacy Policy

Journal Identifiers & Licenses

  • ISSN Verified: 2582-3930ISSN Verified: 2582-3930
  • Crossref DOI: 10.55041Crossref DOI: 10.55041
  • SJIF Ranking: 08.659SJIF Ranking: 08.659
  • Licensed under CC BY 4.0Licensed under CC BY 4.0
  • ISO Certification: 9001:2015ISO Certification: 9001:2015
  • Indexed & Cited In: Google ScholarIndexed & Cited In: Google Scholar

Contact Us

International Journal of Scientific Research in Engineering and Management (IJSREM)

#62/1, New No 7, 1st Cross, 2nd Main, Ganganagar, R T Nagar, Bangalore North, Bangalore, Karnataka, India – 560032
[email protected]+91 93911 67991
logos
logos
Working Hours

Mon – Sat: 9:00 AM – 6:00 PM

Sunday: 10:00 AM – 4:00 PM

+91 93911 67991

© 2026 IJSREM – International Journal of Scientific Research in Engineering and Management. This is an open-access journal. Articles are published under the Creative Commons Attribution (CC BY 4.0) License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

DisclaimerPrivacy PolicyTerms and Conditions
ArticlePeer ReviewedOpen AccessPlagiarism Passed
Paper ID:IJSREM68652

AI-Powered Multilingual Plagiarism Detection Using Graph Neural Networks and Syntax-Semantic Knowledge Graphs

Stream/Area:

-

Subject:

-

Paper ID:

IJSREM68652

Volume:

10 |

10 |

Oct 2026

Pages:

1-8

Publication Frequency:

Monthly (12 issues per year)

DOI
Digital Object Identifier
10.55041/IJSREM68652

License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.

Share this article:

Authors

Anuja Wagh

Anuja Wagh

Computer Engineering

Vishwabharati Academy's College of Engineering

Download Author Certificate
Gargi Madane

Gargi Madane

Computer Engineering

Vishwabharati Academy's College of Engineering

Download Co-Author Certificate
Rutuja Vanwe

Rutuja Vanwe

Computer Engineering

Vishwabharati Academy's College of Engineering

Download Co-Author Certificate

Mentors

Prof. Sonali Dhage

Prof. Sonali Dhage

Computer Engineering

Vishwabharati Academy's College of Engineering

Download Mentor Certificate

Author Services & Downloads

Full ArticlesAcceptance Certificate

Abstract

Digital content, machine translation and generative AI tools make it easy to reuse an idea without reusing its wording, and this has made plagiarism harder to detect in academic and research settings. Detectors built on lexical matching were designed for verbatim copying and lose most of their signal once a text is translated, paraphrased or restructured. Knowledge graphs (KGs) and graph neural networks (GNNs) offer an alternative, because they encode relations between words and concepts instead of surface strings. This paper reviews that line of work and concentrates on the CL-UniDepWord-GNN framework of Bouaine et al. published in IEEE Access, which merges WordNet semantic relations with Universal Dependencies syntax in a single multilingual graph and learns over it with relation embeddings, a graph convolutional network (GCN) and a graph attention network (GAT). We summarise how the framework is built, which datasets it uses and what PlagDet scores it reports for four language pairs, and we read those results critically, including how the evaluation corpora were assembled and how the baselines were compared. We then collect the open problems, namely evaluation realism, dependence on linguistic resources, computational cost, explainability and AI-generated text, and outline a prototype architecture for future work.

KEYWORDS

Plagiarism Detection Graph Neural Networks Knowledge Graphs Cross-Language Plagiarism Detection Nat-ural Language Processing WordNet Universal Dependencies Graph Attention Networks Graph Convolutional Networks Semantic Similarity

Cite This Article

Anuja Wagh, Gargi Madane, Rutuja Vanwe, Prof. Sonali Dhage, "AI-Powered Multilingual Plagiarism Detection Using Graph Neural Networks and Syntax-Semantic Knowledge Graphs," International Journal of Scientific Research in Engineering and Management, vol. 10, no. 10, pp. 1-8, Oct 2026. https://doi.org/10.55041/IJSREM68652

Full Article/Conclusion

The framework reviewed here shows that adding syntac-tic structure to WordNet-based graphs can improve cross-language plagiarism detection in three of four language pairs, with the language-dependent pattern in the ablation being its most informative result. The size of the reported gains over earlier systems should be treated with caution until they are confirmed on held-out corpora with like-for-like baselines. Semantic resources combined with graph learning remain a promising basis for next-generation detectors. Future systems should add reliable handling of AI-generated content, scalable deployment and explanation of their output, while preserving multilingual support.

References

[1]     C. Bouaine, F. Benabbou, A. Bouaine, and C. Zaoui, “Multilingual Plagiarism Detection Using GNNs and Syntax-Semantic Knowledge Graphs,” IEEE Access, vol. 14, pp. 99027–99043, 2026. [2]     O. Hourrane and E. H. Benlahmar, “Graph Transformer for Cross-Lingual Plagiarism Detection,” IAES Int. J. Artif. Intell. (IJ-AI), vol. 11, no. 3, pp. 905–915, Sep. 2022. [3]     M. Potthast, B. Stein, A. Eiselt, A. Barro´n-Ceden˜o, and P. Rosso, “PAN Plagiarism Corpus 2011 (PAN-PC-11),” Zenodo, 2011. [4]     P. Koehn, “Europarl: A Parallel Corpus for Statistical Machine Transla-tion,” in Proc. MT Summit X, Phuket, Thailand, 2005, pp. 79–86. [5]     R. Steinberger et al., “The JRC-Acquis: A Multilingual Aligned Parallel Corpus with 20+ Languages,” in Proc. 5th Int. Conf. Lang. Resour. Eval. (LREC), 2006. [6]     N. Reimers and I. Gurevych, “Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks,” in Proc. EMNLP-IJCNLP, 2019, pp. 3982–3992. [7]     G. A. Miller, “WordNet: A Lexical Database for English,” Commun. ACM, vol. 38, no. 11, pp. 39–41, 1995. [8]     Z. Sun, Z.-H. Deng, J.-Y. Nie, and J. Tang, “RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space,” in Proc. ICLR, 2019. [9]     T. N. Kipf and M. Welling, “Semi-Supervised Classification with Graph Convolutional Networks,” in Proc. ICLR, 2017. [10]    P. Velickovic et al., “Graph Attention Networks,” in Proc. ICLR, 2018.

Editorial & Review Transparency

Publication Date

10/31/2026

Peer Review Type

Double-Blind Peer Review

Review Rounds: 2

Documents

Review Report (Confidential)
Copyright Form (Office)

Article Metrics & Impact

Article Views

1

Total views since publication

PDF Downloads

4

Total downloads since publication

Geographic Reach

5

Indexing, Archiving & Preservation

Google Scholar
Academia
ResearchGate
Crossref
SSRN
Semantic Scholar
Thomson Reuters
WorldCat
Mendeley
OpenAlex
EBSCO
Zenodo

Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.

Ethics, Compliance & Transparency

Plagiarism Screening

This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.

Conflict of Interest

The authors declare no conflict of interest related to this research work.

Funding Information

No funding information available for this research.

Similar & Recommended Articles

Similar Articles by Topic

Related research in the same subject area

Loading similar articles...