{"id":"808e9fb7-ff85-4c0e-ada9-d28b80880ae5","arxiv_id":"2507.18674","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":3.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":5,"one_line_summary":"A systematic atlas of frequency-histogram coarse graining for 88 elementary cellular automata rules and two 2D rules, but the appendix is corrupted and the evaluation is qualitative.","lead":"This paper applies a frequency-based coarse-graining method to elementary cellular automata, the Game of Life, and one evolved multi-neighborhood rule, producing compressed diagrams that highlight rare blocks. It also speculates, without evidence, that this kind of coarse graining could help steer artificial systems toward open-ended intelligence.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The appendix atlas is not exhaustive: Tables 42–61 all repeat Rule 50 and Tables 64–88 repeat Rule 126, so the manuscript as submitted does not actually present the claimed systematic FHCG exploration of all 88 ECA rules.","rationale":"The method described is a simple and transparent visualization heuristic: block probabilities are computed from a run, thresholds are set just above each observed probability, and low-probability blocks are highlighted. As a qualitative tool this can be evaluated by visual examples, and the selected examples in Figure 2 are not unreasonable. The load-bearing weakness is not the method's internal logic; it is that the paper's advertised contribution, the complete atlas, is the evidence that the examples are representative of the whole ECA space. If the atlas were complete, the claim to 'systematically explore the entire ECA space' would have direct support. As submitted, the appendix's repeated captions mean the central generalization claim rests on a handful of hand-selected rules. The reader's rejection is already based on this corrupted artifact and on missing sensitivity analysis; my concern is narrower and can be settled by counting the appendix and website entries. The repeated captions are objective and do not depend on interpretive judgment, so this is the most decisive check. If the website contains all 88 classes with thresholds matching the text, a revised manuscript could reasonably move to conditional acceptance; in the current PDF the claim is not substantiated.","tokens_in":67135,"tokens_out":5463,"duration_ms":58384,"concrete_test":"Script the appendix PDF to extract every table caption and compare the set of rule labels against the 88 rules in the minimum-equivalence class set used in Section 3. Separately, download the pages under https://s4nyam.github.io/eca88/ and count distinct rule visualizations. If the PDF contains fewer than 88 distinct rules and the website also lacks some minimum-equivalence classes, the exhaustive-atlas claim fails. If the website does contain all 88 classes, the failure is confined to the PDF artifact and a corrected submission could meet the claim.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central deliverable, stated in the abstract and in Section 3, is a systematic exploration of FHCG for the entire ECA space (88 minimum-equivalent rules), with the Appendix presented as the full results. In the submitted PDF that deliverable is missing. The table captions repeat the same rule label for long stretches: Tables 42–61 are all labeled 'ECA Rule 50' and Tables 64–88 are all labeled 'ECA Rule 126', with only Rule 110 and 122 appearing between them. This is not a matter of rules with identical block statistics: the captions themselves identify the tables as the same rule. Consequently the reader cannot verify that any of the other equivalence classes were run, and the only evidence for the method's generality is the handful of selected examples in Figure 2. The existence of a companion website does not cure the submitted artifact unless that website actually contains the missing rules with reproducible parameters, since the paper explicitly claims that the Appendix contains the entire exploration.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes Frequency-Histogram Coarse Graining (FHCG), a dimensionality-reduction method for cellular automaton space-time diagrams: fixed-size blocks are counted over a run, a threshold is derived from the block-frequency histogram, and rare blocks are highlighted in a coarsened representation. The authors apply FHCG to selected Elementary Cellular Automata (ECA), to the Game of Life, and to one evolved MNCA rule, and they claim to provide a systematic atlas of all 88 minimum-equivalent ECA rules in the appendix, with an interactive companion website. The main stated purpose is to make emergent computational structures (e.g., gliders, particles) easier to identify and to use such identification as a step toward open-ended evolution in artificial intelligence systems.","tokens_in":67306,"tokens_out":4483,"duration_ms":52699,"significance":"If the claimed exhaustive atlas and the interpretive link between rare blocks and emergent computation were fully supported, the paper would offer a simple and cheap visualization tool for locating candidate computational structures in CA space-time diagrams, with potential value for exploratory studies of artificial life and neural CA. The paper has useful ingredients: the method is easy to implement, the code and interactive portal are promised at public links, and the selected examples (Rule 30, Rule 110, Game of Life gliders) are visually suggestive as illustrations of the procedure. However, the central evidence for the paper's main deliverable—the \"entire exploration\" of the 88 ECA rules—is not present in the submitted artifact, and the core interpretive claim that rare blocks correspond to emergent computation is never validated against any external benchmark or against known particle/domain decompositions. As submitted, the contribution is an unverified methodology demonstration rather than a systematic study.","major_comments":[{"comment":"The appendix does not contain the claimed systematic investigation of the 88 minimum-equivalent ECA rules. Tables 42–61 are all captioned \"FHCG plots for ECA Rule 50\" and Tables 64–88 are all captioned \"FHCG plots for ECA Rule 126\"; between these runs only Rule 110 (Table 62) and Rule 122 (Table 63) appear. The Abstract and the Proposed Methods section promise the entire exploration of coarse graining for the full ECA space, and the Appendix text states \"one rule per page,\" but roughly half the appendix repeats two rule labels. The companion website link does not cure this defect, because the manuscript explicitly identifies the Appendix as the full results and does not document the exact parameters, seeds, or code used to generate any external dataset. This is a load-bearing gap: the systematic atlas is the paper's central deliverable, and it is not verifiable from the submitted manuscript.","section":"Appendix (Tables 42–61 and 64–88)"},{"comment":"The thresholds are derived from the same space-time diagram to which they are applied: Algorithm 1 collects all blocks, computes their probabilities, and sets each threshold to a sorted probability plus δ=0.005. Thus any block whose probability falls below a chosen threshold is \"rare\" by construction, and the coarse-grained output is guaranteed to highlight the least frequent blocks of that single run. The paper never validates that these rare blocks correspond to particles, gliders, domains, or other structures of interest; it only asserts this for selected examples. A concrete fix would be to compare the highlighted regions with known particle/domain decompositions for rules such as 54 and 110 (e.g., the Hanson–Crutchfield analysis cited as [22]) and to report how the identified structures change with random seed, δ, block size, lattice size, boundary conditions, and simulation length.","section":"Algorithm 1 and Proposed Methods"},{"comment":"The two-dimensional thresholds are explicitly handpicked: Table 89 states \"chosen handpicked threshold for FHCG-Evo-MNCA is 0.011\" and Table 90 states a handpicked threshold of 0.025. Unlike the 1D case, no automatic thresholding procedure is described for 2D, and no criterion is given for selecting these two values. The 2D results are therefore demonstrations rather than part of a systematic study, yet they are used in the Discussion to support the claim that FHCG preserves gliders and other computational structures in the Game of Life. Sensitivity of the 2D output to the threshold choice is not reported.","section":"Tables 89–90 (2D results)"},{"comment":"The experimental protocol is under-specified for reproducibility. The appendix states a CA size of 100 cells and 100 time steps, but it does not state the boundary condition (periodic, fixed, or null), the random seed, or the precise initialization rule (e.g., independent Bernoulli draws with the stated percentages). Because the thresholds are computed from a single run, these details directly affect every histogram and every coarse-grained output in the appendix. Without them, the numerical thresholds listed in the tables (e.g., Threshold 1: 0.0066 in Table 1) cannot be reproduced or checked.","section":"Experimental protocol (Proposed Methods and Appendix preamble)"}],"minor_comments":[{"comment":"There is an internal inconsistency in the thresholding rule: Algorithm 1 defines G(i) = 0 if pi ≥ α and G(i) = 1 if pi < α, whereas the step-by-step description of process_FHCG says that \"values less than or equal to the threshold are set to 1 and others to 0.\" Please harmonize the two definitions and specify which side of the threshold is highlighted.","section":"Algorithm 1 and text (process_FHCG)"},{"comment":"The pseudocode appears to generate one threshold per unique probability (the loop \"foreach pi in unique_probabilities\" adds pi + δ), yet the text and figures consistently describe three thresholds. Please clarify how the number of displayed thresholds is selected and why some rules show only one or two.","section":"Algorithm 1"},{"comment":"Several panels in Figure 2 are labeled \"(e)\" (e.g., Rule 90, Rule 54, Rule 57), which makes the panel references in the caption ambiguous; the panel labels should be corrected to a single sequence.","section":"Figure 2"},{"comment":"There are several typographical errors, including \"coase-graining\" in the Related Work section, \"evole\" in the Cellular Automata background, and \"emerge of a more general artificial intelligence\" in the Abstract; these should be corrected.","section":"Throughout"},{"comment":"The manuscript relies on external URLs for code and the appendix PDF, but it does not state the software versions or the exact commit/version of the repository. For an experimental paper whose main evidence is a corpus of figures, please include versioned code and, if possible, the generated data files in the submission.","section":"References and links"}],"recommendation":"major_revision","confidential_remarks":"The repeated rule labels in the appendix (Tables 42–61 for Rule 50 and Tables 64–88 for Rule 126) are the most serious problem: the paper's headline claim of an exhaustive 88-rule exploration is not supported by the submitted PDF. Please verify whether these are assembly or rendering errors and, in any revision, ensure that the full corpus is actually present. In addition, the lack of external validation for the \"rare equals emergent computation\" interpretation is a conceptual gap; the authors should either supply a validation against known CA particles/domains or substantially soften the claims to describe an exploratory visualization tool rather than a method for identifying emergent computation. My recommendation of major_revision assumes that these gaps are addressable within the manuscript's scope; if the corrected appendix cannot be supplied, the appropriate outcome would be rejection."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Bottom line: the paper applies a known coarse-graining method (Cisneros et al., ref [9]) to the 88 ECA equivalence classes plus Game of Life and one MNCA rule, but the appendix—the claimed exhaustive atlas—is not actually there. Tables 42–61 all say “ECA Rule 50” and Tables 64–88 all say “ECA Rule 126.” That is the load-bearing deliverable, and it is missing. The reader’s stress-test concern holds up on reading the manuscript.\n\nWhat the paper does well: the authors are transparent that FHCG comes from prior work, and the selected examples in Figure 2 are plausible. For rule 54, the coarse graining does appear to pick out diagonal structures; for Game of Life, gliders become compact blobs. The automated threshold selection (adding delta=0.005 to each unique block probability) is a simple, reasonable way to avoid hand-picking thresholds in 1D. The companion website and code pointers are useful, assuming they actually contain the missing rules.\n\nNow the soft spots, in proportion. First, the atlas problem is not cosmetic: the paper’s central promise is systematic coverage, and it is broken. A companion website does not cure a corrupted appendix unless the site is verified and the submitted artifact is fixed. Second, the thresholds are computed from the same run they are applied to—a single 100x100 space-time diagram from one unstated seed—and there is no sensitivity analysis for seed, block size, delta, simulation length, or the handpicked 2D thresholds. So “rare” is defined relative to one sample. Third, the algorithm description contradicts itself: Algorithm 1 maps blocks with pi >= alpha to state 0 and pi < alpha to 1, while the prose says values <= threshold are set to 1. That changes which structures are highlighted and needs resolving before any result is meaningful. Fourth, the interpretive step—that rare blocks correspond to emergent computation or particles—is asserted, not validated against known particle descriptions from computational mechanics. The AI/open-endedness discussion is explicitly speculative and clearly flagged as an argument, so I do not count it as a flaw beyond being unsupported.\n\nWho this is for: someone who wants a quick visual tool to spot rare blocks in CA space-time diagrams. The method works after a fashion, but the atlas as submitted is not usable, and the method itself is not new. I would not cite this as a systematic exploration. As submitted, I would desk reject; if the authors fix the appendix, resolve the threshold inconsistency, and add a basic sensitivity check, a shorter data paper might deserve a serious referee.","headline":"The core claim of a systematic FHCG atlas of all 88 ECA rules is not supported by the appendix, which repeats Rule 50 and Rule 126 for most tables, leaving only a few plausible examples and an unvalidated method.","tokens_in":67867,"tokens_out":3045,"would_cite":false,"duration_ms":32470,"reading_group":"no","serious_thinker":"no","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["37B15","68Q80"],"pacs":[],"model":"deepseek-v4-flash","headline":"Frequency-histogram coarse graining compresses cellular automata space-time diagrams and highlights rare, computation-like structures across all 88 elementary rules and Game of Life.","keywords":["Cellular Automata","Coarse Graining","Frequency Histogram","Elementary Cellular Automata","Game of Life","Emergent Computation","Complexity","Artificial Life"],"falsifier":"Run the same ECA rule (say Rule 110) from many different random seeds and compare the FHCG masks: if two seeds produce similar raw dynamics but the highlighted rare blocks differ drastically, or if varying the block size or $\\delta$ makes the extracted structures appear and vanish, the central claim that the method reveals intrinsic computation would be undercut.","tokens_in":66880,"feed_emoji":"🧫","tokens_out":9158,"duration_ms":82045,"temperature":0.7,"pith_summary":"This paper claims that a cheap pre-processing step—counting how often every small block of cells occurs in a cellular automaton's space-time diagram and thresholding at those frequencies—can compress the diagram into a binary mask that highlights rare, computationally relevant events while discarding repetitive background. The authors apply this frequency-histogram coarse graining to all 88 minimally distinct elementary cellular automata, to the two-dimensional Game of Life, and to an evolved multi-neighborhood rule, and publish the full visual atlas. They report that hidden structures become visible for chaotic and complex rules, that gliders in Game of Life collapse into compact markers of where computation is happening, and that the same idea can be applied recursively to study a system at multiple scales. The larger claim is that such coarse-graining makes emergent complexity easier to locate and quantify in large-scale systems, which could eventually guide evolution or learning toward more open-ended, adaptive behavior.","feed_headline":"Counting blocks uncovers hidden patterns in all 88 cellular automata","feed_subtitle":"Frequency-histogram coarse graining compresses space-time diagrams and exposes rare structures in Game of Life too.","key_machinery":"The central object is the frequency histogram of fixed-size blocks ('supercells') over a single CA space-time diagram. For a chosen block size, the method counts each block pattern's occurrence probability $p_i$, builds the sorted list of thresholds $p_i + \\delta$ with $\\delta = 0.005$, and maps each block to 1 if its probability is below the active threshold and 0 otherwise; applying the thresholds in increasing order produces a ladder of progressively less restrictive coarse-grained views. This frequency-thresholding step is the whole mechanism: no rule-specific parameters are needed in 1D, and the rare blocks that survive low thresholds are identified with the particles, gliders, and other localized structures that computational-mechanics analyses treat as the carriers of computation.","core_discovery":"On the paper's own terms, the discovery is that frequency-histogram coarse graining (FHCG) effectively compresses cellular automata representations while highlighting rare events, making it easier to study emergent behaviors and their complexity. Concretely, the paper shows that when space-time diagrams are cut into small supercells (2×1 blocks in one dimension, 2×2 in two dimensions), the occurrence probabilities of block types form a histogram whose tails correspond to the rare structures that carry computation; thresholds placed just above each observed probability separate those rare blocks from the frequent background. The authors demonstrate this across the 88 minimum-equivalence ECA rules, where rules such as 18, 30, 90, and 110 reveal hidden structures, rule 54 exposes diagonal particles, and periodic class-II rules have their background filtered away, and in two dimensions where Game of Life gliders and other emergent structures remain locatable in a lower-dimensional, coarser image.","pith_inferences":["Because thresholds are computed from the same diagram they are applied to, 'rare' is defined per-run; an immediate test would be to check whether the coarse-grained masks agree across random seeds, block sizes, and simulation lengths before using the method as a general complexity probe.","The handpicked 2D thresholds (0.011 for Game of Life, 0.025 for the evolved rule) hint that the automatic delta-based threshold may be too naive in higher dimensions; a histogram-gap or significance criterion could make the method fully parameter-free and more robust.","A natural extension beyond the paper is to use the density or persistence of rare blocks under FHCG as a fitness function in an evolutionary search, and to test whether selection for that objective actually produces more open-ended behavior rather than simply more noise.","The link to artificial general intelligence is speculative, but the concrete, testable residue is that FHCG provides an inexpensive way to filter space-time diagrams before computing more expensive complexity measures."],"forward_implications":["Any one-dimensional CA rule can be turned into a hierarchy of binary masks, one per threshold, without hand-tuning, because the thresholds are read off the histogram itself.","The 88-rule atlas lets one see which rules concentrate rare blocks into localized, particle-like structures and which spread them diffusely.","In 2D, FHCG compresses gliders and other Game of Life structures into compact shapes while preserving where the action is, so structure detection can be run on the coarse image.","Recursive application of FHCG could yield a scale-space description of a CA, letting the same tool track emergent behavior from fine to coarse levels.","If the method scales to neural or continuous CA, it could serve as a metric to guide evolution toward systems with more rare-event structure."],"supporting_citations":[{"why":"Introduces frequency-histogram coarse graining and shows it qualitatively approximates particle-domain boundaries for selected ECA rules; the method this paper systematically extends.","marker":"[9]"},{"why":"Establishes that symmetry and equivalence reductions leave 88 unique ECA rules, defining the scope of the systematic exploration.","marker":"[12]"},{"why":"Provides the minimum-equivalence criterion used to select the 88 rules for the atlas.","marker":"[23]"},{"why":"Supplies the computational-mechanics particle vocabulary used to interpret rare blocks as carriers of computation.","marker":"[15]"},{"why":"Defines the particle-domain boundaries that FHCG results are compared against for qualitative validation.","marker":"[22]"},{"why":"Discusses complexity as degree of hierarchy and particle-domain structure, the interpretive frame for multi-scale coarse graining.","marker":"[18]"},{"why":"Provides the multiple-neighborhood CA formalism used for the evolved MNCA example.","marker":"[14]"},{"why":"Demonstrates equal complexity at different hierarchical scales (Game of Life embedded in Game of Life), motivating recursive coarse graining.","marker":"[19]"}],"fun_headline_variants":["Histogram coarse-graining highlights rare CA events","Block frequencies unmask hidden structures in 88 rules","Coarse-graining trick exposes Game of Life gliders","Frequency histograms reveal emergent complexity in CAs"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the block frequencies measured in one 100×100 run from a single random initialization are stable enough to tell meaningful rare computation apart from mere background, and that the results do not hinge on the chosen block size, the offset $\\delta = 0.005$, the simulation length, or the handpicked 2D thresholds.","fun_headline_variants_meta":{"raw":{"variants":["Histogram coarse-graining highlights rare CA events","Block frequencies unmask hidden structures in 88 rules","Coarse-graining trick exposes Game of Life gliders","Frequency histograms reveal emergent complexity in CAs"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000177,"raw_usage":{"total_tokens":1275,"prompt_tokens":908,"completion_tokens":367,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":524,"completion_tokens_details":{"reasoning_tokens":305}},"tokens_in":524,"tokens_out":367,"duration_ms":4161,"temperature":1.0,"reasoning_tokens":305,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T18:13:16.079825+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the same ECA rule (say Rule 110) from many different random seeds and compare the FHCG masks: if two seeds produce similar raw dynamics but the highlighted rare blocks differ drastically, or if varying the block size or $\\delta$ makes the extracted structures appear and vanish, the central claim that the method reveals intrinsic computation would be undercut.","supporting_citations":[{"cited_title":"Visualizing compu- tation in large-scale cellular automata","cited_arxiv_id":null,"evidence_quote":"Introduces frequency-histogram coarse graining and shows it qualitatively approximates particle-domain boundaries for selected ECA rules; the method this paper systematically extends."},{"cited_title":"Theory and applications of cellular au - tomata","cited_arxiv_id":null,"evidence_quote":"Establishes that symmetry and equivalence reductions leave 88 unique ECA rules, defining the scope of the systematic exploration."},{"cited_title":"A study on the composition of elementary cellular automata","cited_arxiv_id":"2305.02947","evidence_quote":"Provides the minimum-equivalence criterion used to select the 88 rules for the atlas."},{"cited_title":"Evolving cellular automata with genetic algorithms: A review of recent work","cited_arxiv_id":null,"evidence_quote":"Supplies the computational-mechanics particle vocabulary used to interpret rare blocks as carriers of computation."},{"cited_title":"Computational mechan- ics of cellular automata: An example","cited_arxiv_id":null,"evidence_quote":"Defines the particle-domain boundaries that FHCG results are compared against for qualitative validation."},{"cited_title":"Complexity: A guided tour","cited_arxiv_id":null,"evidence_quote":"Discusses complexity as degree of hierarchy and particle-domain structure, the interpretive frame for multi-scale coarse graining."},{"cited_title":"Understanding Multiple Neighborhood Cellular Automata","cited_arxiv_id":null,"evidence_quote":"Provides the multiple-neighborhood CA formalism used for the evolved MNCA example."},{"cited_title":"Life in Life","cited_arxiv_id":null,"evidence_quote":"Demonstrates equal complexity at different hierarchical scales (Game of Life embedded in Game of Life), motivating recursive coarse graining."}],"review_version":2}