https://w3id.org/np/RAC75kbIpCmBQAsg1NtcxP1ehCYZq8PykdkQEnBkGn9qY
.trig | .trig.txt | .jelly | .jelly.txt | .jsonld | .jsonld.txt | .nq | .nq.txt | .xml | .xml.txt
@prefix this: <https://w3id.org/np/RAC75kbIpCmBQAsg1NtcxP1ehCYZq8PykdkQEnBkGn9qY> .
@prefix sub: <https://w3id.org/np/RAC75kbIpCmBQAsg1NtcxP1ehCYZq8PykdkQEnBkGn9qY/> .
@prefix np: <http://www.nanopub.org/nschema#> .
@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix prov: <http://www.w3.org/ns/prov#> .
@prefix npx: <http://purl.org/nanopub/x/> .
@prefix dc: <http://purl.org/dc/terms/> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
sub:Head {
this: a np:Nanopublication;
np:hasAssertion sub:assertion;
np:hasProvenance sub:provenance;
np:hasPublicationInfo sub:pubinfo .
}
sub:assertion {
<https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-18--claim-test> a <https://w3id.org/delphi/ontology/Assessment>;
dc:description "analysis.py encodes each 16-bit mask as duplicated adjacent pairs on a periodic ring of width 32, applies rule 126 twice, and compares both cells of each pair with one step of rule 90. The same comparison is repeated for 40 double-steps on masks 256, 43690 and 42405.";
<http://www.w3.org/2000/01/rdf-schema#comment> "Measured: 0 mismatches among 65536 pair-states (n = 65536, exact enumeration). Interpretation: The claim names rule 126 behaving like rule 90 when started from paired-cell blocks. The pair is the duplicated bit bb, and the match is every two steps, which is the alignment on which the two cells of a pair agree again. 'Quite common', and the further remark that class 3 rules can thereby act like class 2 rules, are outside this test.";
<http://www.w3.org/2000/01/rdf-schema#label> "Claim test of wolfram2002-ch06-18: supports, confidence 0.93";
<http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch06-18/result.json>;
prov:wasAttributedTo <https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7>;
<https://w3id.org/delphi/ontology/admissibleDatasets> "Elementary rules 126 and 90 only, periodic boundary, the locked width and seeds. Not evidence about organisms.";
<https://w3id.org/delphi/ontology/assessmentType> "claim-test/0.1.0";
<https://w3id.org/delphi/ontology/dataKind> "computational";
<https://w3id.org/delphi/ontology/disconfirmingObservation> "At least one pair-state of rule 126 whose image after two steps is not the pair-encoding of rule 90.";
<https://w3id.org/delphi/ontology/evidenceAgainst> "A match shows only that this computation behaves as claimed. It says nothing about organisms.",
"The encoding is duplicated bits, and the match is every two steps. A different block encoding is not ruled out or in.",
"The stated example holds on this ring: 0 mismatches in 65536 pair-states, and 0 mismatched steps on the three trajectories (41 comparisons each, counting the initial state).",
"The test does not estimate how common such emulations are, and it does not check that class 3 rules can thereby act like class 2 rules. Those clauses of the claim are untested.";
<https://w3id.org/delphi/ontology/expectedObservation> "Zero mismatches among the 65536 pair-states on the width-32 ring, and zero mismatched steps on the three 40-step trajectories.";
<https://w3id.org/delphi/ontology/failCriterion> "Pre-registered. Any pair-state whose two-step image is not the rule-90 encoding refutes the stated example. A trajectory mismatch with a clean exhaustive check is mixed. There is no other-pair survey to fail.";
<https://w3id.org/delphi/ontology/hasConfidence> "0.93"^^xsd:double;
<https://w3id.org/delphi/ontology/hasEvidence> <https://w3id.org/delphi/resource/evidence/wolfram2002-ch06-18--claim-test--dataset-1>;
<https://w3id.org/delphi/ontology/hasVerdict> "supports";
<https://w3id.org/delphi/ontology/hypothesis> "On a ring of 16 duplicated pairs, every two steps of rule 126 return both cells of each pair to the pair-encoding of one step of rule 90, for every one of the 65536 pair-states.";
<https://w3id.org/delphi/ontology/inferenceMethod> "Exhaustive comparison on the paired subspace, plus three locked orbits. A mismatch count of zero supports the stated example.";
<https://w3id.org/delphi/ontology/passCriterion> "Pre-registered. Encoding: each bit b is written as the adjacent pair bb. Ring width 32. For every mask in 0..65535, two steps of elementary rule 126 equal the pair-encoding of one step of elementary rule 90. The same equality is checked for 40 double-steps on three seeds: mask 256 (a single 1), mask 43690 (0xAAAA), and mask 42405 (0xA5A5). Supports if every pair-state matches and every trajectory step matches. This is only the stated pair rule 126 and rule 90. It is not a survey of other pairs, and it does not test the words 'quite common'.";
<https://w3id.org/delphi/ontology/preregistered> "false"^^xsd:boolean .
<https://w3id.org/delphi/resource/claim/wolfram2002-ch06-18> <https://w3id.org/delphi/ontology/hasAssessment>
<https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-18--claim-test> .
<https://w3id.org/delphi/resource/evidence/wolfram2002-ch06-18--claim-test--dataset-1>
a <https://w3id.org/delphi/ontology/EvidenceItem>;
dc:description "the stated pair, rule 126 emulating rule 90";
dc:license "generated data";
<http://www.w3.org/2000/01/rdf-schema#label> "Dataset: Rule 126 on all duplicated-pair states of a width-32 ring";
prov:wasDerivedFrom <https://www.wolframscience.com/nks/p269--special-initial-conditions/> .
}
sub:provenance {
<https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7> a prov:SoftwareAgent;
<http://www.w3.org/2000/01/rdf-schema#label> "delphisci claim tester (Grok 4.7; cursor/wolfram-claim-tests-b-355b)";
prov:actedOnBehalfOf <https://orcid.org/0009-0007-4948-9192>;
<https://w3id.org/delphi/ontology/usesModel> <https://w3id.org/delphi/resource/model/grok-4-7> .
<https://w3id.org/delphi/resource/model/grok-4-7> a <https://w3id.org/delphi/ontology/LanguageModel>;
dc:identifier "Grok 4.7" .
sub:assertion prov:wasAttributedTo <https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7>;
prov:wasDerivedFrom <https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch06-18/result.json>;
prov:wasGeneratedBy sub:test .
sub:plan prov:hadPlan <https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/README.md> .
sub:test a prov:Activity;
prov:qualifiedAssociation sub:plan;
prov:wasAssociatedWith <https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7> .
}
sub:pubinfo {
this: dc:created "2026-11-08T16:24:31.928Z"^^xsd:dateTime;
dc:creator <https://orcid.org/0009-0007-4948-9192>;
dc:license <https://creativecommons.org/licenses/by/4.0/>;
npx:hasNanopubType <https://w3id.org/delphi/ontology/Assessment>;
npx:introduces <https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-18--claim-test>;
<http://www.w3.org/2000/01/rdf-schema#label> "Claim test of wolfram2002-ch06-18: supports, confidence 0.93";
<https://w3id.org/delphi/ontology/domain> <https://w3id.org/delphi/resource/domain/wolfram-nks-2002> .
sub:sig npx:hasAlgorithm "RSA";
npx:hasPublicKey "MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB";
npx:hasSignature "Xz+D1POsbx3sdyMkibEpvEzhGTVoFDggdvIdvU6kdVQcL62OqaA+oZR6WEjSGWUH78KTW4w0209qTTyM6Y0GHyMnazLsrkrihwpC/NcMctRnx317LGoXABjEpVtK+Ums0t+iWkQFKP2jdip7H5mRatLphm/EcS0x5htjH4FuTPrHCvLa2sRVmpyKNzbG8Cr5l3zTL5XLLC+MG/3kabp/p2Gisp/roWQicnGsHCWuxWqle2a3FP7Xq58wZhxssjIIH6E9Scj+AJDvZR5q9NiLR3ZINwLR2U041c9yTnJzfaYWrdYc5rP4TbpA9UZxJO370PGA7gVCLsanFT2gDIAT3Q==";
npx:hasSignatureTarget this:;
npx:signedBy <https://orcid.org/0009-0007-4948-9192> .
}