https://w3id.org/np/RAtL3_CCo1O84EZj3Vzq12smRJ0jmBk185vnUOCZeaN7o
.trig | .trig.txt | .jelly | .jelly.txt | .jsonld | .jsonld.txt | .nq | .nq.txt | .xml | .xml.txt
@prefix this: <https://w3id.org/np/RAtL3_CCo1O84EZj3Vzq12smRJ0jmBk185vnUOCZeaN7o> .
@prefix sub: <https://w3id.org/np/RAtL3_CCo1O84EZj3Vzq12smRJ0jmBk185vnUOCZeaN7o/> .
@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-ch02-08--claim-test> a <https://w3id.org/delphi/ontology/Assessment>;
dc:description "analysis.py evolves rule 110 from one black cell for 8000 steps (boundary never reached; rows 0-4 checked against the standard 1, 11, 111, 1101, 11111). Part A (pre-registered): for P = 1..2000 it tests exact fixed-frame recurrence a(t+P,x) = a(t,x) over the light cone [-t,0] and over the right-edge windows [-500,0], [-1000,0], [-2000,0] across the last 2000 steps; no P qualifies (the leading edge and the drifting structure break every fixed-frame recurrence). Part B (diagnostic, after A): the P = 240 mismatch is recounted excluding the 300 leading-edge cells, which isolates a single cluster of 9-24 cells that drifts left at -0.0846 cells/step; an exhaustive (P, shift) search in windows of +-40 and +-150 cells around that cluster finds its exact space-time period to be (213 steps, -18 cells), with (240, 0) and (240, -20) never matching; the fixed-frame recurrence of the right-edge windows [-50,0] and [-100,0] and of the stripe region is measured for P in {7, 71, 80, 213, 240, 480}, and the onset times of each regime are determined.";
<http://www.w3.org/2000/01/rdf-schema#comment> "Measured: 213 steps (exact minimal space-time period of the surviving localized structure, with a shift of -18 cells per period) (n = 8000, exact (deterministic simulation)). Interpretation: Rule 110 is the Wolfram rule number 110 (rule bit k = new colour for neighbourhood 4*left + 2*centre + right). From a single black cell at x = 0 the pattern occupies only x in [-t, 0] at step t (cells right of the origin stay white), so the natural fixed frame is the one in which the right edge is at rest; Wolfram's figures on pp. 32-39 are drawn in that frame. 'Behavior that repeats every 240 steps' is read as exact time-periodicity of the whole pattern inside the light cone of time t (the cells to the left of -t at time t+P are newly created stripes and are not compared). 'The outcome is finally clear after about 2780 steps' is read as the onset of this exact periodicity, with a 10% tolerance because the text says 'about'. 'One structure survives' is not quantified separately; it is covered by the periodicity of the whole interior.";
<http://www.w3.org/2000/01/rdf-schema#label> "Claim test of wolfram2002-ch02-08: mixed, confidence 0.85";
<http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch02-08/result.json>;
prov:wasAttributedTo <https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1>;
<https://w3id.org/delphi/ontology/admissibleDatasets> "Planned datasets: eca-rule110-single-cell-8000-steps";
<https://w3id.org/delphi/ontology/assessmentType> "claim-test/0.1.0";
<https://w3id.org/delphi/ontology/dataKind> "computational";
<https://w3id.org/delphi/ontology/disconfirmingObservation> "Pre-registered: no P <= 2000 makes the pattern periodic on the light cone for the last 2000 steps of an 8000-step run and 240 is not a period even on the fixed right-edge windows [-500, 0], [-1000, 0] and [-2000, 0]; or the minimal period is not a divisor of 240; or 240 is a period but the onset lies outside [2000, 3500]. Intermediate outcomes (minimal period a proper divisor of 240; periodicity holds only on a restricted window; onset in [2000, 2500) or (3060, 3500]) are pre-registered as 'mixed'.";
<https://w3id.org/delphi/ontology/evidenceAgainst> "Results are for the single evolution the claim describes; 8000 steps were simulated, so the regimes were verified over roughly 5000 steps (about 24 structure periods, 21 periods of 240).",
"The onset part of the claim is confirmed: the last transient collision ends at step 2819-2852 (structure regime from 2819, right-edge 240-periodicity from 2852, P = 240 mismatch count at its final level from 2831), within 3% of 'about 2780'.",
"The period part is only partly confirmed. In the fixed frame the whole pattern except the surviving structure's 9-24-cell neighbourhood (and the leading edge) repeats exactly every 240 steps: the right-edge region [-50,0] has exact period 240 (not 7, 71, 80 or 213), and the stripe train coming from the left has fixed-frame period 80 and lattice vector (3 steps, +2 cells), i.e. a train of speed-2/3 gliders. But the surviving structure itself drifts left at 18 cells per 213 steps and its exact space-time period is (213, -18); it is not 240-periodic in any frame, and no frame makes the whole pattern periodic. 'Behavior that repeats every 240 steps' is therefore accurate for the stripes and the right-edge interaction but not for the surviving structure.",
"The pre-registered primary criterion (exact recurrence on the full light cone) cannot be met by any growing pattern because the leading edge moves; this was a flaw in the pre-registration, and the diagnostic recount excluding 300 leading-edge cells was added after seeing that result. The pre-registered 'mixed' category (periodicity only on restricted windows) is what the data show.";
<https://w3id.org/delphi/ontology/expectedObservation> "Pre-registered: the smallest P in 1..2000 for which a(t+P, x) = a(t, x) for every cell x in the light cone [-t, 0] and every t from some onset t0 to the end of the run equals 240, and that onset t0 (the smallest t from which the relation holds for all later t up to T - P) lies in [2500, 3060], i.e. within 10% of 2780.";
<https://w3id.org/delphi/ontology/failCriterion> "Pre-registered: no P <= 2000 makes the pattern periodic on the light cone for the last 2000 steps of an 8000-step run and 240 is not a period even on the fixed right-edge windows [-500, 0], [-1000, 0] and [-2000, 0]; or the minimal period is not a divisor of 240; or 240 is a period but the onset lies outside [2000, 3500]. Intermediate outcomes (minimal period a proper divisor of 240; periodicity holds only on a restricted window; onset in [2000, 2500) or (3060, 3500]) are pre-registered as 'mixed'.";
<https://w3id.org/delphi/ontology/hasConfidence> "0.85"^^xsd:double;
<https://w3id.org/delphi/ontology/hasEvidence> <https://w3id.org/delphi/resource/evidence/wolfram2002-ch02-08--claim-test--dataset-1>;
<https://w3id.org/delphi/ontology/hasVerdict> "mixed";
<https://w3id.org/delphi/ontology/hypothesis> "Rule 110 evolved from a single black cell becomes exactly time-periodic (in the fixed frame in which the right edge of the pattern stays at x = 0) with minimal period 240 steps, and the periodic regime begins about 2780 steps after the start.";
<https://w3id.org/delphi/ontology/inferenceMethod> "analysis.py evolves rule 110 from one black cell for 8000 steps (boundary never reached; rows 0-4 checked against the standard 1, 11, 111, 1101, 11111). Part A (pre-registered): for P = 1..2000 it tests exact fixed-frame recurrence a(t+P,x) = a(t,x) over the light cone [-t,0] and over the right-edge windows [-500,0], [-1000,0], [-2000,0] across the last 2000 steps; no P qualifies (the leading edge and the drifting structure break every fixed-frame recurrence). Part B (diagnostic, after A): the P = 240 mismatch is recounted excluding the 300 leading-edge cells, which isolates a single cluster of 9-24 cells that drifts left at -0.0846 cells/step; an exhaustive (P, shift) search in windows of +-40 and +-150 cells around that cluster finds its exact space-time period to be (213 steps, -18 cells), with (240, 0) and (240, -20) never matching; the fixed-frame recurrence of the right-edge windows [-50,0] and [-100,0] and of the stripe region is measured for P in {7, 71, 80, 213, 240, 480}, and the onset times of each regime are determined.";
<https://w3id.org/delphi/ontology/passCriterion> "Pre-registered: the smallest P in 1..2000 for which a(t+P, x) = a(t, x) for every cell x in the light cone [-t, 0] and every t from some onset t0 to the end of the run equals 240, and that onset t0 (the smallest t from which the relation holds for all later t up to T - P) lies in [2500, 3060], i.e. within 10% of 2780.";
<https://w3id.org/delphi/ontology/preregistered> "false"^^xsd:boolean .
<https://w3id.org/delphi/resource/claim/wolfram2002-ch02-08> <https://w3id.org/delphi/ontology/hasAssessment>
<https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-08--claim-test> .
<https://w3id.org/delphi/resource/evidence/wolfram2002-ch02-08--claim-test--dataset-1>
a <https://w3id.org/delphi/ontology/EvidenceItem>;
dc:description "the evolution whose transient length and period are measured";
dc:license "";
<http://www.w3.org/2000/01/rdf-schema#label> "Dataset: Elementary cellular automaton rule 110 from a single black cell, 8000 steps (generated by analysis.py)" .
}
sub:provenance {
<https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1> a
prov:SoftwareAgent;
<http://www.w3.org/2000/01/rdf-schema#label> "delphisci claim tester (claude-fable-5.1; cursor/claim-tests-wolfram-nks-0123)";
prov:actedOnBehalfOf <https://orcid.org/0009-0007-4948-9192>;
<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> a <https://w3id.org/delphi/ontology/LanguageModel>;
dc:identifier "claude-fable-5.1" .
sub:assertion prov:wasAttributedTo <https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1>;
prov:wasDerivedFrom <https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch02-08/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-claude-fable-5-1> .
}
sub:pubinfo {
this: dc:created "2026-11-08T16:24:31.915Z"^^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-ch02-08--claim-test>;
<http://www.w3.org/2000/01/rdf-schema#label> "Claim test of wolfram2002-ch02-08: mixed, confidence 0.85";
<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 "tbcdjxwZC2xLyXrfG0sW0q1MO3N87+JkoEwdn24vTC64oPl5n7fyf9yiC2D9cYYDXPKuepX0oGVix7K4sARf6ida8UDrt9uTBcEEUUgshzqEd0EJye5BRYDYCnJi/ZCRnORGIEr3B8moPQKthwTNvQiYaqiKmqUpcaz2GB+sXoF3NIBh/+0rmDwgYHMmRXPAuWevVr9L44STt9ZBZqdAoulol241nm2SAvxZoe41gQOlqdhVGOqyH/hx0xACCNPK8XLafS5D/6pL6ZDxuovY3A4BZx9JQyJr0R75tEBYYvZ2Od+vKMY07edqd/QYcX6IGCMsou2MKadHQ9IVqA2DVw==";
npx:hasSignatureTarget this:;
npx:signedBy <https://orcid.org/0009-0007-4948-9192> .
}