[ { "@id": "https://w3id.org/np/RAC75kbIpCmBQAsg1NtcxP1ehCYZq8PykdkQEnBkGn9qY/provenance", "@graph": [ { "@id": "https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7", "@type": [ "http://www.w3.org/ns/prov#SoftwareAgent" ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "delphisci claim tester (Grok 4.7; cursor/wolfram-claim-tests-b-355b)" } ], "http://www.w3.org/ns/prov#actedOnBehalfOf": [ { "@id": "https://orcid.org/0009-0007-4948-9192" } ], "https://w3id.org/delphi/ontology/usesModel": [ { "@id": "https://w3id.org/delphi/resource/model/grok-4-7" } ] }, { "@id": "https://w3id.org/delphi/resource/model/grok-4-7", "http://purl.org/dc/terms/identifier": [ { "@value": "Grok 4.7" } ], "@type": [ "https://w3id.org/delphi/ontology/LanguageModel" ] }, { "@id": "https://w3id.org/np/RAC75kbIpCmBQAsg1NtcxP1ehCYZq8PykdkQEnBkGn9qY/assertion", "http://www.w3.org/ns/prov#wasAttributedTo": [ { "@id": "https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7" } ], "http://www.w3.org/ns/prov#wasDerivedFrom": [ { "@id": "https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch06-18/result.json" } ], "http://www.w3.org/ns/prov#wasGeneratedBy": [ { "@id": "https://w3id.org/np/RAC75kbIpCmBQAsg1NtcxP1ehCYZq8PykdkQEnBkGn9qY/test" } ] }, { "@id": "https://w3id.org/np/RAC75kbIpCmBQAsg1NtcxP1ehCYZq8PykdkQEnBkGn9qY/test", "@type": [ "http://www.w3.org/ns/prov#Activity" ], "http://www.w3.org/ns/prov#qualifiedAssociation": [ { "@id": "https://w3id.org/np/RAC75kbIpCmBQAsg1NtcxP1ehCYZq8PykdkQEnBkGn9qY/plan" } ], "http://www.w3.org/ns/prov#wasAssociatedWith": [ { "@id": "https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7" } ] }, { "@id": "https://w3id.org/np/RAC75kbIpCmBQAsg1NtcxP1ehCYZq8PykdkQEnBkGn9qY/plan", "http://www.w3.org/ns/prov#hadPlan": [ { "@id": "https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/README.md" } ] } ] }, { "@id": "https://w3id.org/np/RAC75kbIpCmBQAsg1NtcxP1ehCYZq8PykdkQEnBkGn9qY/pubinfo", "@graph": [ { "@id": "https://w3id.org/np/RAC75kbIpCmBQAsg1NtcxP1ehCYZq8PykdkQEnBkGn9qY", "http://purl.org/dc/terms/created": [ { "@value": "2026-11-08T16:24:31.928Z", "@type": "http://www.w3.org/2001/XMLSchema#dateTime" } ], "http://purl.org/dc/terms/creator": [ { "@id": "https://orcid.org/0009-0007-4948-9192" } ], "http://purl.org/dc/terms/license": [ { "@id": "https://creativecommons.org/licenses/by/4.0/" } ], "http://purl.org/nanopub/x/hasNanopubType": [ { "@id": "https://w3id.org/delphi/ontology/Assessment" } ], "http://purl.org/nanopub/x/introduces": [ { "@id": "https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-18--claim-test" } ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "Claim test of wolfram2002-ch06-18: supports, confidence 0.93" } ], "https://w3id.org/delphi/ontology/domain": [ { "@id": "https://w3id.org/delphi/resource/domain/wolfram-nks-2002" } ] }, { "@id": "https://w3id.org/np/RAC75kbIpCmBQAsg1NtcxP1ehCYZq8PykdkQEnBkGn9qY/sig", "http://purl.org/nanopub/x/hasAlgorithm": [ { "@value": "RSA" } ], "http://purl.org/nanopub/x/hasPublicKey": [ { "@value": "MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB" } ], "http://purl.org/nanopub/x/hasSignature": [ { "@value": "Xz+D1POsbx3sdyMkibEpvEzhGTVoFDggdvIdvU6kdVQcL62OqaA+oZR6WEjSGWUH78KTW4w0209qTTyM6Y0GHyMnazLsrkrihwpC/NcMctRnx317LGoXABjEpVtK+Ums0t+iWkQFKP2jdip7H5mRatLphm/EcS0x5htjH4FuTPrHCvLa2sRVmpyKNzbG8Cr5l3zTL5XLLC+MG/3kabp/p2Gisp/roWQicnGsHCWuxWqle2a3FP7Xq58wZhxssjIIH6E9Scj+AJDvZR5q9NiLR3ZINwLR2U041c9yTnJzfaYWrdYc5rP4TbpA9UZxJO370PGA7gVCLsanFT2gDIAT3Q==" } ], "http://purl.org/nanopub/x/hasSignatureTarget": [ { "@id": "https://w3id.org/np/RAC75kbIpCmBQAsg1NtcxP1ehCYZq8PykdkQEnBkGn9qY" } ], "http://purl.org/nanopub/x/signedBy": [ { "@id": "https://orcid.org/0009-0007-4948-9192" } ] } ] }, { "@id": "https://w3id.org/np/RAC75kbIpCmBQAsg1NtcxP1ehCYZq8PykdkQEnBkGn9qY/assertion", "@graph": [ { "@id": "https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-18--claim-test", "http://purl.org/dc/terms/description": [ { "@value": "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." } ], "@type": [ "https://w3id.org/delphi/ontology/Assessment" ], "http://www.w3.org/2000/01/rdf-schema#comment": [ { "@value": "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": [ { "@value": "Claim test of wolfram2002-ch06-18: supports, confidence 0.93" } ], "http://www.w3.org/2000/01/rdf-schema#seeAlso": [ { "@id": "https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch06-18/result.json" } ], "http://www.w3.org/ns/prov#wasAttributedTo": [ { "@id": "https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7" } ], "https://w3id.org/delphi/ontology/admissibleDatasets": [ { "@value": "Elementary rules 126 and 90 only, periodic boundary, the locked width and seeds. Not evidence about organisms." } ], "https://w3id.org/delphi/ontology/assessmentType": [ { "@value": "claim-test/0.1.0" } ], "https://w3id.org/delphi/ontology/dataKind": [ { "@value": "computational" } ], "https://w3id.org/delphi/ontology/disconfirmingObservation": [ { "@value": "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": [ { "@value": "A match shows only that this computation behaves as claimed. It says nothing about organisms." }, { "@value": "The encoding is duplicated bits, and the match is every two steps. A different block encoding is not ruled out or in." }, { "@value": "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)." }, { "@value": "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": [ { "@value": "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": [ { "@value": "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": [ { "@value": "0.93", "@type": "http://www.w3.org/2001/XMLSchema#double" } ], "https://w3id.org/delphi/ontology/hasEvidence": [ { "@id": "https://w3id.org/delphi/resource/evidence/wolfram2002-ch06-18--claim-test--dataset-1" } ], "https://w3id.org/delphi/ontology/hasVerdict": [ { "@value": "supports" } ], "https://w3id.org/delphi/ontology/hypothesis": [ { "@value": "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": [ { "@value": "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": [ { "@value": "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": [ { "@value": "false", "@type": "http://www.w3.org/2001/XMLSchema#boolean" } ] }, { "@id": "https://w3id.org/delphi/resource/evidence/wolfram2002-ch06-18--claim-test--dataset-1", "http://purl.org/dc/terms/description": [ { "@value": "the stated pair, rule 126 emulating rule 90" } ], "http://purl.org/dc/terms/license": [ { "@value": "generated data" } ], "@type": [ "https://w3id.org/delphi/ontology/EvidenceItem" ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "Dataset: Rule 126 on all duplicated-pair states of a width-32 ring" } ], "http://www.w3.org/ns/prov#wasDerivedFrom": [ { "@id": "https://www.wolframscience.com/nks/p269--special-initial-conditions/" } ] }, { "@id": "https://w3id.org/delphi/resource/claim/wolfram2002-ch06-18", "https://w3id.org/delphi/ontology/hasAssessment": [ { "@id": "https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-18--claim-test" } ] } ] }, { "@id": "https://w3id.org/np/RAC75kbIpCmBQAsg1NtcxP1ehCYZq8PykdkQEnBkGn9qY/Head", "@graph": [ { "@id": "https://w3id.org/np/RAC75kbIpCmBQAsg1NtcxP1ehCYZq8PykdkQEnBkGn9qY", "http://www.nanopub.org/nschema#hasAssertion": [ { "@id": "https://w3id.org/np/RAC75kbIpCmBQAsg1NtcxP1ehCYZq8PykdkQEnBkGn9qY/assertion" } ], "http://www.nanopub.org/nschema#hasProvenance": [ { "@id": "https://w3id.org/np/RAC75kbIpCmBQAsg1NtcxP1ehCYZq8PykdkQEnBkGn9qY/provenance" } ], "http://www.nanopub.org/nschema#hasPublicationInfo": [ { "@id": "https://w3id.org/np/RAC75kbIpCmBQAsg1NtcxP1ehCYZq8PykdkQEnBkGn9qY/pubinfo" } ], "@type": [ "http://www.nanopub.org/nschema#Nanopublication" ] } ] } ]