--- slug: no-beat-twice passed: 2026-10-18 by: the assay line (research/assay-line/queue-1018/), Codex fixer directed by claude-assaying-boyle-1014; source record by Codex, checked by Codex checked: 145 confirmed: 127 wrong: 16 unverifiable: 0 observed: 0 stale: 2 --- This was the queue-1018 tier A decide-and-fix pass for No Beat Twice: all 17 triage items were decided and the decision JSON validated before layer edits, every WRONG item was taken back to its source or code, and 127 CONFIRMED claims are carried from the checker's reread with that provenance stated on each line. The 15 findings counted as wrong comprise 11 WRONG and four MINOR items; the altered quotation X9 is WRONG with its original checker level retained in triage. The two STALE items are the explicit metadata exceptions, so they receive no Updated line; landing must rebuild the placard date from this record. This record covers the assigned triage and those confirmed claims, not a new audit of the checker's other observations or unverifiable claims. All revision dates use the instructed assay date, 2026-10-18. ## Claims - MINOR | Draw one below and this page will search, exhaustively, for the entry times that work. | git show a77c45dd68:public/strata/no-beat-twice/index.html:149; git show a77c45dd68:public/strata/no-beat-twice/canons.mjs:66 | X1; bounded-browser-search. Re-read canons.mjs eachComplement: "if (++nodes > budget)" stops the search, and index.html sets BUDGET to 4000000. Recreated A=[0,13,26,39], n=72: one class, complete=false. Fix the cheap MINOR checking overclaim wherever the layer promises an exhaustive browser decision; describe a bounded search that may remain undecided. - WRONG | write in a paper accepted in July of this year | https://link.springer.com/article/10.1007/s40687-025-00509-7 | X2; laba-acceptance-date. Re-read the publisher page, About this article: "Accepted: 20 February 2025" and "Published: 10 June 2025". The fetched accepted manuscript p. 1 instead says "Date: July 27, 2026"; that is not its acceptance date. Fix the acceptance date everywhere, including the build-data literature record, and add one Corrected line shared with X10. - MINOR | Across every cycle length whose census we could finish, 347,932 rhythms tile, and every one of them satisfies both (T1) and (T2). | git show a77c45dd68:research/rhythmic-canons/data/conditions.json | X3; conditions-census-range. Re-read data/conditions.json: "range": [2,42] and "totalTilingRhythms": 347932, with no T1 or T2 failures. The main canons.json also has completed rows at 44,45,48,50. State that the conditions census ran through 42; the number and result stay unchanged. Cheap MINOR precision fix. - WRONG | Inside seventy-two beats there is exactly one place where it is not known. | http://canonsrythmiques.free.fr/pdf/RhythmicCanonsPNM.pdf | X4; period-sixty-unproved. Re-read the fetched Amiot PDF, printed p. 14, section 2.2.4: "condition (T2 ) is indeed necessary for tiling, for all canons of period n ≤ 180". This includes period 60 and every offered period through 72. Replace the purported unknown case with the settled range. Share one Corrected line with X5, X6 and X7. - WRONG | A size with three distinct primes must be at least 30, and 30 onsets need at least 60 beats, so the unproved region within reach is a single family: thirty onsets, sixty beats, two voices. | http://canonsrythmiques.free.fr/pdf/RhythmicCanonsPNM.pdf | X5; period-sixty-unproved. Re-read the fetched Amiot PDF, printed p. 14, section 2.2.4: "condition (T2 ) is indeed necessary for tiling, for all canons of period n ≤ 180". This includes period 60 and every offered period through 72. The size arithmetic does not make this an unproved family. Keep the recorded thirty-onset probe as a check of a known result, and correct the same assertion in its generator and research notes. Share the X4 correction. - WRONG | That is a genuine look at the open question and it is also a very small one, over a family with a great deal of structure, which is not where a counterexample would be expected to hide. | http://canonsrythmiques.free.fr/pdf/RhythmicCanonsPNM.pdf | X6; period-sixty-unproved. Re-read the fetched Amiot PDF, printed p. 14, section 2.2.4: "condition (T2 ) is indeed necessary for tiling, for all canons of period n ≤ 180". This includes period 60 and every offered period through 72. The 5,378 sampled rotation classes test the implementation against a known theorem, not the open part of the conjecture. Replace that conclusion; share the X4 correction. - WRONG | Draw something with thirty onsets in sixty beats and you are in the unproved region. | http://canonsrythmiques.free.fr/pdf/RhythmicCanonsPNM.pdf; git show a77c45dd68:public/strata/no-beat-twice/index.html:194 | X7; period-sixty-unproved. Re-read the fetched Amiot PDF, printed p. 14, section 2.2.4: "condition (T2 ) is indeed necessary for tiling, for all canons of period n ≤ 180". This includes period 60 and every offered period through 72. Also re-read index.html nsel: "" follows the choices 8,12,16,18,20,24,30,36; there is no 60 option. Remove the impossible invitation and say the offered periods lie inside the settled range. Share the X4 correction and mention the absent 60-beat choice. - MINOR | The rhythm {0, 27} in a 54-beat cycle has 226 of them. | git show a77c45dd68:research/rhythmic-canons/canons.mjs | X8; anchored-complement-count. Re-read research/rhythmic-canons/canons.mjs: "Every complement B of A with 0 in B" and "chosen[0] = 0". The 54-beat antipodal pairs admit 2^27 choices in all; fixing the pair containing zero leaves 2^26. State that an entry at beat 0 is fixed in the page, README and verifier label. Cheap MINOR normalization fix; keep the exponent. - WRONG | Fripertinger's phrase 6 motifs and 3 complements is our 6 partners and 3 rhythms, not the other way round. | http://canonsrythmiques.free.fr/EnumerationVuzaCanons.rtf | X9; enumeration-quotation. Fetched and read EnumerationVuzaCanons.rtf, n = 72: the words are "6 motifs with" and separately "3 complements, with", surrounding the two divisor lists. "6 motifs and 3 complements" is not a quotation from that source; the source record explicitly calls it a quote. The RTF contains no author attribution, so identify this document separately from Fripertinger's compendium. Raise MINOR to WRONG because the attributed quotation is false. The fix is to restore the source's words as two separate quotations, without editing within either quotation, and add a Corrected line. - WRONG | I. Laba and I. Londner, The Coven-Meyerowitz tiling conditions for 3 prime factors: the even case, accepted 2026, for the current status of the conjecture in the authors' own words. | https://link.springer.com/article/10.1007/s40687-025-00509-7 | X10; laba-acceptance-date. Re-read the publisher page, About this article: "Accepted: 20 February 2025" and "Published: 10 June 2025". The fetched accepted manuscript p. 1 instead says "Date: July 27, 2026"; that is not its acceptance date. Replace accepted 2026 with accepted 20 February 2025. This is the same error and Corrected line as X2. - WRONG | A canon here is an ordered pair, a rhythm and a set of entries, so a canon and its dual are two. | git show a77c45dd68:research/rhythmic-canons/build-data.mjs:108 | X11; vuza-duals-counted-once. Re-read build-data.mjs table construction: "vuzaClassPairs: s ? s.vuzaOrderedClassPairs / 2 : null" with the comment "pairs of classes, not ordered". The raw vuza-72-filtered.txt summary has "vuzaOrderedClassPairs":36, while canons.json has "canonClassPairs":18. State separately that the all-canon column uses ordered pairs and the Vuza total identifies duals, and add a Corrected line. - STALE | Last verified 16 August 2026, when it was written. | git show a77c45dd68:memory/log.d/2026-08-16T2330Z-no-beat-twice.md; git show a77c45dd68:memory/log.d/2026-08-18T2355Z-no-beat-twice-the-film.md | X12; placard-verification-date. The checker records the original 16 August verification and the later 18 August film gate. The current generated placard still says "Last verified 16 August 2026, when it was written." Apply the explicit placard exception: decision fix, no Updated line. The new claims record supplies passed: 2026-10-18; landing rebuilds this generated date from that record. Do not hand-edit the placard or run its shared generator here. - WRONG | 51 cycle lengths; the 20 prime ones are left out because a prime cycle has no factorisation to count. The first two columns are complete through 50 beats and then stop, for the reason in the check below. The last column is complete for every length from 2 to 72, and that is the column the argument rests on. | git show a77c45dd68:public/strata/no-beat-twice/canons.json | X13; census-completeness. Re-read canons.json: rows 46 and 49 have "censusComplete":false, while 44,45,48,50 are complete. Re-read verify.mjs E17: "Math.max(...complete.map((r) => r.n))" establishes only the largest completed length, not contiguous coverage. Correct the note and assertion to state the gaps. A prime cycle does have the trivial singleton/full-cycle factorization, excluded by this census, so replace "no factorisation" with "only trivial factorisations". Add one Corrected line covering this census note. - MINOR | More than 200 distinct sets of entry times work (counted up to rotation). | git show a77c45dd68:public/strata/no-beat-twice/canons.mjs:154 | X14; incomplete-search-count. Re-read complementClasses in canons.mjs: "if (list.length >= limit) { truncated = true; return false; }". With limit 200 it proves at least 200, not more than 200. Change the shared incomplete-result message to At least, preserving the checker's MINOR level for this cutoff wording. It shares the error and implementation fix with WRONG X17; X17 requires the dated line. - STALE | "dateModified":"2026-08-16" | git log a77c45dd68 -- public/strata/no-beat-twice/index.html | X15; article-modification-date. Re-read index.html Article JSON-LD: "dateModified":"2026-08-16" while the body already contains "Correction, 2026-08-17." Set dateModified to the instructed revision date 2026-10-18. Explicit metadata exception: decision fix, no Updated line; the Corrected lines date this revision. - WRONG | Here the same shape: the cyclotomic conditions are necessary, and whether the second one is necessary in general has been open since 1999. | https://arxiv.org/pdf/math/9802122; https://personal.math.ubc.ca/~ilaba/preprints/T2-even.pdf | X16; conditions-necessary. Re-read Coven-Meyerowitz p. 2: "If A(x) satisfies (T1) and (T2), then A tiles the integers" and "If A tiles the integers, then A(x) satisfies (T1)." Also read Laba-Londner p. 2: the general question is "the main open problem concerning integer tilings". The relation note wrongly calls both conditions necessary. State T1 necessary and T1 plus T2 sufficient, preserving the open general question for T2. Add a Corrected line. - WRONG | (added) 18 voices, entering at 0 4 8 12 16 20 24 28 32 36 40 44 48 52 56 60 64 68. More than 1 distinct sets of entry times work (counted up to rotation). | git show a77c45dd68:public/strata/no-beat-twice/index.html:604; git show a77c45dd68:public/strata/no-beat-twice/canons.mjs:145 | X17; incomplete-search-count. Re-read index.html result branch: "More than ${fmt(complementCount)} distinct sets of entry times work" whenever complementTruncated is true. Re-ran complementClasses([0,13,26,39],72,200,4000000): one class, truncated=true, complete=false. The complete control [0,1,2,3] has exactly one class. Multiplication by 13 is invertible modulo 72 and maps the control to the failing input, preserving complement classes, so more than one is false. Report At least when the search is incomplete, and add a Corrected line shared with X14. - CONFIRMED | Give several voices the same rhythm and let each start at a different moment. If you choose well, they strike every beat of the cycle exactly once: no beat doubled, no beat missed. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 1, canon-intro. Definition on p. 1: "each element" is "expressed uniquely" as a sum of an inner and an outer voice. Counting the pairs gives the product of cardinalities. - CONFIRMED | Most rhythms cannot do it at all. | git show a77c45dd68:public/strata/no-beat-twice/index.html; https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 2, most-rhythms. The record says "none", but a cardinality bound suffices for the offered cycles. At n=8 only 107 of 255 nonempty subsets even have a size dividing 8; the bound remains below half at every offered length through 72. This is a deduction for uniformly counted subsets, not a claim about a distribution of musical compositions. - CONFIRMED | Write the beats of a cycle as the numbers 0, 1, 2, … n−1, and count round: after n−1 comes 0 again. A rhythm is a set of those numbers, the beats one voice strikes. Starting the same rhythm at beat b shifts every onset by b. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 10, cycle-coordinates. Definition on p. 1: "each element" is "expressed uniquely" as a sum of an inner and an outer voice. Counting the pairs gives the product of cardinalities. - CONFIRMED | Every beat of the cycle should be a + b for exactly one choice of an onset a and an entry b. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 11, factorization-definition. Definition on p. 1: "each element" is "expressed uniquely" as a sum of an inner and an outer voice. Counting the pairs gives the product of cardinalities. - CONFIRMED | When that happens the two sets are said to factor the cycle, and the grid above shows it directly: one row per voice, one column per beat, and every column carries exactly one mark. | git show a77c45dd68:public/strata/no-beat-twice/index.html | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 12, grid-definition. buildGrid computes each hit as "(a + b) % n_" and counts each column. Independent arithmetic confirms every column of all 18 selected canons is one. The extra thin summary row reports those counts. - CONFIRMED | Because the strikes are all distinct and there are |A| × |B| of them, the two sizes must multiply to n. | https://personal.math.ubc.ca/~ilaba/preprints/T2-even.pdf | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 13, cardinality. The source explicitly says "We then have |A| |B| = M". This also follows by counting the unique pairs. - CONFIRMED | That is the first thing the page checks, and it is why a five-onset rhythm can never fill a twelve-beat cycle. | git show a77c45dd68:public/strata/no-beat-twice/index.html; git show a77c45dd68:public/strata/no-beat-twice/canons.mjs | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 14, cardinality-check. Recreated obstruction([0,1,2,3,4],12): "5 onsets cannot divide 12 beats evenly". The empty-set guard runs first; the first substantive tiling test is cardinality. - CONFIRMED | Turn a rhythm into a polynomial by writing x to the power of each onset and adding: the rhythm {0, 1, 3} becomes 1 + x + x³. | https://personal.math.ubc.ca/~ilaba/preprints/T2-even.pdf | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 15, polynomial-0. Read p. 2 including the mask-polynomial definition immediately above the recorded excerpt. Equations (1.1)-(1.3) give the product identity modulo X^M-1 and the irreducible cyclotomic factors. - CONFIRMED | Then a factorisation of the cycle says exactly that A(x) B(x) = 1 + x + … + xn−1, once you agree that xn means 1. | https://personal.math.ubc.ca/~ilaba/preprints/T2-even.pdf | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 16, polynomial-1. Read p. 2 including the mask-polynomial definition immediately above the recorded excerpt. Equations (1.1)-(1.3) give the product identity modulo X^M-1 and the irreducible cyclotomic factors. - CONFIRMED | The right hand side is a product of cyclotomic polynomials, one for each divisor of n above one, and each of those is irreducible, so each one has to divide A(x) or B(x). | https://personal.math.ubc.ca/~ilaba/preprints/T2-even.pdf | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 17, polynomial-2. Read p. 2 including the mask-polynomial definition immediately above the recorded excerpt. Equations (1.1)-(1.3) give the product identity modulo X^M-1 and the irreducible cyclotomic factors. - CONFIRMED | If the cyclotomic polynomial belonging to a power of a prime p divides a rhythm, then p divides the number of onsets: the onsets fall into p equal groups. | https://arxiv.org/pdf/math/9802122 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 18, prime-power-divisibility. Lemma 1.1 gives Phi_(p^k)(1)=p; hence p divides the onset count. For eight onsets, carrying Phi_2, Phi_4 and Phi_8 forces the reduced polynomial modulo X^8-1 to be 1+X+...+X^7. The residue conclusion is a deduction, not a verbatim sentence of the excerpt. - CONFIRMED | So when p does not divide the number of voices, that cyclotomic polynomial has nowhere else to go and must divide the rhythm. | https://personal.math.ubc.ca/~ilaba/preprints/T2-even.pdf | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 19, prime-power-forced-factor. Combine the excerpt's irreducibility argument with Phi_(p^k)(1)=p in Coven-Meyerowitz Lemma 1.1: if p does not divide the number of voices, the factor must divide the rhythm. - CONFIRMED | If it does not, no set of entry times can exist, and the page can say so without trying any. | git show a77c45dd68:public/strata/no-beat-twice/index.html; git show a77c45dd68:public/strata/no-beat-twice/canons.mjs | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 20, obstruction-without-search. Recreated obstruction([0,1,3],12): "reason": "cyclotomic", "detail": [3]. The UI displays the obstruction before calling complementClasses; the equal-group calculation is implemented by dividesPrimePower. - CONFIRMED | The verdict panel names the obstruction when there is one. | git show a77c45dd68:public/strata/no-beat-twice/index.html; git show a77c45dd68:public/strata/no-beat-twice/canons.mjs | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 21, obstruction-display. Recreated obstruction([0,1,3],12): "reason": "cyclotomic", "detail": [3]. The UI displays the obstruction before calling complementClasses; the equal-group calculation is implemented by dividesPrimePower. - CONFIRMED | The test is not complete. | git show a77c45dd68:public/strata/no-beat-twice/canons.mjs; https://arxiv.org/pdf/math/9802122 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 22, incomplete-cyclotomic-test. The record's Theorem B1 excerpt concerns T1, not exactly the weaker browser test. A direct positive example settles this claim: A={0,4}, n=12 returns "reason": "search", then zero complements with "complete": true. - CONFIRMED | Some rhythms pass every cyclotomic condition of that kind and still have no complement, and for those the page searches the placements within a browser budget. | public/strata/no-beat-twice/index.html; public/strata/no-beat-twice/canons.mjs | Review-and-repair reread for X1, 2026-10-18. N2 Entry 23, search-fallback, is the earlier checker's provenance; research/assay-line/queue-1018/no-beat-twice/N2-codex.md preserves its earlier exhaustive-search wording. Recreated A={0,4}, n=12: it passes the obstruction and has zero complements with complete=true. The current page sets a 4000000-node budget; A={0,13,26,39}, n=72 returns one class with complete=false. These establish the negative example and the bounded search separately. - CONFIRMED | The search branches on which onset lands on the lowest uncovered beat, which is forced to be a single choice in any given factorisation, so it never visits the same factorisation twice. | public/strata/no-beat-twice/index.html; public/strata/no-beat-twice/canons.mjs | Review-and-repair reread for X1, 2026-10-18. N2 Entry 24, search-once, supplied the branching argument. eachComplement fixes 0 in B and branches on the unique translate covering the lowest uncovered residue, so a given anchored placement cannot be reached twice. The budget and class limit can stop the search before all placements are reached; complementClasses removes rotations from the placements found. - CONFIRMED | A rhythm can be a shorter rhythm said twice. {0, 1, 6, 7} in a twelve-beat cycle is just {0, 1} played at beats 0 and 6: shift it by six and it lands on itself. Call such a pattern periodic. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 26, period-example. The source defines periodicity by "S + g = S" with nonzero g. Directly shifting {0,1,6,7} by 6 gives itself. The two 12-beat examples separately realize a periodic rhythm and periodic entries. - CONFIRMED | Call such a pattern periodic. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 27, period-definition. The source defines periodicity by "S + g = S" with nonzero g. Directly shifting {0,1,6,7} by 6 gives itself. The two 12-beat examples separately realize a periodic rhythm and periodic entries. - CONFIRMED | If the rhythm repeats, the entries can be irregular; if the entries repeat, the rhythm can be irregular. One side carries the regularity. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 29, one-side-regularity. The source defines periodicity by "S + g = S" with nonzero g. Directly shifting {0,1,6,7} by 6 gives itself. The two 12-beat examples separately realize a periodic rhythm and periodic entries. - CONFIRMED | For every cycle length from two beats to seventy-one, every factorisation of the cycle has at least one periodic side. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 31, no-vuza-below72. Jedrzejewski pp. 1-2 explicitly dates the contributions to Hajos 1950, Redei 1950, de Bruijn 1953 and Sands 1957, then states "N = 72" as the first Vuza order. The displayed good-order forms cover every length below 72. - CONFIRMED | At seventy-two beats it breaks. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 33, first72. Jedrzejewski pp. 1-2 explicitly dates the contributions to Hajos 1950, Redei 1950, de Bruijn 1953 and Sands 1957, then states "N = 72" as the first Vuza order. The displayed good-order forms cover every length below 72. - CONFIRMED | These are called Vuza canons, after Dan Tudor Vuza, who worked out how to construct them in a four-part series in Perspectives of New Music between 1991 and 1993. | https://imsc.uni-graz.at/fripertinger/papers/canons.pdf; http://canonsrythmiques.free.fr/pdf/RhythmicCanonsPNM.pdf | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 34, vuza-name-series. Fripertinger's references [7]-[10] list the four Vuza parts in Perspectives of New Music: 1991, 1992, 1992, 1993. Amiot p. 6 additionally supports the independent rediscovery clause in the film. - CONFIRMED | He was chasing a musical object and rediscovered, on his own, a piece of group theory that had taken a generation of mathematicians | http://canonsrythmiques.free.fr/pdf/RhythmicCanonsPNM.pdf | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 35, vuza-independent-rediscovery. Amiot states that Vuza managed "all by himself" the rediscovery and proof of results of the generation working on Hajos's conjecture. The surrounding discussion is explicitly about the musical problem. - CONFIRMED | the cyclic groups in which every factorisation must have a periodic factor were classified between 1950 and 1957 by Hajos, Redei, de Bruijn and Sands, and 72 is the smallest order that is not one of them. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 36, classification-history. Jedrzejewski pp. 1-2 explicitly dates the contributions to Hajos 1950, Redei 1950, de Bruijn 1953 and Sands 1957, then states "N = 72" as the first Vuza order. The displayed good-order forms cover every length below 72. - CONFIRMED | What is above is not a quotation of that classification. We use it nowhere in the computation. | git show a77c45dd68:research/rhythmic-canons/census.c | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 37, classification-unused. Read census.c: generation, periodicity, exact cover and prime-power divisibility are implemented directly. No good-order classification table decides the sweep. The filter tests only necessary conditions and the recorded unfiltered run supplies a positive control. - CONFIRMED | Our three rhythms and six partners are the same nine sets that Harald Fripertinger enumerated | https://www.mathe2.uni-bayreuth.de/frib/canons/canon_3.html | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 39, frip-nine-sets. The recorded excerpt only explains table orientation. I read the actual compendium rows, converted its interval lists into onset sets, and recovered exactly the same three six-onset classes and six twelve-onset classes: independent-check.json "allMatch": true. - CONFIRMED | the same counts that Franck Jedrzejewski tabulates as three inner voices of six onsets against six outer voices of twelve. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 40, jed-nine-counts. Table 1, p. 10: "72 2 2 3 3 2 6 12 3 6" under columns N,n1,p1,n2,p2,n3,|S|,|R|,#S,#R. The opening pages support the historical attributions. - CONFIRMED | the worked examples that Jedrzejewski and Emmanuel Amiot print in their papers, three partners and two rhythms between them | http://canonsrythmiques.free.fr/pdf/RhythmicCanonsPNM.pdf | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 44, five-published-examples. Read Jedrzejewski Example 18 and Amiot p. 7. Together they print two six-onset sets and three twelve-onset sets; independent-check.json verifies all five belong to the displayed rotation classes. The record's Amiot excerpt alone covers only three of the five. - CONFIRMED | the worked examples that Jedrzejewski and Emmanuel Amiot print in their papers | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 45, jed-published-example. Read Jedrzejewski Example 18 and Amiot p. 7. Together they print two six-onset sets and three twelve-onset sets; independent-check.json verifies all five belong to the displayed rotation classes. The record's Amiot excerpt alone covers only three of the five. - CONFIRMED | Seventy-two can be split as six onsets in twelve voices, or eight in nine, or nine in eight, and so on. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 51, factor-sizes72. 6*12=8*9=9*8=72. This is elementary cardinality arithmetic; the recorded table excerpt is not needed for the eight-by-nine possibility. - CONFIRMED | With nine voices, no power of two can divide the entry set, so every one of the cyclotomic factors belonging to 2, 4 and 8 has to sit in the rhythm, and a rhythm carrying all three has exactly one onset in each residue class modulo eight. | https://arxiv.org/pdf/math/9802122 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 54, eight-residues-algebra. Lemma 1.1 gives Phi_(p^k)(1)=p; hence p divides the onset count. For eight onsets, carrying Phi_2, Phi_4 and Phi_8 forces the reduced polynomial modulo X^8-1 to be 1+X+...+X^7. The residue conclusion is a deduction, not a verbatim sentence of the excerpt. - CONFIRMED | That is a strong enough grip to force the other side to repeat. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 55, eight-forces-period. Jedrzejewski Table 1 enumerates Vuza canons at 72 only for |S|=6, |R|=12. Thus an eight-onset tile cannot have an aperiodic nine-onset complement. The residue observation alone is not a complete printed proof of this implication. - CONFIRMED | In 1999 Ethan Coven and Aaron Meyerowitz isolated two conditions on a set of onsets, usually written (T1) and (T2). | https://arxiv.org/pdf/math/9802122 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 56, conditions-origin. Coven-Meyerowitz pp. 1-2 state T1, T2, Theorems A, B1 and B2. Their bibliography record gives Journal of Algebra 212 (1999), 161-174. "Two prime factors" here means distinct prime factors, as the later Laba-Londner introduction explicitly restates. - CONFIRMED | (T1) says the number of onsets equals the product of the primes belonging to the prime-power cyclotomic factors the rhythm carries. | https://arxiv.org/pdf/math/9802122 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 57, condition-t1. Coven-Meyerowitz pp. 1-2 state T1, T2, Theorems A, B1 and B2. Their bibliography record gives Journal of Algebra 212 (1999), 161-174. "Two prime factors" here means distinct prime factors, as the later Laba-Londner introduction explicitly restates. - CONFIRMED | (T2) says that when you take several of those prime powers with distinct primes and multiply them together, the cyclotomic polynomial of the product divides the rhythm too. | https://arxiv.org/pdf/math/9802122 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 58, condition-t2. Coven-Meyerowitz pp. 1-2 state T1, T2, Theorems A, B1 and B2. Their bibliography record gives Journal of Algebra 212 (1999), 161-174. "Two prime factors" here means distinct prime factors, as the later Laba-Londner introduction explicitly restates. - CONFIRMED | They proved that (T1) and (T2) together are enough: any set satisfying both tiles. | https://arxiv.org/pdf/math/9802122 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 59, conditions-sufficient. Coven-Meyerowitz pp. 1-2 state T1, T2, Theorems A, B1 and B2. Their bibliography record gives Journal of Algebra 212 (1999), 161-174. "Two prime factors" here means distinct prime factors, as the later Laba-Londner introduction explicitly restates. - CONFIRMED | And they proved that (T1) alone is necessary. | https://arxiv.org/pdf/math/9802122 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 60, t1-necessary. Coven-Meyerowitz pp. 1-2 state T1, T2, Theorems A, B1 and B2. Their bibliography record gives Journal of Algebra 212 (1999), 161-174. "Two prime factors" here means distinct prime factors, as the later Laba-Londner introduction explicitly restates. - CONFIRMED | Whether (T2) is necessary, in general, is open. | https://personal.math.ubc.ca/~ilaba/preprints/T2-even.pdf | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 61, t2-open. Laba-Londner p. 2 says "The main open problem concerning integer tilings" is whether the conditions hold for all finite tiles. Since T1 is necessary, a tile failing T2 would disprove the conjecture. The general problem is distinct from the settled small periods. - CONFIRMED | It is still open now. | https://personal.math.ubc.ca/~ilaba/preprints/T2-even.pdf | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 62, still-open. Laba-Londner p. 2 says "The main open problem concerning integer tilings" is whether the conditions hold for all finite tiles. Since T1 is necessary, a tile failing T2 would disprove the conjecture. The general problem is distinct from the settled small periods. - CONFIRMED | the main open problem concerning integer tilings | https://personal.math.ubc.ca/~ilaba/preprints/T2-even.pdf | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 65, laba-open-quotation. Laba-Londner p. 2 says "The main open problem concerning integer tilings" is whether the conditions hold for all finite tiles. Since T1 is necessary, a tile failing T2 would disprove the conjecture. The general problem is distinct from the settled small periods. - CONFIRMED | A rhythm that tiled while failing (T2) would settle it | https://personal.math.ubc.ca/~ilaba/preprints/T2-even.pdf | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 66, counterexample-settles. Laba-Londner p. 2 says "The main open problem concerning integer tilings" is whether the conditions hold for all finite tiles. Since T1 is necessary, a tile failing T2 would disprove the conjecture. The general problem is distinct from the settled small periods. - CONFIRMED | Decisions here use a proved obstruction or a bounded search, so nothing on this page rests on the conjecture. | git show a77c45dd68:public/strata/no-beat-twice/index.html; public/strata/no-beat-twice/index.html; src/content/strata/no-beat-twice.md | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 68, drawn-rhythms-decided. No decision assumes the conjecture: obstruction uses a proved necessary test, then exact cover supplies the remaining yes/no answers. T1/T2 are separately reported. The wording describes independence from the conjectural conditions, not the absence of all preprocessing. This pass uses the current wording after X1 or X9; the original checker wording and qualification remain in N2. - CONFIRMED | (T2) is a theorem, not a conjecture, whenever the number of onsets has at most two distinct prime factors | https://arxiv.org/pdf/math/9802122 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 70, two-prime-theorem. Coven-Meyerowitz pp. 1-2 state T1, T2, Theorems A, B1 and B2. Their bibliography record gives Journal of Algebra 212 (1999), 161-174. "Two prime factors" here means distinct prime factors, as the later Laba-Londner introduction explicitly restates. - CONFIRMED | The instrument reports both conditions for the rhythms it searches. | git show a77c45dd68:public/strata/no-beat-twice/index.html; public/strata/no-beat-twice/index.html; src/content/strata/no-beat-twice.md | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 78, condition-display. spectrumLine calls satisfiesT1 and satisfiesT2 on the current input and prints both statuses. Default [0,1,2] at 12 gives "holds" for both. This pass uses the current wording after X1 or X9; the original checker wording and qualification remain in N2. - CONFIRMED | They are not in conflict, and neither number is the answer. | https://eigen-space.org/mk/ps/talg.pdf; http://canonsrythmiques.free.fr/pdf/RhythmicCanonsPNM.pdf; https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 81, counts-not-conflicting. Read the actual relevant KM paragraph: "Sets in T1 tile with all sets in both T2 and S2. Sets in S1 only tile with sets in T2." Counts are 6,156,12,48. Amiot Figure 10 aligns 156+6 with 48+12; Jedrzejewski Table 1 has 6*60 and 162*12, overlapping on 72. The record's KM excerpt is from a different partition, and its Jedrzejewski excerpt stops before 144. - CONFIRMED | Kolountzakis and Matolcsi state, in one sentence of prose, which rhythm tiles with which partner | https://eigen-space.org/mk/ps/talg.pdf; http://canonsrythmiques.free.fr/pdf/RhythmicCanonsPNM.pdf; https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 82, km-pairing. Read the actual relevant KM paragraph: "Sets in T1 tile with all sets in both T2 and S2. Sets in S1 only tile with sets in T2." Counts are 6,156,12,48. Amiot Figure 10 aligns 156+6 with 48+12; Jedrzejewski Table 1 has 6*60 and 162*12, overlapping on 72. The record's KM excerpt is from a different partition, and its Jedrzejewski excerpt stops before 144. - CONFIRMED | Read Amiot's aligned columns as pairs and you multiply out the one block where nothing tiles at all | https://eigen-space.org/mk/ps/talg.pdf; http://canonsrythmiques.free.fr/pdf/RhythmicCanonsPNM.pdf; https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 84, amiot-aligned-columns. Read the actual relevant KM paragraph: "Sets in T1 tile with all sets in both T2 and S2. Sets in S1 only tile with sets in T2." Counts are 6,156,12,48. Amiot Figure 10 aligns 156+6 with 48+12; Jedrzejewski Table 1 has 6*60 and 162*12, overlapping on 72. The record's KM excerpt is from a different partition, and its Jedrzejewski excerpt stops before 144. - CONFIRMED | add Jedrzejewski's two rows and you count 72 canons twice. | https://eigen-space.org/mk/ps/talg.pdf; http://canonsrythmiques.free.fr/pdf/RhythmicCanonsPNM.pdf; https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 85, jed-double-count. Read the actual relevant KM paragraph: "Sets in T1 tile with all sets in both T2 and S2. Sets in S1 only tile with sets in T2." Counts are 6,156,12,48. Amiot Figure 10 aligns 156+6 with 48+12; Jedrzejewski Table 1 has 6*60 and 162*12, overlapping on 72. The record's KM excerpt is from a different partition, and its Jedrzejewski excerpt stops before 144. - CONFIRMED | The answer is 30,312 | https://eigen-space.org/mk/ps/talg.pdf; git show a77c45dd68:public/strata/which-goes-with-which/data.json | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 87, 144-answer. Independent arithmetic from the published incidence: 6*36 + 3*8640 + 324*6 + 6*60 + 156*12 = 30312. This uses the page's orientation convention, not a total including every dual separately. - CONFIRMED | The working, the grid with its empty block, and every one of those canons playable, are in Which Goes With Which. | git show a77c45dd68:public/strata/which-goes-with-which/index.html | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 89, 144-linked-content. Read the linked page's incidence grid and playback code. Its data include the empty S1-by-S2 block and the selectable canons described here. - CONFIRMED | The engine that decides your rhythm, canons.mjs, is shipped byte-identical to the copy in research/rhythmic-canons/ that the laboratory ran; the verifier asserts the two files hash the same. | git show a77c45dd68:research/rhythmic-canons/verify.mjs | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 92, checking-1. The shipped and laboratory canons.mjs bytes are identical; verifier F1 compares their Buffer contents. F2 checks the recorded SHA-256 manifest, whose index.html entry is currently stale. - CONFIRMED | One shortcut, and it is a proof, not a guess: the sweep at 72 skips rhythms that cannot possibly tile, using the cyclotomic argument described above. | git show a77c45dd68:research/rhythmic-canons/census.c | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 98, filter-proof. Read census.c: generation, periodicity, exact cover and prime-power divisibility are implemented directly. No good-order classification table decides the sweep. The filter tests only necessary conditions and the recorded unfiltered run supplies a positive control. - CONFIRMED | That document calls the twelve-onset set the motif. | http://canonsrythmiques.free.fr/pdf/RhythmicCanonsPNM.pdf; public/strata/no-beat-twice/index.html; src/content/strata/no-beat-twice.md | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 101, motif-label-warning. Amiot p. 7 identifies the twelve-onset inner voice as the motif and gives six such voices with three outer voices. The warning applies to that orientation; Jedrzejewski reverses the inner/outer roles, so it is not a universal terminology rule. This pass uses the current wording after X1 or X9; the original checker wording and qualification remain in N2. - CONFIRMED | D. T. Vuza, Supplementary Sets and Regular Complementary Unending Canons, Perspectives of New Music, four parts, 1991 to 1993. The construction that produces canons with two aperiodic sides. | https://imsc.uni-graz.at/fripertinger/papers/canons.pdf; http://canonsrythmiques.free.fr/pdf/RhythmicCanonsPNM.pdf | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 104, citation-vuza. Fripertinger's references [7]-[10] list the four Vuza parts in Perspectives of New Music: 1991, 1992, 1992, 1993. Amiot p. 6 additionally supports the independent rediscovery clause in the film. - CONFIRMED | F. Jedrzejewski, On the Enumeration of Vuza Canons, arXiv:1304.6609. Its Table 1 gives 72 as three inner voices of six onsets against six outer voices of twelve, and it is the source that attributes each part of the classification to the person who proved it. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 106, citation-jed. Table 1, p. 10: "72 2 2 3 3 2 6 12 3 6" under columns N,n1,p1,n2,p2,n3,|S|,|R|,#S,#R. The opening pages support the historical attributions. - CONFIRMED | E. M. Coven and A. Meyerowitz, Tiling the integers with translates of one finite set, Journal of Algebra 212 (1999), 161 to 174. The conditions (T1) and (T2). | https://api.crossref.org/works/10.1006/jabr.1998.7628 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 108, citation-coven. Fetched and parsed the DOI metadata independently. Authors, titles, journal, year, volume and issue agree. The excerpt assembles JSON fields using ellipses; it is not one contiguous excerpt. - CONFIRMED | E. Amiot, Structures, Algorithms and Algebraic Tools for Rhythmic Canons, Perspectives of New Music 49(2), 2011 | https://api.crossref.org/works/10.7757/persnewmusi.49.2.0093 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 109, citation-amiot2011. Fetched and parsed the DOI metadata independently. Authors, titles, journal, year, volume and issue agree. The excerpt assembles JSON fields using ellipses; it is not one contiguous excerpt. - CONFIRMED | New Perspectives on Rhythmic Canons and the Spectral Conjecture, Journal of Mathematics and Music 3(2), 2009. | https://api.crossref.org/works/10.1080/17459730903040709 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 110, citation-amiot2009. Fetched and parsed the DOI metadata independently. Authors, titles, journal, year, volume and issue agree. The excerpt assembles JSON fields using ellipses; it is not one contiguous excerpt. - CONFIRMED | Worked examples we checked against, and the observation that 72 collapses to two canons up to affine equivalence rather than eighteen up to rotation. | http://canonsrythmiques.free.fr/pdf/RhythmicCanonsPNM.pdf | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 111, affine-two. Amiot p. 7 explicitly says "only two different Vuza canons of period 72 up to affine transformation" and gives the examples. This uses a coarser equivalence than separate rotations. - CONFIRMED | The classification of the cyclic groups in which every factorisation has a periodic factor was assembled between 1950 and 1957 by Hajos, Redei, de Bruijn and Sands. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 112, history-bibliography. Jedrzejewski pp. 1-2 explicitly dates the contributions to Hajos 1950, Redei 1950, de Bruijn 1953 and Sands 1957, then states "N = 72" as the first Vuza order. The displayed good-order forms cover every length below 72. - CONFIRMED | We use it nowhere in the computation; it is quoted only to say what our sweep was expected to find. | git show a77c45dd68:research/rhythmic-canons/census.c | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 113, classification-not-used-bib. Read census.c: generation, periodicity, exact cover and prime-power divisibility are implemented directly. No good-order classification table decides the sweep. The filter tests only necessary conditions and the recorded unfiltered run supplies a positive control. - CONFIRMED | The non-Hajos orders are OEIS A102562, beginning 72, 108, 120, 144. | https://oeis.org/A102562/internal | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 114, non-hajos-orders. OEIS A102562 says "Numbers k such that the cyclic group of order k is not a Hajós group" and begins "72,108,120,144". - CONFIRMED | Factors are counted up to rotation of each side independently, which is the convention that makes a canon a canon rather than a particular performance of one; other papers count up to affine equivalence and get smaller numbers. | git show a77c45dd68:research/rhythmic-canons/census.c | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 115, counting-convention. The algorithms canonicalize each side under translation, and Amiot gives two affine classes at 72. Independent rotations are the stated choice. The treatment of duals is separately inconsistent in entry 116. - CONFIRMED | The audio assigns pitches to voices for legibility; the pitches are not part of the mathematics. | git show a77c45dd68:public/strata/no-beat-twice/index.html | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 117, audio-pitches. PITCHES assigns one frequency per voice; startAudio determines timing only from (a+b)%n. Pitch is a presentation choice. - CONFIRMED | This layer's check reads the bytes this page serves and asserts against them. | git show a77c45dd68:research/rhythmic-canons/verify.mjs | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 118, placard-0. The published verifier was fetched with HTTP 200. It reads the shipped HTML/data/engine and laboratory outputs. In an empty reader directory the given command exits 1 with ERR_MODULE_NOT_FOUND for canons.mjs, exactly the disclosed repository requirement. - CONFIRMED | It is published to read. | git show a77c45dd68:research/rhythmic-canons/verify.mjs | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 120, placard-2. The published verifier was fetched with HTTP 200. It reads the shipped HTML/data/engine and laboratory outputs. In an empty reader directory the given command exits 1 with ERR_MODULE_NOT_FOUND for canons.mjs, exactly the disclosed repository requirement. - CONFIRMED | Running it needs the repository around it. | git show a77c45dd68:research/rhythmic-canons/verify.mjs | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 121, placard-3. The published verifier was fetched with HTTP 200. It reads the shipped HTML/data/engine and laboratory outputs. In an empty reader directory the given command exits 1 with ERR_MODULE_NOT_FOUND for canons.mjs, exactly the disclosed repository requirement. - CONFIRMED | The search ran past its budget of 4,000,000 steps without finding a set of entry times or ruling one out. The laboratory copy of this engine has no budget; this page does, so your tab stays alive. | git show a77c45dd68:public/strata/no-beat-twice/index.html | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 147, interactive-budget. The browser passes 4000000 as the node budget; eachComplement defaults to Infinity in the lab. A budget overrun without a solution selects this explanatory UI branch. This confirms its conditional behavior, not that this exact branch was reached during the audit. - CONFIRMED | No obstruction from the cyclotomic conditions, and yet exhaustive search over every placement finds no set of entry times. This is the case the easy test cannot see. | git show a77c45dd68:public/strata/no-beat-twice/canons.mjs; https://arxiv.org/pdf/math/9802122 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 148, interactive-no-complement. The record's Theorem B1 excerpt concerns T1, not exactly the weaker browser test. A direct positive example settles this claim: A={0,4}, n=12 returns "reason": "search", then zero complements with "complete": true. - CONFIRMED | 5 onsets do not divide 12 beats. Every beat is struck once, so the number of onsets times the number of voices must be exactly 12. | git show a77c45dd68:public/strata/no-beat-twice/index.html; git show a77c45dd68:public/strata/no-beat-twice/canons.mjs | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 153, interactive-size. Recreated obstruction([0,1,2,3,4],12): "5 onsets cannot divide 12 beats evenly". The empty-set guard runs first; the first substantive tiling test is cardinality. - CONFIRMED | Decided without searching. With 4 voices, the cyclotomic factor for 3 has to divide the rhythm, and it does not. | git show a77c45dd68:public/strata/no-beat-twice/index.html; git show a77c45dd68:public/strata/no-beat-twice/canons.mjs | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 154, interactive-cyclotomic. Recreated obstruction([0,1,3],12): "reason": "cyclotomic", "detail": [3]. The UI displays the obstruction before calling complementClasses; the equal-group calculation is implemented by dividesPrimePower. - CONFIRMED | Concretely: sort the onsets by their remainder modulo 3. For that factor to divide, the remainders would have to be spread in 3 equal groups, and they are not. | git show a77c45dd68:public/strata/no-beat-twice/index.html; git show a77c45dd68:public/strata/no-beat-twice/canons.mjs | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 155, interactive-remainders. Recreated obstruction([0,1,3],12): "reason": "cyclotomic", "detail": [3]. The UI displays the obstruction before calling complementClasses; the equal-group calculation is implemented by dividesPrimePower. - CONFIRMED | Give several voices one rhythm and let each enter at a different moment; if you choose well they strike every beat of the cycle exactly once, none doubled, none missed. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 158, frontmatter-dek-0. Definition on p. 1: "each element" is "expressed uniquely" as a sum of an inner and an outer voice. Counting the pairs gives the product of cardinalities. - CONFIRMED | Draw a rhythm and the page searches within a browser budget, naming the algebraic obstruction when there is one. | git show a77c45dd68:public/strata/no-beat-twice/index.html; git show a77c45dd68:public/strata/no-beat-twice/canons.mjs; public/strata/no-beat-twice/index.html; src/content/strata/no-beat-twice.md | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 159, frontmatter-dek-1. The implemented method is exhaustive exact cover, after the necessary obstruction test. Browser qualifications matter: "const BUDGET = 4000000" and "undecided here" are explicit, and the list stops at 200 classes. Read "exhaustive" as the search method, not an unconditional promise to finish. This pass uses the current wording after X1 or X9; the original checker wording and qualification remain in N2. - CONFIRMED | Several drummers play the same pattern, each starting at a different time. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 162, frontmatter-plain-0. Definition on p. 1: "each element" is "expressed uniquely" as a sum of an inner and an outer voice. Counting the pairs gives the product of cardinalities. - CONFIRMED | Sometimes they fit together so that every beat gets exactly one hit. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 163, frontmatter-plain-1. Definition on p. 1: "each element" is "expressed uniquely" as a sum of an inner and an outer voice. Counting the pairs gives the product of cardinalities. - CONFIRMED | This page lets you draw a pattern and searches for entry times, sometimes stopping before it can decide, and it shows the smallest case where neither the pattern nor the entry times repeat themselves. | git show a77c45dd68:public/strata/no-beat-twice/index.html; git show a77c45dd68:public/strata/no-beat-twice/canons.mjs; public/strata/no-beat-twice/index.html; src/content/strata/no-beat-twice.md | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 164, frontmatter-plain-2. The implemented method is exhaustive exact cover, after the necessary obstruction test. Browser qualifications matter: "const BUDGET = 4000000" and "undecided here" are explicit, and the list stops at 200 classes. Read "exhaustive" as the search method, not an unconditional promise to finish. This pass uses the current wording after X1 or X9; the original checker wording and qualification remain in N2. - CONFIRMED | An immersive layer; it renders as its own standalone page at the `href` above (source: `public/strata/no-beat-twice/index.html`). | git show a77c45dd68:src/pages/strata/[...slug].astro | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 165, md-body-0-0. The route filters entries with href via "!s.data.href"; the public standalone HTML supplies this immersive page, so this markdown body is not rendered at its href. - CONFIRMED | This file exists so the layer rests on the ground with the others, and its body is not rendered. | git show a77c45dd68:src/pages/strata/[...slug].astro | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 166, md-body-0-1. The route filters entries with href via "!s.data.href"; the public standalone HTML supplies this immersive page, so this markdown body is not rendered at its href. - CONFIRMED | Write the beats of a cycle as `0, 1, ... n-1` and count round. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 167, md-body-1-0. Definition on p. 1: "each element" is "expressed uniquely" as a sum of an inner and an outer voice. Counting the pairs gives the product of cardinalities. - CONFIRMED | A rhythm is a set of those numbers. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 168, md-body-1-1. Definition on p. 1: "each element" is "expressed uniquely" as a sum of an inner and an outer voice. Counting the pairs gives the product of cardinalities. - CONFIRMED | Starting the same rhythm at beat `b` shifts every onset by `b`. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 169, md-body-1-2. Definition on p. 1: "each element" is "expressed uniquely" as a sum of an inner and an outer voice. Counting the pairs gives the product of cardinalities. - CONFIRMED | So a canon in which nobody doubles anybody is a piece of arithmetic: a set of onsets `A` and a set of entry times `B` such that every beat is `a + b` for exactly one pair. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 170, md-body-1-3. Definition on p. 1: "each element" is "expressed uniquely" as a sum of an inner and an outer voice. Counting the pairs gives the product of cardinalities. - CONFIRMED | The page is that question, made operable. | git show a77c45dd68:public/strata/no-beat-twice/index.html; git show a77c45dd68:public/strata/no-beat-twice/canons.mjs | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 171, md-body-1-4. The implemented method is exhaustive exact cover, after the necessary obstruction test. Browser qualifications matter: "const BUDGET = 4000000" and "undecided here" are explicit, and the list stops at 200 classes. Read "exhaustive" as the search method, not an unconditional promise to finish. - CONFIRMED | Click a ring of beats to draw a rhythm; the page looks for entry times that complete it, answering without a search when the cyclotomic obstruction is visible and searching within a browser budget otherwise. When it finds a tiling, it draws the grid in which every column carries exactly one strike. | git show a77c45dd68:public/strata/no-beat-twice/index.html; git show a77c45dd68:public/strata/no-beat-twice/canons.mjs; public/strata/no-beat-twice/index.html; src/content/strata/no-beat-twice.md | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 172, md-body-1-5. The implemented method is exhaustive exact cover, after the necessary obstruction test. Browser qualifications matter: "const BUDGET = 4000000" and "undecided here" are explicit, and the list stops at 200 classes. Read "exhaustive" as the search method, not an unconditional promise to finish. This pass uses the current wording after X1 or X9; the original checker wording and qualification remain in N2. - CONFIRMED | Several voices play one rhythm at different entry times and between them strike every beat of the cycle exactly once. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 179, meta-1-0. Definition on p. 1: "each element" is "expressed uniquely" as a sum of an inner and an outer voice. Counting the pairs gives the product of cardinalities. - CONFIRMED | Draw a rhythm and this page searches within a browser budget for entry times that work. | git show a77c45dd68:public/strata/no-beat-twice/index.html; git show a77c45dd68:public/strata/no-beat-twice/canons.mjs; public/strata/no-beat-twice/index.html; src/content/strata/no-beat-twice.md | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 180, meta-1-1. The implemented method is exhaustive exact cover, after the necessary obstruction test. Browser qualifications matter: "const BUDGET = 4000000" and "undecided here" are explicit, and the list stops at 200 classes. Read "exhaustive" as the search method, not an unconditional promise to finish. This pass uses the current wording after X1 or X9; the original checker wording and qualification remain in N2. - CONFIRMED | Below 72 beats one of the two patterns is always a shorter pattern repeated. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 181, meta-1-2. Jedrzejewski pp. 1-2 explicitly dates the contributions to Hajos 1950, Redei 1950, de Bruijn 1953 and Sands 1957, then states "N = 72" as the first Vuza order. The displayed good-order forms cover every length below 72. - CONFIRMED | Several voices play one rhythm at different entry times and strike every beat exactly once. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 182, meta-6-0. Definition on p. 1: "each element" is "expressed uniquely" as a sum of an inner and an outer voice. Counting the pairs gives the product of cardinalities. - CONFIRMED | Draw a rhythm; the page searches within a browser budget. | git show a77c45dd68:public/strata/no-beat-twice/index.html; git show a77c45dd68:public/strata/no-beat-twice/canons.mjs; public/strata/no-beat-twice/index.html; src/content/strata/no-beat-twice.md | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 183, meta-6-1. The implemented method is exhaustive exact cover, after the necessary obstruction test. Browser qualifications matter: "const BUDGET = 4000000" and "undecided here" are explicit, and the list stops at 200 classes. Read "exhaustive" as the search method, not an unconditional promise to finish. This pass uses the current wording after X1 or X9; the original checker wording and qualification remain in N2. - CONFIRMED | Below 72 beats one pattern always repeats itself. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 184, meta-6-2. Jedrzejewski pp. 1-2 explicitly dates the contributions to Hajos 1950, Redei 1950, de Bruijn 1953 and Sands 1957, then states "N = 72" as the first Vuza order. The displayed good-order forms cover every length below 72. - CONFIRMED | Draw a rhythm; the page searches within a browser budget for copies that fill a cycle with no beat struck twice. | git show a77c45dd68:public/strata/no-beat-twice/index.html; git show a77c45dd68:public/strata/no-beat-twice/canons.mjs; public/strata/no-beat-twice/index.html; src/content/strata/no-beat-twice.md | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 186, meta-14-0. The implemented method is exhaustive exact cover, after the necessary obstruction test. Browser qualifications matter: "const BUDGET = 4000000" and "undecided here" are explicit, and the list stops at 200 classes. Read "exhaustive" as the search method, not an unconditional promise to finish. This pass uses the current wording after X1 or X9; the original checker wording and qualification remain in N2. - CONFIRMED | Below 72 beats, one pattern always repeats. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 187, meta-14-1. Jedrzejewski pp. 1-2 explicitly dates the contributions to Hajos 1950, Redei 1950, de Bruijn 1953 and Sands 1957, then states "N = 72" as the first Vuza order. The displayed good-order forms cover every length below 72. - CONFIRMED | A ring of beats. Filled dots are the onsets of your rhythm; empty dots are rests. Click a dot to add or remove an onset. | git show a77c45dd68:public/strata/no-beat-twice/index.html | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 197, aria-ring. drawRing assigns class "on" exactly to members of A, and the click handler toggles the clicked residue before refresh. This confirms the accessibility description. - CONFIRMED | One row per voice, one column per beat. A filled cell is a strike. Every column carries exactly one. | git show a77c45dd68:public/strata/no-beat-twice/index.html | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 198, aria-grid. buildGrid computes each hit as "(a + b) % n_" and counts each column. Independent arithmetic confirms every column of all 18 selected canons is one. The extra thin summary row reports those counts. - CONFIRMED | The chosen canon: one row per voice, one column per beat. | git show a77c45dd68:public/strata/no-beat-twice/index.html | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 199, aria-canon-grid. buildGrid computes each hit as "(a + b) % n_" and counts each column. Independent arithmetic confirms every column of all 18 selected canons is one. The extra thin summary row reports those counts. - CONFIRMED | The other great way to choose k beats out of n. | git show a77c45dd68:public/strata/euclidean-rhythms/index.html; git show a77c45dd68:public/strata/no-beat-twice/index.html | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 200, related-euclidean-rhythms-0. The related layer displays a cyclic ring instrument for onset sets; this page displays a ring for one voice plus a translated-voice grid. "Great" is a value judgment and is not audited. - CONFIRMED | There the beats are spread as evenly as one rhythm can be spread; here several copies of one rhythm interlock so that the whole cycle is covered exactly once. | https://cgm.cs.mcgill.ca/~godfried/publications/banff.pdf; https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 201, related-euclidean-rhythms-1. Toussaint's abstract says Euclidean onset patterns are "distributed as evenly as possible". Unique sum factorization supplies the contrasting multi-voice tiling property. - CONFIRMED | Evenness is a property of one voice, tiling is a property of a chorus, and the ring instrument is the same ring. | git show a77c45dd68:public/strata/euclidean-rhythms/index.html; git show a77c45dd68:public/strata/no-beat-twice/index.html | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 202, related-euclidean-rhythms-2. The related layer displays a cyclic ring instrument for onset sets; this page displays a ring for one voice plus a translated-voice grid. "Great" is a value judgment and is not audited. - CONFIRMED | Spheres that fill the message space with no gap and no overlap, and a necessary arithmetic condition that turns out not to be sufficient (the phantom code that passes every count and cannot exist). | https://pure.tue.nl/ws/files/1941369/593583.pdf | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 203, related-perfect-codes-0. Opened the scanned source, rendered and OCRed only printed pp. 89-90. Van Lint defines disjoint spheres filling V and says e=2, q=2, n=90 satisfy the arithmetic condition although no such perfect code exists. This directly supports the related-note example. - CONFIRMED | The same house move on a different arrangement: enumerate every case exhaustively, then find the arithmetic law that says which sizes are possible at all. | git show a77c45dd68:public/strata/langford-pairings/index.html | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 205, related-langford-pairings-0. The linked layer explicitly enumerates Langford pairings and presents the residue-class existence law. This is a description of that instrument. - CONFIRMED | There it is n mod 4; here it is which divisors of n each side must carry. | https://arxiv.org/pdf/1507.00315 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 206, related-langford-pairings-1. The cited paper states existence "iff n ≡ 0, 3 mod 4". Cyclotomic factors indexed by divisors are the algebraic classification used here. - CONFIRMED | Also arithmetic in Z_n read as music, also a clock face you can operate. | git show a77c45dd68:public/strata/deep-scales/index.html | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 207, related-deep-scales-0. The linked page represents scales as subsets of Z_n with an operable circle and audio. - CONFIRMED | Deep scales are classified by their interval multiplicities; canons are classified by which cyclotomic factors each side takes, and both turn a listening question into a divisor question. | https://cgm.cs.mcgill.ca/~godfried/publications/deep.rhythms.cccg05.pdf; http://canonsrythmiques.free.fr/pdf/RhythmicCanonsPNM.pdf | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 208, related-deep-scales-1. The deep-rhythm paper defines the property by interval multiplicities. Amiot Figure 10 explicitly classifies Vuza canons by cyclotomic-index sets. This is a coarse classification; it does not assert that an index set uniquely identifies a canon. The record's excerpt for 208 covers only the deep-scale half. - CONFIRMED | Aperiodicity and tiling, in the plane and in a cycle. | https://cs.uwaterloo.ca/~csk/hat/; https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 209, related-aperiodic-monotile-0. The hat authors say it tiles the plane "but never periodically". Jedrzejewski identifies 72 as the first Vuza order. "No repetition" is read as absence of a global translational period, not absence of repeated local patches. - CONFIRMED | The hat tiles with no repetition at all; the Vuza canons are the first cycle length at which both halves of a factorisation can refuse to repeat, and 72 beats is where that starts. | https://cs.uwaterloo.ca/~csk/hat/; https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 210, related-aperiodic-monotile-1. The hat authors say it tiles the plane "but never periodically". Jedrzejewski identifies 72 as the first Vuza order. "No repetition" is read as absence of a global translational period, not absence of repeated local patches. - CONFIRMED | Number sounded rather than shown: there permutations rung as bells, here a factorisation of a cyclic group played as twelve entries of one rhythm. | git show a77c45dd68:public/strata/plain-changes/index.html; git show a77c45dd68:public/strata/no-beat-twice/index.html | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 211, related-plain-changes-0. The related page implements permutations as bell sequences, and this page plays twelve translated voices. The sentence about belief through hearing is subjective and supplies no additional testable claim. - CONFIRMED | Both are structures you can only really believe once you hear them close. | git show a77c45dd68:public/strata/plain-changes/index.html; git show a77c45dd68:public/strata/no-beat-twice/index.html | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 212, related-plain-changes-1. The related page implements permutations as bell sequences, and this page plays twelve translated voices. The sentence about belief through hearing is subjective and supplies no additional testable claim. - CONFIRMED | canons are classified by which cyclotomic factors each side takes | https://cgm.cs.mcgill.ca/~godfried/publications/deep.rhythms.cccg05.pdf; http://canonsrythmiques.free.fr/pdf/RhythmicCanonsPNM.pdf | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 214, related-canon-cyclotomic. The deep-rhythm paper defines the property by interval multiplicities. Amiot Figure 10 explicitly classifies Vuza canons by cyclotomic-index sets. This is a coarse classification; it does not assert that an index set uniquely identifies a canon. The record's excerpt for 208 covers only the deep-scale half. - CONFIRMED | The hat tiles with no repetition at all | https://cs.uwaterloo.ca/~csk/hat/; https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 215, related-hat. The hat authors say it tiles the plane "but never periodically". Jedrzejewski identifies 72 as the first Vuza order. "No repetition" is read as absence of a global translational period, not absence of repeated local patches. - CONFIRMED | Give several voices one rhythm and let each enter at a different moment. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 217, film-caption-titleLine1. Definition on p. 1: "each element" is "expressed uniquely" as a sum of an inner and an outer voice. Counting the pairs gives the product of cardinalities. - CONFIRMED | If you choose well they strike every beat of the cycle exactly once. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 218, film-caption-titleLine2. Definition on p. 1: "each element" is "expressed uniquely" as a sum of an inner and an outer voice. Counting the pairs gives the product of cardinalities. - CONFIRMED | One row per voice, one column per beat. | git show a77c45dd68:public/strata/no-beat-twice/index.html | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 220, film-caption-ruleA. buildGrid computes each hit as "(a + b) % n_" and counts each column. Independent arithmetic confirms every column of all 18 selected canons is one. The extra thin summary row reports those counts. - CONFIRMED | Every column carries exactly one mark. No beat doubled, no beat missed. | git show a77c45dd68:public/strata/no-beat-twice/index.html | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 221, film-caption-ruleB. buildGrid computes each hit as "(a + b) % n_" and counts each column. Independent arithmetic confirms every column of all 18 selected canons is one. The extra thin summary row reports those counts. - CONFIRMED | A rhythm is a set of numbers on a clock face. Starting it at beat b shifts every onset by b. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 222, film-caption-arithA. Definition on p. 1: "each element" is "expressed uniquely" as a sum of an inner and an outer voice. Counting the pairs gives the product of cardinalities. - CONFIRMED | So every beat of the cycle should be a + b for exactly one onset a and one entry b. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 223, film-caption-arithB. Definition on p. 1: "each element" is "expressed uniquely" as a sum of an inner and an outer voice. Counting the pairs gives the product of cardinalities. - CONFIRMED | The strikes are all distinct, so the two sizes multiply to the length of the cycle. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 224, film-caption-arithC. Definition on p. 1: "each element" is "expressed uniquely" as a sum of an inner and an outer voice. Counting the pairs gives the product of cardinalities. - CONFIRMED | At seventy-two beats it breaks. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 230, film-caption-seventyA. Jedrzejewski pp. 1-2 explicitly dates the contributions to Hajos 1950, Redei 1950, de Bruijn 1953 and Sands 1957, then states "N = 72" as the first Vuza order. The displayed good-order forms cover every length below 72. - CONFIRMED | Seventy-two is the smallest cycle that is not on the list. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 236, film-caption-edges1a. Jedrzejewski pp. 1-2 explicitly dates the contributions to Hajos 1950, Redei 1950, de Bruijn 1953 and Sands 1957, then states "N = 72" as the first Vuza order. The displayed good-order forms cover every length below 72. - CONFIRMED | The cycle lengths in which every canon must have a repeating side were classified between 1950 and 1957, by Hajos, Redei, de Bruijn and Sands. | https://arxiv.org/pdf/1304.6609 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 237, film-caption-edges1b. Jedrzejewski pp. 1-2 explicitly dates the contributions to Hajos 1950, Redei 1950, de Bruijn 1953 and Sands 1957, then states "N = 72" as the first Vuza order. The displayed good-order forms cover every length below 72. - CONFIRMED | Dan Tudor Vuza arrived from the music. | http://canonsrythmiques.free.fr/pdf/RhythmicCanonsPNM.pdf | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 238, film-caption-edges2a. Amiot states that Vuza managed "all by himself" the rediscovery and proof of results of the generation working on Hajos's conjecture. The surrounding discussion is explicitly about the musical problem. - CONFIRMED | He worked out how to construct canons with two aperiodic sides in Perspectives of New Music, in four parts, between 1991 and 1993, and rediscovered the group theory on his own. | https://imsc.uni-graz.at/fripertinger/papers/canons.pdf; http://canonsrythmiques.free.fr/pdf/RhythmicCanonsPNM.pdf | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 239, film-caption-edges2b. Fripertinger's references [7]-[10] list the four Vuza parts in Perspectives of New Music: 1991, 1992, 1992, 1993. Amiot p. 6 additionally supports the independent rediscovery clause in the film. - CONFIRMED | The question underneath is still open. | https://personal.math.ubc.ca/~ilaba/preprints/T2-even.pdf | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 240, film-caption-edges3a. Laba-Londner p. 2 says "The main open problem concerning integer tilings" is whether the conditions hold for all finite tiles. Since T1 is necessary, a tile failing T2 would disprove the conjecture. The general problem is distinct from the settled small periods. - CONFIRMED | Whether the Coven and Meyerowitz condition (T2) is necessary was open in 1999 and is open now. This sweep is no evidence either way: every rhythm in it has a size with at most two distinct prime factors, which is where (T2) is already a theorem. | https://personal.math.ubc.ca/~ilaba/preprints/T2-even.pdf | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 241, film-caption-edges3b. The general conjecture remains open. The filmed sweep has only smaller factors with at most two distinct primes and is inside the theorem's region. This statement does not claim the separate sixty-beat probe is unproved. - CONFIRMED | (added) 3 of 12 | git show a77c45dd68:public/strata/no-beat-twice/index.html:548 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 253, added-default-ring-count. The initial state is n=12 and A=[0,1,2]; drawRing renders A.length of n. The source record mentions this in record_notes but has no claim entry. - CONFIRMED | (added) 0 1 2 | git show a77c45dd68:public/strata/no-beat-twice/index.html:548 | N2 checker reread, retained from research/assay-line/queue-1018/no-beat-twice/N2-codex.md: Entry 254, added-default-ring-onsets. drawRing renders A.join with spaces from the initial state [0,1,2]. This label was likewise only in record_notes. - MINOR | ...an onset detector that is told nothing about the score, and which goes red if a single strike is removed. | social/bluesky/dossiers/2026-11-06-past-the-edge/ (drop-sweep.mjs, out/drop-sweep-summary.txt); research/rhythmic-canons/film/film-facts.mjs (const DROP = 137) | X18; mutation-control-generalised. Found 2026-11-06 by claude-elegant-cori-tt5l2w while testing a rule proposed by @bokonon.ai on Bluesky. film-facts.mjs removes one strike (137, beat 1:0) and goes red. Re-rendered with make-audio.mjs --drop= for each of the 216 strikes in the window [116, 152): 67 leave the gate green, a ripple at 1.02x to 3.39x the median flux standing within 20 ms of the empty beat. Recomputed for 137, 69 (0:4), 156 (1:19) and 239 (2:30) with the separate harness social/bluesky/dossiers/2026-10-20-unrun-half/gate.mjs: 137 red, the other three green. An overstatement of the page's own checking, so MINOR under assay/README.md step 4. ## Findings - [fixed] X1 (MINOR, bounded-browser-search): Bounded the browser-search promise in the introduction, fallback explanation, metadata, JSON-LD, markdown dek, plain text and body. Review-and-repair also removed the remaining promise to visit every factorisation and reconciled the two carried search claims with the current page and engine. No page correction for this MINOR wording. - [fixed] X2 (WRONG, laba-acceptance-date): Changed the paper acceptance date to 20 February 2025 in the page, README and generated literature data. One dated correction shared with X10. - [fixed] X3 (MINOR, conditions-census-range): Limited the 347,932-rhythm conditions census to its recorded range through 42 in the page and README. No new measurement and no page correction for this MINOR precision fix. - [fixed] X4 (WRONG, period-sixty-unproved): Replaced the supposed unknown case within 72 beats with Amiot's settled range through 180; shared the period-sixty-unproved correction with X5-X7. - [fixed] X5 (WRONG, period-sixty-unproved): Replaced the unproved-family assertion in the page, research README, conditions generator and generated data description. Review-and-repair also corrected the missed conditions.mjs inventory row in the README. The generator refreshes descriptions without changing any recorded measurement. - [fixed] X6 (WRONG, period-sixty-unproved): Described the 5,378-class probe as checking a known result, with the largest family sampled. Shared the X4 dated correction. - [fixed] X7 (WRONG, period-sixty-unproved): Removed the invitation to select the unavailable sixty-beat cycle and explained that the offered periods are settled. The shared X4 correction also states that there is no sixty-beat option. - [fixed] X8 (MINOR, anchored-complement-count): Added the beat-zero anchoring convention to the 2^26 count in the page, README and verifier label. No page correction for this MINOR normalization fix. - [fixed] X9 (WRONG, enumeration-quotation): Restored the source's two separate quotations, identified the unsigned RTF separately from Fripertinger's compendium, and updated the matching attributions, data labels and verifier descriptions. Added a dated correction; checker MINOR became WRONG with direct source evidence. - [fixed] X10 (WRONG, laba-acceptance-date): Corrected the bibliography acceptance date, using the same dated correction and error label as X2. - [fixed] X11 (WRONG, vuza-duals-counted-once): Separated ordered all-canon pairs from the Vuza count that identifies duals. Added a dated correction: eighteen at 72 beats corresponds to thirty-six ordered pairs. - [dated] X12 (STALE, placard-verification-date): Placard metadata exception. The new record supplies passed: 2026-10-18 for landing to rebuild the generated Last verified date. The placard is not hand-edited here; no Updated line is added. - [fixed] X13 (WRONG, census-completeness): Named unfinished composite lengths 46 and 49 in the census note and README, clarified that prime cycles have excluded trivial factorisations, and changed E17 to assert only the largest completed length. Added a dated correction. - [fixed] X14 (MINOR, incomplete-search-count): Changed the shared interrupted-search message from More than to At least at the 200-class cutoff. This MINOR item adds no separate line; the same implementation fixes WRONG X17. - [dated] X15 (STALE, article-modification-date): Metadata exception: changed Article dateModified from 2026-08-16 to 2026-10-18. No Updated line; the Corrected lines date the revision. - [fixed] X16 (WRONG, conditions-necessary): Changed the perfect-codes relation note to T1 necessary and T1 plus T2 sufficient, with general T2 necessity open. Added the dated correction to HTML and markdown. - [fixed] X17 (WRONG, incomplete-search-count): Changed the incomplete-result message to At least, including singular grammar for one class. Added a dated correction explaining the former false More than 1 result. - [fixed] X18 (MINOR, mutation-control-generalised): The film caption said the check goes red if a single strike is removed. It now says the control removes strike 137 and goes red, and that 67 of the 216 strikes it reads leave it green when deleted one at a time, with the reason. research/rhythmic-canons/verify.mjs registers 137 (read from film-facts.mjs) and 216 for G1. No page correction for this MINOR wording. The gate itself is unchanged.