@prefix this: . @prefix sub: . @prefix np: . @prefix rdf: . @prefix prov: . @prefix npx: . @prefix dc: . @prefix xsd: . sub:Head { this: a np:Nanopublication; np:hasAssertion sub:assertion; np:hasProvenance sub:provenance; np:hasPublicationInfo sub:pubinfo . } sub:assertion { a ; dc:description "analysis.py iterates reverse-and-add from 512 for 1000 steps and tracks runs of 1-bits of length 1..32 with an 8-bit pad. It tests run-length signatures on the last 400 steps for a period of 1..24 at agreement 0.85, and applies the same repetition test to 400 steps of doubling from 512. Chain counts are in derived/measured.json."; "Measured: 408 tracked chains of localized runs lasting at least 20 steps (n = 1000, count of greedy chains, not a census of visually distinct particles). Interpretation: The page states a thousand steps from 512. 'Localized structures' are persistent short runs of 1-bits in the binary picture, aligned at the least significant bit. 'No simple repetitive form' is the absence of a short period in the sequence of run lengths, not in the integers themselves (those strictly increase). The doubling map is the repetitive control: a single moving 1."; "Claim test of wolfram2002-ch04-07: supports, confidence 0.7"; ; prov:wasAttributedTo ; "The orbit is generated by the locked reverse-and-add rule from 512 for 1000 steps. No external trajectory is loaded. This is not evidence about organisms."; "claim-test/0.1.0"; "computational"; "Fewer than three persistent runs and a short-period signature, with the doubling control correctly flagged as repetitive."; "A match shows only that this computation behaves as claimed. It says nothing about organisms.", "Finite check: 1000 steps, final bit length 627, under the cap of 20000. A later period longer than 24 is not ruled out. The best short-period agreement on the last 400 signatures was 0.0.", "Runs longer than 32 bits are ignored by the tracker, and a structure that jumps more than 8 bits in one step is dropped.", "The count 408 is the number of greedy chains under an 8-bit pad, and the longest chain is 80 steps (18 chains last at least 50; none last 100). One visual structure can be split or re-linked, so 408 is not a particle census. The pre-registered bar was at least 3."; "At least three tracked runs last >= 20 steps, no period 1..24 reaches agreement 0.85 on the last 400 signatures, and the doubling control does reach that agreement."; "Pre-registered. If the run finishes and the doubling control is repetitive, fewer than 3 persistent structures together with a simply repetitive signature refutes the claim on this bound. One of those two features without the other is mixed. Hitting the bit cap, finishing fewer than 1000 steps, or a control that is not flagged repetitive makes the verdict inconclusive. The check does not say the pattern never repeats at a longer period, and it says nothing about organisms."; "0.7"^^xsd:double; ; "supports"; "Base-2 reverse-and-add started at 512, run for 1000 steps, produces at least three localized structures and its run-length signature is not simply periodic, while the same tracker calls the doubling map repetitive."; "Greedy nearest-start tracking of runs of length 1..32 with an 8-bit pad, plus the maximum period-agreement of run-length signatures. Thresholds are the constants in analysis.py."; "Pre-registered. Rule: n -> n + int(bin(n)[2:][::-1], 2), dropping what would be leading zeros, start 512, 1000 iterations, stop if the bit length exceeds 20000. A localized run is a contiguous block of 1-bits of length 1..32, positions measured from the least significant bit. A run continues a chain if its interval lies within 8 bits of the previous run; chains are matched greedily by closest start. A structure is persistent if its chain lasts at least 20 steps. The pattern is simply repetitive if, on the last 400 run-length signatures, some period p in 1..24 agrees on at least 0.85 of the comparable steps. Supports if at least 3 persistent structures are found, the reverse-and-add signature is not simply repetitive, the run finishes all 1000 steps under the bit cap, and the control n -> 2n from 512 for 400 steps is simply repetitive. A moving-bit self-check (one chain of length 30) must pass or the script aborts."; "false"^^xsd:boolean . . a ; dc:description "the orbit whose runs are tracked; the picture on the cited page is the same rule and start"; dc:license "generated data"; "Dataset: Base-2 reverse-and-add orbit from 512"; prov:wasDerivedFrom . } sub:provenance { a prov:SoftwareAgent; "delphisci claim tester (Grok 4.7; cursor/wolfram-claim-tests-b-355b)"; prov:actedOnBehalfOf ; . a ; dc:identifier "Grok 4.7" . sub:assertion prov:wasAttributedTo ; prov:wasDerivedFrom ; prov:wasGeneratedBy sub:test . sub:plan prov:hadPlan . sub:test a prov:Activity; prov:qualifiedAssociation sub:plan; prov:wasAssociatedWith . } sub:pubinfo { this: dc:created "2026-11-08T16:24:31.922Z"^^xsd:dateTime; dc:creator ; dc:license ; npx:hasNanopubType ; npx:introduces ; "Claim test of wolfram2002-ch04-07: supports, confidence 0.7"; . sub:sig npx:hasAlgorithm "RSA"; npx:hasPublicKey "MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB"; npx:hasSignature "QxYOLLXVdXo4CMWtIA18fwrRH7zCG1ciEYgY6jop/kRPmX0t/C4+Mhzk2soedFpiY+1wwYd+OYmPc2rC1RAFBht25YTuIMNVb4+vF0K5tYefBsn45EZDTftEYHeX6PNxJ5ntSEXjRzpyidh/GSG98fetKr3bny8EH8pwUlEPDCF3f/OAcqVvFNxT3w6h3YbFOyCohusid7HT49k3/SOzGobPANFlEGYAHAXsTKjUUYM76puJcGG6OCTX4Y5JeDusszrJsqk7tPNnRN5deWzcbIqO2mDe42sEsQvuDowBDpPIRCHxkKQgKpMUNasl6PErA2PygZF0YP8UoAx95sGuUQ=="; npx:hasSignatureTarget this:; npx:signedBy . }