Blocking in Fully Connected Networks of Arbitrary Size
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
The problem of checking blocking properties is studied for networks consisting of arbitrary numbers of finite-state discrete-event subsystems. The topology of the networks is that of a fully connected graph: any subsystem can potentially interact with any other. Two types of blocking are studied: component blocking, whereby a subsystem is potentially prevented from entering its set of marker states, and network blocking, whereby the subsystems are potentially unable to occupy marker states simultaneously. It is shown that if the subsystems are all identical and broadcast actions are permitted, both types of blocking properties are undecidable; but in the absence of broadcast actions, they become decidable. If the subsystems are not necessarily identical but only isomorphic, then blocking properties are in general undecidable; however, a template is proposed for ensuring adequate structure for decidability. It is claimed that this template is sufficiently general to admit many realistic examples.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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