{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:38:42Z","timestamp":1742913522504,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031560682"},{"type":"electronic","value":"9783031560699"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-56069-9_42","type":"book-chapter","created":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T08:17:45Z","timestamp":1711095465000},"page":"334-337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Analyzing Mathematical Content for\u00a0Plagiarism and\u00a0Recommendations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3219-026X","authenticated-orcid":false,"given":"Ankit","family":"Satpute","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,23]]},"reference":[{"issue":"2","key":"42_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1109\/TSMCC.2011.2134847","volume":"42","author":"SM Alzahrani","year":"2012","unstructured":"Alzahrani, S.M., Salim, N., Abraham, A.: Understanding plagiarism linguistic patterns, textual features, and detection methods. IEEE Trans. Syst. Man Cybern. Part C Appl. Rev. 42(2), 133\u2013149 (2012). https:\/\/doi.org\/10.1109\/TSMCC.2011.2134847","journal-title":"IEEE Trans. Syst. Man Cybern. Part C Appl. Rev."},{"key":"42_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118034","volume":"207","author":"H Arabi","year":"2022","unstructured":"Arabi, H., Akbari, M.: Improving plagiarism detection in text document using hybrid weighted similarity. Expert Syst. Appl. 207, 118034 (2022)","journal-title":"Expert Syst. Appl."},{"key":"42_CR3","unstructured":"Dadure, P., Pakray, P., Bandyopadhyay, S.: BERT-based embedding model for formula retrieval. In: CLEF (Working Notes), pp. 36\u201346 (2021)"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Diaz, Y., Nishizawa, G., Mansouri, B., Davila, K., Zanibbi, R.: The mathdeck formula editor: interactive formula entry combining latex, structure editing, and search. In: Extended Abstracts of the 2021 CHI Conference on Human Factors in Computing Systems, pp. 1\u20135 (2021)","DOI":"10.1145\/3411763.3451564"},{"issue":"21","key":"42_CR5","doi-asserted-by":"publisher","first-page":"18837","DOI":"10.1007\/s00521-022-07486-w","volume":"34","author":"MA El-Rashidy","year":"2022","unstructured":"El-Rashidy, M.A., Mohamed, R.G., El-Fishawy, N.A., Shouman, M.A.: Reliable plagiarism detection system based on deep learning approaches. Neural Comput. Appl. 34(21), 18837\u201318858 (2022)","journal-title":"Neural Comput. Appl."},{"key":"42_CR6","unstructured":"Fishman, T.: We know it when we see it is not good enough: toward a standard definition of plagiarism that transcends theft, fraud, and copyright (2009)"},{"issue":"6","key":"42_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3345317","volume":"52","author":"T Folt\u00fdnek","year":"2020","unstructured":"Folt\u00fdnek, T., Meuschke, N., Gipp, B.: Academic plagiarism detection: a systematic literature review. ACM Comput. Surv. 52(6), 1\u201342 (2020). https:\/\/doi.org\/10.1145\/3345317","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"42_CR8","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1038\/s41597-022-01908-z","volume":"10","author":"L Gienapp","year":"2023","unstructured":"Gienapp, L., Kircheis, W., Sievers, B., Stein, B., Potthast, M.: A large dataset of scientific text reuse in open-access publications. Sci. Data 10(1), 58 (2023). https:\/\/doi.org\/10.1038\/s41597-022-01908-z","journal-title":"Sci. Data"},{"key":"42_CR9","doi-asserted-by":"publisher","unstructured":"Greiner-Petter, A., Schubotz, M., Breitinger, C., Scharpf, P., Aizawa, A., Gipp, B.: Do the math: making mathematics in Wikipedia computable. IEEE Trans. Pattern Anal. Mach. Intell. 45(4), 4384\u20134395 (2022). https:\/\/doi.org\/10.1109\/TPAMI.2022.3195261","DOI":"10.1109\/TPAMI.2022.3195261"},{"key":"42_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-981-13-8676-3_3","volume-title":"Computational Intelligence in Data Mining: Proceedings of the International Conference on ICCIDM 2018","author":"Lovepreet","year":"2020","unstructured":"Lovepreet, Gupta, V., Kumar, R.: Survey on plagiarism detection systems and their comparison. In: Behera, H.S., Nayak, J., Naik, B., Pelusi, D. (eds.) Computational Intelligence in Data Mining: Proceedings of the International Conference on ICCIDM 2018, pp. 27\u201339. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-13-8676-3_3"},{"key":"42_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-030-99739-7_51","volume-title":"Advances in Information Retrieval","author":"B Mansouri","year":"2022","unstructured":"Mansouri, B., Agarwal, A., Oard, D.W., Zanibbi, R.: Advancing math-aware search: the ARQMath-3 lab at CLEF 2022. In: Hagen, M., et al. (eds.) ECIR 2022. LNCS, vol. 13186, pp. 408\u2013415. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99739-7_51"},{"key":"42_CR12","doi-asserted-by":"publisher","unstructured":"McCabe, D.L.: Cheating among college and university students: a North American perspective. Int. J. Educ. Integrity 1(1) (2005). https:\/\/doi.org\/10.21913\/IJEI.v1i1.14","DOI":"10.21913\/IJEI.v1i1.14"},{"key":"42_CR13","doi-asserted-by":"publisher","unstructured":"Meuschke, N., Schubotz, M., Hamborg, F., Skopal, T., Gipp, B.: Analyzing mathematical content to detect academic plagiarism. In: Proceedings of the International Conference on Information and Knowledge Management (CIKM) (2017). https:\/\/doi.org\/10.1145\/3132847.3133144","DOI":"10.1145\/3132847.3133144"},{"key":"42_CR14","doi-asserted-by":"publisher","unstructured":"Meuschke, N., Stange, V., Schubotz, M., Kramer, M., Gipp, B.: Improving academic plagiarism detection for stem documents by analyzing mathematical content and citations. In: Proceedings of the ACM\/IEEE Joint Conference on Digital Libraries (JCDL) (Jun 2019). https:\/\/doi.org\/10.1109\/JCDL.2019.00026","DOI":"10.1109\/JCDL.2019.00026"},{"key":"42_CR15","doi-asserted-by":"publisher","unstructured":"Potthast, M., Stein, B., Eiselt, A., Barr\u00f3n-Cede\u00f1o, A., Rosso, P.: PAN plagiarism corpus 2011 (PAN-PC-11) (Jun 2011). https:\/\/doi.org\/10.5281\/zenodo.3250095, https:\/\/doi.org\/10.5281\/zenodo.3250095","DOI":"10.5281\/zenodo.3250095"},{"key":"42_CR16","doi-asserted-by":"publisher","unstructured":"Scharpf, P., Mackerracher, I., Schubotz, M., Beel, J., Breitinger, C., Gipp, B.: AnnoMathTex - a formula identifier annotation recommender system for stem documents. In: Proceedings of the 13th ACM Conference on Recommender Systems (RecSys 2019). ACM, Copenhagen, Denmark (Sept 2019). https:\/\/doi.org\/10.1145\/3298689.3347042","DOI":"10.1145\/3298689.3347042"},{"key":"42_CR17","doi-asserted-by":"publisher","unstructured":"Schubotz, M., Teschke, O., Stange, V., Meuschke, N., Gipp, B.: Forms of plagiarism in digital mathematical libraries. In: Intelligent Computer Mathematics - 12th International Conference, CICM 2019, Prague, Czech Republic, July 8\u201312, 2019, Proceedings (2019). https:\/\/doi.org\/10.1007\/978-3-030-23250-4_18","DOI":"10.1007\/978-3-030-23250-4_18"},{"issue":"2","key":"42_CR18","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/1328964.1328976","volume":"41","author":"B Stein","year":"2007","unstructured":"Stein, B., Koppel, M., Stamatatos, E.: Plagiarism analysis, authorship identification, and near-duplicate detection PAN\u201907. ACM SIGIR Forum 41(2), 68\u201371 (2007). https:\/\/doi.org\/10.1145\/1328964.1328976","journal-title":"ACM SIGIR Forum"},{"key":"42_CR19","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-031-16976-2_20","volume-title":"Academic Integrity: Broadening Practices, Technologies, and the Role of Students: Proceedings from the European Conference on Academic Integrity and Plagiarism 2021","author":"D Weber-Wulff","year":"2022","unstructured":"Weber-Wulff, D.: Talking to a wall: the response of German universities to documentations of plagiarism in doctoral theses. In: Bjelobaba, S., Folt\u00fdnek, T., Glendinning, I., Kr\u00e1sni\u010dan, V., Dlabolov\u00e1, D.H. (eds.) Academic Integrity: Broadening Practices, Technologies, and the Role of Students: Proceedings from the European Conference on Academic Integrity and Plagiarism 2021, pp. 363\u2013371. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-16976-2_20"},{"key":"42_CR20","unstructured":"Yu, W., Pang, L., Xu, J., Su, B., Dong, Z., Wen, J.R.: Optimal partial transport based sentence selection for long-form document matching. In: Proceedings of the 29th International Conference on Computational Linguistics, pp. 2363\u20132373 (2022)"},{"key":"42_CR21","unstructured":"Zanibbi, R., Aizawa, A., Kohlhase, M., Ounis, I., Topic, G., Davila, K.: NTCIR-12 MathIR task overview. In: NTCIR (2016)"},{"key":"42_CR22","first-page":"5","volume":"2022","author":"W Zhong","year":"2022","unstructured":"Zhong, W., Xie, Y., Lin, J.: Applying structural and dense semantic matching for the ARQMath lab 2022, CLEF. Proc. Working Notes CLEF 2022, 5\u20138 (2022)","journal-title":"Proc. Working Notes CLEF"},{"key":"42_CR23","doi-asserted-by":"crossref","unstructured":"Zhong, W., Yang, J.H., Lin, J.: Evaluating token-level and passage-level dense retrieval models for math information retrieval. arXiv preprint arXiv:2203.11163 (2022)","DOI":"10.18653\/v1\/2022.findings-emnlp.78"},{"key":"42_CR24","unstructured":"Zhong, W., Zhang, X., Xin, J., Zanibbi, R., Lin, J.: Approach zero and Anserini at the CLEF-2021 ARQMath track: Applying substructure search and BM25 on operator tree path tokens. In: Proceedings CLEF 2021 (CEUR Working Notes) (2021)"}],"container-title":["Lecture Notes in Computer Science","Advances in Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56069-9_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T08:26:54Z","timestamp":1711096014000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56069-9_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031560682","9783031560699"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56069-9_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"23 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECIR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Glasgow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecir2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ecir2024.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"578","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"110","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31 (Tracks: Workshop, Tutorial, Industry, Doctoral Consortium)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}