{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T16:25:29Z","timestamp":1783700729251,"version":"3.55.0"},"reference-count":81,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/access.2026.3670106","type":"journal-article","created":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T20:51:06Z","timestamp":1772657466000},"page":"35552-35569","source":"Crossref","is-referenced-by-count":1,"title":["DIFFICODE: A Dataset and Graph Spectral Framework for Programming MCQ Difficulty Estimation"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2640-8528","authenticated-orcid":false,"given":"Manikandan","family":"Ravikiran","sequence":"first","affiliation":[{"name":"IIT Mandi, Mandi, Himachal Pradesh, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rakesh","family":"Prakash","sequence":"additional","affiliation":[{"name":"University of Colorado Boulder, Boulder, CO, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arnav","family":"Bhavsar","sequence":"additional","affiliation":[{"name":"IIT Mandi, Mandi, Himachal Pradesh, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0773-3480","authenticated-orcid":false,"given":"Rohit","family":"Saluja","sequence":"additional","affiliation":[{"name":"IIT Mandi, Mandi, Himachal Pradesh, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3441636.3442306"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TLT.2022.3226523"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2960310.2960316"},{"key":"ref4","volume-title":"Proc. ACM Conf. Int. Comput. Educ. Res. (ICER)","author":"Ko"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s40593-023-00362-1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3556538"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1111\/j.1745-3992.1997.tb00603.x"},{"key":"ref8","volume-title":"Item Response Theory for Psychologists","author":"Embretson","year":"2000"},{"key":"ref9","article-title":"BanditCAT and AutoIRT: Machine learning approaches to computerized adaptive testing and item calibration","author":"Sharpnack","year":"2024","journal-title":"arXiv:2410.21033"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s11423-023-10231-2"},{"key":"ref11","first-page":"2085","article-title":"TEEMIL: Towards educational MCQ difficulty estimation in Indic languages","volume-title":"Proc. Int. Conf. Comput. Linguistics (COLING)","author":"Ravikiran"},{"key":"ref12","first-page":"470","article-title":"Findings from the first shared task on automated prediction of difficulty and response time for multiple-choice questions","volume-title":"Proc. 19th Workshop Innov. Use NLP Building Educ. Appl. (BEA 2024)","author":"Yaneva"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-99267-4_16"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-98414-3_14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3469128"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.findings-naacl.193"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.acl-short.3"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.findings-emnlp.139"},{"key":"ref19","first-page":"1","article-title":"GraphCodeBERT: Pre-training code representations with data flow","volume-title":"Proc. 9th Int. Conf. Learn. Represent.","author":"Guo"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2019.00086"},{"key":"ref21","article-title":"Abstract syntax tree for programming language understanding and representation: How far are we?","author":"Sun","year":"2023","journal-title":"arXiv:2312.00413"},{"key":"ref22","first-page":"483","article-title":"Predicting item difficulty with scalar-mixed transformers","volume-title":"Proc. 19th Workshop Innov. Use NLP Building Educ. Appl. (BEA)","author":"Gombert"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s40593-023-00362-1"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-36336-8_67"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1080\/09585176.2016.1232201"},{"key":"ref26","first-page":"1","article-title":"Question difficulty ranking for multiple-choice reading comprehension","volume-title":"Proc. Conf. Empirical Methods Natural Lang. Process. (EMNLP)","author":"Raina"},{"key":"ref27","article-title":"Retrieving and reading: A comprehensive survey on open-domain question answering","author":"Zhu","year":"2021","journal-title":"arXiv:2101.00774"},{"key":"ref28","article-title":"What does BERT learn from multiple-choice reading comprehension datasets?","author":"Si","year":"2019","journal-title":"arXiv:1910.12391"},{"key":"ref29","article-title":"CodeSearchNet challenge: Evaluating the state of semantic code search","author":"Husain","year":"2019","journal-title":"arXiv:1909.09436"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P16-1195"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10139"},{"key":"ref32","article-title":"Estimating difficulty levels of programming problems with pre-trained model","author":"Wang","year":"2024","journal-title":"arXiv:2406.08828"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3511886"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/cae.22679"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2025.3606125"},{"key":"ref36","article-title":"Toward trustworthy difficulty assessments: Large language models as judges in programming and synthetic tasks","author":"Tabib","year":"2025","journal-title":"arXiv:2511.18597"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.24251\/HICSS.2019.924"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3158670"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1080\/08957340701301272"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2025.acl-long.1154"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.3102\/0034654317726529"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.4324\/9780203052211-12"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1186\/s41039-018-0082-z"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.3115\/1705415.1705422"},{"key":"ref45","article-title":"Devign: Effective vulnerability identification by learning comprehensive program semantics via graph neural networks","author":"Zhou","year":"2019","journal-title":"arXiv:1909.03496"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.naacl-main.45"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2023.103297"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/n19-1240"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-022-2336-6"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-98459-4_3"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-41226-4_2"},{"key":"ref52","article-title":"Evaluating large language models trained on code","author":"Chen","year":"2021","journal-title":"arXiv:2107.03374"},{"key":"ref53","article-title":"Program synthesis with large language models","author":"Austin","year":"2021","journal-title":"arXiv:2108.07732"},{"key":"ref54","first-page":"1","article-title":"Measuring coding challenge competence with APPS","volume-title":"Proc. Neural Inf. Process. Syst. Track Datasets Benchmarks (NeurIPS)","author":"Hendrycks"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1126\/science.abq1158"},{"key":"ref56","article-title":"TACO: Topics in algorithmic code generation dataset","author":"Li","year":"2023","journal-title":"arXiv:2312.14852"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.findings-emnlp.223"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.naacl-main.148"},{"key":"ref59","article-title":"Multiple-choice questions are efficient and robust LLM evaluators","author":"Zhang","year":"2024","journal-title":"arXiv:2405.11966"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1177\/001316446002000104"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1810.04805"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.emnlp-main.685"},{"key":"ref63","volume-title":"Probabilistic Models for Some Intelligence and Attainment Tests","author":"Rasch","year":"1960"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.7899\/JCE-18-22"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1090\/cbms\/129\/05"},{"key":"ref66","article-title":"A structured self-attentive sentence embedding","author":"Lin","year":"2017","journal-title":"arXiv:1703.03130"},{"key":"ref67","article-title":"VisualBERT: A simple and performant baseline for vision and language","author":"Li","year":"2019","journal-title":"arXiv:1908.03557"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i07.6795"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/n16-1174"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1609.02907"},{"key":"ref71","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017","journal-title":"arXiv:1710.10903"},{"key":"ref72","first-page":"1","article-title":"Diffusion improves graph learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Gasteiger"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313562"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1007\/BF00994018"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"ref78","first-page":"1","article-title":"Graph neural networks exponentially lose expressive power for node classification","volume-title":"Proc. 8th Int. Conf. Learn. Represent.","author":"Oono"},{"key":"ref79","first-page":"8026","article-title":"PyTorch: An imperative style, high-performance deep learning library","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","volume":"32","author":"Paszke"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-demos.6"},{"key":"ref81","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014","journal-title":"arXiv:1412.6980"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/11323511\/11421337.pdf?arnumber=11421337","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T19:38:46Z","timestamp":1773257926000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11421337\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":81,"URL":"https:\/\/doi.org\/10.1109\/access.2026.3670106","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}