MétaCan
Menu
Back to cohort
Record W4399763590 · doi:10.16995/dm.15125

Machine Learning and Sigillography: Using Decision Trees to Date British Seal Matrices

2024· article· en· W4399763590 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueDigital Medievalist · 2024
Typearticle
Languageen
FieldSocial Sciences
TopicIntellectual Property Law
Canadian institutionsnot available
Fundersnot available
KeywordsComputer science

Abstract

fetched live from OpenAlex

The availability of software libraries for machine learning, in combination with the growing number of digital sigillographic information resources, enables scholars to explore how this technology can help date medieval seal matrices. This paper presents and evaluates a pioneering system based on archival seal impression data, courtesy of the Digisig Project. The system constructs a decision tree that can be employed to date seal matrices. To explore the potential practical applications of the method, we compare its outputs with the dates assigned to seal matrices by the cataloguers of the Portable Antiquities Scheme and the Schøyen Collection catalogue. This method does not replace human cataloguers, but it can quickly and cost-effectively identify sections of existing catalogues that might benefit from revision.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.987
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0020.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.028
GPT teacher head0.321
Teacher spread0.293 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it