<?xml version="1.0" encoding="UTF-8"?>
<resource xmlns="http://datacite.org/schema/kernel-4" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.5/metadata.xsd">
  <identifier identifierType="DOI">10.60507/FK2/LYIDHI</identifier>
  <creators>
    <creator>
      <creatorName nameType="Personal">Swierzy, Ben</creatorName>
      <givenName>Ben</givenName>
      <familyName>Swierzy</familyName>
      <nameIdentifier nameIdentifierScheme="ORCID" schemeURI="https://orcid.org">https://orcid.org/0009-0003-0485-4791</nameIdentifier>
      <affiliation>University of Bonn</affiliation>
    </creator>
  </creators>
  <titles>
    <title>dolospy</title>
    <title titleType="Subtitle">Efficient implementation of the core algorithm for the plagiarism detection tool "Dolos"</title>
  </titles>
  <publisher>bonndata</publisher>
  <publicationYear>2026</publicationYear>
  <subjects>
    <subject>Computer and Information Science</subject>
  </subjects>
  <contributors>
    <contributor contributorType="ContactPerson">
      <contributorName nameType="Personal">Swierzy, Ben</contributorName>
      <givenName>Ben</givenName>
      <familyName>Swierzy</familyName>
      <affiliation>University of Bonn</affiliation>
    </contributor>
  </contributors>
  <dates>
    <date dateType="Submitted">2026-01-14</date>
    <date dateType="Available">2026-01-22</date>
  </dates>
  <resourceType resourceTypeGeneral="Dataset">program source code</resourceType>
  <relatedIdentifiers>
    <relatedIdentifier relationType="IsSupplementTo" relatedIdentifierType="DOI">10.1145/3744916.3787780</relatedIdentifier>
    <relatedIdentifier relationType="IsSupplementTo" relatedIdentifierType="DOI">10.48550/ARXIV.2512.15447</relatedIdentifier>
    <relatedIdentifier relationType="HasPart" relatedIdentifierType="DOI">10.60507/FK2/LYIDHI/DIGDMT</relatedIdentifier>
    <relatedIdentifier relationType="HasPart" relatedIdentifierType="DOI">10.60507/FK2/LYIDHI/ALARYK</relatedIdentifier>
    <relatedIdentifier relationType="HasPart" relatedIdentifierType="DOI">10.60507/FK2/LYIDHI/BWOEG3</relatedIdentifier>
    <relatedIdentifier relationType="HasPart" relatedIdentifierType="DOI">10.60507/FK2/LYIDHI/HJZHQG</relatedIdentifier>
    <relatedIdentifier relationType="HasPart" relatedIdentifierType="DOI">10.60507/FK2/LYIDHI/HNMKX6</relatedIdentifier>
    <relatedIdentifier relationType="HasPart" relatedIdentifierType="DOI">10.60507/FK2/LYIDHI/9GATIX</relatedIdentifier>
    <relatedIdentifier relationType="HasPart" relatedIdentifierType="DOI">10.60507/FK2/LYIDHI/X8KFUS</relatedIdentifier>
    <relatedIdentifier relationType="HasPart" relatedIdentifierType="DOI">10.60507/FK2/LYIDHI/ENYEV5</relatedIdentifier>
    <relatedIdentifier relationType="HasPart" relatedIdentifierType="DOI">10.60507/FK2/LYIDHI/1VBFYT</relatedIdentifier>
    <relatedIdentifier relationType="HasPart" relatedIdentifierType="DOI">10.60507/FK2/LYIDHI/4QYSRZ</relatedIdentifier>
    <relatedIdentifier relationType="HasPart" relatedIdentifierType="DOI">10.60507/FK2/LYIDHI/XR2VMI</relatedIdentifier>
    <relatedIdentifier relationType="HasPart" relatedIdentifierType="DOI">10.60507/FK2/LYIDHI/T2G23Q</relatedIdentifier>
    <relatedIdentifier relationType="HasPart" relatedIdentifierType="DOI">10.60507/FK2/LYIDHI/BFDFEV</relatedIdentifier>
    <relatedIdentifier relationType="HasPart" relatedIdentifierType="DOI">10.60507/FK2/LYIDHI/FOBHLP</relatedIdentifier>
    <relatedIdentifier relationType="HasPart" relatedIdentifierType="DOI">10.60507/FK2/LYIDHI/0LZH5S</relatedIdentifier>
    <relatedIdentifier relationType="HasPart" relatedIdentifierType="DOI">10.60507/FK2/LYIDHI/HHTU77</relatedIdentifier>
    <relatedIdentifier relationType="HasPart" relatedIdentifierType="DOI">10.60507/FK2/LYIDHI/ILENOC</relatedIdentifier>
    <relatedIdentifier relationType="HasPart" relatedIdentifierType="DOI">10.60507/FK2/LYIDHI/PCJQKT</relatedIdentifier>
  </relatedIdentifiers>
  <sizes>
    <size>4925</size>
    <size>2693</size>
    <size>222</size>
    <size>4032</size>
    <size>289</size>
    <size>1175</size>
    <size>23</size>
    <size>245</size>
    <size>1371</size>
    <size>427</size>
    <size>530</size>
    <size>2434</size>
    <size>1128</size>
    <size>1802</size>
    <size>771</size>
    <size>203</size>
    <size>2706</size>
    <size>2003</size>
  </sizes>
  <formats>
    <format>text/x-c++src</format>
    <format>text/x-chdr</format>
    <format>text/x-chdr</format>
    <format>text/x-python</format>
    <format>application/toml</format>
    <format>text/x-c++src</format>
    <format>text/x-python</format>
    <format>text/x-chdr</format>
    <format>text/x-c++src</format>
    <format>text/x-c++src</format>
    <format>text/plain</format>
    <format>text/x-c++src</format>
    <format>text/x-chdr</format>
    <format>text/x-c++src</format>
    <format>text/x-python3</format>
    <format>text/markdown</format>
    <format>text/plain</format>
    <format>text/markdown</format>
  </formats>
  <version>1.0</version>
  <rightsList>
    <rights rightsURI="info:eu-repo/semantics/openAccess"/>
    <rights rightsURI="https://mit-license.org/" xml:lang="en">The MIT License</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">This repository contains a re-implementation of the rolling AST hash algorithm from Dolos (https://dolos.ugent.be/) in C++ with Python bindings. It is 8x faster for indexing and 10,000x faster in reporting compared to the original JavaScript implementation (cf. BENCHMARKING.md).</description>
  </descriptions>
</resource>
