https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE/Head https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE http://www.nanopub.org/nschema#hasAssertion https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE/assertion https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE http://www.nanopub.org/nschema#hasProvenance https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE/provenance https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE/pubinfo https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE/assertion https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test http://purl.org/dc/terms/description analysis.py computes exact orbits of the doubling map with Python Fractions. (1) For 2000 random reduced fractions p/q (odd q <= 10^5) the 2000-step itinerary is compared bit for bit with the binary digits of p/q from long division; for seeds whose digits are OEIS b-files (A004539 sqrt(2), A010060 Thue-Morse, A030190 Champernowne) truncated to a dyadic rational, the itinerary is compared with the published digits, and the A004539 digits are cross-checked against math.isqrt. (2) For every odd q in 3..2000 the exact orbit of 1/q is walked until it repeats and its period and preperiod are compared with the multiplicative order of 2 mod q; 1/2^k is iterated for k <= 60. (3) lzma compression ratios of seed digits and of the 10000-bit itinerary are compared for Thue-Morse, Champernowne, sqrt(2), random bits, 1/1999 and 1/7, against 200 random-bit references; the NIST serial test (m = 8) is applied to each itinerary. (4) Control: the exact orbit of 3x mod 1 from 1/2^60 for 10000 steps, with compression ratio, pair frequencies and serial test. Run time about 15 s including downloads. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--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-19--claim-test http://www.w3.org/2000/01/rdf-schema#comment Measured: 0 itinerary bits differing from the seed's binary digits (out of 4,020,999 compared) (n = 4020999, exact). Interpretation: Wolfram's 'shift map' is x -> 2x mod 1 (NKS p. 149, 'doubling modulo 1'), and 'moving digits leftward' refers to the base-2 expansion; the output of the map is taken to be the coarse itinerary (which half of the interval x_t lies in), which is the standard symbolic coding and is what Wolfram's pictures show. 'Randomness' is operationalised as incompressibility by a general-purpose compressor (lzma) plus block-frequency uniformity, following the assessors' remark that the claim locates randomness in the digit sequence. Dyadic rationals have two binary expansions; the itinerary follows the terminating one (x_t = 1/2 gives bit 1 then zeros), so seeds are compared with that convention. All orbits are computed with exact rational arithmetic; a floating-point implementation would collapse to 0 after 53 steps, which is noted but not used. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch04-19: supports, confidence 0.95 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--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-19/result.json https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--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-19--claim-test https://w3id.org/delphi/ontology/admissibleDatasets Planned datasets: shift-map-exact-orbits, oeis-a004539-bfile, oeis-a010060-bfile, oeis-a030190-bfile, control-3x-mod-1-orbit https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/delphi/ontology/assessmentType claim-test/0.1.0 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/delphi/ontology/dataKind computational https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/delphi/ontology/disconfirmingObservation Pre-registered: any itinerary bit that differs from the corresponding seed digit in part (1); any odd-q seed whose itinerary period differs from the multiplicative order of 2, or any dyadic seed not reaching 0 within k steps; any seed class whose shift-map itinerary is more than 0.01 less compressible than the seed digits, or a periodic/Thue-Morse itinerary as incompressible as random bits (ratio within the central 98% of the random references). Failure of the control (4) alone does not refute the claim but would be reported as reducing the discriminating power of the test (verdict stays 'supports' with lower confidence if (1)-(3) pass). If (1) fails the verdict is 'refutes'; if (1) passes but (2) or (3) fails the verdict is 'mixed'. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/delphi/ontology/evidenceAgainst Parts (1)-(3) passed exactly as pre-registered: 0 of 4,020,999 itinerary bits differ from the seed digits; all 999 odd denominators q <= 2000 give purely periodic itineraries whose period equals the multiplicative order of 2 mod q (max 1996 = q - 3 for q = 1999); every seed class has identical lzma ratio for seed and itinerary (the itinerary is literally the digit string); periodic seeds compress to 0.011-0.019 and Thue-Morse to 0.017 against a random reference of 0.168-0.171, while a random-bit seed gives 0.170. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The A004539 b-file has only 1000 terms, so the sqrt(2) identity check used 999 instead of the planned 10000 digits; the compressibility comparison for sqrt(2) used 10000 digits computed with math.isqrt, which agree with all 999 published digits. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The claim is an exact identity (2x mod 1 deletes the leading binary digit), so computation can only illustrate it; the test's value is in confirming the identity with independent implementations (Fraction orbit vs long division vs OEIS digits) and in showing that the output's compressibility is exactly the seed's. In float64 the orbit of 0.1 collapses to exactly 0 after 55 steps, which is why exact arithmetic was used. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The control (4) passed its compression sub-criterion (ratio 0.156 = 0.92 x random median, from a seed with ratio 0.011) but failed the pre-registered serial test (p ~ 0): the half-interval coding of 3x mod 1 is a two-state Markov source with pair probabilities 1/3, 1/6, 1/6, 1/3 (measured 0.341, 0.166, 0.166, 0.327), so uniform block frequencies were the wrong control criterion. The control still shows that a non-shift map produces an incompressible itinerary from a trivially simple seed, which the doubling map never does; confidence is reduced from 0.98 to 0.95 for the imperfect control design, as pre-registered. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/delphi/ontology/expectedObservation Pre-registered, all of: (1) transcription identity: for 2000 random reduced fractions p/q with odd q in [3, 10^5], the itinerary of the exact rational orbit (Python Fractions) for 2000 steps agrees bit for bit with the binary digits d_1..d_2000 of p/q computed independently by long division (0 mismatches of 4,000,000), and for three seeds whose binary digits are taken from OEIS b-files truncated to N = 10000 digits (A004539 binary digits of sqrt(2), A010060 Thue-Morse, A030190 binary Champernowne) the exact itinerary agrees with the published digits for all t < N (0 mismatches), with A004539 additionally cross-checked against digits computed with integer isqrt (0 mismatches); (2) periodic seeds stay periodic: for every odd q in 3..2000 and p = 1, the itinerary of p/q, found by exact cycle detection, is purely periodic with minimal period equal to the multiplicative order of 2 modulo q (0 exceptions), and every seed p/2^k (k <= 60) reaches the fixed point 0 within k steps; (3) randomness is inherited, not created: for every seed class the lzma compression ratio of the 10000-bit itinerary differs from the ratio of the seed's own first 10000 digits by less than 0.01, the itinerary of a periodic seed (1/q, q <= 2000) has ratio below 0.10, the Thue-Morse itinerary has ratio below the 1st percentile of 200 random-bit references, and the itinerary of a random-bit seed has ratio within the central 98% of the random references; (4) control with discriminating power: the itinerary of x -> 3x mod 1 started at the seed 1/2^60 (whose binary digits are a single 1 followed by zeros, ratio below 0.05) for 10000 steps has compression ratio above 0.8 times the median random reference and passes an 8-bit block chi-square test at p > 0.001, i.e. it does produce randomness its seed did not have. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/delphi/ontology/failCriterion Pre-registered: any itinerary bit that differs from the corresponding seed digit in part (1); any odd-q seed whose itinerary period differs from the multiplicative order of 2, or any dyadic seed not reaching 0 within k steps; any seed class whose shift-map itinerary is more than 0.01 less compressible than the seed digits, or a periodic/Thue-Morse itinerary as incompressible as random bits (ratio within the central 98% of the random references). Failure of the control (4) alone does not refute the claim but would be reported as reducing the discriminating power of the test (verdict stays 'supports' with lower confidence if (1)-(3) pass). If (1) fails the verdict is 'refutes'; if (1) passes but (2) or (3) fails the verdict is 'mixed'. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/delphi/ontology/hasConfidence 0.95 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-2 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-3 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-4 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-5 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/delphi/ontology/hasVerdict supports https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/delphi/ontology/hypothesis Under the shift map x -> 2x mod 1 the symbolic itinerary (1 if x_t >= 1/2 else 0) is exactly the seed's binary digit sequence read from the first digit onward, so the output is a suffix of the input: periodic seeds give periodic itineraries with the same period, nested seeds give nested itineraries, and the itinerary of a seed is never less compressible (more random) than the seed's own digits. By contrast a map that is not a digit shift in base 2 (control: x -> 3x mod 1) can produce incompressible itineraries from seeds with trivially simple binary digits. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/delphi/ontology/inferenceMethod analysis.py computes exact orbits of the doubling map with Python Fractions. (1) For 2000 random reduced fractions p/q (odd q <= 10^5) the 2000-step itinerary is compared bit for bit with the binary digits of p/q from long division; for seeds whose digits are OEIS b-files (A004539 sqrt(2), A010060 Thue-Morse, A030190 Champernowne) truncated to a dyadic rational, the itinerary is compared with the published digits, and the A004539 digits are cross-checked against math.isqrt. (2) For every odd q in 3..2000 the exact orbit of 1/q is walked until it repeats and its period and preperiod are compared with the multiplicative order of 2 mod q; 1/2^k is iterated for k <= 60. (3) lzma compression ratios of seed digits and of the 10000-bit itinerary are compared for Thue-Morse, Champernowne, sqrt(2), random bits, 1/1999 and 1/7, against 200 random-bit references; the NIST serial test (m = 8) is applied to each itinerary. (4) Control: the exact orbit of 3x mod 1 from 1/2^60 for 10000 steps, with compression ratio, pair frequencies and serial test. Run time about 15 s including downloads. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/delphi/ontology/passCriterion Pre-registered, all of: (1) transcription identity: for 2000 random reduced fractions p/q with odd q in [3, 10^5], the itinerary of the exact rational orbit (Python Fractions) for 2000 steps agrees bit for bit with the binary digits d_1..d_2000 of p/q computed independently by long division (0 mismatches of 4,000,000), and for three seeds whose binary digits are taken from OEIS b-files truncated to N = 10000 digits (A004539 binary digits of sqrt(2), A010060 Thue-Morse, A030190 binary Champernowne) the exact itinerary agrees with the published digits for all t < N (0 mismatches), with A004539 additionally cross-checked against digits computed with integer isqrt (0 mismatches); (2) periodic seeds stay periodic: for every odd q in 3..2000 and p = 1, the itinerary of p/q, found by exact cycle detection, is purely periodic with minimal period equal to the multiplicative order of 2 modulo q (0 exceptions), and every seed p/2^k (k <= 60) reaches the fixed point 0 within k steps; (3) randomness is inherited, not created: for every seed class the lzma compression ratio of the 10000-bit itinerary differs from the ratio of the seed's own first 10000 digits by less than 0.01, the itinerary of a periodic seed (1/q, q <= 2000) has ratio below 0.10, the Thue-Morse itinerary has ratio below the 1st percentile of 200 random-bit references, and the itinerary of a random-bit seed has ratio within the central 98% of the random references; (4) control with discriminating power: the itinerary of x -> 3x mod 1 started at the seed 1/2^60 (whose binary digits are a single 1 followed by zeros, ratio below 0.05) for 10000 steps has compression ratio above 0.8 times the median random reference and passes an 8-bit block chi-square test at p > 0.001, i.e. it does produce randomness its seed did not have. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/delphi/ontology/preregistered false https://w3id.org/delphi/resource/claim/wolfram2002-ch04-19 https://w3id.org/delphi/ontology/hasAssessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-1 http://purl.org/dc/terms/description transcription identity, periodic seeds, compressibility of seed vs itinerary https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-1 http://purl.org/dc/terms/license https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--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-19--claim-test--dataset-1 http://www.w3.org/2000/01/rdf-schema#label Dataset: Exact orbits of x -> 2x mod 1 (Python Fractions) and binary digits by long division (generated by analysis.py) https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-2 http://purl.org/dc/terms/description irrational seed digits (only 1000 terms available; 999 fractional digits used) and cross-check of isqrt digits https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-2 http://purl.org/dc/terms/license CC BY-SA 4.0 (OEIS) https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--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-19--claim-test--dataset-2 http://www.w3.org/2000/01/rdf-schema#label Dataset: OEIS A004539: expansion of sqrt(2) in base 2, b-file https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-2 http://www.w3.org/ns/prov#atLocation https://oeis.org/A004539/b004539.txt https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-2 http://www.w3.org/ns/prov#wasDerivedFrom https://oeis.org/A004539 https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-2 https://w3id.org/delphi/ontology/hasChecksum sha256:4446da33fe29722c596a32c7b35d628d5f198d790120d0a1fb7685eea94a752b https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-3 http://purl.org/dc/terms/description nested (non-periodic, highly compressible) seed digits https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-3 http://purl.org/dc/terms/license CC BY-SA 4.0 (OEIS) https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--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-19--claim-test--dataset-3 http://www.w3.org/2000/01/rdf-schema#label Dataset: OEIS A010060: Thue-Morse sequence, b-file https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-3 http://www.w3.org/ns/prov#atLocation https://oeis.org/A010060/b010060.txt https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-3 http://www.w3.org/ns/prov#wasDerivedFrom https://oeis.org/A010060 https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-3 https://w3id.org/delphi/ontology/hasChecksum sha256:b8de7fe3b9000bf892e400f15a9e8c326adf05956d4464f4ed5281ea70ae57fa https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-4 http://purl.org/dc/terms/description normal-number seed digits https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-4 http://purl.org/dc/terms/license CC BY-SA 4.0 (OEIS) https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-4 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-19--claim-test--dataset-4 http://www.w3.org/2000/01/rdf-schema#label Dataset: OEIS A030190: binary Champernowne sequence, b-file https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-4 http://www.w3.org/ns/prov#atLocation https://oeis.org/A030190/b030190.txt https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-4 http://www.w3.org/ns/prov#wasDerivedFrom https://oeis.org/A030190 https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-4 https://w3id.org/delphi/ontology/hasChecksum sha256:b5d6fbe62cc958bd03bd039450354c72d3bb2695e06772fc3900be0613e11f5f https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-5 http://purl.org/dc/terms/description negative control: a map that is not a base-2 digit shift https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-5 http://purl.org/dc/terms/license https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-19--claim-test--dataset-5 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-19--claim-test--dataset-5 http://www.w3.org/2000/01/rdf-schema#label Dataset: Exact orbit of x -> 3x mod 1 from 1/2^60 for 10000 steps (generated by analysis.py) https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE/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/claim-tests-wolfram-nks-0123) 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/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE/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/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE/assertion http://www.w3.org/ns/prov#wasDerivedFrom https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch04-19/result.json https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE/assertion http://www.w3.org/ns/prov#wasGeneratedBy https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE/test https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE/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/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE/test http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#Activity https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE/test http://www.w3.org/ns/prov#qualifiedAssociation https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE/plan https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE/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/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE/pubinfo https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE http://purl.org/dc/terms/created 2026-11-08T16:24:31.924Z https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE http://purl.org/dc/terms/creator https://orcid.org/0009-0007-4948-9192 https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE http://purl.org/dc/terms/license https://creativecommons.org/licenses/by/4.0/ https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE http://purl.org/nanopub/x/hasNanopubType https://w3id.org/delphi/ontology/Assessment https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE http://purl.org/nanopub/x/introduces https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-19--claim-test https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch04-19: supports, confidence 0.95 https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE https://w3id.org/delphi/ontology/domain https://w3id.org/delphi/resource/domain/wolfram-nks-2002 https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE/sig http://purl.org/nanopub/x/hasAlgorithm RSA https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE/sig http://purl.org/nanopub/x/hasPublicKey MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE/sig http://purl.org/nanopub/x/hasSignature QVgSleSWsP7glpgTu1e3J6K1kNeqjLvSIFdnlcFsduGYRJaeqFFaBiI0fJq0nr4uFTv38F8GANvh9GdtMDjZ4gILBFxbr3SH4R+XbWXPs5CDVbU489fQ/kHvqfMqBpGmpX8hgMp1Lg3vHDOv6uDsjry+GP5PH7UT2umLfu/tonnoufHJu6AMRpc1UbOPF6HMNAo2Mhou2Wqt5F+aWQEohFfpo2FdxNX4FqdImlr1BoEJ1q6bModJp2mZuB1fl+BBIeprp43kVpYYv15CfMKOF/IOSJhU/VALZpWfZa6yz3gHaNDpHZSV1fiI5FptZ5huDPw2f/51IUV3Rz/5rKCtJA== https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE/sig http://purl.org/nanopub/x/hasSignatureTarget https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE https://w3id.org/np/RAzS65I0arn2LV3GiaVk_FfSLze7A5K4MVSEkI7rMvdoE/sig http://purl.org/nanopub/x/signedBy https://orcid.org/0009-0007-4948-9192