https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM/Head https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM http://www.nanopub.org/nschema#hasAssertion https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM/assertion https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM http://www.nanopub.org/nschema#hasProvenance https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM/provenance https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM/pubinfo https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM/assertion https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test http://purl.org/dc/terms/description analysis.py evolves all 256 elementary rules from both single-cell seeds through t = 200 on a width-401 window and applies the locked ether, run-count and motion clauses. The meeting set is compared with {110, 124, 137, 193}. A second run matched derived/measured.json byte for byte. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/Assessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test http://www.w3.org/2000/01/rdf-schema#comment Measured: 8 elementary rules meeting the locked clear-class-4 screen (n = 256, exact on this finite screen). Interpretation: Clear class 4 is operationalized as a periodic ether (short spatial period, agreement at least 0.70 on three late rows) plus a few localized mismatch runs that move, on a quiescent background, and not a short temporal period of the whole row. The two simple seeds cover a black cell on white and the color-swapped seed. Left-right reflection does not need its own seed because the statistics do not prefer a direction. The claim also says class 4 becomes common once more colors or neighbors are allowed; this screen does not enumerate those families. The computation says nothing about organisms. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch11-18: refutes, confidence 0.52 https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test http://www.w3.org/2000/01/rdf-schema#seeAlso https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch11-18/result.json https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test https://w3id.org/delphi/ontology/admissibleDatasets The 256 elementary cellular automata, generated by the checksummed script from the two single-cell seeds on a quiescent homogeneous background, width 401, through t = 200. No organism record is admissible. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test https://w3id.org/delphi/ontology/assessmentType claim-test/0.1.0 https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test https://w3id.org/delphi/ontology/dataKind computational https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test https://w3id.org/delphi/ontology/disconfirmingObservation Some other elementary rules meet the same clauses and none of 110, 124, 137 and 193 do, with at most 20 rules meeting them. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test https://w3id.org/delphi/ontology/evidenceAgainst Every rule that met the screen did so at spatial period 4, with agreement between 0.980 and 0.995 and two to five mismatch runs, and the mean mismatch moved by about 40 cells between t = 160 and t = 200. That is a short-period background plus a few drifting defects. The locked clauses counted it as clear class 4. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The claim's second clause, that class 4 becomes common with more colors or neighbors, was not tested. The run stops at t = 200. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The meeting set is 56, 98, 106, 120, 169, 185, 225 and 227. It is nonempty, smaller than 21, and disjoint from {110, 124, 137, 193}, which is the pre-registered refuting case. None of 110, 124, 137 or 193 met the clauses. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The same clauses did not count rule 110 or its three equivalents. A screen that misses those four and accepts simple drifting defects is a weak reading of Wolfram's pictures. The clauses were not changed after the run. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test https://w3id.org/delphi/ontology/evidenceAgainst This is a computation about elementary cellular automata. It says nothing about organisms. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test https://w3id.org/delphi/ontology/expectedObservation The rules that meet the ether, localized-run, and motion clauses are exactly 110, 124, 137 and 193. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test https://w3id.org/delphi/ontology/failCriterion Pre-registered. Refutes if the meeting set is nonempty, has size at most 20, and is disjoint from {110, 124, 137, 193}. Mixed if the meeting set intersects that expected set, has size at most 20, and is not equal to it. Inconclusive if the meeting set is empty or has more than 20 rules. The clause that class 4 becomes common for rules with more colors or neighbors is not part of this pass/fail rule. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test https://w3id.org/delphi/ontology/hasConfidence 0.52 https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch11-18--claim-test--dataset-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test https://w3id.org/delphi/ontology/hasVerdict refutes https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test https://w3id.org/delphi/ontology/hypothesis Under a locked ether-and-glider screen, the only elementary rules that read as clear class 4 are 110, 124, 137 and 193. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test https://w3id.org/delphi/ontology/inferenceMethod Apply the locked screen to every rule and list the meeting set. Equality with the expected four supports. A nonempty partial overlap of size at most 20 is mixed. A nonempty disjoint set of size at most 20 refutes. Empty or larger than 20 is inconclusive. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test https://w3id.org/delphi/ontology/passCriterion Pre-registered. All 256 elementary rules. Width 401, center 200, t = 0..200, homogeneous background outside the array. Two seeds: one black cell on white, and one white cell on black. A seed counts only when the background bit is constant on t = 168..200, the rows t = 168..200 have no temporal period in 1..8, and some spatial period p in 4..20 (the smallest such p) has majority-color agreement at least 0.70 on each of t = 170, 185 and 200, with ties called white. On each of those three rows the mismatches form between 2 and 12 runs, every run at most 60 cells. The mean mismatch index at t = 200 and t = 160, using that p, differs by at least 3. A rule meets the definition if either seed counts. Supports if and only if the set of rules that meet it is exactly {110, 124, 137, 193}. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test https://w3id.org/delphi/ontology/preregistered false https://w3id.org/delphi/resource/claim/wolfram2002-ch11-18 https://w3id.org/delphi/ontology/hasAssessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test https://w3id.org/delphi/resource/evidence/wolfram2002-ch11-18--claim-test--dataset-1 http://purl.org/dc/terms/description the census the class-4 screen is applied to https://w3id.org/delphi/resource/evidence/wolfram2002-ch11-18--claim-test--dataset-1 http://purl.org/dc/terms/license https://w3id.org/delphi/resource/evidence/wolfram2002-ch11-18--claim-test--dataset-1 http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/EvidenceItem https://w3id.org/delphi/resource/evidence/wolfram2002-ch11-18--claim-test--dataset-1 http://www.w3.org/2000/01/rdf-schema#label Dataset: Single-cell evolutions of all 256 elementary rules https://w3id.org/delphi/resource/evidence/wolfram2002-ch11-18--claim-test--dataset-1 https://w3id.org/delphi/ontology/hasChecksum sha256:21b33c9bcc11cf95ca36b5d69502fdb30357a0e4a097e562ec11ffeb4df6a5b2 https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM/provenance https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#SoftwareAgent https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 http://www.w3.org/2000/01/rdf-schema#label delphisci claim tester (Grok 4.7; cursor/claim-tests-wolfram-programs-b8d9) https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 http://www.w3.org/ns/prov#actedOnBehalfOf https://orcid.org/0009-0007-4948-9192 https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/delphi/ontology/usesModel https://w3id.org/delphi/resource/model/grok-4-7 https://w3id.org/delphi/resource/model/grok-4-7 http://purl.org/dc/terms/identifier Grok 4.7 https://w3id.org/delphi/resource/model/grok-4-7 http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/LanguageModel https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM/assertion http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM/assertion http://www.w3.org/ns/prov#wasDerivedFrom https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch11-18/result.json https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM/assertion http://www.w3.org/ns/prov#wasGeneratedBy https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM/test https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM/plan http://www.w3.org/ns/prov#hadPlan https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/README.md https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM/test http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#Activity https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM/test http://www.w3.org/ns/prov#qualifiedAssociation https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM/plan https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM/test http://www.w3.org/ns/prov#wasAssociatedWith https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM/pubinfo https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM http://purl.org/dc/terms/created 2026-11-08T16:24:31.939Z https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM http://purl.org/dc/terms/creator https://orcid.org/0009-0007-4948-9192 https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM http://purl.org/dc/terms/license https://creativecommons.org/licenses/by/4.0/ https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM http://purl.org/nanopub/x/hasNanopubType https://w3id.org/delphi/ontology/Assessment https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM http://purl.org/nanopub/x/introduces https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-18--claim-test https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch11-18: refutes, confidence 0.52 https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM https://w3id.org/delphi/ontology/domain https://w3id.org/delphi/resource/domain/wolfram-nks-2002 https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM/sig http://purl.org/nanopub/x/hasAlgorithm RSA https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM/sig http://purl.org/nanopub/x/hasPublicKey MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM/sig http://purl.org/nanopub/x/hasSignature s8FbS/otYE70NWDTRAUcPUE8hGOpiiXbby/UC2CbIbAD3N+6P1PsmfnKty4c67+4dPaAPjgoCiZyjf0m4BMEjsNUciRXyLMKDevGvhYk0gsIEWrAhc9dp5Cky8GVh5zqXQx6KIb1W0ezRtv8BfYn36dKV8bl4hrsgNzHoC7Ac4speY5ooOjdWbay5oBVMJYFfrGl3jNCszzrTHKXfjrwj1b0PKBVnyz9tfqo1UIvRdvfuCLq6U29N9e5baxf3C4SPG1HjOJHxmNbg7HHDTurcA3fAF4O/AYDnMC6xWjFynl1EjdAdQ9JMHYB/V/X6S3GWJ6uz7lwVgRvJ8AHY31Lsw== https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM/sig http://purl.org/nanopub/x/hasSignatureTarget https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM https://w3id.org/np/RAYj7Z11Gi62n2NDmfkVQ5qmEREiAVC59aQ6HbpFxm5EM/sig http://purl.org/nanopub/x/signedBy https://orcid.org/0009-0007-4948-9192