Combining left and right neurons gave unsupported two-step chemical routes among 162 embryonic neurons in eight C. elegans brain maps
We tested how combining left and right neurons changes short chemical routes in eight C. elegans brain maps. Each graph used the same 162 embryonic neurons. We combined 75 left and right pairs and kept 12 other neurons separate. An edge required one recorded synapse site. Across the maps, 6.68 to 10.95 percent of two-step class sequences had no matching neuron route. There were 3,459 unsupported records among 37,079 tested sequences. For endpoint pairs reached within two pooled steps, 4.43 to 7.39 percent lacked a neuron route within that limit, even when other middle classes were allowed. All eight maps retained unsupported sequences at cutoffs of two and three sites. An exact reference swapped incoming target labels within pairs while keeping all class edge counts fixed. Its central 95 percent ranges contained the recorded count in all eight maps. The distinction between class and neuron routes is established prior work. This contribution supplies a directed census, an exact conditional reference, and a route check tool. Separate calculations checked all primary sequences and endpoint distances. Fresh source files reproduced the input tables. The package preserves code, numerical extracts, source hashes, full results, figures, and repeat instructions. These are results for fixed annotation files and graph rules. They do not establish neural signal flow, random biological wiring, or a change with age.
connectome · Caenorhabditis elegans · bilateral neurons · class aggregation · directed paths · conditional reference · reproducible research
References
4- usesdoi:10.1038/s41586-021-03778-8
The eight chemical synapse lists and cell metadata supply the graph inputs. We pin the authors' source repository and preserve hashes and numerical extracts.
- supportsdoi:10.1016/j.isci.2024.110713
This work defined class routes with neuron realizations and excluded unsupported routes from its measures. We extend that established distinction with a directed census in all eight maps and an exact input swap reference.
- supportsdoi:10.48550/arXiv.2006.15401
Graph aggregation can create paths that do not occur in the full graph. The general aggregation problem is established prior work.
- supportsThe union of two adult C. elegans brain maps gave paths of at most two edges for 1,102 neuron pairs with no such path in either map sci:sha256:fa0ea4c43e02533a5f18b5a255a13297792c2b49c443ef165f63ecefeeababae
This prior audit measured short routes after pooling edges across two adult animals. The present audit combines neuron labels within each animal. Its 180-neuron adult edge counts also provide a consistency check.
Cited by
4 publicationsPublic catalog entries on Sciscape.
- usesKeeping ten neuron pairs separate reduced mean class error by 22–26% in two adult C. elegans routing models with recorded panel exits
We reuse its fixed neuron, group and edge tables. We verify its signed archive and rebuild edge counts from the pinned raw annotations. Its short route audit is prior work.
- With equal leak and unit normalized gap gain, bilateral pooling reduced input power by up to 12.33% and 14.57% in two passive C. elegans nerve ring models
This earlier SCI study measured chemical route changes after bilateral pooling. We test steady electrical response in different source maps.
- usesAt fixed neuron totals, early directions cut adult count deviance by 2.4–4.6% in two C. elegans maps with matched contact smoothing
We reuse its derived neuron table and verify every count entry against its distinct-target and listed-target count extract.
- usesCount differences between two adult maps gave no clear gain in a ridge test of response spread across worms for 370 C. elegans neuron pairs
We use the verified numerical chemical-count extract and node groups. An independent raw JSON recount matched every adult edge.