MétaCan
Menu
Back to cohort
Record W2810979461 · doi:10.33137/js.v1i0.27158

Reformulating the Second Law

2017· article· en· W2810979461 on OpenAlex
Paul Patton, Nicholas Overgaard, Hakob Barseghyan

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
venuePublished in a venue whose home country is Canada.

Bibliographic record

VenueScientonomy Journal for the Science of Science · 2017
Typearticle
Languageen
FieldComputer Science
TopicSemantic Web and Ontologies
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsOutcome (game theory)Computer scienceCalculus (dental)Mathematical economicsMathematics

Abstract

fetched live from OpenAlex

The current formulation of the second law is flawed since it does not specify the causal relations between the outcomes of theory assessment and the actual acceptance/unacceptance of a theory; it merely tells us that a theory was assessed by the method employed at the time. We propose a new formulation of the second law: “If a theory satisfies the acceptance criteria of the method actually employed at the time, then it becomes accepted into the mosaic; if it does not, it remains unaccepted; if it is inconclusive whether the theory satisfies the method, the theory can be accepted or not accepted.” This new formulation makes the causal connection between theory assessment outcomes and cases of theory acceptance/unacceptance explicit. Also, this new formulation is not a tautology because it forbids certain logically possible scenarios, such as a theory satisfying the method of the time yet remaining unaccepted. Finally, we outline what inferences an observational scientonomist can make regarding theory assessment outcomes from the record of accepted theories.Suggested Modifications[Sciento-2017-0004]:Accept the following reformulation of the second law:The second law: if a theory satisfies the acceptance criteria of the method employed at the time, it becomes accepted into the mosaic; if it does not, it remains unaccepted; if assessment is inconclusive, the theory can be accepted or not accepted.Accept the following definitions of theory assessment outcomes:Outcome: satisfied ≡ the theory is deemed to conclusively meet the requirements of the method employed at the time.Outcome: not satisfied ≡ the theory is deemed to conclusively not meet the requirements of the method employed at the time.Outcome: inconclusive ≡ it is unclear whether or not the requirements of the method employed at the time are met.Accept the following ontology of theory assessment outcomes:The three possible outcomes of theory assessment are “satisfied”, “not satisfied”, and “inconclusive”.Accept the following redefinition of employed method:Employed method ≡ a method is said to be employed if its requirements constitute the actual expectations of the community.Reject:The previous formulation of the second law.The previous definitions of theory assessment outcomes.The previous ontology of theory assessment outcomes.The previous definition of employed method. [Sciento-2017-0005]:Contingent upon the acceptance of the preceding modification [Sciento-2017-0004], accept that the new second law is not a tautology. [Sciento-2017-0006]:Contingent upon the acceptance of modification [Sciento-2017-0004], accept the following set of inferences of theory assessment outcomes from the acceptance or unacceptance of a single contender (see text).Also accept the following set of inferences of theory assessment outcomes from the acceptance or unacceptance of two contender theories (see text).

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.018
metaresearch head score (Gemma)0.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScience and technology studies, Scholarly communication, Open science
Consensus categoriesScience and technology studies
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.661
Threshold uncertainty score0.996

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0180.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0260.027
Scholarly communication0.0050.007
Open science0.0230.002
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.051
GPT teacher head0.333
Teacher spread0.282 · 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