Explore the vast range of titles available.

Digital Object Identifiers (DOIs) are a key persistent identifier in the publishing landscape to ensure the discoverability and citation of research products. Minting DOIs can be a time-consuming task for repository librarians. This process can be automated since the metadata for DOIs is already in the repository record and DataCite, a DOI minting organization, and Open Repository, a DSpace repository platform, both have application programming interfaces (APIs). Existing software enables bulk DOI minting. However, the institutional repository at UMass Chan Medical School contains a mixture of original materials that need DOIs (dissertations, reports, data, etc.) and previously published materials that already have DOIs such as journal articles. An institutional repository librarian and her librarian colleague with Python experience embarked on a paired programming project to create a script to mint DOIs on demand in DataCite for individual items in the institution’s Open Repository instance. The pair met for one hour each week to develop and test the script using combined skills in institutional repositories, metadata, DOI minting, coding in Python, APIs, and data cleaning. The project was a great learning opportunity for both librarians to improve their Python coding skills. The new script makes the DOI minting process more efficient, enhances metadata in DataCite, and improves accuracy. Future script enhancements such as automatically updating repository metadata with the new DOI are planned after the repository upgrade to DSpace 7.

Scholarly resources, just like any other resources on the web, are subject to reference rot as they frequently disappear or significantly change over time. Digital Object Identifiers (DOIs) are commonplace to persistently identify scholarly resources and have become the de facto standard for citing them. This paper is an extended version of work previously published in the proceedings of the 2020 International Conference on Theory and Practice of Digital Libraries (TPDL). We investigate the notion of persistence of DOIs by conducting a series of experiments to analyze a DOI’s resolution on the web, with this work presenting a set of novel investigations to expand on our previous work. We derive confidence in the persistence of these identifiers in part from the assumption that dereferencing a DOI will consistently return the same response, regardless of which HTTP request method we use or from which network environment we send the requests. Our experiments show, however, that persistence, according to our interpretation, is not warranted. We find that scholarly content providers respond differently to varying request methods and network environments, change their response to requests against the same DOI, and even return inconsistent results over a period of time. We present the results of our quantitative analysis that is aimed at informing the scholarly communication community about this disconcerting lack of consistency.

In 2014, local rice exploration survey identified 76 local rice accessions from Yogyakarta. These local rice collections have been stored in Yogyakarta AIAT cooler facilities. Yogyakarta AIAT has assigned the digital object identifier (DOI) to 55 of its local rice collections. The assignation of DOI will be useful for the local rice collection for their availability for transfer with the Standard Material Transfer Agreement (SMTA) in the Multilateral System (MLS) of Access and Benefit-Sharing (ABS) of the International Treaty on Plant Genetic Resources for Food and Agriculture (ITPGRFA).

We provide a general approach to Lipschitz regularity of solutions for a large class of vector-valued, nonautonomous variational problems exhibiting nonuniform ellipticity. The functionals considered here range from those with unbalanced polynomial growth conditions to those with fast, exponential type growth. The results obtained are sharp with respect to all the data considered and also yield new, optimal regularity criteria in the classical uniformly elliptic case. We give a classification of different types of nonuniform ellipticity, accordingly identifying suitable conditions to get regularity theorems.