Three linear orders are needed to cover all input sets in a six-axon mouse muscle table under an exact interval model
We tested an exact structural constraint on ordered activity in one P6 mouse omohyoid source table. The table has 297 target rows and six motor axons. A target is covered if its inputs occupy consecutive positions in at least one shared linear order. We searched all 360 orders up to reversal, 64,620 pairs, and 7,711,320 triples. The best single order covered 235 targets. The best pair covered 283. Exactly three orders were needed for complete coverage, with nine complete solutions. None included the unique best single order. Keeping that order required four orders for full coverage, but three missed only one target. Removal of any 13 target rows still left a three-order requirement. A split with 148 training rows and 149 test rows gave 82.55% and 92.95% test coverage for one and two orders. Both exceeded fixed-count graph controls. Adding an order also increased coverage in those controls, so coverage gain alone did not identify another activity order. The result sets a limit on an exact interval model. It does not measure recruitment sequences or reject a graded account of activity-dependent synapse removal. We preserve complete minimum solutions, independent code, source records, figures, controls, and repeat instructions.
neuromuscular connectome · synapse elimination · motor recruitment · consecutive ones · exact enumeration · structural model · mouse development
References
3- usesdoi:10.1038/s41593-026-02344-7
We use the unchanged Figure 5 source CSV from one P6 omohyoid muscle. We test a strict interval constraint motivated by the article's activity account. The source material remains external under its original license.
- 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 checked source identity and CSV-to-figure label audit. We verified its signed package and extend its one-order coverage analysis to exact unions of orders.
- doi:10.1016/S0022-0000(76)80045-1
This work defines the established consecutive-ones problem. Our six-column analysis uses complete enumeration and does not claim a new general algorithm.
Cited by
2 publicationsPublic catalog entries on Sciscape.
- A tie for the best axon order required 20 input label changes in one mouse table with target and axon totals fixed
Its interval coverage result defines prior evidence for the score. We ask how errors can change the best single order.
- At fixed totals and order, pair counts forced 234 to 239 consecutive sets in one mouse table with six axons
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.