https://w3id.org/np/RAkjqw6Y3fZNeyIYGunhwjOcamXFsCHlAGKvCVZ5dcq_Q
.trig | .trig.txt | .jelly | .jelly.txt | .jsonld | .jsonld.txt | .nq | .nq.txt | .xml | .xml.txt
@prefix this: <https://w3id.org/np/RAkjqw6Y3fZNeyIYGunhwjOcamXFsCHlAGKvCVZ5dcq_Q> .
@prefix sub: <https://w3id.org/np/RAkjqw6Y3fZNeyIYGunhwjOcamXFsCHlAGKvCVZ5dcq_Q/> .
@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-ch07-22--claim-test> a <https://w3id.org/delphi/ontology/Assessment>;
dc:description "analysis.py shuffled 256 zeros and 256 ones with PCG64 seed 20261102 and evolved elementary rule 184 for 256 steps on a periodic line of width 512. A defect is a cell equal to its right neighbor. W(0)=258, W(256)=0, early mean=91.1875, late mean=3.9225, compression ratio=0.5842.";
<http://www.w3.org/2000/01/rdf-schema#comment> "Measured: 0.5842105263157895 lzma(defect bitmap) / lzma(row-shifted control) (n = 258, exact on the locked initial row). Interpretation: Page 359 states the example: rule 184 from a random initial condition with equally many black and white cells produces stripes that annihilate when they meet and leave nested regions. Defects are adjacent equal cells, which are absent from the alternating state the balanced rule moves toward. Nesting is compressibility of the defect bitmap relative to a row-shifted control that keeps each row's defect count but breaks diagonal structure. The result is about this one rule on this lattice. It does not establish the claim for every domain-merging system, and it says nothing about organisms.";
<http://www.w3.org/2000/01/rdf-schema#label> "Claim test of wolfram2002-ch07-22: supports, confidence 0.72";
<http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch07-22/result.json>;
prov:wasAttributedTo <https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7>;
<https://w3id.org/delphi/ontology/admissibleDatasets> "Elementary rule 184 on a width-512 ring from one locked balanced shuffle. No other rule is scored.";
<https://w3id.org/delphi/ontology/assessmentType> "claim-test/0.1.0";
<https://w3id.org/delphi/ontology/dataKind> "computational";
<https://w3id.org/delphi/ontology/disconfirmingObservation> "The defect count stays above 90% of its initial value, or the defect bitmap does not compress better than the control.";
<https://w3id.org/delphi/ontology/evidenceAgainst> "Nesting here is compressibility against a row-shifted control, not a proof that the defect tree is a substitution system.",
"Only rule 184 is tested. The page's statement about essentially any domain-merging system is not.",
"The result is about this program on this lattice. It does not show that organisms form nested patterns this way.";
<https://w3id.org/delphi/ontology/expectedObservation> "Defect count at step 256 is at most half the initial count, the late defect count is at most half the early count, and the defect bitmap compresses to at most 85% of the row-shifted control.";
<https://w3id.org/delphi/ontology/failCriterion> "Pre-registered. Refutes if W(256) > 0.9 * W(0) (no substantial annihilation) or the compression ratio is >= 1. Mixed if annihilation holds but the compression ratio is in (0.85, 1), or the compression ratio is <= 0.85 but only one of the two annihilation inequalities holds. Rule 110, mentioned later on the same page, is not part of this test.";
<https://w3id.org/delphi/ontology/hasConfidence> "0.72"^^xsd:double;
<https://w3id.org/delphi/ontology/hasEvidence> <https://w3id.org/delphi/resource/evidence/wolfram2002-ch07-22--claim-test--dataset-1>;
<https://w3id.org/delphi/ontology/hasVerdict> "supports";
<https://w3id.org/delphi/ontology/hypothesis> "Elementary rule 184, started from a balanced random row, progressively annihilates equal-neighbor defects, and the defect space-time is more compressible than the same rows after random cyclic shifts.";
<https://w3id.org/delphi/ontology/inferenceMethod> "Compare W(256) and the early/late means with the locked ratios, and compare lzma sizes of the defect bitmap and one locked row-shift control.";
<https://w3id.org/delphi/ontology/passCriterion> "Pre-registered. Only rule 184 is tested; the page's 'essentially any system' is not. Width 512, periodic boundaries, 256 steps. Initial row: a shuffle of exactly 256 zeros and 256 ones, numpy Generator PCG64 seed 20261102. A defect site is a cell equal to its right neighbor. Let W(t) be the number of defect sites at step t. Progressive annihilation: W(256) <= W(0) / 2, and the mean of W over steps 128..256 is <= half the mean of W over steps 0..31. Nesting: pack the 257 by 512 defect bitmap and lzma-9 compress it. The control is the same bitmap with each row cyclically rotated by an independent integer from numpy Generator PCG64 seed 20261103. Supports if both annihilation inequalities hold and lzma(defects) / lzma(control) <= 0.85.";
<https://w3id.org/delphi/ontology/preregistered> "false"^^xsd:boolean .
<https://w3id.org/delphi/resource/claim/wolfram2002-ch07-22> <https://w3id.org/delphi/ontology/hasAssessment>
<https://w3id.org/delphi/resource/assessment/wolfram2002-ch07-22--claim-test> .
<https://w3id.org/delphi/resource/evidence/wolfram2002-ch07-22--claim-test--dataset-1>
a <https://w3id.org/delphi/ontology/EvidenceItem>;
dc:description "the one stated rule, with equal numbers of black and white cells";
dc:license "generated";
<http://www.w3.org/2000/01/rdf-schema#label> "Dataset: Rule 184 from one balanced shuffle, width 512, 256 steps";
prov:wasDerivedFrom <https://www.wolframscience.com/nks/p359--origins-of-simple-behavior/> .
}
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-programs-c-b6e6)";
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-ch07-22/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.932Z"^^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-ch07-22--claim-test>;
<http://www.w3.org/2000/01/rdf-schema#label> "Claim test of wolfram2002-ch07-22: supports, confidence 0.72";
<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 "izyGV6Pu2keI0oHoXP6WDM+C07TCIZ4BPuPnrfMUBqd89s4OZIg0Ds3jhcTjxVBsxmXGGKGzqcbQ52yngcXMK1Y2yg9zkb8L8zpOmXxWrmIjIKrJdyZh5GXZ7BKeanYG7cgXKyP9fVlgM6uK9JnBMX2/qS6rzmnAs+juRS9CWqJxJJG+O0g9AXACMP85CdN445T7J+wRxBSNwgWBt6XUAkc+KBIZpsxVmpt2KT6U2K8sdBTSHc50pna28WTa7QsScZasln2Oc1/+dFYElgsxgPcAje4C1ua5sZ0vNTF8FrOP5Il7tjk+K1WCMUGTX4PEUijxIb9Oo6WQku1CM+Dy1Q==";
npx:hasSignatureTarget this:;
npx:signedBy <https://orcid.org/0009-0007-4948-9192> .
}