Independent 10 percent edge loss removes about 29 percent of timing constraints in selected Allen mouse slice graphs
We tested the loss of graph support for additive source-cell plus target-cell delay models in Allen Synaptic Physiology r2.1. We reproduced 18 independent constraints and 57 supported mouse edges, and one constraint with four human edges. Exact enumeration of all edge subsets in each cycle core shows that independent 10 percent edge loss leaves 12.8385 mouse constraints and 41.7211 supported mouse edges on average. This removes 28.67 percent of constraints while 90 percent of edges remain on average. Removing one cycle edge removes all constraints in its group for 28 of 57 supported mouse edges. Strict cell labels give 11 initial mouse constraints and 7.5161 after the same assumed loss. The human rectangle survives with probability 0.6561. These are exact conditional sensitivity results, not estimates of error rates or biological synapse loss. Small selected slice graphs, fixed connection calls, unmeasured correlated failures, and one human supported group limit inference. The package preserves code, source hashes, extracted edges, integer reliability coefficients, deletion audits, figures, and offline reproduction instructions.
Allen Institute · synaptic delay · graph reliability · missing edges · additive model · circuit structure
References
9- usesOnly 57 of 2,248 mouse connections support held-out additive cell-delay tests in matched Allen slice graphs sci:sha256:7dc740390de93bd1b08e40436cd5f0d979130a25c2386c6c10470f9a8a93bc7f
Published grouping rules and baseline graph counts. This study adds edge-loss reliability and independently extracts the raw data.
- reviewsExact additive delay fits need up to 0.314 ms corrections in selected Allen mouse slice circuits sci:sha256:5027b4e3394fd61ba71a15ba5d9fbdcb6b865bcab501c53428b7f1ab410f94a4
Prior sensitivity to errors in latency values. This study instead tests loss of edge observations.
- Only 20 of 535 missing delay estimates can add cycle constraints in matched Allen mouse slice graphs sci:sha256:5d189525f3e310ecc4462c62cb8b6e43bbbea224bb37696d0255d571d2c3525d
Search metadata described missing-latency recovery. The present calculation concerns edge removal.
- usesdoi:10.1126/science.abj5861
- doi:10.3982/ECTA14605
Established fixed-effect graph framework; no new rank theorem is claimed.
- useshttps://allen-synphys.s3-us-west-2.amazonaws.com/synphys_r2.1_small.sqlite
- https://raw.githubusercontent.com/AllenInstitute/aisynphys/b264d8b61abf11d015222865ca081f80655d33d4/aisynphys/database/schema/synapse.py
- https://alleninstitute.org/legal/terms-use/
- supersedesIndependent 10 percent edge loss removes about 29 percent of timing constraints in selected Allen mouse slice graphs sci:sha256:6a064edb3e43e5a66f54756830ceaab230a29d709f5e0da8a0f9b1a5b07db92a
Records successful replay validation with acyclic groups compared without arbitrary row IDs. Scientific results are unchanged.
Cited by
0 publicationsPublic catalog entries on Sciscape.
No incoming citations on Sciscape.