Escaping the Shadow of Bell's Theorem in Network Nonlocality
Bibliographic record
Abstract
The possibility of nonclassicality in networks unrelated to Bell's original eponymous theorem has recently attracted significant interest. Here, we identify a sufficient condition for being "outside the shadow of Bell's theorem" and introduce a testable criterion capable of certifying the novelty of instances of network-nonclassicality which we call minimal network nonclassicality. We provide examples of minimally network nonclassical correlations realizable in quantum theory as well as examples coming from more exotic operational probabilistic theories. In particular, we apply these concepts to the simplest configuration of the 3-chain scenario (a.k.a. the bilocality scenario) to prove that certain correlations have escaped the shadow of Bell's theorem. While some of the examples herein are unprecedented, we also revisit more familiar examples of network nonclassicality in order to highlight the contrast between our approach versus prior approaches with respect to assessing novelty.
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.006 | 0.026 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.002 | 0.011 |
| Scholarly communication | 0.003 | 0.008 |
| Open science | 0.001 | 0.004 |
| Research integrity | 0.003 | 0.004 |
| Insufficient payload (model declined to judge) | 0.003 | 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".