MétaCan
Menu
Back to cohort
Record W2767516636

An Attention Based Theory to Explore Affordances of Textual and Diagrammatic Proofs

2010· article· en· W2767516636 on OpenAlexaboutno aff
Peter Coppin, Jim Burton

Bibliographic record

VenueeScholarship (California Digital Library) · 2010
Typearticle
Languageen
FieldComputer Science
TopicSemantic Web and Ontologies
Canadian institutionsnot available
Fundersnot available
KeywordsDiagrammatic reasoningAffordanceMathematical proofNotationComputer scienceFocus (optics)Human–computer interactionSemantic reasonerCognitive scienceProgramming languageArtificial intelligenceLinguisticsPsychologyMathematics
DOInot available

Abstract

fetched live from OpenAlex

An Attention Based Theory to Explore Affordances of Textual and Diagrammatic Proofs Peter Coppin University of Toronto James Burton University of Brighton Abstract: Shimojima and Katagiri have demonstrated that diagrams reduce ”inferential load” during reasoning by scaffolding visual-spatial aspects of memory. In response, we wondered why, if this is true, that proofs are usually text based? The purpose of this paper is to explore ergonomic affordances of text that may encourage its use in the communication of proofs by building on prior work in attention. We claim that textual notations may focus a reasoner’s ”spotlight” of attention through serialized sequential chunks, whereas many diagrams may ”diffuse” attention and that a diagrammatic notation system that serialized information in chunks amenable to focused attention could leverage the power of textual notations. We present such an example through a case study focused on generalized constraint diagrams, a visual logic with attributes that may support focused attention and extract ergonomic principles that may transcend each notation system.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.012
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.011
Threshold uncertainty score0.037

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.012
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0000.002
Bibliometrics0.0040.001
Science and technology studies0.0010.007
Scholarly communication0.0030.012
Open science0.0020.004
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0110.001

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.019
GPT teacher head0.237
Teacher spread0.218 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2010
Admission routes1
Has abstractyes

Explore more

Same venueeScholarship (California Digital Library)Same topicSemantic Web and OntologiesFrench-language works237,207