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: "RAKykADcmyGU060bhxpza7oIrSvBkoq-tKQ_85ofdL9X8"
  }
}
rows {
  namespace {
    name: "this"
    value {
      prefix_id: 1
    }
  }
}
rows {
  prefix {
    value: "https://w3id.org/np/RAKykADcmyGU060bhxpza7oIrSvBkoq-tKQ_85ofdL9X8/"
  }
}
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-ch11-28--claim-test"
  }
}
rows {
  name {
    value: "description"
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 9
    }
    p_iri {
      prefix_id: 7
    }
    o_literal {
      lex: "analysis.py writes the random initial tapes, compiles tm22.c with gcc and runs it over all 4096 machines x 3176 initial conditions (13,008,896 runs, 10000-step limit). Each run is classified exactly as (A) eventually periodic modulo translation (the head-relative configuration recurs) or (B) escaping, with two exact escape tests: B1 as pre-registered (head beyond all non-zero cells moving outward with a repeated state) and B2 (two successive new-extreme head positions with identical state and identical non-zero tape, the head farther from the tape than the time between them, so the motion repeats verbatim on blank tape). Runs that are neither are put through three post-hoc heuristic classes added after the first full run showed 16% of runs growing their tape: (C) regular linear growth, where the last 16 events at which the head reaches a new extreme position (sampled with stride 1-3) have constant second time differences, constant state and tape contents S_{n+1} = P + S_n[:o] + B + S_n[o:] + Q with fixed P, B, Q, o; (D) the same with event gaps obeying g_{n+1} = a g_n + b, a >= 2 (binary-counter growth); (E) a counter certificate for runs whose tape never grows: at >= 8 returns of the head to one end of its range, in a fixed state, the tape read as a binary number changes by the same non-zero amount. C/D stop the run early once 16 events fit; as a check the program is also run without early stopping (full 10000 steps) on machines 256-319 and 2048-2111 and the class counts compared. Symmetry-distinct machines are counted under state relabelling, colour swap and reflection."
    }
    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: 0.83358595533395 fraction of the 13,008,896 (machine, initial condition) runs classified exactly as eventually periodic (A) or escaping (B) within 10000 steps (pre-registered threshold 1.0) (n = 13008896, exact for A and B; C, D and E are heuristic pattern fits (see caveats)). Interpretation: \'Too simple to support universality\' is operationalized as: every tested evolution is provably eventually periodic (with or without drift), established by exact recurrence detection rather than by visual inspection. This is necessary-condition evidence: universality requires some input with a non-eventually-periodic evolution, and the tested inputs cover all short tapes exhaustively plus random longer ones, but not all inputs; a proof for all inputs would need a per-machine argument. The convention follows NKS p. 78 and the note \'Turing machine enumeration\' (p. 1120): machines never halt, and all 4096 = 8^4 rule tables are counted. The search program is in C (compiled by analysis.py with gcc) for speed; this tooling deviation is recorded."
    }
  }
}
rows {
  name {
    value: "label"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Claim test of wolfram2002-ch11-28: supports, confidence 0.75"
    }
  }
}
rows {
  name {
    value: "seeAlso"
  }
}
rows {
  prefix {
    value: "https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch11-28/"
  }
}
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-claude-fable-5-1-cursor-cloud-agent"
  }
}
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: "Planned datasets: tm-2-2-enumeration-generator, nks-note-turing-machine-enumeration"
    }
  }
}
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: "Pre-registered. The test cannot establish universality, so \'refutes\' is not reachable by this computation alone. \'Mixed\' if any (machine, initial condition) pair is unclassified after 10000 steps (unbounded non-periodic behaviour within the tested inputs, which would be at least consistent with the complexity universality needs) or if periods above 1000 steps occur. \'Supports\' otherwise."
    }
  }
}
rows {
  name {
    value: "evidenceAgainst"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Classes A and B are proofs of the individual run\'s future; classes C, D and E are pattern fits over a finite window (16 growth events, or 8 counter visits) and could in principle be fooled by behaviour that changes later. The no-early-stop check on 128 machines gives identical class counts, and the classes were designed after inspecting the actual mechanisms (sweepers, binary counters), but they are heuristics."
    }
  }
}
rows {
  quad {
    o_literal {
      lex: "Implementation deviations from the pre-registration: the exhaustive set has 3076 initial conditions per machine, not 1284 (miscount in the pre-registration; the set itself is as described); the A test is applied for t <= 2000 and spans <= 128 only (for speed; no run escaped A because of this: the max transient to A or B is 3354 for B, and the max period is 24); an additional exact escape test B2 was added because many \'glider\' runs carry a bounded pattern away from a fixed tape remnant and are neither periodic modulo translation nor caught by B1. The search is in C (gcc), a tooling deviation from the python/mjs rule, recorded in the pre-registration."
    }
  }
}
rows {
  quad {
    o_literal {
      lex: "The computation is necessary-condition evidence only: it covers all tapes of length <= 7 and 100 random longer tapes per machine, not all inputs, and finding only repetitive and nested behaviour does not prove non-universality. The known proof is Pavlotskaya (1973), who showed every 2-state 2-colour machine has a decidable halting problem; that result is not checked here."
    }
  }
}
rows {
  quad {
    o_literal {
      lex: "The pre-registered criterion fails: only 83.36% of runs are eventually periodic (A) or escaping (B); analysis.py reports preregistered_verdict = \'mixed\'. The pre-registered hypothesis was too narrow, not the claim: the remaining runs are tapes that grow forever in a regular way (a head sweeping a growing block, 2,142,325 runs in 864 machines) or binary counters (22,536 runs in 11 machines belonging to just 2 symmetry classes, representatives 441 and 462), which Wolfram describes as the most complex 2,2 behaviour (NKS p. 79-80, \'nested\'). Under the post-hoc classes C-E every run but 2 of 13,008,896 is accounted for, and both residual runs belong to counter machines (1372, 3654) whose other 3175 runs are classified; the verdict \'supports\' rests on these post-hoc classes and is therefore given lower confidence."
    }
  }
}
rows {
  quad {
    o_literal {
      lex: "The symmetry-reduced count of 560 distinct machines matches Wolfram\'s note (p. 1120), confirming the enumeration covers the same family."
    }
  }
}
rows {
  name {
    value: "expectedObservation"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Pre-registered. For each of the 4096 machines and each initial condition in the set I = {every binary tape string of length 1-7 with the head on each of its cells, in each of the 2 states} (1284 initial conditions per machine) plus 100 random tapes of length 16-32 per machine (seeded), simulate on an infinite blank (0) tape for up to 10000 steps and classify the evolution exactly as (A) eventually periodic modulo translation: the head-relative configuration (state, tape between the outermost non-zero cells, head offset) recurs exactly, which implies periodic evolution forever; or (B) escaping: the head is beyond all non-zero cells, moving outward over blank cells, and the same state occurs twice during that outward run, which implies it moves outward forever. \'Supports\' if 100% of the (machine, initial condition) pairs are classified as (A) or (B) within 10000 steps, and the largest period found is at most 1000 steps. The symmetry-reduced count of distinct machines (state relabelling, colour swap, reflection) is also computed and compared with Wolfram\'s 560 as a consistency check on the enumeration."
    }
  }
}
rows {
  name {
    value: "failCriterion"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Pre-registered. The test cannot establish universality, so \'refutes\' is not reachable by this computation alone. \'Mixed\' if any (machine, initial condition) pair is unclassified after 10000 steps (unbounded non-periodic behaviour within the tested inputs, which would be at least consistent with the complexity universality needs) or if periods above 1000 steps occur. \'Supports\' otherwise."
    }
  }
}
rows {
  name {
    value: "hasConfidence"
  }
}
rows {
  datatype {
    value: "http://www.w3.org/2001/XMLSchema#double"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "0.75"
      datatype: 1
    }
  }
}
rows {
  name {
    value: "hasEvidence"
  }
}
rows {
  prefix {
    value: "https://w3id.org/delphi/resource/evidence/"
  }
}
rows {
  name {
    value: "wolfram2002-ch11-28--claim-test--dataset-1"
  }
}
rows {
  quad {
    p_iri {
    }
    o_iri {
      prefix_id: 14
    }
  }
}
rows {
  name {
    value: "wolfram2002-ch11-28--claim-test--dataset-2"
  }
}
rows {
  quad {
    o_iri {
    }
  }
}
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: "Every one of the 4096 Turing machines with 2 states and 2 colours (Wolfram\'s convention: each (state, colour) maps to (new colour, new state, move left/right); no halt state) has behaviour that from every finite initial condition becomes eventually periodic, possibly with a drifting head (a \'glider\'), after a short transient. Since a universal machine must have initial conditions whose evolution is not eventually periodic (otherwise every question about its evolution is decidable), such a classification is strong evidence that none is universal."
    }
  }
}
rows {
  name {
    value: "inferenceMethod"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "analysis.py writes the random initial tapes, compiles tm22.c with gcc and runs it over all 4096 machines x 3176 initial conditions (13,008,896 runs, 10000-step limit). Each run is classified exactly as (A) eventually periodic modulo translation (the head-relative configuration recurs) or (B) escaping, with two exact escape tests: B1 as pre-registered (head beyond all non-zero cells moving outward with a repeated state) and B2 (two successive new-extreme head positions with identical state and identical non-zero tape, the head farther from the tape than the time between them, so the motion repeats verbatim on blank tape). Runs that are neither are put through three post-hoc heuristic classes added after the first full run showed 16% of runs growing their tape: (C) regular linear growth, where the last 16 events at which the head reaches a new extreme position (sampled with stride 1-3) have constant second time differences, constant state and tape contents S_{n+1} = P + S_n[:o] + B + S_n[o:] + Q with fixed P, B, Q, o; (D) the same with event gaps obeying g_{n+1} = a g_n + b, a >= 2 (binary-counter growth); (E) a counter certificate for runs whose tape never grows: at >= 8 returns of the head to one end of its range, in a fixed state, the tape read as a binary number changes by the same non-zero amount. C/D stop the run early once 16 events fit; as a check the program is also run without early stopping (full 10000 steps) on machines 256-319 and 2048-2111 and the class counts compared. Symmetry-distinct machines are counted under state relabelling, colour swap and reflection."
    }
  }
}
rows {
  name {
    value: "passCriterion"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Pre-registered. For each of the 4096 machines and each initial condition in the set I = {every binary tape string of length 1-7 with the head on each of its cells, in each of the 2 states} (1284 initial conditions per machine) plus 100 random tapes of length 16-32 per machine (seeded), simulate on an infinite blank (0) tape for up to 10000 steps and classify the evolution exactly as (A) eventually periodic modulo translation: the head-relative configuration (state, tape between the outermost non-zero cells, head offset) recurs exactly, which implies periodic evolution forever; or (B) escaping: the head is beyond all non-zero cells, moving outward over blank cells, and the same state occurs twice during that outward run, which implies it moves outward forever. \'Supports\' if 100% of the (machine, initial condition) pairs are classified as (A) or (B) within 10000 steps, and the largest period found is at most 1000 steps. The symmetry-reduced count of distinct machines (state relabelling, colour swap, reflection) is also computed and compared with Wolfram\'s 560 as a consistency check on the enumeration."
    }
  }
}
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-ch11-28"
  }
}
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 enumerated program family"
    }
  }
}
rows {
  name {
    value: "license"
  }
}
rows {
  quad {
    p_iri {
      name_id: 39
    }
    o_literal {
      lex: "CC0 (generated data)"
    }
  }
}
rows {
  name {
    value: "EvidenceItem"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 4
      name_id: 10
    }
    o_iri {
      prefix_id: 10
      name_id: 40
    }
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 11
      name_id: 16
    }
    o_literal {
      lex: "Dataset: All 2-state 2-colour Turing machines (generated by analysis.py + tm22.c)"
    }
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 14
      name_id: 31
    }
    p_iri {
      prefix_id: 7
      name_id: 13
    }
    o_literal {
      lex: "the count 560 of symmetry-distinct machines used as a consistency check"
    }
  }
}
rows {
  quad {
    p_iri {
      name_id: 39
    }
    o_literal {
      lex: "copyright Stephen Wolfram LLC"
    }
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 4
      name_id: 10
    }
    o_iri {
      prefix_id: 10
      name_id: 40
    }
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 11
      name_id: 16
    }
    o_literal {
      lex: "Dataset: NKS note \'Turing machine enumeration\' (p. 1120)"
    }
  }
}
rows {
  name {
    value: "atLocation"
  }
}
rows {
  prefix {
    value: "https://www.wolframscience.com/nks/notes-11-12--turing-machine-enumeration/"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 5
      name_id: 41
    }
    o_iri {
      prefix_id: 16
      name_id: 2
    }
  }
}
rows {
  name {
    value: "wasDerivedFrom"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 5
      name_id: 42
    }
  }
}
rows {
  name {
    value: "hasChecksum"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 10
    }
    o_literal {
      lex: "sha256:5f25641e45831bb01cdff9c5f595813e5ca4c8b0f7a734e091cb1b34b70bed66"
    }
  }
}
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: 44
    }
    g_iri {
      prefix_id: 2
      name_id: 7
    }
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 11
      name_id: 16
    }
    o_literal {
      lex: "delphisci claim tester (Claude Fable 5.1 (Cursor cloud agent); cursor/claim-tests-wolfram-nks-f0e1)"
    }
  }
}
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: 45
    }
    o_iri {
      prefix_id: 6
    }
  }
}
rows {
  name {
    value: "usesModel"
  }
}
rows {
  prefix {
    id: 8
    value: "https://w3id.org/delphi/resource/model/"
  }
}
rows {
  name {
    value: "claude-fable-5-1-cursor-cloud-agent"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 10
    }
    o_iri {
      prefix_id: 8
    }
  }
}
rows {
  name {
    value: "identifier"
  }
}
rows {
  quad {
    s_iri {
      name_id: 48
    }
    p_iri {
      prefix_id: 7
    }
    o_literal {
      lex: "Claude Fable 5.1 (Cursor cloud agent)"
    }
  }
}
rows {
  name {
    value: "LanguageModel"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 4
      name_id: 10
    }
    o_iri {
      prefix_id: 10
      name_id: 50
    }
  }
}
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: 42
    }
    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: 51
    }
    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: 52
    }
    p_iri {
      prefix_id: 4
      name_id: 10
    }
    o_iri {
      prefix_id: 5
      name_id: 56
    }
  }
}
rows {
  name {
    value: "qualifiedAssociation"
  }
}
rows {
  quad {
    p_iri {
    }
    o_iri {
      prefix_id: 2
      name_id: 53
    }
  }
}
rows {
  name {
    value: "wasAssociatedWith"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 5
      name_id: 58
    }
    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: 59
    }
    o_literal {
      lex: "2026-11-08T16:24:31.941Z"
      datatype: 3
    }
    g_iri {
      prefix_id: 2
      name_id: 9
    }
  }
}
rows {
  name {
    value: "creator"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 7
      name_id: 60
    }
    o_iri {
      prefix_id: 6
      name_id: 46
    }
  }
}
rows {
  prefix {
    id: 15
    value: "https://creativecommons.org/licenses/by/4.0/"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 7
      name_id: 39
    }
    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: 61
    }
    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: 62
    }
    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-ch11-28: supports, confidence 0.75"
    }
  }
}
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: 63
    }
    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: "v6E7wgqUv+Jf34SfALZkTSebZdOUlouyiC/Wwcjgj47HIs2gZXNfumy2ucOEk486R0l/JRW1LDGy9e94c8Ndoa4rEszBgc1wtcjjDFwop7i6xLXKn4Igt2oBwE5MY8atZ8jPdkpZFAUQ3LiNYU1RfH/zal52Dt/gi5/BIn0mJzTRW8GHEpfhfcpoEGQCMG/EEpmu4fgtDDs4hild7hY/TonU8BXk5FF79Qb2aqEJOcrck25MzTwvkHlrAh5lbhvfn/2yl2TAoS+3ToFQthSHuWf2Yocn5L3XCGw7ylWlIB61LXSQX4ylUnkCCvEHPvJOs8sx/eQmlMBsVHClp8PHlQ=="
    }
  }
}
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: 70
    }
    o_iri {
      prefix_id: 6
      name_id: 46
    }
  }
}