https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs/Head https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs http://www.nanopub.org/nschema#hasAssertion https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs/assertion https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs http://www.nanopub.org/nschema#hasProvenance https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs/provenance https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs/pubinfo https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs/assertion https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test http://purl.org/dc/terms/description analysis.py generates each rule's pattern from a single black cell for 2048 steps, takes the 1024 x 1024 interior window, and compresses it with six methods: Elias-gamma run-length coding, static Huffman on 8-bit blocks (plus a 256-byte table), zlib 9, lzma 9e, bz2 9 and a quadtree code. Each size is divided by the size of a Bernoulli pattern with the same black fraction (clipped to [0.01, 0.99]) compressed by the same method, and the ratios are compared with the pre-registered class thresholds. Run time about 2 s. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--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-08--claim-test http://www.w3.org/2000/01/rdf-schema#comment Measured: [object Object] compressed size relative to a density-matched Bernoulli pattern (r) (n = 1048576, deterministic patterns; Bernoulli control sizes vary by well under 1 % between seeds (rules 50 and 250 controls: 0.00-0.03 %)). Interpretation: Wolfram (p. 560-570) compares run-length, block (Huffman), pointer-based (LZ) and two-dimensional schemes on CA patterns and concludes they share the same capabilities. The four families are represented by our own run-length and block-Huffman coders, three standard library compressors (zlib/Deflate and lzma are pointer-based; bzip2 adds a block-sorting family Wolfram does not discuss) and a quadtree code as the two-dimensional scheme. 'Substantial compression' is measured relative to a random pattern of the same density, so that compression explained by an unequal black/white ratio alone does not count; thresholds of 0.85 (little compression) and 0.60 (substantial) are our choice. The universal 'all methods' wording cannot be tested; a purpose-built compressor for a specific rule is outside the claim's scope (generic methods), as the assessors note. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch10-08: mixed, confidence 0.75 https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--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-08/result.json https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-opus-5-5 https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test https://w3id.org/delphi/ontology/admissibleDatasets Patterns generated exactly from elementary CA rules by committed code, analysed in a window inside the light cone; generic compressors not tuned to any rule; density-matched seeded random references. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test https://w3id.org/delphi/ontology/assessmentType claim-test/0.1.0 https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test https://w3id.org/delphi/ontology/dataKind computational https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test https://w3id.org/delphi/ontology/disconfirmingObservation Any generic method compressing a rule 30 or rule 45 window to less than 60 % of a density-matched random window, or the methods failing to compress both repetitive and nested patterns. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test https://w3id.org/delphi/ontology/evidenceAgainst Exploratory (outside the verdict): rule 110 from a single cell, which Wolfram counts as complex, is compressed strongly by all LZ/BWT methods (r 0.06-0.11) because most of its window is the periodic background; complex patterns embedded in regular backgrounds are compressible by the generic methods. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test https://w3id.org/delphi/ontology/evidenceAgainst Rules 50 and 250 produce the identical checkerboard window, so the repetitive class is effectively one pattern. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The similarity of capabilities is partial, as Wolfram's own wording ('most methods') allows: run-length and quadtree coding do not compress the checkerboard (r 0.88 and 1.08) because it has no long runs or uniform blocks, and block Huffman barely compresses rule 90 (0.86). https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The substantive claim is borne out: no method compresses rule 30 or rule 45 by more than 12 % relative to random (minimum r = 0.88, lzma on rule 30), far above the refutation threshold of 0.60, whereas every method except run-length and quadtree compresses the repetitive pattern more than 7-fold and at least four methods compress each nested pattern to <= 0.49. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test https://w3id.org/delphi/ontology/evidenceAgainst Verdict 'mixed' follows the pre-registered rule because condition (a) fails on a single method: block Huffman compresses the all-black window to 16,640 bytes (12.7 % of raw, the 1-bit-per-symbol floor of a static Huffman code plus its table), which is 0.80 of what it achieves on the Bernoulli(0.99) control, not <= 0.10. This is an artefact of normalizing a uniform pattern by a nearly uniform control, a choice made at pre-registration; every other method compresses the uniform window to <= 1.1 % of the control and run-length/quadtree to essentially nothing. Under a raw-size normalization (not pre-registered) the uniform condition would hold. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test https://w3id.org/delphi/ontology/expectedObservation Across all six methods, uniform and repetitive windows compress to a small fraction of a density-matched random window, nested windows compress at least partly, and rule 30 and rule 45 windows compress by at most 15 %. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test https://w3id.org/delphi/ontology/failCriterion Pre-registered. 'refutes' if any method achieves r < 0.60 on rule 30 or rule 45 (substantial compression of complex behavior by a generic method), or if (b) and (c) both fail (the methods do not share the ability to compress repetition and nesting). 'mixed' otherwise when any of (a)-(d) fails. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test https://w3id.org/delphi/ontology/hasConfidence 0.75 https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-08--claim-test--dataset-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-08--claim-test--dataset-2 https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test https://w3id.org/delphi/ontology/hasVerdict mixed https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test https://w3id.org/delphi/ontology/hypothesis Six structurally different lossless compression methods (run-length, block Huffman, LZ77/Deflate, LZMA, Burrows-Wheeler/bzip2 and a two-dimensional quadtree code) all strongly compress uniform and repetitive cellular automaton patterns, compress nested patterns at least partly, and achieve little compression of complex patterns from rules 30 and 45, relative to random patterns of the same density. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test https://w3id.org/delphi/ontology/inferenceMethod Compressed size ratio r against a density-matched Bernoulli pattern for each (rule, method), compared with the pre-registered per-class thresholds. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test https://w3id.org/delphi/ontology/passCriterion Pre-registered. Patterns: elementary CAs from a single black cell, T = 2048 steps; window rows 1024-2047, columns -512..511 (1024 x 1024 cells, inside the light cone). Classes: uniform = rule 254; repetitive = rules 50 and 250; nested = rules 90 and 150; complex = rules 30 and 45; exploratory (not in the verdict) = rule 110. Methods: (1) run-length coding of the row-major bit stream with Elias-gamma run lengths; (2) static Huffman code on non-overlapping 8-bit blocks (size = code bits + 256-byte table); (3) zlib level 9; (4) lzma preset 9 extreme; (5) bz2 level 9; (6) quadtree code of the 1024 x 1024 bitmap (1 bit 'split' or 2 bits 'uniform leaf + colour'; 1 bit per single cell). Statistic: r = size(pattern) / size(Bernoulli(d) pattern of the same shape), d = pattern's black fraction clipped to [0.01, 0.99], Bernoulli control from numpy PCG64 seed 20261031. 'supports' if all of: (a) uniform: r <= 0.10 for all 6 methods; (b) each repetitive rule: r <= 0.20 for at least 4 of 6 methods; (c) each nested rule: r <= 0.80 for at least 3 of 6 methods; (d) each complex rule: r >= 0.85 for all 6 methods. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test https://w3id.org/delphi/ontology/preregistered false https://w3id.org/delphi/resource/claim/wolfram2002-ch10-08 https://w3id.org/delphi/ontology/hasAssessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-08--claim-test--dataset-1 http://purl.org/dc/terms/description uniform, repetitive, nested and complex patterns to be compressed https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-08--claim-test--dataset-1 http://purl.org/dc/terms/license https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-08--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-08--claim-test--dataset-1 http://www.w3.org/2000/01/rdf-schema#label Dataset: Elementary CA rules 254, 50, 250, 90, 150, 30, 45 and 110 from a single black cell, 2048 steps; interior windows rows 1024-2047, x in [-512, 511] (generated by analysis.py) https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-08--claim-test--dataset-1 http://www.w3.org/ns/prov#wasDerivedFrom https://www.wolframscience.com/nks/p560--data-compression/ https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-08--claim-test--dataset-2 http://purl.org/dc/terms/description normalizing reference for compressed sizes https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-08--claim-test--dataset-2 http://purl.org/dc/terms/license https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-08--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-08--claim-test--dataset-2 http://www.w3.org/2000/01/rdf-schema#label Dataset: Density-matched Bernoulli 1024 x 1024 patterns, numpy PCG64 seed 20261031 (generated by analysis.py) https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs/provenance https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-opus-5-5 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-claude-opus-5-5 http://www.w3.org/2000/01/rdf-schema#label delphisci claim tester (claude-opus-5.5; cursor local subagent) https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-opus-5-5 http://www.w3.org/ns/prov#actedOnBehalfOf https://orcid.org/0009-0007-4948-9192 https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-opus-5-5 https://w3id.org/delphi/ontology/usesModel https://w3id.org/delphi/resource/model/claude-opus-5-5 https://w3id.org/delphi/resource/model/claude-opus-5-5 http://purl.org/dc/terms/identifier claude-opus-5.5 https://w3id.org/delphi/resource/model/claude-opus-5-5 http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/LanguageModel https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs/assertion http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-opus-5-5 https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs/assertion http://www.w3.org/ns/prov#wasDerivedFrom https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch10-08/result.json https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs/assertion http://www.w3.org/ns/prov#wasGeneratedBy https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs/test https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs/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/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs/test http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#Activity https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs/test http://www.w3.org/ns/prov#qualifiedAssociation https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs/plan https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs/test http://www.w3.org/ns/prov#wasAssociatedWith https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-opus-5-5 https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs/pubinfo https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs http://purl.org/dc/terms/created 2026-11-08T16:24:31.934Z https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs http://purl.org/dc/terms/creator https://orcid.org/0009-0007-4948-9192 https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs http://purl.org/dc/terms/license https://creativecommons.org/licenses/by/4.0/ https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs http://purl.org/nanopub/x/hasNanopubType https://w3id.org/delphi/ontology/Assessment https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs http://purl.org/nanopub/x/introduces https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-08--claim-test https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch10-08: mixed, confidence 0.75 https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs https://w3id.org/delphi/ontology/domain https://w3id.org/delphi/resource/domain/wolfram-nks-2002 https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs/sig http://purl.org/nanopub/x/hasAlgorithm RSA https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs/sig http://purl.org/nanopub/x/hasPublicKey MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs/sig http://purl.org/nanopub/x/hasSignature fhRwbRJARXGhj/z5gb8I7AdSMsAfMTUxwsd8cnRcUVCm791pZ5p2IQRHFoLN0N919CuvMFfNyJ6c50fSbv11wqncGPHzJXruEGJ/i9Dv0Yb77dbC+3XjSM1IblZ0wUsGOcmOXM/pSdlB/7lGDqfpIAsRS96efL0RyYgdcB8sNr+E7s5X4/jzZDRO1j6RVOyTqZYpfdK5wA3EBQNtOzn60puLmG6/CnxshM3oQZ2mteAJUvv+NSKabAJKLhTD6sy5F/haExEXkQoYWkN1JqSUwtLYo2gQHa4F7egn5hCCosNIAGGrUkXll5uTpBwmAPJ9S2LtGULsriVFMR4oIl2qvw== https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs/sig http://purl.org/nanopub/x/hasSignatureTarget https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs https://w3id.org/np/RAwiZKOnbBVNO65QvFzGMvC_UQ6X9KS49AZqyou_0uzQs/sig http://purl.org/nanopub/x/signedBy https://orcid.org/0009-0007-4948-9192