sciscape Publications
← All publications

At fixed totals and order, pair counts forced 234 to 239 consecutive sets in one mouse table with six axons

We tested how much a group-order score adds after pairwise wiring is known. We used the Figure 5a mouse muscle source table from Meirovitch and colleagues. It has 297 target rows and six axon columns. We fixed the published order, each axon count and the target input counts. Those totals alone allowed zero to 297 consecutive input sets. Adding all 15 pair counts forced 234 to 239; the observed count was 235. Integer model tables attain both bounds. A path identity and three rare pair counts give a short proof. We also tested the 52 targets with three or four inputs. Their own pair counts and degrees fixed exactly 37 consecutive sets. We checked 359 alternative orders after removal of reversal. Each had a certified upper bound of at most 221 under the primary margins. The published order had at least 234 in every allowed table. Thus the group score and its best order follow closely from pairwise structure under these constraints. This result concerns one finite table and does not assume independent rows. It does not show that activity caused the pattern. The source omits single-input targets. We used no matched axon activity. The package has independent code, aggregate facts, exact certificates, integer witnesses, figures, source hashes and repeat instructions. Original source rows remain external under their source terms.

neuromuscular junction · connectome · axon order · co-innervation · pair counts · integer programming · exact certificate · structure and function

Admitted 1 citing publication

References

6
  1. usesdoi:10.1038/s41593-026-02344-7

    We analyze new aggregate facts from its Figure 5a source table. The original CSV remains external under its source license.

  2. usesAn order learned from 148 targets gave 80% test agreement beyond count controls in one six-axon mouse table sci:sha256:ac8d45daa6e486c18434493f9e3edac4d3a42c301e40b6b088009527d7875049

    We use its source-label audit. We compare our pair-count constraints with its order test beyond target and axon counts. We independently checked the source. No source code is copied.

  3. Three linear orders are needed to cover all input sets in a six-axon mouse muscle table under an exact interval model sci:sha256:ac0ec49c31e54682cd5d01c3f96843a53cba76bc7c1314d1bfd7fce336b5df29

    This study established exact order-cover limits for the same table. We test how much a single-order score is already fixed by pair counts.

  4. usesWith site sizes and edge counts fixed, target pair counts for each source forced 2,974 of 3,098 three-target group counts in eight C. elegans brain maps sci:sha256:4fe3757a9aac707d9c24d41e1be39c5cd674e8fa35a9ea2781e6641c90c99dab

    We apply its exact constraint approach and rational certificate strategy to an ordered muscle-input score. Our source data, proof and code are independent.

  5. usesdoi:10.1038/s41592-019-0686-2

    SciPy supplies the linear and integer programming interfaces. We check the resulting rational certificates and integer witnesses exactly.

  6. usesdoi:10.1007/s12532-017-0130-5

    HiGHS supplies the optimization solvers. Exact checks provide the final bounds.

Cited by

1 publication

Public catalog entries on Sciscape.