Go-activation endures following the presentation of a stop-signal: evidence from startle
Bibliographic record
Abstract
It has been proposed that, in a stop-signal task (SST), independent go- and stop-processes "race" to control behavior. If the go-process wins, an overt response is produced, whereas, if the stop-process wins, the response is withheld. One prediction that follows from this proposal is that, if the activation associated with one process is enhanced, it is more likely to win the race. We looked to determine whether these initiation and inhibition processes (and thus response outcomes) could be manipulated by using a startling acoustic stimulus (SAS), which has been shown to provide additional response activation. In the present study, participants were to respond to a visual go-stimulus; however, if a subsequent stop-signal appeared, they were to inhibit the response. The stop-signal was presented at a delay corresponding to a probability of responding of 0.4 (determined from a baseline block of trials). On stop-trials, a SAS was presented either simultaneously with the go-signal or stop-signal or 100, 150, or 200 ms following the stop-signal. Results showed that presenting a SAS during stop-trials led to an increase in probability of responding when presented with or following the stop-signal. The latency of SAS responses at the stop-signal + 150 ms and stop-signal + 200 ms probe times suggests that they would have been voluntarily inhibited but instead were involuntarily initiated by the SAS. Thus results demonstrate that go-activation endures even 200 ms following a stop-signal and remains accessible well after the response has been inhibited, providing evidence against a winner-take-all race between independent go- and stop-processes. NEW & NOTEWORTHY: In this study, a startling acoustic stimulus (SAS) was used to determine whether response outcome could be manipulated in a stop-signal task. Results revealed that presenting a SAS during stop-signal trials led to an increase in probability of responding even when presented 200 ms following the stop-signal. The latency of SAS responses indicates that go-activation remains accessible and modifiable well after the response is voluntarily inhibited, providing evidence against an irrevocable commitment to inhibition.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".