https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk/Head https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk http://www.nanopub.org/nschema#hasAssertion https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk/assertion https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk http://www.nanopub.org/nschema#hasProvenance https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk/provenance https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk/pubinfo https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk/assertion https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--claim-test http://purl.org/dc/terms/description analysis.py evolves rule 90 from a single black cell for 2048 steps on a 4097-cell line (boundary never reached, asserted). For k = 1..11 it reconstructs the 2^k-row triangle from three translated copies of the 2^(k-1)-row triangle (top centred, bottom copies shifted by -2^(k-1) and +2^(k-1)) over a white background and counts mismatching cells against the simulated triangle, also counting black cells inside the central inverted triangle. It then downloads the OEIS A001317 b-file (3322 terms), reads each simulated row's cells at positions x = -t, -t+2, ..., t as a binary number and compares with A001317(t) for all 2048 rows. https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--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-ch02-01--claim-test http://www.w3.org/2000/01/rdf-schema#comment Measured: 0 mismatching cells in the three-copy decomposition, summed over k = 1..11 (n = 11180714, exact). Interpretation: 'Nested triangular pieces that all have exactly the same form' is operationalised as exact self-similarity under doubling: the pattern of the first 2^k steps is three translated copies of the pattern of the first 2^(k-1) steps separated by an empty (white) inverted triangle; iterated down to k = 1 this means every triangular piece is a scaled copy of the whole. The rule is the Wolfram rule 90 (new colour = XOR of the two neighbours), started from one black cell on an otherwise white infinite line, which is simulated exactly on a line wide enough that boundaries never matter. As an independent external check the rows are compared with OEIS A001317 (Sierpinski's triangle rows read as binary numbers), which is tabulated independently of any cellular-automaton code. https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--claim-test http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch02-01: supports, confidence 0.99 https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--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-ch02-01/result.json https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--claim-test http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--claim-test https://w3id.org/delphi/ontology/admissibleDatasets Planned datasets: eca-rule90-single-cell-2048-steps, oeis-a001317-bfile https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--claim-test https://w3id.org/delphi/ontology/assessmentType claim-test/0.1.0 https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--claim-test https://w3id.org/delphi/ontology/dataKind computational https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--claim-test https://w3id.org/delphi/ontology/disconfirmingObservation Pre-registered: any cell of the simulated pattern violates the three-copy decomposition at some k <= 11, or any simulated row differs from the independently tabulated A001317 value. https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--claim-test https://w3id.org/delphi/ontology/evidenceAgainst Exact self-similarity was verified up to depth 2^11 = 2048 steps; the extension to all depths follows from the row formula a(t,x) = C(t,(t+x)/2) mod 2 and Lucas's theorem, which the OEIS comparison confirms independently for every simulated row but which this test does not prove. https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--claim-test https://w3id.org/delphi/ontology/evidenceAgainst OEIS A001317 is itself computed from Pascal's triangle mod 2, not from a cellular automaton, so the agreement is a check against an independent construction of the same mathematical object, not against a physical dataset. https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--claim-test https://w3id.org/delphi/ontology/expectedObservation Pre-registered: (1) for every k = 1..11 the 2^k-step triangle decomposes exactly (zero mismatching cells) into three copies of the 2^(k-1)-step triangle plus an all-white central inverted triangle; and (2) every simulated row t whose value is present in the OEIS A001317 b-file equals A001317(t) when the row's cells at positions of parity t are read as a binary number (zero mismatching rows). https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--claim-test https://w3id.org/delphi/ontology/failCriterion Pre-registered: any cell of the simulated pattern violates the three-copy decomposition at some k <= 11, or any simulated row differs from the independently tabulated A001317 value. https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--claim-test https://w3id.org/delphi/ontology/hasConfidence 0.99 https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch02-01--claim-test--dataset-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch02-01--claim-test--dataset-2 https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--claim-test https://w3id.org/delphi/ontology/hasVerdict supports https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--claim-test https://w3id.org/delphi/ontology/hypothesis Rule 90 evolved from a single black cell produces a pattern in which the triangle of the first 2^k steps is composed exactly of three copies of the triangle of the first 2^(k-1) steps (one on top, two below, with an all-white inverted triangle between them), for every k up to the depth simulated, and its rows coincide with Pascal's triangle modulo 2 as tabulated independently in OEIS A001317. https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--claim-test https://w3id.org/delphi/ontology/inferenceMethod analysis.py evolves rule 90 from a single black cell for 2048 steps on a 4097-cell line (boundary never reached, asserted). For k = 1..11 it reconstructs the 2^k-row triangle from three translated copies of the 2^(k-1)-row triangle (top centred, bottom copies shifted by -2^(k-1) and +2^(k-1)) over a white background and counts mismatching cells against the simulated triangle, also counting black cells inside the central inverted triangle. It then downloads the OEIS A001317 b-file (3322 terms), reads each simulated row's cells at positions x = -t, -t+2, ..., t as a binary number and compares with A001317(t) for all 2048 rows. https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--claim-test https://w3id.org/delphi/ontology/passCriterion Pre-registered: (1) for every k = 1..11 the 2^k-step triangle decomposes exactly (zero mismatching cells) into three copies of the 2^(k-1)-step triangle plus an all-white central inverted triangle; and (2) every simulated row t whose value is present in the OEIS A001317 b-file equals A001317(t) when the row's cells at positions of parity t are read as a binary number (zero mismatching rows). https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--claim-test https://w3id.org/delphi/ontology/preregistered false https://w3id.org/delphi/resource/claim/wolfram2002-ch02-01 https://w3id.org/delphi/ontology/hasAssessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--claim-test https://w3id.org/delphi/resource/evidence/wolfram2002-ch02-01--claim-test--dataset-1 http://purl.org/dc/terms/description the pattern whose nesting is tested https://w3id.org/delphi/resource/evidence/wolfram2002-ch02-01--claim-test--dataset-1 http://purl.org/dc/terms/license https://w3id.org/delphi/resource/evidence/wolfram2002-ch02-01--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-ch02-01--claim-test--dataset-1 http://www.w3.org/2000/01/rdf-schema#label Dataset: Elementary cellular automaton rule 90 from a single black cell, 2048 steps (generated by analysis.py) https://w3id.org/delphi/resource/evidence/wolfram2002-ch02-01--claim-test--dataset-2 http://purl.org/dc/terms/description independent tabulation of rule-90 rows from a single cell (row t read as binary) https://w3id.org/delphi/resource/evidence/wolfram2002-ch02-01--claim-test--dataset-2 http://purl.org/dc/terms/license CC BY-SA 4.0 (OEIS) https://w3id.org/delphi/resource/evidence/wolfram2002-ch02-01--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-ch02-01--claim-test--dataset-2 http://www.w3.org/2000/01/rdf-schema#label Dataset: OEIS A001317: Sierpinski's triangle (Pascal's triangle mod 2) converted to decimal, b-file https://w3id.org/delphi/resource/evidence/wolfram2002-ch02-01--claim-test--dataset-2 http://www.w3.org/ns/prov#atLocation https://oeis.org/A001317/b001317.txt https://w3id.org/delphi/resource/evidence/wolfram2002-ch02-01--claim-test--dataset-2 http://www.w3.org/ns/prov#wasDerivedFrom https://oeis.org/A001317 https://w3id.org/delphi/resource/evidence/wolfram2002-ch02-01--claim-test--dataset-2 https://w3id.org/delphi/ontology/hasChecksum sha256:fc61a63ffcdbfe524aee0ebf372f4a91653244cb466a94fba3b5ee48ccb04f19 https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk/provenance https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 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-fable-5-1 http://www.w3.org/2000/01/rdf-schema#label delphisci claim tester (claude-fable-5.1; cursor/claim-tests-wolfram-nks-0123) https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 http://www.w3.org/ns/prov#actedOnBehalfOf https://orcid.org/0009-0007-4948-9192 https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 https://w3id.org/delphi/ontology/usesModel https://w3id.org/delphi/resource/model/claude-fable-5-1 https://w3id.org/delphi/resource/model/claude-fable-5-1 http://purl.org/dc/terms/identifier claude-fable-5.1 https://w3id.org/delphi/resource/model/claude-fable-5-1 http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/LanguageModel https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk/assertion http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk/assertion http://www.w3.org/ns/prov#wasDerivedFrom https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch02-01/result.json https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk/assertion http://www.w3.org/ns/prov#wasGeneratedBy https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk/test https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk/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/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk/test http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#Activity https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk/test http://www.w3.org/ns/prov#qualifiedAssociation https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk/plan https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk/test http://www.w3.org/ns/prov#wasAssociatedWith https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk/pubinfo https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk http://purl.org/dc/terms/created 2026-11-08T16:24:31.913Z https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk http://purl.org/dc/terms/creator https://orcid.org/0009-0007-4948-9192 https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk http://purl.org/dc/terms/license https://creativecommons.org/licenses/by/4.0/ https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk http://purl.org/nanopub/x/hasNanopubType https://w3id.org/delphi/ontology/Assessment https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk http://purl.org/nanopub/x/introduces https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-01--claim-test https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch02-01: supports, confidence 0.99 https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk https://w3id.org/delphi/ontology/domain https://w3id.org/delphi/resource/domain/wolfram-nks-2002 https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk/sig http://purl.org/nanopub/x/hasAlgorithm RSA https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk/sig http://purl.org/nanopub/x/hasPublicKey MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk/sig http://purl.org/nanopub/x/hasSignature aLgjaUFn5HtaopoC2NM0+QaS+/W/qNkDJDDm2PS39IHX/qlWSnFUFkCVogVQ4+7tjsBVXXyh5dvHr0O2yPvuFG0JEe+Zw+wFf3yVwed+hPoR00Hlsmejq6ZHgR7F5blymK7lUDRwTd/vm3lW/cbpqzwVLgpqGCDfU7DVeAkVmydBf4PrPehKoG2oih5Vah6i1KEtsw9Ja40OOApOPczenGy0dOf0G+0NcitHbXsnTpldNAEflI/7+cY7vaotjxi5z4t2i+kjhrbVqItjl3jwDEby2zoLbcoHSjxOcREZk9Cw3qPsrh4IPw8h/oijnchG6Z+xEIQRceFLFFfUnz5EZQ== https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk/sig http://purl.org/nanopub/x/hasSignatureTarget https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk https://w3id.org/np/RA7wpL-OuEGqA7vxhPp-eWjTWuL0k0o2duIbqmrIaOaFk/sig http://purl.org/nanopub/x/signedBy https://orcid.org/0009-0007-4948-9192