[ { "@id": "https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/Head", "@graph": [ { "@id": "https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg", "http://www.nanopub.org/nschema#hasAssertion": [ { "@id": "https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/assertion" } ], "http://www.nanopub.org/nschema#hasProvenance": [ { "@id": "https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/provenance" } ], "http://www.nanopub.org/nschema#hasPublicationInfo": [ { "@id": "https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/pubinfo" } ], "@type": [ "http://www.nanopub.org/nschema#Nanopublication" ] } ] }, { "@id": "https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/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-programs-c-b6e6)" } ], "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/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/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-ch04-15/result.json" } ], "http://www.w3.org/ns/prov#wasGeneratedBy": [ { "@id": "https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/test" } ] }, { "@id": "https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/test", "@type": [ "http://www.w3.org/ns/prov#Activity" ], "http://www.w3.org/ns/prov#qualifiedAssociation": [ { "@id": "https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/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/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/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/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/pubinfo", "@graph": [ { "@id": "https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg", "http://purl.org/dc/terms/created": [ { "@value": "2026-11-08T16:24:31.923Z", "@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-ch04-15--claim-test" } ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "Claim test of wolfram2002-ch04-15: supports, confidence 0.45" } ], "https://w3id.org/delphi/ontology/domain": [ { "@id": "https://w3id.org/delphi/resource/domain/wolfram-nks-2002" } ] }, { "@id": "https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/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": "Y3tbrwOlbkvnLib6cSSq6LGLGjoE/n9jHusde9pxbMLKEkB4pt8z1Li+iaBiiP7rAFHfTJfX4FU/NqD8nTmZzs4FKAr4f8u9Es79pXtjnfNCwmMl4R2cS+A4H9yiVHlTV0kX3/DG0T8zzljm3YqexcjixK94WLdKzyAww0XW+Rdd7d1copTyvLfe4MKbo0WHw88/Bw5keG0bbw1JIdKdMDek/I31wzR1xEANSUQHyI86DnIg5zU4F9YQ2tG5V+3qkbZKNnPZ6VkQlVJBNF0ij2wIkX2ygDAitFZ1pOPAv/eMmQ+7l18lrPCMvWq7UtdyCqoBSLJBKA+mSrtSZPYOkA==" } ], "http://purl.org/nanopub/x/hasSignatureTarget": [ { "@id": "https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg" } ], "http://purl.org/nanopub/x/signedBy": [ { "@id": "https://orcid.org/0009-0007-4948-9192" } ] } ] }, { "@id": "https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/assertion", "@graph": [ { "@id": "https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test", "http://purl.org/dc/terms/description": [ { "@value": "analysis.py generated 2048 symbols of the Thue-Morse, period-doubling, Fibonacci and Cantor substitution sequences and the first 512 fractional digits of sqrt(2), sqrt(3), cbrt(2) and cbrt(3) in bases 2 and 10. Unequal pairs: 32 of 32. A 512-digit agreement would have been recomputed to 2048 digits. The universal reading is marked not-proved." } ], "@type": [ "https://w3id.org/delphi/ontology/Assessment" ], "http://www.w3.org/2000/01/rdf-schema#comment": [ { "@value": "Measured: 0 sequence-root-base pairs equal on the checked prefix (n = 32, exact inequality when any digit differs; universal reading not proved). Interpretation: Page 142 says a nested digit sequence produced by a substitution system never corresponds to a number obtained by taking roots. 'Corresponds' is equality of digits. Inequality on a prefix proves that pair unequal. It does not prove the universal statement, which is marked not-proved and is not given a support verdict of its own. The scored claim is the locked family of 4 sequences, 4 roots and 2 bases (32 pairs). Nothing here is about organisms." } ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "Claim test of wolfram2002-ch04-15: supports, confidence 0.45" } ], "http://www.w3.org/2000/01/rdf-schema#seeAlso": [ { "@id": "https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch04-15/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": "The four substitution systems and four roots named in pass_criterion, generated by analysis.py. No other sequence is searched after the run." } ], "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": "Some locked nested sequence equals the expansion of one locked root through 2048 digits." } ], "https://w3id.org/delphi/ontology/evidenceAgainst": [ { "@value": "A differing digit proves that pair unequal. It does not prove that no substitution system produces a root. The universal reading is not proved." }, { "@value": "Nothing in this computation is about organisms." }, { "@value": "The scored family is four sequences, four roots and two bases. Confidence is capped at 0.45 because the claim's 'never' is wider than the family." } ], "https://w3id.org/delphi/ontology/expectedObservation": [ { "@value": "All 32 sequence-root-base comparisons differ in at least one of the first 512 digits." } ], "https://w3id.org/delphi/ontology/failCriterion": [ { "@value": "Pre-registered. Refutes if any pair agrees on 512 digits and still agrees on a recomputed prefix of 2048 digits. If a 512-digit agreement fails at 2048, the pair is not a counterexample and the example reading is scored on the 512-digit comparisons that remain unequal. A finite family cannot prove 'never'. Inconclusive is not used merely because the universal quantifier is open; that limit is stated in the verdict's caveats while the examples are scored." } ], "https://w3id.org/delphi/ontology/hasConfidence": [ { "@value": "0.45", "@type": "http://www.w3.org/2001/XMLSchema#double" } ], "https://w3id.org/delphi/ontology/hasEvidence": [ { "@id": "https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-15--claim-test--dataset-1" }, { "@id": "https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-15--claim-test--dataset-2" } ], "https://w3id.org/delphi/ontology/hasVerdict": [ { "@value": "supports" } ], "https://w3id.org/delphi/ontology/hypothesis": [ { "@value": "None of four locked nested digit sequences agrees with the first 512 fractional digits of sqrt(2), sqrt(3), cbrt(2) or cbrt(3) in base 2 or base 10. The universal reading, that no nested sequence from any substitution system equals any root, is not proved by this check." } ], "https://w3id.org/delphi/ontology/inferenceMethod": [ { "@value": "Count exact prefix agreements. Zero agreements supports the example reading with the universal reading marked not-proved. An agreement that survives 2048 digits refutes the universal claim by counterexample." } ], "https://w3id.org/delphi/ontology/passCriterion": [ { "@value": "Pre-registered. Substitution sequences, each truncated to 512 symbols, started as specified: Thue-Morse 0->01, 1->10 from 0; period-doubling 0->01, 1->00 from 0; Fibonacci word 0->01, 1->0 from 0; Cantor 1->101, 0->000 from 1. Roots: sqrt(2), sqrt(3), cbrt(2), cbrt(3), fractional digits in base 2 and base 10, 512 digits, from Decimal at precision 2000. A pair matches only if all 512 digits agree. The example reading is supported if the number of matches is 0. The universal reading is recorded as not-proved regardless. Confidence in a support verdict is capped at 0.45." } ], "https://w3id.org/delphi/ontology/preregistered": [ { "@value": "false", "@type": "http://www.w3.org/2001/XMLSchema#boolean" } ] }, { "@id": "https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-15--claim-test--dataset-1", "http://purl.org/dc/terms/description": [ { "@value": "the locked nested digit sequences" } ], "http://purl.org/dc/terms/license": [ { "@value": "generated" } ], "@type": [ "https://w3id.org/delphi/ontology/EvidenceItem" ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "Dataset: Thue-Morse, period-doubling, Fibonacci word and Cantor substitution sequences" } ], "http://www.w3.org/ns/prov#wasDerivedFrom": [ { "@id": "https://www.wolframscience.com/nks/p142--mathematical-constants/" } ] }, { "@id": "https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-15--claim-test--dataset-2", "http://purl.org/dc/terms/description": [ { "@value": "the locked roots" } ], "http://purl.org/dc/terms/license": [ { "@value": "generated" } ], "@type": [ "https://w3id.org/delphi/ontology/EvidenceItem" ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "Dataset: Fractional digits of four roots in bases 2 and 10" } ], "http://www.w3.org/ns/prov#wasDerivedFrom": [ { "@id": "https://www.wolframscience.com/nks/p142--mathematical-constants/" } ] }, { "@id": "https://w3id.org/delphi/resource/claim/wolfram2002-ch04-15", "https://w3id.org/delphi/ontology/hasAssessment": [ { "@id": "https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test" } ] } ] } ]