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: "RAn_co3g4xT6dD0-1wZIna0LPHZoTITh50ruLnYOyvLyo"
  }
}
rows {
  namespace {
    name: "this"
    value {
      prefix_id: 1
    }
  }
}
rows {
  prefix {
    value: "https://w3id.org/np/RAn_co3g4xT6dD0-1wZIna0LPHZoTITh50ruLnYOyvLyo/"
  }
}
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-21--claim-test"
  }
}
rows {
  name {
    value: "description"
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 9
    }
    p_iri {
      prefix_id: 7
    }
    o_literal {
      lex: "analysis.py evolves rule 54 for 256 steps from every initial condition n = 1..65535 (binary digits of n on white; batches of 512 vectorised in numpy on a lattice wide enough that the light cone never reaches the edge), encodes every 6 x 6 space-time tile with top-left in rows 128..250 inside the light cone as a 36-bit integer and counts distinct tiles D; patterns with D <= 400 are also tested for exact temporal periodicity (period <= 16) of the light-cone core over steps 128..256. The 20 initial conditions with the largest D are re-run for 512 steps. Per-initial-condition values in derived/census.csv.xz; runtime about 3 minutes."
    }
    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 number of initial conditions n <= 65536 whose rule-54 pattern has more than 1050 distinct 6x6 tiles in steps 128-256 (n = 65535, exhaustive over n = 1..65535 (n = 65536 has 17 bits and was not included)). Interpretation: The claim is a finite observational statement about the first 10^8 initial conditions; the full census is beyond a few minutes of Python, so this is a scaled census (2^16 initial conditions) with the book\'s informal judgement \'nothing fundamentally more complicated than repetitive or nested\' frozen into a local-complexity classifier. The classifier counts distinct 6 x 6 space-time tiles in the second half of the evolution: self-similar (nested) and periodic patterns have bounded tile vocabularies, whereas class 3 patterns have thousands and class 4 patterns with interacting gliders over a thousand. The threshold was set from controls outside the rule-54 family plus the book\'s own eight rule-54 examples; it is admittedly coarse, and the random-seed rule 150 controls (nested, up to 1007) show that nested patterns with wide seeds approach it. A failure under this classifier would therefore need the T = 512 confirmation and visual inspection before being read as a counterexample to Wolfram\'s census."
    }
  }
}
rows {
  name {
    value: "label"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Claim test of wolfram2002-ch11-21: supports, confidence 0.6"
    }
  }
}
rows {
  name {
    value: "seeAlso"
  }
}
rows {
  prefix {
    value: "https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch11-21/"
  }
}
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"
  }
}
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: rule54-initial-condition-census"
    }
  }
}
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 claim FAILS if at least one initial condition n <= 65536 has D > 1050 and the T = 512 re-run also gives D > 1050 (sustained local complexity comparable to the class 3/4 controls). If some exceed 1050 at T = 256 but not at T = 512 the verdict is \'mixed\' (transient complexity). The census is 1/1526 of the book\'s 10^8 initial conditions; a pass is consistent with the claim but far from exhausting it."
    }
  }
}
rows {
  name {
    value: "evidenceAgainst"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "\'Repetitive or nested\' was frozen into a local-complexity classifier (distinct 6 x 6 space-time tiles) with a threshold set from controls outside the family (rule 90/150/22/18 nested, rules 250/108/184/62/41 repetitive, rules 110/30/45 complex) and the book\'s own eight rule-54 examples. The margin is large (426 observed vs. 1094 for the least complex rule-110 control) but the classifier is coarse: a class-4-like pattern with a small glider repertoire could in principle have a modest tile vocabulary, and nested patterns from wide seeds (rule 150 random 14-bit seeds reach 1007) approach the threshold."
    }
  }
}
rows {
  quad {
    o_literal {
      lex: "Finite horizon (256 steps, re-checks to 512): slowly developing complexity, e.g. structures appearing only after thousands of steps, would be missed."
    }
  }
}
rows {
  quad {
    o_literal {
      lex: "Pre-registered decision: 0 of 65,535 initial conditions exceeds the 1050-tile threshold (0 exceed even the stricter 700). The largest vocabulary is 426 tiles (n = 52843) and the twenty largest all fall back to 391 tiles at steps 256-512, the same vocabulary as the book\'s examples n = 787 and 803; the distribution is strongly clustered (median 68; 50,561 below 100; 214 between 400 and 500), consistent with a small repertoire of repetitive and nested forms. 17.2% of the patterns are exactly periodic in the core with period 4 over steps 128-256."
    }
  }
}
rows {
  quad {
    o_literal {
      lex: "This is a scaled census: 2^16 initial conditions rather than the 10^8 of the book, i.e. seeds of at most 16 cells, so wider seeds (where interacting structures are more likely) are untested; a pass here is consistent with Wolfram\'s census but does not reproduce it."
    }
  }
}
rows {
  name {
    value: "expectedObservation"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Pre-registered. Family: initial conditions n = 1..65536 (16 bits), cell values = binary digits of n placed on an infinite white background (validated against the figure: n = 1 single cell, n = 3 two cells, n = 291 nested); rule 54 run for T = 256 steps on a lattice wide enough that the light cone never reaches the edge. Classifier (frozen before the census): the number D of distinct 6 x 6 space-time tiles whose top-left corner lies in rows 128..250 and inside the light cone (plus 2 cells) of the pattern. Calibration on controls outside the family, disclosed: repetitive and nested rules give D <= 1007 (rule 90 single cell 115, random 14-bit seeds 267-395; rule 150 single 316, random seeds 804-1007; rule 22 single 119; rule 18 random 309-602; rules 250, 108, 184, 62, 41 random 1-178), while class 3/4 controls give D >= 1094 (rule 110 random 14- and 30-bit seeds 1094-1553; rule 30 6801-7166; rule 45 6338-6401), with a few class-3 rules from narrow seeds in between (rule 106: 462 and 2912; rule 126: 130-402; rule 146: 371-413; rule 73: 64-774). The eight rule-54 patterns shown in the book\'s figure (n = 1, 3, 75, 259, 291, 787, 803, 56549) give D = 10, 37, 315, 315, 286, 391, 391, 370, and a batch of 256 random 14-bit seeds gave max 391. Threshold: D > 1050 (geometric midpoint of 1007 and 1094) = \'more complicated\'. Also recorded per initial condition: exact temporal periodicity (period <= 16) of the pattern\'s core over steps 128..256 (\'repetitive\'). The claim PASSES if 0 of the 65536 initial conditions has D > 1050. Reported, not decisive: the distribution of D, the fraction that is exactly periodic, the number with D > 700 (a stricter threshold that still clears all rule-54 book examples), and for any initial condition above threshold a re-run with T = 512."
    }
  }
}
rows {
  name {
    value: "failCriterion"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Pre-registered. The claim FAILS if at least one initial condition n <= 65536 has D > 1050 and the T = 512 re-run also gives D > 1050 (sustained local complexity comparable to the class 3/4 controls). If some exceed 1050 at T = 256 but not at T = 512 the verdict is \'mixed\' (transient complexity). The census is 1/1526 of the book\'s 10^8 initial conditions; a pass is consistent with the claim but far from exhausting it."
    }
  }
}
rows {
  name {
    value: "hasConfidence"
  }
}
rows {
  datatype {
    value: "http://www.w3.org/2001/XMLSchema#double"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "0.6"
      datatype: 1
    }
  }
}
rows {
  name {
    value: "hasEvidence"
  }
}
rows {
  prefix {
    value: "https://w3id.org/delphi/resource/evidence/"
  }
}
rows {
  name {
    value: "wolfram2002-ch11-21--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: "Rule 54, run from each of the first N initial conditions (binary digits of n on a white background, as in NKS p. 697), produces only repetitive or nested patterns: none has the local space-time complexity characteristic of class 3 or class 4 behaviour."
    }
  }
}
rows {
  name {
    value: "inferenceMethod"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "analysis.py evolves rule 54 for 256 steps from every initial condition n = 1..65535 (binary digits of n on white; batches of 512 vectorised in numpy on a lattice wide enough that the light cone never reaches the edge), encodes every 6 x 6 space-time tile with top-left in rows 128..250 inside the light cone as a 36-bit integer and counts distinct tiles D; patterns with D <= 400 are also tested for exact temporal periodicity (period <= 16) of the light-cone core over steps 128..256. The 20 initial conditions with the largest D are re-run for 512 steps. Per-initial-condition values in derived/census.csv.xz; runtime about 3 minutes."
    }
  }
}
rows {
  name {
    value: "passCriterion"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Pre-registered. Family: initial conditions n = 1..65536 (16 bits), cell values = binary digits of n placed on an infinite white background (validated against the figure: n = 1 single cell, n = 3 two cells, n = 291 nested); rule 54 run for T = 256 steps on a lattice wide enough that the light cone never reaches the edge. Classifier (frozen before the census): the number D of distinct 6 x 6 space-time tiles whose top-left corner lies in rows 128..250 and inside the light cone (plus 2 cells) of the pattern. Calibration on controls outside the family, disclosed: repetitive and nested rules give D <= 1007 (rule 90 single cell 115, random 14-bit seeds 267-395; rule 150 single 316, random seeds 804-1007; rule 22 single 119; rule 18 random 309-602; rules 250, 108, 184, 62, 41 random 1-178), while class 3/4 controls give D >= 1094 (rule 110 random 14- and 30-bit seeds 1094-1553; rule 30 6801-7166; rule 45 6338-6401), with a few class-3 rules from narrow seeds in between (rule 106: 462 and 2912; rule 126: 130-402; rule 146: 371-413; rule 73: 64-774). The eight rule-54 patterns shown in the book\'s figure (n = 1, 3, 75, 259, 291, 787, 803, 56549) give D = 10, 37, 315, 315, 286, 391, 391, 370, and a batch of 256 random 14-bit seeds gave max 391. Threshold: D > 1050 (geometric midpoint of 1007 and 1094) = \'more complicated\'. Also recorded per initial condition: exact temporal periodicity (period <= 16) of the pattern\'s core over steps 128..256 (\'repetitive\'). The claim PASSES if 0 of the 65536 initial conditions has D > 1050. Reported, not decisive: the distribution of D, the fraction that is exactly periodic, the number with D > 700 (a stricter threshold that still clears all rule-54 book examples), and for any initial condition above threshold a re-run with T = 512."
    }
  }
}
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-21"
  }
}
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: "program family under test"
    }
  }
}
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: Rule 54 from initial conditions 1..65536 (generated by analysis.py)"
    }
  }
}
rows {
  name {
    value: "wasDerivedFrom"
  }
}
rows {
  prefix {
    value: "https://www.wolframscience.com/nks/p697--the-threshold-of-universality-in-cellular-automata/"
  }
}
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 (claude-fable-5.1; cursor/wolfram-nks-claim-tests-106e)"
    }
  }
}
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: "claude-fable-5-1"
  }
}
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: "claude-fable-5.1"
    }
  }
}
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.940Z"
      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-ch11-21: supports, confidence 0.6"
    }
  }
}
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: "Yi7O5bpQrtHV0I2g60+QMwkD+GDkKfwac+veornNz/3o4f+fVg9W/dumLYeDa+GgT0sYO0gapOZYXy5KxL21+cm7duy7hmLQl9nENThYJQVL75uliGOeVgxnxC3kUmQ7Qh5zEFpBrO7u0ctbKxjo1yLT7HKfqk31g74Ck7soPVOwCYESr+btz9YStHV4IY0WwqVQDZQ0qnEAKI8aBdBW/6ZdRp1712ku7D+5N0wxPgSQSp4H2YlTAuy8psgjyCG4f3Aa2jJ5Ou9myIJpzEb+vUfFyfwfHTNOd+PxpFaQZQrsBqF1c/P6omZm+6csGOV7PGAkBnZRWYHjY6SzwaxJ9A=="
    }
  }
}
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
    }
  }
}