https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30/Head https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30 http://www.nanopub.org/nschema#hasAssertion https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30/assertion https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30 http://www.nanopub.org/nschema#hasProvenance https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30/provenance https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30 http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30/pubinfo https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30 http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30/assertion https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--claim-test http://purl.org/dc/terms/description analysis.py evolves rule 110 from one black cell and cuts out rows 80..159, columns 60..139. It fits a first-order Markov chain to within-row transitions, draws 80 rows with random.Random(20261102), and compares transition frequencies, 4-bit block entropy, and vertical agreement. A second run matched derived/measured.json byte for byte. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--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-ch10-13--claim-test http://www.w3.org/2000/01/rdf-schema#comment Measured: 0.7884493670886076 vertical agreement of consecutive rule-110 rows in the 80 by 80 window (n = 6320, exact window; the Markov sample is one seeded draw of 80 rows). Interpretation: The probabilistic model is a first-order Markov chain, one of the kinds the claim names. It is fit to one deterministic rule, elementary rule 110, in one window. 'Reproduce the statistics used in fitting' is the sample's transition probabilities staying within 0.05 of the fit. 'More random' is a 4-bit block entropy at least 0.03 higher. The detailed feature is vertical agreement between consecutive rows, which the cellular automaton has because each row determines the next, and which independent Markov rows are not built to keep. One rule and one model do not survey every probabilistic fit. The computation says nothing about organisms. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--claim-test http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch10-13: mixed, confidence 0.73 https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--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-ch10-13/result.json https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--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-ch10-13--claim-test https://w3id.org/delphi/ontology/admissibleDatasets The rule-110 window and the Markov samples generated by the checksummed script, with the locked bounds and seed 20261102. No organism record is admissible. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--claim-test https://w3id.org/delphi/ontology/assessmentType claim-test/0.1.0 https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--claim-test https://w3id.org/delphi/ontology/dataKind computational https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--claim-test https://w3id.org/delphi/ontology/disconfirmingObservation The samples match the transitions within 0.05, and they are neither 0.03 higher in h4 nor 0.15 lower in vertical agreement. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The sample transitions stay within 0.05 of the fit: P(1|0) is 0.14779602420051857 against 0.15256899259591652, and P(1|1) is 0.5975177304964538 against 0.6162104133118625. Vertical agreement falls from 0.7884493670886076 to 0.5977848101265822, past the locked gap of 0.15. Block entropy does not rise: sample h4 is 0.7375219947505822 and data h4 is 0.746435604101548. One gap holds and one does not. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--claim-test https://w3id.org/delphi/ontology/evidenceAgainst This is a computation about rule 110 and one probabilistic model. It says nothing about organisms. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--claim-test https://w3id.org/delphi/ontology/evidenceAgainst This is one rule, one 80 by 80 window, and an order-1 Markov chain. A higher-order model could keep more of the vertical agreement. A different rule could raise the sample entropy. The thresholds were not changed after the run. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--claim-test https://w3id.org/delphi/ontology/expectedObservation Samples from the Markov chain fit to the rule-110 window match both transition probabilities within 0.05, have h4 at least 0.03 above the data, and have vertical agreement at least 0.15 below the data. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--claim-test https://w3id.org/delphi/ontology/failCriterion Pre-registered. Refutes if the transitions match within 0.05 and both gaps fail: sample h4 < data h4 + 0.03 and data vertical agreement < sample vertical agreement + 0.15. Mixed if the transitions match and exactly one gap fails. Inconclusive if either transition has no observations or the sample misses a fitted transition by more than 0.05. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--claim-test https://w3id.org/delphi/ontology/hasConfidence 0.73 https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-13--claim-test--dataset-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-13--claim-test--dataset-2 https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--claim-test https://w3id.org/delphi/ontology/hasVerdict mixed https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--claim-test https://w3id.org/delphi/ontology/hypothesis A first-order Markov chain fit to rows of rule 110 reproduces its own transition probabilities, while its samples have higher 4-bit block entropy than the cellular-automaton rows and lose the rows' vertical agreement. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--claim-test https://w3id.org/delphi/ontology/inferenceMethod Fit the transitions, redraw 80 rows, and compare transition error, h4, and vertical agreement with the locked gaps. Both gaps plus a transition match supports. A transition match with both gaps failing refutes. One gap is mixed. A missed transition is inconclusive. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--claim-test https://w3id.org/delphi/ontology/passCriterion Pre-registered. Rule 110, one black cell at index 100, homogeneous white background, width 201, t = 0..160. Data: rows 80..159, columns 60..139 (80 by 80). The Markov chain uses within-row transitions only. P(1) is the bit frequency. Eighty sample rows of length 80 are drawn with random.Random(20261102). h4 is the normalized 4-bit block entropy of the concatenated rows. Vertical agreement is the fraction of cells equal to the cell above. Supports if and only if both sample transitions are within 0.05 of the fitted transitions, sample h4 >= data h4 + 0.03, and data vertical agreement >= sample vertical agreement + 0.15. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--claim-test https://w3id.org/delphi/ontology/preregistered false https://w3id.org/delphi/resource/claim/wolfram2002-ch10-13 https://w3id.org/delphi/ontology/hasAssessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--claim-test https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-13--claim-test--dataset-1 http://purl.org/dc/terms/description deterministic data the Markov chain is fit to https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-13--claim-test--dataset-1 http://purl.org/dc/terms/license https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-13--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-ch10-13--claim-test--dataset-1 http://www.w3.org/2000/01/rdf-schema#label Dataset: Rule 110 rows from one black cell https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-13--claim-test--dataset-1 https://w3id.org/delphi/ontology/hasChecksum sha256:62fb3c2bab77d57ed49803b1d51d496f1e56e845e841a8c2d988ca0473f1509c https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-13--claim-test--dataset-2 http://purl.org/dc/terms/description typical samples from the fitted model https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-13--claim-test--dataset-2 http://purl.org/dc/terms/license https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-13--claim-test--dataset-2 http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/EvidenceItem https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-13--claim-test--dataset-2 http://www.w3.org/2000/01/rdf-schema#label Dataset: Eighty rows drawn from the fitted first-order Markov chain https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30/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/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30/assertion http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30/assertion http://www.w3.org/ns/prov#wasDerivedFrom https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch10-13/result.json https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30/assertion http://www.w3.org/ns/prov#wasGeneratedBy https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30/test https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30/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/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30/test http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#Activity https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30/test http://www.w3.org/ns/prov#qualifiedAssociation https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30/plan https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30/test http://www.w3.org/ns/prov#wasAssociatedWith https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30/pubinfo https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30 http://purl.org/dc/terms/created 2026-11-08T16:24:31.935Z https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30 http://purl.org/dc/terms/creator https://orcid.org/0009-0007-4948-9192 https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30 http://purl.org/dc/terms/license https://creativecommons.org/licenses/by/4.0/ https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30 http://purl.org/nanopub/x/hasNanopubType https://w3id.org/delphi/ontology/Assessment https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30 http://purl.org/nanopub/x/introduces https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-13--claim-test https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30 http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch10-13: mixed, confidence 0.73 https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30 https://w3id.org/delphi/ontology/domain https://w3id.org/delphi/resource/domain/wolfram-nks-2002 https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30/sig http://purl.org/nanopub/x/hasAlgorithm RSA https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30/sig http://purl.org/nanopub/x/hasPublicKey MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30/sig http://purl.org/nanopub/x/hasSignature t6Ic8cv+gCArD/ZPqpYLrtgZVdGbQRKP+iTsO+DVAglySlrb1GBEdOam9/CrwxwRYkzI+v8kpPdTtrj0ACt7roGrYV2rWLu1IjBcKDy12Bzi95Q3EuAhSnkikZyJWujEMUzPUyr2vRyK1qD6jXHCL+ZG6jYzo2d3BknKoycb4VlqQJuVc9DPzgXTaGddXz8WCP8s7D6N5Rn2/pWB3nM6znJrQ2+TbQ3/GDHa0tMg9F/KNJNbndgkdM6h11Dux4msdhlAJkQRmdRFxxzJ40THbOyEj40w1++/dwioIBqRu7VzoePyPEwXa5ZMy2E75ou6Gq0jz4rHndM5TQMROYhd5g== https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30/sig http://purl.org/nanopub/x/hasSignatureTarget https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30 https://w3id.org/np/RAksVodJGD_eyVD6eiJZueShPVaysLRUGqVE0ydr2ZC30/sig http://purl.org/nanopub/x/signedBy https://orcid.org/0009-0007-4948-9192