MétaCan
Menu
Back to cohort
Record W1972399611 · doi:10.1109/mahc.2013.13

Chaim Selig Slonimski and His Adding Devices

2013· article· en· W1972399611 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.

fundA Canadian funder is recorded on the work.
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

VenueIEEE Annals of the History of Computing · 2013
Typearticle
Languageen
FieldMathematics
TopicHistory and Theory of Mathematics
Canadian institutionsnot available
FundersUniversity of Alberta
KeywordsHistory of computingWork (physics)Computer scienceEngineeringElectrical engineeringMechanical engineeringAlgorithm

Abstract

fetched live from OpenAlex

This article presents the accomplishments of Chaim Selig Slonimski (1810-1904), an important but not sufficiently known figure in the history of calculating devices. The authors briefly discuss Slonimski's life and the recognition he achieved in the 19th century in both Prussia and Russia as well as his patents, financing attempts, similarities to the work of others, and a detailed account of his adding devices of 1845 and 1846. The authors claim that Slonimski invented more calculating devices than it is currently known and present a recently discovered exemplar of one of these devices. They found that Slonimski invented at least two different adding devices and three different multiplying devices and designed a machine to calculate logarithms.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
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.452
Threshold uncertainty score0.590

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
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.100
GPT teacher head0.303
Teacher spread0.203 · 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