{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T10:03:28Z","timestamp":1777025008608,"version":"3.51.4"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031126697","type":"print"},{"value":"9783031126703","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-12670-3_5","type":"book-chapter","created":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T15:07:54Z","timestamp":1658761674000},"page":"53-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Fast NDFA-Based Approach to\u00a0Approximate Pattern-Matching for\u00a0Plagiarism Detection in\u00a0Blockchain-Driven NFTs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2969-3969","authenticated-orcid":false,"given":"Darius","family":"Gali\u0219","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8732-1645","authenticated-orcid":false,"given":"Ciprian","family":"Pungil\u0103","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7133-572X","authenticated-orcid":false,"given":"Viorel","family":"Negru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,26]]},"reference":[{"key":"5_CR1","unstructured":"Howcroft, E.: Reuters. NFT sales hit \\$25 billion in 2021, but growth shows signs of slowing. https:\/\/www.reuters.com\/markets\/europe\/nft-sales-hit-25-billion-2021-growth-shows-signs-slowing-2022-01-10\/. Accessed 2 Apr 2022"},{"key":"5_CR2","unstructured":"Pungila, C., Galis, D., Negru, V.: A New High-Performance Approach to Approximate Pattern-Matching for Plagiarism Detection in Blockchain-Based Non-Fungible Tokens (NFTs) (2022). https:\/\/arxiv.org\/abs\/2205.14492"},{"key":"5_CR3","unstructured":"Anzelmi, D., Carlone, D., Rizzello, F., Thomsen, R., Hussain, D.M.A.: Plagiarism detection based on SCAM algorithm. In: Proceedings of the International MultiConference on Engineers and Computer Scientists 2011, vol. I, pp. 272\u2013277. Newswood Limited, International Association of Engineers, IAENG (2011)"},{"key":"5_CR4","unstructured":"AL-Jibory, F.K., Al-Tamimi, M.S.H.: Hybrid system for plagiarism detection on a scientific paper. Turk. J. Comput. Math. Educ. 12(13), 5707\u20135719 (2021)"},{"issue":"3","key":"5_CR5","first-page":"8","volume":"134","author":"A Saini","year":"2016","unstructured":"Saini, A., Kumari, S., Bahl, A., Singh, M.: Plagiarism checker: text mining. Int. J. Comput. Appl. 134(3), 8\u201311 (2016)","journal-title":"Int. J. Comput. Appl."},{"issue":"8","key":"5_CR6","doi-asserted-by":"publisher","first-page":"196","DOI":"10.23883\/IJRTER.2017.3404.4SNDK","volume":"3","author":"RE Putri","year":"2017","unstructured":"Putri, R.E., Putera, A., Siahaan, U.: Examination of document similarity using Rabin-Karp algorithm. Int. J. Recent Trends Eng. Res. 3(8), 196\u2013201 (2017). https:\/\/doi.org\/10.23883\/IJRTER.2017.3404.4SNDK","journal-title":"Int. J. Recent Trends Eng. Res."},{"issue":"6","key":"5_CR7","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"AV Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18(6), 333\u2013340 (1975). https:\/\/doi.org\/10.1145\/360825.360855","journal-title":"Commun. ACM"},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10579-009-9112-1","volume":"45","author":"P Clough","year":"2011","unstructured":"Clough, P., Stevenson, M.: Developing a corpus of plagiarised short answers. Lang. Resour. Eval. 45(1), 5\u201324 (2011). https:\/\/doi.org\/10.1007\/s10579-009-9112-1","journal-title":"Lang. Resour. Eval."},{"key":"5_CR9","unstructured":"Clough, P., Stevenson, M.: Developing a corpus of plagiarised short answers (2011). https:\/\/s3.amazonaws.com\/video.udacity-data.com\/topher\/2019\/January\/5c4147f9_data\/data.zip. Accessed 2 Apr 2022"},{"key":"5_CR10","unstructured":"The virtuaLedger project. https:\/\/virtualedger.com. Accessed 2 Apr 2022"}],"container-title":["Lecture Notes in Computer Science","Big Data Analytics and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-12670-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:29:10Z","timestamp":1710260950000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-12670-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031126697","9783031126703"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-12670-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"26 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DaWaK","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Big Data Analytics and Knowledge Discovery","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dawak2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dawak2022","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":"57","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":"12","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":"12","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":"21% - 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":"5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}