rows {
  options {
    physical_type: PHYSICAL_STREAM_TYPE_QUADS
    max_name_table_size: 128
    max_prefix_table_size: 16
    max_datatype_table_size: 16
    logical_type: LOGICAL_STREAM_TYPE_DATASETS
    version: 2
  }
}
rows {
  prefix {
    value: "https://w3id.org/np/"
  }
}
rows {
  name {
    value: "RAjiEqmoHsEln4az9dNosKmM4iuXl2hEdbLAzapoyFdl4"
  }
}
rows {
  namespace {
    name: "this"
    value {
      prefix_id: 1
    }
  }
}
rows {
  prefix {
    value: "https://w3id.org/np/RAjiEqmoHsEln4az9dNosKmM4iuXl2hEdbLAzapoyFdl4/"
  }
}
rows {
  name {
  }
}
rows {
  namespace {
    name: "sub"
    value {
      prefix_id: 2
    }
  }
}
rows {
  prefix {
    value: "http://www.nanopub.org/nschema#"
  }
}
rows {
  namespace {
    name: "np"
    value {
      prefix_id: 3
      name_id: 2
    }
  }
}
rows {
  prefix {
    value: "http://www.w3.org/1999/02/22-rdf-syntax-ns#"
  }
}
rows {
  namespace {
    name: "rdf"
    value {
      prefix_id: 4
      name_id: 2
    }
  }
}
rows {
  prefix {
    value: "http://www.w3.org/ns/prov#"
  }
}
rows {
  namespace {
    name: "prov"
    value {
      prefix_id: 5
      name_id: 2
    }
  }
}
rows {
  prefix {
    value: "http://purl.org/nanopub/x/"
  }
}
rows {
  namespace {
    name: "npx"
    value {
      prefix_id: 6
      name_id: 2
    }
  }
}
rows {
  prefix {
    value: "http://purl.org/dc/terms/"
  }
}
rows {
  namespace {
    name: "dc"
    value {
      prefix_id: 7
      name_id: 2
    }
  }
}
rows {
  prefix {
    value: "http://www.w3.org/2001/XMLSchema#"
  }
}
rows {
  namespace {
    name: "xsd"
    value {
      prefix_id: 8
      name_id: 2
    }
  }
}
rows {
  name {
    value: "hasAssertion"
  }
}
rows {
  name {
    value: "assertion"
  }
}
rows {
  name {
    value: "Head"
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 1
      name_id: 1
    }
    p_iri {
      prefix_id: 3
      name_id: 3
    }
    o_iri {
      prefix_id: 2
    }
    g_iri {
    }
  }
}
rows {
  name {
    value: "hasProvenance"
  }
}
rows {
  name {
    value: "provenance"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 3
    }
    o_iri {
      prefix_id: 2
    }
  }
}
rows {
  name {
    value: "hasPublicationInfo"
  }
}
rows {
  name {
    value: "pubinfo"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 3
    }
    o_iri {
      prefix_id: 2
    }
  }
}
rows {
  name {
    value: "type"
  }
}
rows {
  name {
    value: "Nanopublication"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 4
    }
    o_iri {
      prefix_id: 3
    }
  }
}
rows {
  prefix {
    value: "https://w3id.org/delphi/resource/assessment/"
  }
}
rows {
  name {
    value: "wolfram2002-ch04-07--claim-test"
  }
}
rows {
  name {
    value: "description"
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 9
    }
    p_iri {
      prefix_id: 7
    }
    o_literal {
      lex: "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."
    }
    g_iri {
      prefix_id: 2
      name_id: 4
    }
  }
}
rows {
  prefix {
    value: "https://w3id.org/delphi/ontology/"
  }
}
rows {
  name {
    value: "Assessment"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 4
      name_id: 10
    }
    o_iri {
      prefix_id: 10
      name_id: 14
    }
  }
}
rows {
  prefix {
    value: "http://www.w3.org/2000/01/rdf-schema#"
  }
}
rows {
  name {
    value: "comment"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 11
    }
    o_literal {
      lex: "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."
    }
  }
}
rows {
  name {
    value: "label"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Claim test of wolfram2002-ch04-07: supports, confidence 0.7"
    }
  }
}
rows {
  name {
    value: "seeAlso"
  }
}
rows {
  prefix {
    value: "https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch04-07/"
  }
}
rows {
  name {
    value: "result.json"
  }
}
rows {
  quad {
    p_iri {
    }
    o_iri {
      prefix_id: 12
    }
  }
}
rows {
  name {
    value: "wasAttributedTo"
  }
}
rows {
  prefix {
    value: "https://w3id.org/delphi/resource/agent/"
  }
}
rows {
  name {
    value: "delphisci-claim-tester-grok-4-7"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 5
    }
    o_iri {
      prefix_id: 13
    }
  }
}
rows {
  name {
    value: "admissibleDatasets"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 10
    }
    o_literal {
      lex: "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."
    }
  }
}
rows {
  name {
    value: "assessmentType"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "claim-test/0.1.0"
    }
  }
}
rows {
  name {
    value: "dataKind"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "computational"
    }
  }
}
rows {
  name {
    value: "disconfirmingObservation"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Fewer than three persistent runs and a short-period signature, with the doubling control correctly flagged as repetitive."
    }
  }
}
rows {
  name {
    value: "evidenceAgainst"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "A match shows only that this computation behaves as claimed. It says nothing about organisms."
    }
  }
}
rows {
  quad {
    o_literal {
      lex: "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."
    }
  }
}
rows {
  quad {
    o_literal {
      lex: "Runs longer than 32 bits are ignored by the tracker, and a structure that jumps more than 8 bits in one step is dropped."
    }
  }
}
rows {
  quad {
    o_literal {
      lex: "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."
    }
  }
}
rows {
  name {
    value: "expectedObservation"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "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."
    }
  }
}
rows {
  name {
    value: "failCriterion"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "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."
    }
  }
}
rows {
  name {
    value: "hasConfidence"
  }
}
rows {
  datatype {
    value: "http://www.w3.org/2001/XMLSchema#double"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "0.7"
      datatype: 1
    }
  }
}
rows {
  name {
    value: "hasEvidence"
  }
}
rows {
  prefix {
    value: "https://w3id.org/delphi/resource/evidence/"
  }
}
rows {
  name {
    value: "wolfram2002-ch04-07--claim-test--dataset-1"
  }
}
rows {
  quad {
    p_iri {
    }
    o_iri {
      prefix_id: 14
    }
  }
}
rows {
  name {
    value: "hasVerdict"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 10
    }
    o_literal {
      lex: "supports"
    }
  }
}
rows {
  name {
    value: "hypothesis"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "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."
    }
  }
}
rows {
  name {
    value: "inferenceMethod"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "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."
    }
  }
}
rows {
  name {
    value: "passCriterion"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "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."
    }
  }
}
rows {
  name {
    value: "preregistered"
  }
}
rows {
  datatype {
    value: "http://www.w3.org/2001/XMLSchema#boolean"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "false"
      datatype: 2
    }
  }
}
rows {
  prefix {
    value: "https://w3id.org/delphi/resource/claim/"
  }
}
rows {
  name {
    value: "wolfram2002-ch04-07"
  }
}
rows {
  name {
    value: "hasAssessment"
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 15
    }
    p_iri {
      prefix_id: 10
    }
    o_iri {
      prefix_id: 9
      name_id: 12
    }
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 14
      name_id: 30
    }
    p_iri {
      prefix_id: 7
      name_id: 13
    }
    o_literal {
      lex: "the orbit whose runs are tracked; the picture on the cited page is the same rule and start"
    }
  }
}
rows {
  name {
    value: "license"
  }
}
rows {
  quad {
    p_iri {
      name_id: 38
    }
    o_literal {
      lex: "generated data"
    }
  }
}
rows {
  name {
    value: "EvidenceItem"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 4
      name_id: 10
    }
    o_iri {
      prefix_id: 10
      name_id: 39
    }
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 11
      name_id: 16
    }
    o_literal {
      lex: "Dataset: Base-2 reverse-and-add orbit from 512"
    }
  }
}
rows {
  name {
    value: "wasDerivedFrom"
  }
}
rows {
  prefix {
    value: "https://www.wolframscience.com/nks/p126--elementary-arithmetic/"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 5
      name_id: 40
    }
    o_iri {
      prefix_id: 16
      name_id: 2
    }
  }
}
rows {
  name {
    value: "SoftwareAgent"
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 13
      name_id: 20
    }
    p_iri {
      prefix_id: 4
      name_id: 10
    }
    o_iri {
      prefix_id: 5
      name_id: 41
    }
    g_iri {
      prefix_id: 2
      name_id: 7
    }
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 11
      name_id: 16
    }
    o_literal {
      lex: "delphisci claim tester (Grok 4.7; cursor/wolfram-claim-tests-b-355b)"
    }
  }
}
rows {
  name {
    value: "actedOnBehalfOf"
  }
}
rows {
  prefix {
    id: 6
    value: "https://orcid.org/"
  }
}
rows {
  name {
    value: "0009-0007-4948-9192"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 5
      name_id: 42
    }
    o_iri {
      prefix_id: 6
    }
  }
}
rows {
  name {
    value: "usesModel"
  }
}
rows {
  prefix {
    id: 8
    value: "https://w3id.org/delphi/resource/model/"
  }
}
rows {
  name {
    value: "grok-4-7"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 10
    }
    o_iri {
      prefix_id: 8
    }
  }
}
rows {
  name {
    value: "identifier"
  }
}
rows {
  quad {
    s_iri {
      name_id: 45
    }
    p_iri {
      prefix_id: 7
    }
    o_literal {
      lex: "Grok 4.7"
    }
  }
}
rows {
  name {
    value: "LanguageModel"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 4
      name_id: 10
    }
    o_iri {
      prefix_id: 10
      name_id: 47
    }
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 2
      name_id: 4
    }
    p_iri {
      prefix_id: 5
      name_id: 19
    }
    o_iri {
      prefix_id: 13
    }
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 5
      name_id: 40
    }
    o_iri {
      prefix_id: 12
      name_id: 18
    }
  }
}
rows {
  name {
    value: "wasGeneratedBy"
  }
}
rows {
  name {
    value: "test"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 5
      name_id: 48
    }
    o_iri {
      prefix_id: 2
    }
  }
}
rows {
  name {
    value: "plan"
  }
}
rows {
  name {
    value: "hadPlan"
  }
}
rows {
  prefix {
    id: 1
    value: "https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/"
  }
}
rows {
  name {
    value: "README.md"
  }
}
rows {
  quad {
    s_iri {
    }
    p_iri {
      prefix_id: 5
    }
    o_iri {
      prefix_id: 1
    }
  }
}
rows {
  name {
    value: "Activity"
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 2
      name_id: 49
    }
    p_iri {
      prefix_id: 4
      name_id: 10
    }
    o_iri {
      prefix_id: 5
      name_id: 53
    }
  }
}
rows {
  name {
    value: "qualifiedAssociation"
  }
}
rows {
  quad {
    p_iri {
    }
    o_iri {
      prefix_id: 2
      name_id: 50
    }
  }
}
rows {
  name {
    value: "wasAssociatedWith"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 5
      name_id: 55
    }
    o_iri {
      prefix_id: 13
      name_id: 20
    }
  }
}
rows {
  prefix {
    id: 3
    value: "https://w3id.org/np/"
  }
}
rows {
  name {
    value: "created"
  }
}
rows {
  datatype {
    value: "http://www.w3.org/2001/XMLSchema#dateTime"
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 3
      name_id: 1
    }
    p_iri {
      prefix_id: 7
      name_id: 56
    }
    o_literal {
      lex: "2026-11-08T16:24:31.922Z"
      datatype: 3
    }
    g_iri {
      prefix_id: 2
      name_id: 9
    }
  }
}
rows {
  name {
    value: "creator"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 7
      name_id: 57
    }
    o_iri {
      prefix_id: 6
      name_id: 43
    }
  }
}
rows {
  prefix {
    id: 15
    value: "https://creativecommons.org/licenses/by/4.0/"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 7
      name_id: 38
    }
    o_iri {
      prefix_id: 15
      name_id: 2
    }
  }
}
rows {
  prefix {
    id: 9
    value: "http://purl.org/nanopub/x/"
  }
}
rows {
  name {
    value: "hasNanopubType"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 9
      name_id: 58
    }
    o_iri {
      prefix_id: 10
      name_id: 14
    }
  }
}
rows {
  name {
    value: "introduces"
  }
}
rows {
  prefix {
    id: 14
    value: "https://w3id.org/delphi/resource/assessment/"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 9
      name_id: 59
    }
    o_iri {
      prefix_id: 14
      name_id: 12
    }
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 11
      name_id: 16
    }
    o_literal {
      lex: "Claim test of wolfram2002-ch04-07: supports, confidence 0.7"
    }
  }
}
rows {
  name {
    value: "domain"
  }
}
rows {
  prefix {
    id: 16
    value: "https://w3id.org/delphi/resource/domain/"
  }
}
rows {
  name {
    value: "wolfram-nks-2002"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 10
      name_id: 60
    }
    o_iri {
      prefix_id: 16
    }
  }
}
rows {
  name {
    value: "sig"
  }
}
rows {
  name {
    value: "hasAlgorithm"
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 2
    }
    p_iri {
      prefix_id: 9
    }
    o_literal {
      lex: "RSA"
    }
  }
}
rows {
  name {
    value: "hasPublicKey"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB"
    }
  }
}
rows {
  name {
    value: "hasSignature"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "QxYOLLXVdXo4CMWtIA18fwrRH7zCG1ciEYgY6jop/kRPmX0t/C4+Mhzk2soedFpiY+1wwYd+OYmPc2rC1RAFBht25YTuIMNVb4+vF0K5tYefBsn45EZDTftEYHeX6PNxJ5ntSEXjRzpyidh/GSG98fetKr3bny8EH8pwUlEPDCF3f/OAcqVvFNxT3w6h3YbFOyCohusid7HT49k3/SOzGobPANFlEGYAHAXsTKjUUYM76puJcGG6OCTX4Y5JeDusszrJsqk7tPNnRN5deWzcbIqO2mDe42sEsQvuDowBDpPIRCHxkKQgKpMUNasl6PErA2PygZF0YP8UoAx95sGuUQ=="
    }
  }
}
rows {
  name {
    value: "hasSignatureTarget"
  }
}
rows {
  quad {
    p_iri {
    }
    o_iri {
      prefix_id: 3
      name_id: 1
    }
  }
}
rows {
  name {
    value: "signedBy"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 9
      name_id: 67
    }
    o_iri {
      prefix_id: 6
      name_id: 43
    }
  }
}