{"id":"02253fb5-4b76-43d2-8af1-18acc910ae53","arxiv_id":"2412.21145","paper_version":2,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":3.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"The words 0011 and 001011 are claimed to be the shortest 'interesting' binary words, illustrated through many existing and a few new results.","lead":"This paper argues that the binary words 0011 and 001011 are the 'shortest interesting' binary words because they appear as extremal examples across dozens of results in combinatorics on words. The paper surveys many known theorems and adds a few small new observations about palindromic structure and Lyndon factorizations.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The abstract's 'shortest interesting' is not a theorem: the paper never defines interestingness or compares v and w systematically with shorter candidates, so the surveyed evidence cannot establish minimality.","rationale":"The reader's weakest assumption identifies exactly the soft spot: the central claim is a subjective value judgment disguised as a mathematical one. My reading confirms that the paper is a valuable collection of known results and minor observations about two specific words, but it does not provide a mechanism for deciding whether any other short word is 'more interesting'. The proposed empirical test would make the claim checkable, but because the author does not supply the needed definition, the correct verdict remains conditional rather than a clean accept. I also noticed a small technical slip in Proposition 1: the palindrome 010 has derivative 02, which is an anti-palindrome over the ternary alphabet, contradicting the assertion that the derivative of a palindrome is never an anti-palindrome. This is peripheral to the central claim and does not change the verdict, but it is a concrete correctness issue that a revision should fix.","tokens_in":13733,"tokens_out":12351,"duration_ms":162961,"concrete_test":"Define a fixed scoring rule using exactly the extremal or canonical properties mentioned in Sections 2–5 (rich, Lyndon with multiple factorizations, Dyck, minimal unbalanced, maximal number of distinct factors, asymmetric, minimal palindromic length, etc.). Enumerate every binary word of length at most 6 and compute the number of properties for which each word is the unique shortest or extremal example. If any word of length less than 4 or of length 5 ties or exceeds the scores of v and w, the 'shortest' claim fails under the paper's own evidence. Publish the property list and scoring weights before running the enumeration to avoid post hoc selection.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The load-bearing step is informal and unfalsifiable as stated. 'Interesting' is never defined, and the paper gives no criterion for which properties count, how they are weighted, or why the list in Sections 2–5 is representative. The evidence shows that v and w recur in many named contexts, but it does not show that no shorter binary word is at least as interesting. Candidates such as 01, 10, 010, or 0110 are dismissed as 'too trivial' rather than shown to be less interesting. The conclusion 'shortest interesting binary words' therefore depends on an implicit aesthetic judgment, and the same survey method could be used to make other short words look special by selecting a different set of properties. A precise version of the claim would need either a formal definition of interestingness or an explicit restriction to a stated class of properties, after which minimality could actually be checked.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper argues that the binary words v=0011 and w=001011 are 'the shortest interesting binary words.' The argument is a survey: the author lists numerous properties (anti-palindromes, rich words, palindromic length, Lyndon factorizations, runs, de Bruijn words, balanced/unbalanced words, attractors, bispecial factors, etc.) for which v and w are extremal or characteristic examples, with citations to the literature and a few short propositions.","tokens_in":13856,"tokens_out":4935,"duration_ms":47673,"significance":"If the central claim were made precise, the paper could serve as a useful annotated bibliography of properties shared by two small words. Its value as a survey is real: it collects a large number of known theorems and examples in one place. However, the central assertion is not a theorem: 'interesting' is undefined, and minimality is not established by the evidence. The manuscript's strength is its compilation of references; its weakness is the mismatch between the title/abstract claim and the informal evidence.","major_comments":[{"comment":"The central claim 'the shortest interesting binary words' is not precisely defined. The paper never specifies what makes a binary word 'interesting', which properties count, how they are weighted, or why the list in Sections 2-5 is representative. As a result, the minimality claim cannot be checked, and the conclusion is an aesthetic judgment rather than a theorem. The author's own hedge ('probably the shortest binary words that are not too trivial', Section 1) acknowledges this. Either define the class of properties under which minimality is asserted and prove it, or restate the aim as a survey of notable properties of v and w.","section":"Abstract and Section 1"},{"comment":"Several 'shortest' or 'minimal' assertions are load-bearing for the paper's claim but are cited without proof or precise theorem numbers, e.g. 'no binary word of length smaller than 6 is asymmetric' (Section 2), 'w=001011 is a binary word of minimal length having palindromic length 3' (Section 2), 'the maximal value of sigma for a word of length 6 is 6, realized by w' (Section 3), and 'the shortest binary word having no attractor of size 2 is w' (Section 5). For each such statement, please provide the exact source (theorem number and page) or a proof, since the survey's cumulative evidence depends on these facts.","section":"Sections 2, 3, and 5"},{"comment":"The selection of properties is not justified against alternative short words. The paper does not compare v and w with 01, 10, 010, or 0110 under any systematic criterion, and 'too trivial' is never made precise. A different but equally defensible list of properties (e.g., being a palindrome, being a square, having a square factor) would single out other short words, so the evidence as presented cannot rule out a shorter 'interesting' word. The paper needs either a formalization of interestingness or an explicit statement that the claim is about the particular list of properties surveyed.","section":"Section 1"}],"minor_comments":[{"comment":"In the proof, 'the derivative of a palindrome is either the word 1n' should read '1^n' (the word consisting of n copies of the character 1).","section":"Section 2, Proposition 1"},{"comment":"The word 'morphsim' should be 'morphism'.","section":"Section 3"},{"comment":"The definition of an anti-square as 'a word of the form uu, where u is the complement of u' is self-contradictory; presumably the intended definition is u followed by the complement of u. Please correct.","section":"Section 3"},{"comment":"The phrase 'this can be proved by exercise' should be replaced by a reference or a short proof.","section":"Section 4"}],"recommendation":"major_revision","confidential_remarks":"The paper would be more appropriately framed as a survey of two noteworthy words; the title and abstract currently overclaim. The author may want to discuss with the editor whether the venue accepts expository work of this kind."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Read this if you want a single place that assembles the many known extremal roles of 0011 and 001011. The paper is a well-organized survey, and the bibliography looks solid. It collects facts about palindromic richness, runs, Lyndon factorizations, de Bruijn properties, Dyck words, anti-squares, minimal forbidden factors, and more, and shows how often these two words are the extremal or characteristic examples. As a reference and teaching aid, that is genuinely useful.\n\nThe genuinely new content is small: Propositions 3 and 4 on Pansiot pre-palindromes and pre-antipalindromes, Proposition 6 on shortest words with n Lyndon factorizations, and Proposition 9 on highly bispecial words. These are simple observations with sketch proofs. They look correct to me, though Proposition 6's one-line proof would need expansion if published as a research contribution.\n\nThe soft spot is exactly what the stress-test flags: 'shortest interesting' is never defined. 'Interesting' is a sociological property, measured by appearances in the literature, not a formal one. The paper says 'probably the shortest binary words that are not too trivial' and never gives a criterion for counting properties, weighting them, or excluding shorter candidates like 01, 010, or 0110. That makes the headline claim unfalsifiable as stated. The survey supports 'these two words are exceptionally well represented in combinatorics on words,' but it does not support a minimality claim. The abstract's 'I will show' overpromises.\n\nThere are also minor issues: some minimality assertions are simply cited from the literature, which is fine in a survey, but the exceptions in Proposition 9 deserve a real proof rather than 'sketch of proof.' And the paper introduces new terminology (Pansiot pre-palindrome, highly bispecial) without much motivation beyond the two example words; that is acceptable in an expository paper but should be flagged as such.\n\nIf I were the editor, I would send this to peer review with a request to reframe. The survey is worth publishing as an expository note, but the 'shortest interesting' claim should be either restricted to an explicit class of properties—where minimality could be checked—or honestly labeled as a conjecture and a motivational narrative. As written, the central claim is informal, but the underlying compilation is accurate and useful.","headline":"A pleasant, useful survey of two very special binary words, but the 'shortest interesting' claim is an aesthetic judgment dressed up as a theorem.","tokens_in":14360,"tokens_out":1814,"would_cite":false,"duration_ms":19600,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["68R15"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper argues that the binary words 0011 and 001011 are the shortest interesting binary words, since each is the shortest or unique example across dozens of distinct problems in combinatorics on words.","keywords":["combinatorics on words","binary words","palindromes","anti-palindromes","Lyndon words","de Bruijn words","rich words","runs"],"falsifier":"A literature-wide count of distinct properties for which each binary word of length at most 5 is the shortest or unique example; if any such word matches or exceeds the number of properties realized by 0011 and 001011, the claim of minimality fails.","tokens_in":13517,"feed_emoji":"🔤","tokens_out":10705,"duration_ms":89467,"temperature":0.7,"pith_summary":"The paper tries to establish that two specific binary words, v=0011 and w=001011, are the shortest 'interesting' binary words. It argues for this by showing that, across a wide range of classical problems in combinatorics on words, these two words are the shortest or the unique example: v is the shortest word with two primitive square factors, the smallest Dyck shuffle square, and the lexicographically least de Bruijn word of order 2; w is the unique asymmetric binary word of length 6, the shortest word with palindromic length 3, the generator of an infinite word with the minimum possible number of palindromic factors, and the lexicographically least generalized de Bruijn word of order 3. If the claim is right, these two small words occupy a special structural position in the field, and many extremal results can be illustrated or tested using them.","feed_headline":"Two words, length 4 and 6, are the shortest interesting binary words","feed_subtitle":"A survey shows 0011 and 001011 recur as extremal examples across palindromes, Lyndon words, de Bruijn words, and more.","key_machinery":"The paper is carried by the two concrete binary words v=0011 and w=001011. In the diagonal lattice representation (0 encodes a downstep, 1 an upstep), v traces a V and w traces a W, and the paper shows that both words reappear as extremal examples across a broad set of definitions: palindromes, anti-palindromes, rich words, Lyndon words, Dyck words, de Bruijn words, runs, bispecial factors, minimal forbidden factors, attractors, balanced words, and shuffle squares. Their role is to serve as the minimal or unique nontrivial instances where these notions take their extreme values, with the supporting results borrowed from the literature and, in places, given short proofs or sketches.","core_discovery":"The central claim is that v=0011 and w=001011 are the shortest binary words that can reasonably be called interesting, because each is the shortest or unique example for a long list of properties studied in combinatorics on words. The paper demonstrates this by surveying properties: v is an anti-palindrome (its mirror image differs in every position), a Lyndon word, a Dyck word, a rich word, a minimal anti-square, the shortest word with two primitive rooted squares, the lexicographically least binary de Bruijn word of order 2, and a word with the maximum number of distinct factors for its length; w is the unique asymmetric binary word of length 6, a word of palindromic length 3 that is minimal with this property, the shortest word with no attractor of size 2, a word whose rotations are all rich while its square is not, the lexicographically least generalized de Bruijn word of order 3, and the generator of an infinite periodic word containing the minimum possible number of palindromic factors.","pith_inferences":["A natural quantitative extension of the paper's thesis would be to score every binary word of length at most 6 by how many distinct extremal properties it realizes; the prediction is that v and w (together with their mirror images and complements) dominate, and that no word of length 5 or less has a comparable profile.","The same 'shortest interesting words' question could be posed over larger alphabets or for circular words, where an analogous small set of words might concentrate the extremal behaviors.","The morphisms built from w in the paper (e.g., 0 ↦ 0w, 1 ↦ w) suggest a general recipe for constructing infinite binary words with very few palindromic factors, which could be tested beyond the aperiodic example given.","Since w∞ has the minimal palindromic-factor count, w could serve as a benchmark input for algorithms that count or avoid palindromes in streams."],"forward_implications":["Any general theorem about binary words of length at most 6 must account for v and w, since they already realize the extremal values of many classical parameters.","The infinite word w∞ is, up to rotation and complement, the unique binary word with the minimum possible 9 distinct palindromic factors, making it the natural extremal example for palindromic-factor lower bounds.","The sharp bound 7 in the overlap-free factorization theorem is pinned down by w, which has two distinct overlap-free decompositions.","The words v and w are respectively the lexicographically least binary de Bruijn word of order 2 and the lexicographically least generalized binary de Bruijn word of order 3, so they sit at the start of the standard de Bruijn constructions.","Because w is a rotation of its own Burrows-Wheeler transform, it provides a rare small example relevant to the open problem of characterizing BWT fixed points."],"supporting_citations":[{"why":"Proves that no binary word of length smaller than 6 is asymmetric and that the orbit of w is the unique asymmetric orbit of length 6.","marker":"[12]"},{"why":"Shows that every infinite binary word has at least 9 palindromic factors, and that the only words with exactly 9 are powers of a rotation of w.","marker":"[25]"},{"why":"Gives the formula for the maximum palindromic length of binary words, with the word w11/6 as the exception at length 11.","marker":"[51]"},{"why":"Characterizes circularly rich words, used to show all rotations of w are rich while w2 is not.","marker":"[31]"},{"why":"Supplies the overlap-free factorization theorem whose sharp bound 7 is witnessed by w.","marker":"[52]"},{"why":"Proves that w is a test set for overlap-free morphisms.","marker":"[53]"},{"why":"Provides the generalized de Bruijn construction by Lyndon words, making w the lexicographically least generalized de Bruijn word of order 3.","marker":"[2]"},{"why":"Shows w∞ avoids the mirror images of all its factors of length at least 5.","marker":"[50]"},{"why":"Establishes maximal counts of primitive rooted squares, with v and w as the shortest words containing 2 and 3 such squares.","marker":"[26]"}],"fun_headline_variants":["0011 and 001011: the shortest interesting binary words","Shortest interesting binary words: 0011 and 001011","Why 0011 and 001011 are the shortest interesting binary words","Meet 0011 and 001011, the shortest interesting binary words","The two binary words that recur in dozens of papers: 0011 and 001011"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The argument depends on accepting that the list of properties surveyed (palindromic richness, Lyndon decompositions, de Bruijn properties, runs, factor complexity, and so on) is what makes a word interesting; if 'interesting' means something broader, shorter words might qualify.","fun_headline_variants_meta":{"raw":{"variants":["0011 and 001011: the shortest interesting binary words","Shortest interesting binary words: 0011 and 001011","Why 0011 and 001011 are the shortest interesting binary words","Meet 0011 and 001011, the shortest interesting binary words","The two binary words that recur in dozens of papers: 0011 and 001011"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000535,"raw_usage":{"total_tokens":2502,"prompt_tokens":806,"completion_tokens":1696,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":422,"completion_tokens_details":{"reasoning_tokens":1599}},"tokens_in":422,"tokens_out":1696,"duration_ms":13912,"temperature":1.0,"reasoning_tokens":1599,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T23:00:07.737731+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A literature-wide count of distinct properties for which each binary word of length at most 5 is the shortest or unique example; if any such word matches or exceeds the number of properties realized by 0011 and 001011, the claim of minimality fails.","supporting_citations":[{"cited_title":"Richomme and P","cited_arxiv_id":null,"evidence_quote":"Proves that w is a test set for overlap-free morphisms."},{"cited_title":"Brlek, S","cited_arxiv_id":null,"evidence_quote":"Proves that no binary word of length smaller than 6 is asymmetric and that the orbit of w is the unique asymmetric orbit of length 6."},{"cited_title":"Fici and L","cited_arxiv_id":null,"evidence_quote":"Shows that every infinite binary word has at least 9 palindromic factors, and that the only words with exactly 9 are powers of a rotation of w."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the formula for the maximum palindromic length of binary words, with the word w11/6 as the exception at length 11."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Characterizes circularly rich words, used to show all rotations of w are rich while w2 is not."},{"cited_title":"Restivo and S","cited_arxiv_id":null,"evidence_quote":"Supplies the overlap-free factorization theorem whose sharp bound 7 is witnessed by w."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the generalized de Bruijn construction by Lyndon words, making w the lexicographically least generalized de Bruijn word of order 3."},{"cited_title":"Rampersad and J","cited_arxiv_id":null,"evidence_quote":"Shows w∞ avoids the mirror images of all its factors of length at least 5."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Establishes maximal counts of primitive rooted squares, with v and w as the shortest words containing 2 and 3 such squares."}],"review_version":1}