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: "RASizrS8-_GkTpmvhX9JPEgvxYw_rf0FkOgQFEY1TPlT0"
  }
}
rows {
  namespace {
    name: "this"
    value {
      prefix_id: 1
    }
  }
}
rows {
  prefix {
    value: "https://w3id.org/np/RASizrS8-_GkTpmvhX9JPEgvxYw_rf0FkOgQFEY1TPlT0/"
  }
}
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-ch09-15--claim-test"
  }
}
rows {
  name {
    value: "description"
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 9
    }
    p_iri {
      prefix_id: 7
    }
    o_literal {
      lex: "analysis.py generates each graph implicitly (lattices, tree, Heisenberg Cayley graph) or explicitly (configuration-model random 4-regular graph, n = 300000, numpy seed 20261031) and counts the closed ball N(r) around the origin by breadth-first search. The growth exponent is the OLS slope of log N(r) on log r over r in [R/2, R] with R = 32 (Z^1..Z^3), 20 (Z^4), 13 (tree), 8 (random graph; largest r with N(r) <= n/10) and 24 (Heisenberg). For the tree and random graph the fit of log N(r) linear in r is compared with the log-log fit by R^2. Exact closed-form ball sizes of Z^d were used post hoc to check the BFS counts and to show how the slope estimator converges."
    }
    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: [object Object] log-log slope of N(r) over r in [R/2, R] (growth-exponent estimate) (n = [object Object], exact counts; slopes are OLS fits with R^2 >= 0.988 (log-log) for every graph). Interpretation: Wolfram\'s \'number of nodes that appear out to distance r\' is the size N(r) of the closed ball of graph-distance radius r around a node. \'Grows in some limiting sense like r^d\' is operationalised as the local log-log slope of N(r) at the largest radii computed, which for an exact polynomial of degree d tends to d from below. \'Corresponds to ordinary d-dimensional space\' is taken, for the primary test, as \'is the nearest-neighbour graph of Z^d\'; for the secondary test we use the standard geometric-group-theory meaning (quasi-isometric to R^d) and rely on published theorems for the Heisenberg group\'s status. \'Tree-like or randomly connected\' is operationalised as the infinite 3-regular tree (BFS-generated) and a configuration-model random 4-regular graph. All graphs are generated by analysis.py; there is no external download."
    }
  }
}
rows {
  name {
    value: "label"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Claim test of wolfram2002-ch09-15: inconclusive, confidence 0.6"
    }
  }
}
rows {
  name {
    value: "seeAlso"
  }
}
rows {
  prefix {
    value: "https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch09-15/"
  }
}
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: nks-ch09-15-graph-family-generator"
    }
  }
}
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. \'refutes\' if any lattice exponent differs from d by more than 0.5, or if either the tree or the random 4-regular graph has a slope below 3 over the stated range (i.e. appears to have a small finite dimension), or if log N(r) for the tree or random graph is better fit by a straight line in log r than in r. Any other outcome (e.g. a lattice exponent off by between 0.15 and 0.5) -> \'inconclusive\' with reason \'other\'."
    }
  }
}
rows {
  name {
    value: "evidenceAgainst"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "\'Corresponds to ordinary space\' was not measured independently of the growth exponent; the status of each test graph was taken from its construction (lattice) or from the cited theorems (Heisenberg)."
    }
  }
}
rows {
  quad {
    o_literal {
      lex: "Every other pre-registered condition held: Z^1..Z^3 within 0.07 of d; the 3-regular tree and the random 4-regular graph have slopes above 6 that keep rising with r, and log N(r) is fit perfectly (R^2 = 1.000) by a line in r, i.e. exponential growth with no finite dimension, as the claim says of tree-like and random networks."
    }
  }
}
rows {
  quad {
    o_literal {
      lex: "Post hoc (not pre-registered): the closed-form ball sizes of Z^d reproduce the BFS counts exactly, and the same slope estimator at R = 200 gives 0.997, 1.993, 2.989, 3.986 for d = 1..4, i.e. the estimator converges to d from below as the claim\'s \'limiting sense\' requires. Had the tolerance been 0.2, the primary test would have passed and the pre-registered verdict would have been \'mixed\'."
    }
  }
}
rows {
  quad {
    o_literal {
      lex: "The Heisenberg Cayley graph has measured growth exponent 3.994 (degree 4, as proved by Bass 1972 and Guivarc\'h 1973) although the group is not quasi-isometric to any Z^d (Pansu 1983). Under the strict reading of \'corresponds to ordinary d-dimensional space\', r^d growth is therefore necessary but not sufficient; under Wolfram\'s own usage, in which dimension is defined by growth, the sentence is close to definitional. This bears on the \'precisely\' (biconditional) wording and was the reason the pre-registered best outcome was \'mixed\' rather than \'supports\'."
    }
  }
}
rows {
  quad {
    o_literal {
      lex: "The random 4-regular graph is a configuration-model multigraph; self-loops and multi-edges were not removed. They can only reduce N(r), so they bias against the exponential-growth conclusion that was nevertheless reached."
    }
  }
}
rows {
  quad {
    o_literal {
      lex: "The verdict follows the pre-registered rule literally: the Z^4 slope at R = 20 (3.831) misses the pre-registered 0.15 tolerance by 0.019, which the rule maps to \'inconclusive\'. The tolerance was set too tight for the finite radius chosen; this is a flaw of the pre-registration, not evidence against the claim."
    }
  }
}
rows {
  name {
    value: "expectedObservation"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Pre-registered. Primary (necessity and the tree/random clause): for the hypercubic lattices Z^1, Z^2, Z^3, Z^4 the growth exponent, estimated as the ordinary-least-squares slope of log N(r) against log r over r in [R/2, R] (R = 32 for d <= 3, R = 20 for d = 4), lies within 0.15 of d; for the infinite 3-regular tree (R = 13) and for a random 4-regular graph on n = 300000 nodes (R = largest radius with N(R) <= n/10) the same slope estimated over r in [R/2, R] exceeds 5, and log N(r) is better fit (higher R^2) by a straight line in r than in log r. If every one of these six conditions holds the primary test passes. Secondary (sufficiency / \'precisely\'): the Cayley graph of the discrete Heisenberg group with generators x, y and inverses is known not to be quasi-isometric to any Z^d (Pansu 1983), yet has polynomial growth of degree 4 (Bass 1972 / Guivarc\'h 1973). If its measured slope over r in [12, 24] lies in [3.5, 4.5], then a network with r^d growth exists that does not correspond to ordinary d-dimensional space in the strict sense. Verdict rule: primary passes and secondary slope in [3.5, 4.5] -> \'mixed\' (the necessity direction and the tree/random clause hold; the sufficiency direction holds only if \'corresponds to ordinary d-dimensional space\' is read as \'has growth dimension d\'); primary passes and secondary slope outside [3.5, 4.5] -> \'supports\'."
    }
  }
}
rows {
  name {
    value: "failCriterion"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Pre-registered. \'refutes\' if any lattice exponent differs from d by more than 0.5, or if either the tree or the random 4-regular graph has a slope below 3 over the stated range (i.e. appears to have a small finite dimension), or if log N(r) for the tree or random graph is better fit by a straight line in log r than in r. Any other outcome (e.g. a lattice exponent off by between 0.15 and 0.5) -> \'inconclusive\' with reason \'other\'."
    }
  }
}
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-ch09-15--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: "inconclusive"
    }
  }
}
rows {
  name {
    value: "hypothesis"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "For graphs that are discretisations of ordinary d-dimensional space (hypercubic lattices Z^d) the number of nodes within graph distance r grows like r^d, while for tree-like and randomly connected graphs the growth is exponential, so no finite exponent d exists; the biconditional (\'precisely\') additionally requires that polynomial growth of degree d occur only for networks corresponding to ordinary d-dimensional space."
    }
  }
}
rows {
  name {
    value: "inferenceMethod"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "analysis.py generates each graph implicitly (lattices, tree, Heisenberg Cayley graph) or explicitly (configuration-model random 4-regular graph, n = 300000, numpy seed 20261031) and counts the closed ball N(r) around the origin by breadth-first search. The growth exponent is the OLS slope of log N(r) on log r over r in [R/2, R] with R = 32 (Z^1..Z^3), 20 (Z^4), 13 (tree), 8 (random graph; largest r with N(r) <= n/10) and 24 (Heisenberg). For the tree and random graph the fit of log N(r) linear in r is compared with the log-log fit by R^2. Exact closed-form ball sizes of Z^d were used post hoc to check the BFS counts and to show how the slope estimator converges."
    }
  }
}
rows {
  name {
    value: "passCriterion"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Pre-registered. Primary (necessity and the tree/random clause): for the hypercubic lattices Z^1, Z^2, Z^3, Z^4 the growth exponent, estimated as the ordinary-least-squares slope of log N(r) against log r over r in [R/2, R] (R = 32 for d <= 3, R = 20 for d = 4), lies within 0.15 of d; for the infinite 3-regular tree (R = 13) and for a random 4-regular graph on n = 300000 nodes (R = largest radius with N(R) <= n/10) the same slope estimated over r in [R/2, R] exceeds 5, and log N(r) is better fit (higher R^2) by a straight line in r than in log r. If every one of these six conditions holds the primary test passes. Secondary (sufficiency / \'precisely\'): the Cayley graph of the discrete Heisenberg group with generators x, y and inverses is known not to be quasi-isometric to any Z^d (Pansu 1983), yet has polynomial growth of degree 4 (Bass 1972 / Guivarc\'h 1973). If its measured slope over r in [12, 24] lies in [3.5, 4.5], then a network with r^d growth exists that does not correspond to ordinary d-dimensional space in the strict sense. Verdict rule: primary passes and secondary slope in [3.5, 4.5] -> \'mixed\' (the necessity direction and the tree/random clause hold; the sufficiency direction holds only if \'corresponds to ordinary d-dimensional space\' is read as \'has growth dimension d\'); primary passes and secondary slope outside [3.5, 4.5] -> \'supports\'."
    }
  }
}
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-ch09-15"
  }
}
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: "ball sizes N(r) measured by breadth-first search from the origin node; radii up to R = 32 (Z^1..Z^3), 20 (Z^4), 24 (Heisenberg), and until N(r) > n/10 for the tree and random graph"
    }
  }
}
rows {
  name {
    value: "license"
  }
}
rows {
  quad {
    p_iri {
      name_id: 38
    }
    o_literal {
      lex: "generated"
    }
  }
}
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: Graph families generated by analysis.py: hypercubic lattices Z^1..Z^4 (nearest-neighbour, L1 adjacency), infinite 3-regular tree, random 4-regular configuration-model graph (n = 300000, numpy seed 20261031), discrete Heisenberg group Cayley graph (generators x, y and inverses)"
    }
  }
}
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: 40
    }
    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/claim-tests-wolfram-nks-e5f4)"
    }
  }
}
rows {
  name {
    value: "actedOnBehalfOf"
  }
}
rows {
  prefix {
    value: "https://orcid.org/"
  }
}
rows {
  name {
    value: "0009-0007-4948-9192"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 5
      name_id: 41
    }
    o_iri {
      prefix_id: 16
    }
  }
}
rows {
  name {
    value: "usesModel"
  }
}
rows {
  prefix {
    id: 6
    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: 6
    }
  }
}
rows {
  name {
    value: "identifier"
  }
}
rows {
  quad {
    s_iri {
      name_id: 44
    }
    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: 46
    }
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 2
      name_id: 4
    }
    p_iri {
      prefix_id: 5
      name_id: 19
    }
    o_iri {
      prefix_id: 13
    }
  }
}
rows {
  name {
    value: "wasDerivedFrom"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 5
      name_id: 47
    }
    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: 8
    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: 8
    }
  }
}
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 {
  name {
    value: "created"
  }
}
rows {
  datatype {
    value: "http://www.w3.org/2001/XMLSchema#dateTime"
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 1
      name_id: 1
    }
    p_iri {
      prefix_id: 7
      name_id: 56
    }
    o_literal {
      lex: "2026-11-08T16:24:31.934Z"
      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: 16
      name_id: 42
    }
  }
}
rows {
  prefix {
    id: 3
    value: "https://creativecommons.org/licenses/by/4.0/"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 7
      name_id: 38
    }
    o_iri {
      prefix_id: 3
      name_id: 2
    }
  }
}
rows {
  prefix {
    id: 15
    value: "http://purl.org/nanopub/x/"
  }
}
rows {
  name {
    value: "hasNanopubType"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 15
      name_id: 58
    }
    o_iri {
      prefix_id: 10
      name_id: 14
    }
  }
}
rows {
  name {
    value: "introduces"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 15
      name_id: 59
    }
    o_iri {
      prefix_id: 9
      name_id: 12
    }
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 11
      name_id: 16
    }
    o_literal {
      lex: "Claim test of wolfram2002-ch09-15: inconclusive, confidence 0.6"
    }
  }
}
rows {
  name {
    value: "domain"
  }
}
rows {
  prefix {
    id: 14
    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: 14
    }
  }
}
rows {
  name {
    value: "sig"
  }
}
rows {
  name {
    value: "hasAlgorithm"
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 2
    }
    p_iri {
      prefix_id: 15
    }
    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: "GrMO+VkfSxqRQ/s963yLDZS8ETpKYhhQjhm7ehBeHjQLl2bboCzIxldluh4EH8q9XeqaJ5sVML16gFLizpCeqLF+xoO+S8nhvp8dGPkO1x5D97Wr9mpKPhwGNlaRSo8MAZjeInGQkATS9NkrWfktT/C4+YVBd4oa9xNDBhgYXgRziYI8srfyvs48NxzBGDpANASU9QLqS5K/Fu+3mTSxKWEb2FKS9dG5FkOn+plgI9c0NGCdnNDzNjgBstfbsRzx5yTV6JPsQNMfOMrNWKGfDs56b7zB77mG2Vb7hnT1kNqcbFdXdjkY7vgl7NKNxuMUfxaA7AgcjTnaajjGkXEE6A=="
    }
  }
}
rows {
  name {
    value: "hasSignatureTarget"
  }
}
rows {
  quad {
    p_iri {
    }
    o_iri {
      prefix_id: 1
      name_id: 1
    }
  }
}
rows {
  name {
    value: "signedBy"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 15
      name_id: 67
    }
    o_iri {
      prefix_id: 16
      name_id: 42
    }
  }
}