https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw/Head https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw http://www.nanopub.org/nschema#hasAssertion https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw/assertion https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw http://www.nanopub.org/nschema#hasProvenance https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw/provenance https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw/pubinfo https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw/assertion https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test http://purl.org/dc/terms/description analysis.py computes each of the six recurrences for n <= 2^20 with memoised integer arithmetic, verifies rules (e) and (c) term-by-term against the 10,000-term OEIS b-files of A005185 and A004001 (all terms match), detrends by n/2 (rules c-g) or by a log-log power-law fit for n >= 16 (rule h), lzma-compresses the increment-sign sequence of the residual, and measures sign balance and the dyadic correlation corr(r[n], r[2n]). https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/Assessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test http://www.w3.org/2000/01/rdf-schema#comment Measured: 4 rules among (e)-(h) that are complex/random-like by the pre-registered criteria (n = 4). Interpretation: 'Fluctuations ... complex and in many respects random' (p. 130-131) is read as: the increment-sign sequence of the detrended fluctuations is not compressible to a small fraction of its entropy bound by a general-purpose compressor (nested/digit-based fluctuations compress to < 0.01 bits/symbol), and positive and negative fluctuations are balanced (Wolfram's own stated 'respect' for case (f)). The claim is existential ('can produce'), so one qualifying rule suffices; the book's nested rules (c) and (d) serve as internal controls that must be detected as regular. The OEIS b-files provide independent public values of two of the sequences to verify the implementation. Trend n/2 for (c)-(g) follows the book's plots; the power-law trend for (h) follows the book's caption (0.42 n^0.916). https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch04-08: supports, confidence 0.9 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test http://www.w3.org/2000/01/rdf-schema#seeAlso https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch04-08/result.json https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/delphi/ontology/admissibleDatasets Planned datasets: oeis-a005185-bfile, oeis-a004001-bfile, nks-recursive-sequences-p129 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/delphi/ontology/assessmentType claim-test/0.1.0 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/delphi/ontology/dataKind computational https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/delphi/ontology/disconfirmingObservation Pre-registered. The claim FAILS if none of rules (e)-(h) is complex/random-like (every one is undefined before N, or compresses below 0.5 bits/symbol, or is sign-unbalanced by more than 0.05). If the nested controls (c) or (d) do not compress below 0.15 bits/symbol the measure lacks discriminating power and the verdict is inconclusive (not-operationalizable). If computed terms disagree with the OEIS b-files for A005185 or A004001, the verdict is inconclusive (other) until the implementation is fixed. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/delphi/ontology/evidenceAgainst For rule (h) the power-law trend fitted over n in [16, 2^20] is 0.338 n^0.837, not the book's 0.42 n^0.916 fitted over n <= 2048; residual statistics for (h) depend mildly on the trend choice. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/delphi/ontology/evidenceAgainst Rules (g) and (h) have dyadic correlation corr(r[n], r[2n]) of 0.44 and 0.41 (vs 1.00 for nested rule c and ~0 for e, f), so part of their fluctuation is self-similar at scale 2; they still compress at > 0.97 bits/symbol, so the sign sequence itself carries no detectable regularity. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/delphi/ontology/evidenceAgainst Statistical incompressibility over 2^20 terms is evidence of complexity, not proof that no closed form exists; the test shows the fluctuations are not periodic or nested at the scales examined. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The downloaded b-files (about 97 KB each) are not committed; analysis.py re-fetches them and the SHA-256 values above pin what was used. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The sign-balance 'respect' is Wolfram's own stated one for case (f); other respects of randomness (e.g. spectral flatness, distribution of increments) were not pre-registered and not tested. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/delphi/ontology/expectedObservation Pre-registered. Rules (all with f[1]=f[2]=1, from NKS pp. 129-130): (c) f[n]=f[f[n-1]]+f[n-f[n-1]] (OEIS A004001); (d) f[n]=f[n-f[n-1]]+f[n-f[n-2]-1]; (e) f[n]=f[n-f[n-1]]+f[n-f[n-2]] (OEIS A005185); (f) f[n]=f[n-f[n-1]-1]+f[n-f[n-2]-1]; (g) f[n]=f[f[n-1]]+f[n-f[n-2]-1]; (h) f[n]=f[f[n-1]]+f[n-2f[n-1]+1]. Compute f[n] for n <= N = 2^20 (stop a rule if an index < 1 occurs). Residual r[n] = f[n] - n/2 for (c)-(g); for (h) r[n] = f[n] - a n^b with (a,b) a least-squares power-law fit in log-log. Statistics: (i) bits per symbol = 8 * lzma(preset 9|EXTREME) compressed size of the increment-sign sequence sign(r[n]-r[n-1]) in {-1,0,1} stored as one byte each, divided by N-1; (ii) sign balance |P(increment>0) - P(increment<0)|; (iii) dyadic self-similarity corr(r[n], r[2n]) for n in [N/4, N/2) (reported). A rule is 'complex/random-like' if it is well defined up to N, (i) >= 0.5 bits/symbol and (ii) <= 0.05. The claim PASSES if at least one of rules (e)-(h) is complex/random-like AND the nested controls (c) and (d) both have (i) < 0.15 bits/symbol (validity of the measure). Calibration from controls outside the family: binary digit sum s2(n) gives 0.002 bits/symbol, its partial sums 0.005, a symmetric random walk 1.10. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/delphi/ontology/failCriterion Pre-registered. The claim FAILS if none of rules (e)-(h) is complex/random-like (every one is undefined before N, or compresses below 0.5 bits/symbol, or is sign-unbalanced by more than 0.05). If the nested controls (c) or (d) do not compress below 0.15 bits/symbol the measure lacks discriminating power and the verdict is inconclusive (not-operationalizable). If computed terms disagree with the OEIS b-files for A005185 or A004001, the verdict is inconclusive (other) until the implementation is fixed. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/delphi/ontology/hasConfidence 0.9 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-2 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-3 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/delphi/ontology/hasVerdict supports https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/delphi/ontology/hypothesis At least one of Wolfram's nested recurrences using only addition and subtraction, f[n] = f[p[n]] + f[q[n]] with variable look-back such as n - f[n-1], produces fluctuations about its trend that are incompressible (not periodic or nested) and sign-balanced, while his nested examples (c) and (d) are detected as highly compressible. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/delphi/ontology/inferenceMethod analysis.py computes each of the six recurrences for n <= 2^20 with memoised integer arithmetic, verifies rules (e) and (c) term-by-term against the 10,000-term OEIS b-files of A005185 and A004001 (all terms match), detrends by n/2 (rules c-g) or by a log-log power-law fit for n >= 16 (rule h), lzma-compresses the increment-sign sequence of the residual, and measures sign balance and the dyadic correlation corr(r[n], r[2n]). https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/delphi/ontology/passCriterion Pre-registered. Rules (all with f[1]=f[2]=1, from NKS pp. 129-130): (c) f[n]=f[f[n-1]]+f[n-f[n-1]] (OEIS A004001); (d) f[n]=f[n-f[n-1]]+f[n-f[n-2]-1]; (e) f[n]=f[n-f[n-1]]+f[n-f[n-2]] (OEIS A005185); (f) f[n]=f[n-f[n-1]-1]+f[n-f[n-2]-1]; (g) f[n]=f[f[n-1]]+f[n-f[n-2]-1]; (h) f[n]=f[f[n-1]]+f[n-2f[n-1]+1]. Compute f[n] for n <= N = 2^20 (stop a rule if an index < 1 occurs). Residual r[n] = f[n] - n/2 for (c)-(g); for (h) r[n] = f[n] - a n^b with (a,b) a least-squares power-law fit in log-log. Statistics: (i) bits per symbol = 8 * lzma(preset 9|EXTREME) compressed size of the increment-sign sequence sign(r[n]-r[n-1]) in {-1,0,1} stored as one byte each, divided by N-1; (ii) sign balance |P(increment>0) - P(increment<0)|; (iii) dyadic self-similarity corr(r[n], r[2n]) for n in [N/4, N/2) (reported). A rule is 'complex/random-like' if it is well defined up to N, (i) >= 0.5 bits/symbol and (ii) <= 0.05. The claim PASSES if at least one of rules (e)-(h) is complex/random-like AND the nested controls (c) and (d) both have (i) < 0.15 bits/symbol (validity of the measure). Calibration from controls outside the family: binary digit sum s2(n) gives 0.002 bits/symbol, its partial sums 0.005, a symmetric random walk 1.10. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/delphi/ontology/preregistered false https://w3id.org/delphi/resource/claim/wolfram2002-ch04-08 https://w3id.org/delphi/ontology/hasAssessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-1 http://purl.org/dc/terms/description independent published terms of rule (e) to validate the implementation https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-1 http://purl.org/dc/terms/license CC BY-SA 4.0 (OEIS) https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-1 http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/EvidenceItem https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-1 http://www.w3.org/2000/01/rdf-schema#label Dataset: OEIS A005185 (Hofstadter Q-sequence) b-file https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-1 http://www.w3.org/ns/prov#atLocation https://oeis.org/A005185/b005185.txt https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-1 http://www.w3.org/ns/prov#wasDerivedFrom https://oeis.org/A005185 https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-1 https://w3id.org/delphi/ontology/hasChecksum sha256:123200bbe8c66a132f7a02ede01831b7e5bd69a35efd41bb39e9a917b6e5dde9 https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-2 http://purl.org/dc/terms/description independent published terms of rule (c) to validate the implementation https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-2 http://purl.org/dc/terms/license CC BY-SA 4.0 (OEIS) https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-2 http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/EvidenceItem https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-2 http://www.w3.org/2000/01/rdf-schema#label Dataset: OEIS A004001 (Hofstadter-Conway $10000 sequence) b-file https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-2 http://www.w3.org/ns/prov#atLocation https://oeis.org/A004001/b004001.txt https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-2 http://www.w3.org/ns/prov#wasDerivedFrom https://oeis.org/A004001 https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-2 https://w3id.org/delphi/ontology/hasChecksum sha256:68bb68831fff5fb3baa056b60cb50a7800260fa79ef9902ef915b171c081154e https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-3 http://purl.org/dc/terms/description program family under test https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-3 http://purl.org/dc/terms/license generated data https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-3 http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/EvidenceItem https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-3 http://www.w3.org/2000/01/rdf-schema#label Dataset: Six nested recurrences from NKS pp. 129-130 (generated by analysis.py) https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-08--claim-test--dataset-3 http://www.w3.org/ns/prov#wasDerivedFrom https://www.wolframscience.com/nks/p130--recursive-sequences/ https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw/provenance https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#SoftwareAgent https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 http://www.w3.org/2000/01/rdf-schema#label delphisci claim tester (claude-fable-5.1; cursor/wolfram-nks-claim-tests-106e) https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 http://www.w3.org/ns/prov#actedOnBehalfOf https://orcid.org/0009-0007-4948-9192 https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 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 http://purl.org/dc/terms/identifier claude-fable-5.1 https://w3id.org/delphi/resource/model/claude-fable-5-1 http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/LanguageModel https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw/assertion http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw/assertion http://www.w3.org/ns/prov#wasDerivedFrom https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch04-08/result.json https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw/assertion http://www.w3.org/ns/prov#wasGeneratedBy https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw/test https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw/plan http://www.w3.org/ns/prov#hadPlan https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/README.md https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw/test http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#Activity https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw/test http://www.w3.org/ns/prov#qualifiedAssociation https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw/plan https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw/test http://www.w3.org/ns/prov#wasAssociatedWith https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw/pubinfo https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw http://purl.org/dc/terms/created 2026-11-08T16:24:31.922Z https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw http://purl.org/dc/terms/creator https://orcid.org/0009-0007-4948-9192 https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw http://purl.org/dc/terms/license https://creativecommons.org/licenses/by/4.0/ https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw http://purl.org/nanopub/x/hasNanopubType https://w3id.org/delphi/ontology/Assessment https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw http://purl.org/nanopub/x/introduces https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-08--claim-test https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch04-08: supports, confidence 0.9 https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw https://w3id.org/delphi/ontology/domain https://w3id.org/delphi/resource/domain/wolfram-nks-2002 https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw/sig http://purl.org/nanopub/x/hasAlgorithm RSA https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw/sig http://purl.org/nanopub/x/hasPublicKey MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw/sig http://purl.org/nanopub/x/hasSignature rUDa+DYYgVjhanZmdTMsinIQcJU4o6VxZhQw7mPY9ZEZsiw/9DdHtQKhYoXKNBy/hZ9oeRmt4KlBRIqpKyPklbFwxYYAW6RphCRQadOT8N7dgDzr0SEFOO7Nsz2HF7Y7n+03n4WvlqOdrxzP27W9eLreQwY9tn1aVy9D5LGO6rYM6WqOBJGHTAxbvyyBakQKIa5AI9yfV5quOKP38bSCGC9pjh1EWdAI45O8WRUABMCbV+roI7G/1AK3TzobgvSTLYHCg+aTnm3/N84Fo6LQtgRl7v4Dlo5esYsvyahLJpq1W1DJGyCargMj4Hbbk/Mno/wKk08uZKT41XlhiCjGIQ== https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw/sig http://purl.org/nanopub/x/hasSignatureTarget https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw https://w3id.org/np/RAZP6KxJjCV1YKbcvt9ebG8XX2sqqreIWrd8r_OjS4dAw/sig http://purl.org/nanopub/x/signedBy https://orcid.org/0009-0007-4948-9192