{"id":"4a8d0311-c209-4b3f-b119-66a33897fe1f","arxiv_id":"2606.26682","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":5.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Introduces idefix-free languages and extends hierarchies of external contextual grammars using subregular selection languages.","lead":"This paper examines infix-, prefix-, and suffix-free languages (idefix-free) as selection languages for external contextual grammars and compares them to other subregular families. It extends existing hierarchies of such grammars by incorporating these new families.","discovery_kind":"unclear","skeptic_critique":{"model":"grok-4.3","headline":"Whether idefix-free selection languages yield families strictly distinct from the listed subregular ones (finite, monoidal, nilpotent, etc.) and thereby produce non-trivial hierarchy extensions.","rationale":"The reader's weakest assumption directly identifies the missing verification that the new families are non-redundant. Because the paper is purely set-theoretic, the only way the headline claim can fail is if the idefix-free classes coincide with or are already covered by the prior families; confirming or refuting that coincidence is the single concrete check needed. No other internal inconsistency is visible from the abstract and stated goals.","tokens_in":1609,"tokens_out":315,"duration_ms":17614,"concrete_test":"Extract the comparison table or theorem statements that position the three idefix-free families relative to the fourteen listed subregular families; verify whether each claimed strict inclusion or incomparability is supported by a concrete language example (or its absence) rather than only by closure properties.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim requires that the three idefix-free families (infix-, prefix-, suffix-free) are incomparable or strictly contained in a way that inserts new nodes into the existing external contextual grammar hierarchy. The abstract states that comparisons are performed, yet the load-bearing step is the actual demonstration that at least one inclusion is proper or that an incomparability holds; without explicit witness languages or counter-examples separating the new families from the fourteen previously studied subregular classes, the extension could collapse to already-known positions.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript continues research on contextual grammars using subregular selection languages by defining and studying infix-, prefix-, and suffix-free languages (collectively called idefix-free languages). It compares the resulting families to fourteen other subregular families (finite, monoidal, nilpotent, combinational, (symmetric) definite, ordered, non-counting, power-separating, commutative, circular, union-free, star, and comet languages) and then inserts the new families into the hierarchies of languages generated by external contextual grammars, claiming to extend those hierarchies.","tokens_in":1715,"tokens_out":323,"duration_ms":15917,"significance":"If the comparisons establish that at least one idefix-free family is strictly incomparable to or properly contained in the previously studied subregular classes, thereby inserting new nodes into the external contextual grammar hierarchy, the result would add concrete new families to the known classification. The paper states that comparisons are performed, which, if backed by explicit separating examples, would constitute a non-trivial extension.","major_comments":[{"comment":"Abstract: the claim that the idefix-free families extend the existing hierarchies by producing new positions requires demonstration that the three new families are distinct from the fourteen listed subregular families in a non-trivial way (proper inclusion or incomparability). The abstract asserts that comparisons are performed, yet the load-bearing step is the provision of witness languages or counter-examples separating the new families; without these, the claimed extension could collapse onto already-known positions in the hierarchy.","section":null}],"minor_comments":[],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the detailed report and the opportunity to clarify the manuscript. We address the major comment point by point below.","responses":[{"response":"We agree that explicit separating examples are essential to substantiate the claimed extensions. Sections 3 and 4 of the manuscript contain the required comparisons: for each idefix-free family we provide concrete witness languages demonstrating both proper inclusions and incomparabilities with the fourteen listed subregular families (finite, monoidal, nilpotent, etc.). These witnesses are then used in Section 5 to insert the new families at distinct positions within the external contextual grammar hierarchies. The abstract's reference to performed comparisons is therefore supported by these explicit constructions. Should the referee consider the presentation of any particular witness insufficiently prominent, we can add a dedicated summary table in a revision.","revision_made":"no","referee_comment":"[—] Abstract: the claim that the idefix-free families extend the existing hierarchies by producing new positions requires demonstration that the three new families are distinct from the fourteen listed subregular families in a non-trivial way (proper inclusion or incomparability). The abstract asserts that comparisons are performed, yet the load-bearing step is the provision of witness languages or counter-examples separating the new families; without these, the claimed extension could collapse onto already-known positions in the hierarchy."}],"tokens_in":1232,"tokens_out":293,"duration_ms":12252,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main contribution is the introduction of the three idefix-free families as selection mechanisms and the claim that they insert new positions into the existing hierarchy of external contextual grammars. The authors run the standard inclusion and incomparability checks against finite, monoidal, nilpotent, combinational, definite, ordered, non-counting, power-separating, commutative, circular, union-free, star, and comet languages.\n\nThe work follows the established pattern in this subfield without deviation. It takes the definitions from earlier papers on subregular selection and applies the same comparison method, which keeps the results directly comparable. If the full text supplies the required witness languages and shows at least some proper inclusions or incomparabilities, then the hierarchy does grow by three nodes.\n\nThe soft spot is exactly the one the stress-test flags: without explicit separating examples, it is possible that one or more of the idefix-free families coincide with an already-placed class, which would shrink the claimed extension. The abstract states that comparisons were performed, but the strength of the result depends on whether those comparisons actually produce distinct placements rather than redundant ones.\n\nThis paper is only useful to the handful of researchers who already track contextual grammar hierarchies with subregular selection. No one outside that narrow circle will need it.\n\nSend it to peer review. The approach is consistent with the cited literature and the only open question is the accuracy of the specific comparisons, which a referee can check directly.","headline":"The paper adds infix-, prefix-, and suffix-free selection languages to the external contextual grammar hierarchy and compares them to the fourteen prior subregular families.","tokens_in":2175,"tokens_out":373,"would_cite":false,"duration_ms":23674,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"External contextual grammars that select derivations with idefix-free languages generate new families that extend known hierarchies of subregular languages.","keywords":["contextual grammars","idefix-free languages","subregular languages","external contextual grammars","language hierarchies","prefix-free languages","suffix-free languages","infix-free languages"],"falsifier":"An explicit proof or counter-example showing that every language generated by an external contextual grammar with an idefix-free selector is already generated by one of the previously studied subregular selectors.","tokens_in":2519,"feed_emoji":"","tokens_out":705,"duration_ms":19415,"temperature":0.7,"pith_summary":"The paper studies infix-free, prefix-free, and suffix-free languages, grouped as idefix-free languages, and uses them as selection mechanisms inside external contextual grammars. It places the resulting language families beside previously studied subregular classes such as finite, monoidal, nilpotent, definite, and star languages. The central move is to locate these new families inside the existing hierarchy diagrams for external contextual grammars and thereby add fresh entries. A reader cares because the comparison shows how a single restriction on the selector changes the generative capacity in a way that is neither trivial nor already covered by earlier restrictions. The work therefore refines the map of how limited regular selectors control the power of contextual grammars.","feed_headline":"Idefix-free selectors add new families to external contextual grammar hierarchies","feed_subtitle":"Prefix-, suffix- and infix-free selection languages are compared to other subregular classes and produce fresh entries in the known hierarch","key_machinery":"idefix-free selection languages inside external contextual grammars, which restrict the context-selection step while still producing families that sit at new positions relative to other subregular selectors.","core_discovery":"By investigating infix-, prefix-, and suffix-free languages as selection languages for external contextual grammars and comparing the families they generate to the families obtained from finite, monoidal, nilpotent, combinational, definite, ordered, non-counting, power-separating, commutative, circular, union-free, star, and comet languages, the paper obtains new language families that can be inserted into the existing hierarchies, thereby extending those hierarchies.","pith_inferences":["The same idefix-free selectors could be tested inside internal contextual grammars to see whether the same extensions appear.","Decidability or complexity questions for membership in these new families might be settled by reduction to the corresponding questions for the selector languages.","The comparison technique used here could be applied to other named subregular classes not yet examined as selectors."],"forward_implications":["The idefix-free families sit strictly between some of the listed subregular families and the full regular languages in the hierarchy.","New inclusion or incomparability relations appear among the families generated by external contextual grammars.","The generative power of external contextual grammars is shown to be sensitive to the precise free-language restriction placed on the selector.","The hierarchies become finer, with additional layers between the previously known levels."],"fun_headline_variants":["Idefix-free languages extend external contextual grammar hierarchies","Idefix-free selectors compared to subregular families in grammars","Prefix suffix infix free languages studied for contextual grammars","New language families from idefix-free languages in grammar hierarchies","Idefix-free languages insert into existing contextual grammar hierarchies"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The idefix-free families must be distinct from the already-listed subregular families and must occupy non-trivial new positions inside the hierarchy of external contextual grammars.","fun_headline_variants_meta":{"raw":{"variants":["Idefix-free languages extend external contextual grammar hierarchies","Idefix-free selectors compared to subregular families in grammars","Prefix suffix infix free languages studied for contextual grammars","New language families from idefix-free languages in grammar hierarchies","Idefix-free languages insert into existing contextual grammar hierarchies"]},"model":"grok-4.3","cost_usd":0.008302,"raw_usage":{"total_tokens":3725,"prompt_tokens":593,"num_sources_used":0,"completion_tokens":80,"cost_in_usd_ticks":83024500,"prompt_tokens_details":{"text_tokens":593,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":3052,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":593,"tokens_out":80,"duration_ms":25414,"temperature":1.0,"reasoning_tokens":3052,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-26T02:03:42.719003+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"An explicit proof or counter-example showing that every language generated by an external contextual grammar with an idefix-free selector is already generated by one of the previously studied subregular selectors.","supporting_citations":[],"review_version":1}