Efficient and Exact Diagnosis of Multiple Stuck-At Faults
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.
Bibliographic record
Abstract
A simulation-based approach to multiple stuck-at fault diagnosis is presented. The algorithm works iteratively as it identifies and fault models a single location at a time so that the functionality of the new netlist gradually resembles that of the corrupted one. The method is based on a theoretical result along with a number of heuristics which help avoid the exponential complexity inherent to the problem. Experiments on multiple stuck-at faults confirm its e#ectiveness and accuracy which scales well with increasing number of faults. J. Brandon Liu Andreas Veneris Magdy S. Abadir University of Toronto University of Toronto Motorola Dept ECE Dept ECE and CS 7700 W. Parmer Toronto, ON M5S 3G4 ON M5S 3G4 Austin, TX 78729 liuji@eecg.toronto.edu veneris@eecg.toronto.edu m.abadir@motorola.com 1
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| 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.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it