Mental health courts, premised on the notion of therapeutic justice, have become an increasingly appealing way of dealing with what is widely, although not uniformly, seen as the inappropriate incarceration of people who engage in criminal behavior caused by mental illness. Nevertheless, mental health courts are not without their critics and a number of objections have been raised against the implementation of these courts. Among these criticisms is that mental health courts may inappropriately privilege criminal behavior by the provision of (...) expedited comprehensive services to persons with mental illness who commit criminal of enses and, in doing so, reduce or delay the provision of services to persons with mental illness who do not engage in criminal behavior. This article explores the mechanisms that may result in “queue-jumping” and analyzes whether a priority to of enders, when it does occur, is justii able. (shrink)

In [2], Jockusch and Shore have introduced a new hierarchy of sets and operators called the REA hierarchy. In this note we prove analogues of the Friedberg Jump Theorem and the Sacks Jump Theorem for many REA operators. MSC: 03D25, 03D55.

. We prove a jump inversion theorem for the enumeration jump and a minimal pair type theorem for the enumeration reducibilty. As an application some results of Selman, Case and Ash are obtained.

In lieu of an abstract, here is a brief excerpt of the content:Feminist Studies 46, no. 1. © 2020 by Abby Minor 103 JUMP ROPE CHANT: A CURE FOR ALL KINDS OF STOMACH ACHES, ca. 2000 BCE–ca. 2000 CE Abby Minor Happy are those who stand in a field at night and hear the double rainbows land, or clap the gaps that RHYTHM makes, or shout to the beat of grasses; They are like trees planted by streams of water, which (...) yield their fruit in its season, & their leaps & their leaves & their feet do not wither, they leap up in the morning singing, in all that they do they chant, and jump, and are singing: “Blood root, hair pin, lupine, clover, watermints and cinnamon, a pencil, myrrh, poplar, juniper, copper water, whiskey, cotton root, snake root, savin, wire,  Clap your hands, all you peoples. —Psalm 47.1 104 Abby Minor wallflower, gunpowder, emeralds, myrtle, tonic of geranium, lace seeds, soap, bone stay, coltsfoot, catheters, quinine, a hoop bound with oil-silk, a hat pin, oak—” I chant a long time I chant from within a hollow place I chant all colors of cohosh Instantly as dawn clips green & white, I chant to dissolve separate parts I jump backwards and I chant So that you may bathe your feet in blood, it was in the Psalms, it’s what God does it might be a rain dance it will come to you like a beautiful cigar filled with fine leaves like the fine feet of a deer cleft in gold leaves Like rhythm a hair pin, rhythm a hat pin, rhythm a knitting hook, rhythm a nail RHYTHM makes my feet like the feet of a deer. I chant rosemary so assiduous I chant pennyroyal forever most poisonous I chant intransigence and double rainbows pop on the sidewalks of the cosmos, double Abby Minor 105 Dutch ropes spin like twin rivers, there I am planted like a tree by the water, like an outrider dropping fire into the ropes: I will kick up my heels seven times there will be a noise and the seed will fall out on the ground shouting, “Date palms, dancing, anise, trillium, turpentine, scissors, silphium, rum, cundums, pomegranate, pearlash, iron, foot baths, borax, birthwort, rue, wormwood, fern root, fig leaf, sneezing, a small ball of sheep’s wool, smart weed, brass, blackberries, goldbeaters, button hooks, hawthorn, womb veil, vinegar, saffron, glass—” If you try our hearts, RHYTHM, if you visit us by night; if I forget which is my left hand and which is your right— just let it be me; psalmist, you, a trace of blood. Me, muscle, 106 Abby Minor you, myrrh. Or you jumping, me rope. Me mirrorstep, you leave your dark prints on the light. Me ambush, you flood. Me bloodthirsty, you a smaller blood. You bloodthirsty, me myrrh. Me fortress, you a tent for the sun. Me splendor, you go on and on. Me hat pin, me flood. You poetry, me a clapping tree, or me poetry and you nothing at all. I say to RHYTHM, “You are my Rhythm, I have no song apart from you and I could never tell just where the sole leaves the sidewalk and turns into the smallest lit pause popped, suspended above shoe shadow; I could never say whether I’m the jumper picking up her knees or the turner planted so still save for her hands— and what pilots her hands, pilot, if not you, if not her hands? If not the offbeat, the bows of light we pattern, Rhythm which is both the rivet and what’s held: like rhythm a hair pin, rhythm a hat pin, rhythm a knitting hook, rhythm a nail Abby Minor 107 RHYTHM makes my feet like the feet of a deer. Now I chant the bitter melon fruit who lights up darkness and my feet do not grow weary writing RHYTHM on the sidewalk lighting incense in the bathtub filled with gin in which I lay chanting like the singers in front, like the musicians last, like the girls between them playing tambourines: Rhythm make a riot Rhythm eat a bee Rhythm use a chicken feather & make a joyful noise Praise Rhythm with mint & astringents with spearmints & syringes with pipes, pen handles, mercury... (shrink)

We introduce a new family of jump operators on Borel equivalence relations; specifically, for each countable group [Formula: see text] we introduce the [Formula: see text]-jump. We study the elementary properties of the [Formula: see text]-jumps and compare them with other previously studied jump operators. One of our main results is to establish that for many groups [Formula: see text], the [Formula: see text]-jump is proper in the sense that for any Borel equivalence relation [Formula: see text] the [Formula: see (...) text]-jump of [Formula: see text] is strictly higher than [Formula: see text] in the Borel reducibility hierarchy. On the other hand, there are examples of groups [Formula: see text] for which the [Formula: see text]-jump is not proper. To establish properness, we produce an analysis of Borel equivalence relations induced by continuous actions of the automorphism group of what we denote the full [Formula: see text]-tree, and relate these to iterates of the [Formula: see text]-jump. We also produce several new examples of equivalence relations that arise from applying the [Formula: see text]-jump to classically studied equivalence relations and derive generic ergodicity results related to these. We apply our results to show that the complexity of the isomorphism problem for countable scattered linear orders properly increases with the rank. (shrink)

We consider the set of jumps below a Turing degree, given by JB={x':x≤a}, with a focus on the problem: Which recursively enumerable degrees a are uniquely determined by JB? Initially, this is motivated as a strategy to solve the rigidity problem for the partial order R of r.e. degrees. Namely, we show that if every high2 r.e. degree a is determined by JB, then R cannot have a nontrivial automorphism. We then defeat the strategy—at least in the form presented—by constructing (...) pairs a0, a1 of distinct r.e. degrees such that JB=JB within any possible jump class {x:x'=c}. We give some extensions of the construction and suggest ways to salvage the attack on rigidity. (shrink)

One of the main problems in effective model theory is to find an appropriate information complexity measure of the algebraic structures in the sense of computability. Unlike the commonly used degrees of structures, the structure degree measure is total. We introduce and study the jump operation for structure degrees. We prove that it has all natural jump properties (including jump inversion theorem, theorem of Ash), which show that our definition is relevant. We study the relation between the structure degree jump (...) (in the sense of Soskov) and the jump degrees of a structure (in the sense of Jockusch) and give necessary and sufficient conditions for their existence in the terms of structure degrees. We show some properties, distinguishing the structure degrees from the enumeration degrees. (shrink)

We study inversions of the jump operator on ${\mathrm{\Pi }}_{1}^{0}$ classes, combined with certain basis theorems. These jump inversions have implications for the study of the jump operator on the random degrees—for various notions of randomness. For example, we characterize the jumps of the weakly 2-random sets which are not 2-random, and the jumps of the weakly 1-random relative to 0′ sets which are not 2-random. Both of the classes coincide with the degrees above 0′ which are not 0′-dominated. A (...) further application is the complete solution of [24, Problem 3.6.9]: one direction of van Lambalgen's theorem holds for weak 2-randomness, while the other fails. Finally we discuss various techniques for coding information into incomplete randoms. Using these techniques we give a negative answer to [24, Problem 8.2.14]: not all weakly 2-random sets are array computable. In fact, given any oracle X, there is a weakly 2-random which is not array computable relative to X. This contrasts with the fact that all 2-random sets are array computable. (shrink)

A queue‐jumping argument concludes that some course of action is impermissible by likening it to the presumptively impermissible act of jumping a queue. Arguments of this sort may be found in a disparate range of contexts and in support of policies favoured by both left and right. Examples include arguments against private education and private health care but also arguments against accommodations for learning disabilities, refugee resettlement, and birthright citizenship. We infer that, although queue‐jumping arguments are strictly (...) analogies, they constitute a sufficiently distinct class of arguments to justify their separate treatment. The paper proposes an argumentation scheme for queue‐jumping arguments and demonstrates its applicability to some existing arguments of this type. (shrink)

We show, for each computable ordinal α and degree $\alpha > {0^{\left( \alpha \right)}}$, the existence of a torsion-free abelian group with proper α th jump degree α.

In this paper we show that there are various pseudo-jump operators definable over inadmissible $J_{\beta}$ that relate to the failure of admissiblity and to non-regularity. We will use these ideas to construct some intermediate degrees.

This paper uses the 5-five-minute high-frequency data of energy-listed companies in China's A-share market to extract the jump of energy stock prices and build a dynamic stock price jump complex network. Then, we analyze the clustering effect of the complex network. The research shows that the energy stock price jump is an important part of stock price volatility, and the complex network of energy stock jump risk has obvious time-varying characteristics. However, the infection problem of stock price jump risks needs (...) specific analysis. China's coal industry has an important influence on the development of China's energy industry. According to the clustering analysis results of the network community, the clustering effect of the network community has time-varying characteristics. After October 2017, the clustering effect of the jumping risk of the coal industry and the new energy industry is obvious. The risk contagion within the new energy industry community is a key point for the development of the new energy industry. (shrink)

The apparent dichotomy between quantum jumps on the one hand, and continuous time evolution according to wave equations on the other hand, provided a challenge to Bohr’s proposal of quantum jumps in atoms. Furthermore, Schrödinger’s time-dependent equation also seemed to require a modification of the explanation for the origin of line spectra due to the apparent possibility of superpositions of energy eigenstates for different energy levels. Indeed, Schrödinger himself proposed a quantum beat mechanism for the generation of discrete line spectra (...) from superpositions of eigenstates with different energies. However, these issues between old quantum theory and Schrödinger’s wave mechanics were correctly resolved only after the development and full implementation of photon quantization. The second quantized scattering matrix formalism reconciles quantum jumps with continuous time evolution through the identification of quantum jumps with transitions between different sectors of Fock space. The continuous evolution of quantum states is then recognized as a sum over continually evolving jump amplitudes between different sectors in Fock space. In today’s terminology, this suggests that linear combinations of scattering matrix elements are epistemic sums over ontic states. Insights from the resolution of the dichotomy between quantum jumps and continuous time evolution therefore hold important lessons for modern research both on interpretations of quantum mechanics and on the foundations of quantum computing. They demonstrate that discussions of interpretations of quantum theory necessarily need to take into account field quantization. They also demonstrate the limitations of the role of wave equations in quantum theory, and caution us that superpositions of quantum states for the formation of qubits may be more limited than usually expected. (shrink)

This paper continues the investigation into the relationship between good approximations and jump inversion initiated by Griffith. Firstly it is shown that there is a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Pi^{0}_{2}}$$\end{document} set A whose enumeration degree a is bad—i.e. such that no set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${X \in a}$$\end{document} is good approximable—and whose complement \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\overline{A}}$$\end{document} has lowest possible jump, in other words (...) is low2. This also ensures that the degrees y ≤ a only contain \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta^{0}_{3}}$$\end{document} sets and thus yields a tight lower bound for the complexity of both a set of bad enumeration degree, and of its complement, in terms of the high/low jump hierarchy. Extending the author’s previous characterisation of the double jump of good approximable sets, the triple jump of a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Sigma^{0}_{2}}$$\end{document} set A is characterised in terms of the index set of coinfinite sets enumeration reducible to A. The paper concludes by using Griffith’s jump interpolation technique to show that there exists a high quasiminimal \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta^{0}_{2}}$$\end{document} enumeration degree. (shrink)

We review the current knowledge concerning strong jump-traceability. We cover the known results relating strong jump-traceability to randomness, and those relating it to degree theory. We also discuss the techniques used in working with strongly jump-traceable sets. We end with a section of open questions.

The main stream of legal theory tends to incorporate unwritten principles into the law. Weighing of principles plays a great role in legal argumentation, inter alia in statutory interpretation. A weighing and balancing of principles and other prima facie reasons is a jump. The inference is not conclusive.To deal with defeasibility and weighing, a jurist needs both the belief-revision logic and the nonmonotonic logic. The systems of nonmonotonic logic included in the present volume provide logical tools enabling one to speak (...) precisely about various kinds of rules about rules, dealing with such things as applicability of rules, what is assumed by rules, priority between rules and the burden of proof. Nonmonotonic logic is an example of an extension of the domain of logic. But the more far-reaching the extension is, the greater problems it meets. It seems impossible to make logical reconstruction of the totality of legal argumentation. (shrink)

People who score high in the jumping to conclusions bias (JTC) require relatively little evidence to reach highly confident conclusions. However, they often feel as though they have done ample research in informing their decisions. What factors could account for this discrepancy? The current research examines one potential factor: how individuals (with varying degrees of the JTC bias) generate hypotheses to explain uncertain events prior to searching for evidence. Study 1 demonstrated that high JTC participants generated fewer hypotheses but (...) were more confident that one was right (compared to low JTC participants). Study 2 showed that, when given the choice between generating alternative hypotheses and supporting initial hypotheses, individuals high in JTC chose to support their initial hypotheses more often. Thus, while the JTC bias is associated with limited hypothesising for unexplained events, it also corresponds with “doubling down” and investing research efforts in confirming initial hunches. (shrink)

The jump operator on the ω-enumeration degrees was introduced in [I.N. Soskov, The ω-enumeration degrees, J. Logic Computat. 17 1193–1214]. In the present paper we prove a jump inversion theorem which allows us to show that the enumeration degrees are first order definable in the structure of the ω-enumeration degrees augmented by the jump operator. Further on we show that the groups of the automorphisms of and of the enumeration degrees are isomorphic. In the second part of the paper we (...) study the jumps of the ω-enumeration degrees below . We define the ideal of the almost zero degrees and obtain a natural characterization of the class H of the ω-enumeration degrees below which are high n for some n and of the class L of the ω-enumeration degrees below which are low n for some n. (shrink)

We define the bounded jump of $A$ by $A^{b}=\{x\in \omega \mid \exists i\leq x[\varphi_{i}\downarrow \wedge\Phi_{x}^{A\upharpoonright \!\!\!\upharpoonright \varphi_{i}}\downarrow ]\}$ and let $A^{nb}$ denote the $n$th bounded jump. We demonstrate several properties of the bounded jump, including the fact that it is strictly increasing and order-preserving on the bounded Turing degrees. We show that the bounded jump is related to the Ershov hierarchy. Indeed, for $n\geq2$ we have $X\leq_{bT}\emptyset ^{nb}\iff X$ is $\omega^{n}$-c.e. $\iff X\leq_{1}\emptyset ^{nb}$, extending the classical result that $X\leq_{bT}\emptyset '\iff (...) X$ is $\omega$-c.e. Finally, we prove that the analogue of Shoenfield inversion holds for the bounded jump on the bounded Turing degrees. That is, for every $X$ such that $\emptyset ^{b}\leq_{bT}X\leq_{bT}\emptyset ^{2b}$, there is a $Y\leq_{bT}\emptyset ^{b}$ such that $Y^{b}\equiv_{bT}X$. (shrink)

Five errors that fit under the category of jumping to a conclusion are identified: (1) arguing from premises that are insufficient as evidence to prove a conclusion (2) fallacious argument from ignorance, (3) arguing to a wrong conclusion, (4) using defeasible reasoning without being open to exceptions, and (5) overlooking/suppressing evidence. It is shown that jumping to a conclusion is best seen not as a fallacy itself, but as a more general category of faulty argumentation pattern underlying these (...) errors and some related fallacies. (shrink)

Where $\underline{a}$ is a Turing degree and ξ is an ordinal $ , the result of performing ξ jumps on $\underline{a},\underline{a}^{(\xi)}$ , is defined set-theoretically, using Jensen's fine-structure results. This operation appears to be the natural extension through $(\aleph_1)^{L^\underline{a}}$ of the ordinary jump operations. We describe this operation in more degree-theoretic terms, examine how much of it could be defined in degree-theoretic terms and compare it to the single jump operation.

Part of the draw of athletics is its straightforwardness. There are nuances to competitions to make them more sporting contests, but at the end of a long jump competition whomever records the longest jump should win. Unfortunately, a recent rule-change at the highest level of the sport – the “Final 3” format – undermined this simplicity for the horizontal jumps and the throws for some of the 2020 and much of the 2021 seasons. While fortunately this rule was largely reverted (...) within days of the initial submission of this paper, it’s still valuable to critically evaluate why such a rule is problematic so as to better understand of the value of sporting competitions and give guidance on future rule changes, be they in athletics or other sports. To that end, we will be drawing from the literature on the purpose and value of competitions and coupling that with simulations based on data from actual top-tier long jump competitions to show that the Final 3 format makes for significantly worse competitions than the standard format. (shrink)

Short Stories and Political Philosophy: Power, Prose, and Persuasion explores the relationship between fictional short stories and the classic works of political philosophy. This edited volume addresses the innovative ways that short stories grapple with the same complex political and moral questions, concerns, and problems studied in the fields of political philosophy and ethics. The volume is designed to highlight the ways in which short stories may be used as an access point for the challenging works of political philosophy encountered (...) in higher education. Each chapter analyzes a single story through the lens of thinkers ranging from Plato and Aristotle to Max Weber and Hannah Arendt. The contributors to this volume do not adhere to a single theme or intellectual tradition. Rather, this volume is a celebration of the intellectual and literary diversity available to students and teachers of political philosophy. It is a resource for scholars as well as educators who seek to incorporate short stories into their teaching practice. (shrink)

We study the following classes: Q* (r 1 A 1 ,..., r kA k ) which is defined to be the collection of all sets that can be computed by a Turing machine that on any input makes a total of r i queries to A i for all i ∈ {1,..., k}. Q(r 1A 1 ,...,r kA k ) which is defined like Q* (r 1A 1 ,..., r kA k ) except that queries to A i must be (...) made before queries to A i+1 for all i ∈ {1,..., k - 1}. QC(r 1A 1 ,..., r kA k ) which is defined like Q(r 1A 1 ,..., r kA k ) except that the Turing machine must halt even if given incorrect answers to some of its queries. We show that if A 1 ,..., A k are jumps that are not too close together, then all three of these classes are identical and are not changed if we permute (r 1A 1 ,..., r kA k ). This extends a result of Beigel's [1]. Since the second class is not affected by permutations, we say that these sets commute with each other. We also show that jumps that are too close together may not commute. We also characterize the commutative sequences of sets obtained by iterating the jump operation through an ordinal notation. (shrink)

A relativized version of Tarski's T-scheme is introduced as a new principle of the truth predicate. Under the relativized T-scheme, the paradoxical objects, such as the Liar sentence and Jourdain's card sequence, are found to have certain relative contradictoriness. That is, they are contradictory only in some frames in the sense that any valuation admissible for them in these frames will lead to a contradiction. It is proved that for any positive integer n, the n-jump liar sentence is contradictory in (...) and only in those frames containing at least an n-jump odd cycle. In particular, the Liar sentence is contradictory in and only in those frames containing at least an odd cycle. The Liar sentence is also proved to be less contradictory than Jourdain's card sequence: the latter must be contradictory in those frames where the former is so, but not vice versa. Generally, the relative contradictoriness is the common characteristic of the paradoxical objects, but different paradoxical objects may have different relative contradictoriness. (shrink)

It is well known that the structure of honest elementary degrees is a lattice with rather strong density properties. Let $\mbox{\bf a} \cup \mbox{\bf b}$ and $\mbox{\bf a} \cap \mbox{\bf b}$ denote respectively the join and the meet of the degrees $\mbox{\bf a}$ and $\mbox{\bf b}$ . This paper introduces a jump operator ( $\cdot'$ ) on the honest elementary degrees and defines canonical degrees $\mbox{\bf 0},\mbox{\bf 0}', \mbox{\bf 0}^{\prime \prime },\ldots$ and low and high degrees analogous to the corresponding (...) concepts for the Turing degrees. Among others, the following results about the structure of the honest elementary degrees are shown: There exist low degrees, and there exist degrees which are neither low nor high. Every degree above $\mbox{\bf 0}'$ is the jump of some degree, moreover, for every degree $\mbox{\bf c}$ above $\mbox{\bf 0}'$ there exist degrees $\mbox{\bf a},\mbox{\bf b}$ such that $\mbox{\bf c}=\mbox{\bf a} \cup \mbox{\bf b} = \mbox{{\bf a}}'=\mbox{\bf b}'$ . We have $\mbox{\bf a}'\cup \mbox{\bf b}' \leq (\mbox{\bf a}\cup\mbox{\bf b})'$ and $\mbox{\bf a}'\cap \mbox{\bf b}' \geq (\mbox{\bf a}\cap \mbox{\bf b})'$ . The jump operator is of course monotonic, i.e. $\mbox{\bf a}\leq\mbox{{\bf b}}\Rightarrow \mbox{\bf a}'\leq \mbox{\bf b}'$ . We prove that every situation compatible with $\mbox{\bf a}\leq\mbox{\bf b}\Rightarrow \mbox{\bf a}'\leq \mbox{\bf b}'$ is realized in the structure, e.g. we have incomparable degrees $\mbox{\bf a},\mbox{\bf b}$ such that $\mbox{\bf a}'<\mbox{\bf b}'$ and incomparable degrees $\mbox{\bf a},\mbox{\bf b}$ such that $\mbox{\bf a}' = \mbox{\bf b}'$ etcetera. We are able to prove all these results without the traditional recursion theoretic constructions. Our proof method relies on the fact that the growth of the functions in a degree is bounded. This technique also yields a very simple proof of an old result, namely that the structure is a lattice. (shrink)

It is proved that for every countable structure and a computable successor ordinal α there is a countable structure which is ‐least among all countable structures such that is Σ‐definable in the αth jump. We also show that this result does not hold for the limit ordinal. Moreover, we prove that there is no countable structure with the degree spectrum for.

Sociobiology is a grand narrative of evolutionary biology on which to build unified knowledge. Consilience is a metaphorical representation of that narrative. I take up the same metaphor but apply it differently. I evoke the image of jumping together, not on solid ground but on the strong, flexible canvas sheet of a trampoline, on which natural sciences, social sciences, and the humanities jump together. This image overlaps with the traditional East Asian way of understanding—that is, the “Heaven-Earth-Person Triad.” Using (...) recent insights from cognitive science—metaphor, embodiment, and conceptual blending—I propose the alternative way of “bio-socio-humanities” to understand and experience the world. (shrink)

For most people in the world of cinema, ‘film’ still means ‘feature-length narrative film’, while so-called ‘shorts’ fill another, neglected, undervalued category. However, there appear to be more short films around than ever before – more opportunities to make and also to show them, thanks particularly to digital technology. This article takes the usual reductive characterizations of short audio-visual work – as being, variously, a training ground for future ‘professionals’, a free space where young people can indulge in anarchy for (...) a little while before growing up, or as a calling card for the film industry – and interrogates them in the context of a rapidly changing and evolving media culture. (shrink)

The catalogue raisonné compiled by art scholars holds information about an artist’s work such as a painting’s image, medium, provenance, and title. The catalogue raisonné as a tangible asset suffers from the challenges of art authentication and impermanence. As the catalogue raisonné is born digital, the impermanence challenge abates, but the authentication challenge persists. With the popularity of artificial intelligence and its deep learning architectures of computer vision, we propose to address the authentication challenge by creating a new artefact for (...) the digital catalogue raisonné: a digital classification model. This digital classification model will help art scholars with new artwork claims via a tool that authenticates a proposed artwork with an artist. We create this tool by training a machine learning model with 90 artists having at least 150 artworks and achieve an accuracy of 87.31%. We use the ResNet Convolutional Neural Network to improve accuracy and number of artist classes over state-of-the-art artist classification experiments using the WikiArt database. We address inconsistencies in the way scholars approach artist classification by providing a consistent method to recreate our dataset and providing a consistent method to calculate performance metrics based on imbalanced data. (shrink)