MétaCan
Menu
Back to cohort
Record W2048929512 · doi:10.1037/1196-1961.62.2.91

Asymmetric switch cost and backward inhibition: Carryover activation and inhibition in switching between tasks of unequal difficulty.

2008· article· en· W2048929512 on OpenAlexafffund
Katherine D. Arbuthnott

Bibliographic record

VenueCanadian Journal of Experimental Psychology/Revue canadienne de psychologie expérimentale · 2008
Typearticle
Languageen
FieldNeuroscience
TopicNeural and Behavioral Psychology Studies
Canadian institutionsCampion CollegeUniversity of Regina
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsTask switchingTask (project management)Priming (agriculture)Set (abstract data type)AsymmetryNegative primingComputer sciencePsychologyNeuroscienceCognitionBiologyEngineeringSelective attentionPhysics

Abstract

fetched live from OpenAlex

Asymmetric switch cost, observed when switching between tasks varying in difficulty, shows that the difference between repeat and switch trials is greater when switching to the easier task. Early explanations of this effect attributed this pattern to both positive priming of the difficult task and negative priming of the easier task, but more recent models have focused only on activation processes. The role of inhibition in asymmetric switch cost was examined using backward inhibition, a more direct measure of task-set inhibition. The results indicated asymmetric backward inhibition, with greater sequential inhibition of the easier task (i.e., easy-difficult-easy sequences). Switch costs, however, showed both typical and reversed asymmetry (greater cost when switching from the easy to the difficult task), depending on the relative difficulty of task pairs. This pattern of results indicates that switch costs are attributable to both activation and inhibition processes.

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.001
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.002
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0000.001
Scholarly communication0.0000.001
Open science0.0000.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0020.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.144
GPT teacher head0.353
Teacher spread0.209 · 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 designObservational
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

Citations54
Published2008
Admission routes2
Has abstractyes

Explore more

Same venueCanadian Journal of Experimental Psychology/Revue canadienne de psychologie expérimentaleSame topicNeural and Behavioral Psychology StudiesFrench-language works237,207