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: "RApmDBBdvhmqwZCWp4bWMlxy6BFnZivZP2Mr8DNZ_3srI"
  }
}
rows {
  namespace {
    name: "this"
    value {
      prefix_id: 1
    }
  }
}
rows {
  prefix {
    value: "https://w3id.org/np/RApmDBBdvhmqwZCWp4bWMlxy6BFnZivZP2Mr8DNZ_3srI/"
  }
}
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-17--claim-test"
  }
}
rows {
  name {
    value: "description"
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 9
    }
    p_iri {
      prefix_id: 7
    }
    o_literal {
      lex: "analysis.py enumerates all 2305 one- and two-rule systems over {A,B} with lhs length 1-3 and strictly shorter rhs, classifies each syntactically as non-overlapping (37 systems; lhs sets {A}, {B}, {A,B}, {AB}, {BA}, {AAB}, {ABB}, {BAA}, {BBA}) or overlapping (2268), and for each of the 62 initial strings of length 1-5 generates every complete evolution by depth-first search over all possible replacement choices, tracking element identities so that each event is identified by (rule, consumed elements) and the causal network by its identity-labelled edges. Networks from different orders are compared first for identity and then, if they differ, up to isomorphism by brute force over event permutations. A supplementary (not pre-registered) run covers all 127 non-overlapping systems with lhs length up to 4 (which includes genuinely non-overlapping pairs such as {AAB, BBBA} and {AABB, BBAA}) from all 126 initial strings of length 1-6. Run time about 3 s."
    }
    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: 1 fraction of non-overlapping (rule set, initial string) pairs with >= 2 complete evolutions whose causal networks all coincide (n = 186, exact (exhaustive within the family)). Interpretation: Wolfram\'s generalized substitution systems (NKS pp. 497-503) replace one occurrence of a left-hand block at a time; which occurrence, and when, is the free choice of \'order\'. A causal network has one node per replacement event and an edge from event P to event E whenever E\'s matched block contains an element that P produced; the initial condition is represented by a node 0 that \'produces\' the initial elements. Two orders give \'the same causal network\' if the networks are isomorphic as node-labelled directed graphs (labels = rule applied, node 0 fixed). Non-overlap is the syntactic condition of p. 503: no non-empty proper suffix of any block equals a prefix of any block (including the block itself), and no block is a substring of another. To compare complete histories across orders, the enumeration is restricted to systems whose every rule strictly shortens the string (|rhs| < |lhs|), so every evolution terminates after finitely many events; all complete evolutions (all choices at every step) from every initial string of length <= 5 over {A, B} are generated exhaustively. Wolfram\'s weaker condition (no overlap among strings actually generated) is not tested."
    }
  }
}
rows {
  name {
    value: "label"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Claim test of wolfram2002-ch09-17: supports, confidence 0.93"
    }
  }
}
rows {
  name {
    value: "seeAlso"
  }
}
rows {
  prefix {
    value: "https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch09-17/"
  }
}
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: shrinking-substitution-systems-2-letters-exhaustive"
    }
  }
}
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: at least one non-overlapping (rule set, initial string) pair whose complete evolutions produce two or more non-isomorphic causal networks."
    }
  }
}
rows {
  name {
    value: "evidenceAgainst"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "The enumeration is restricted to terminating (strictly shrinking) systems so that complete histories can be compared; for non-terminating systems the statement concerns infinite causal networks and was not tested. Within the family the result is exhaustive: all 186 (primary) and 524 (supplementary) non-overlapping cases with a genuine choice of order gave identical, not merely isomorphic, causal networks and identical final strings, while 96.6% of overlapping rule sets showed order-dependent networks for some initial string, so the non-overlap condition is doing real work."
    }
  }
}
rows {
  quad {
    o_literal {
      lex: "Within the pre-registered family (lhs length <= 3) every non-overlapping rule set has a single multi-letter block or only single-letter blocks; non-overlapping pairs of multi-letter blocks appear only in the supplementary run with blocks of length 4, which was added after the primary run and is reported separately."
    }
  }
}
rows {
  quad {
    o_literal {
      lex: "Wolfram\'s weaker condition (no overlaps among the strings actually generated) and his extension to network rewriting systems were not tested; the causal-network definition (edge from the event that produced an element to the event that consumes it, with an \'init\' node for the initial condition) follows pp. 497-503 but the book gives it only pictorially."
    }
  }
}
rows {
  name {
    value: "expectedObservation"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Pre-registered: among all enumerated (rule set, initial string) pairs whose rule set is syntactically non-overlapping and which admit at least two distinct complete evolutions, 100% have exactly one causal-network isomorphism class (and one final string) over all complete evolutions; and at least 10% of the overlapping rule sets exhibit at least two non-isomorphic causal networks for some initial string (otherwise the test has no discriminating power and the verdict is \'inconclusive\', reason \'not-operationalizable\')."
    }
  }
}
rows {
  name {
    value: "failCriterion"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Pre-registered: at least one non-overlapping (rule set, initial string) pair whose complete evolutions produce two or more non-isomorphic causal networks."
    }
  }
}
rows {
  name {
    value: "hasConfidence"
  }
}
rows {
  datatype {
    value: "http://www.w3.org/2001/XMLSchema#double"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "0.93"
      datatype: 1
    }
  }
}
rows {
  name {
    value: "hasEvidence"
  }
}
rows {
  prefix {
    value: "https://w3id.org/delphi/resource/evidence/"
  }
}
rows {
  name {
    value: "wolfram2002-ch09-17--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: "For every string substitution system whose left-hand-side blocks can never overlap themselves or each other, every possible order of performing replacements from a given initial string yields the same causal network (up to isomorphism), whereas systems with overlapping blocks can yield different causal networks for different orders."
    }
  }
}
rows {
  name {
    value: "inferenceMethod"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "analysis.py enumerates all 2305 one- and two-rule systems over {A,B} with lhs length 1-3 and strictly shorter rhs, classifies each syntactically as non-overlapping (37 systems; lhs sets {A}, {B}, {A,B}, {AB}, {BA}, {AAB}, {ABB}, {BAA}, {BBA}) or overlapping (2268), and for each of the 62 initial strings of length 1-5 generates every complete evolution by depth-first search over all possible replacement choices, tracking element identities so that each event is identified by (rule, consumed elements) and the causal network by its identity-labelled edges. Networks from different orders are compared first for identity and then, if they differ, up to isomorphism by brute force over event permutations. A supplementary (not pre-registered) run covers all 127 non-overlapping systems with lhs length up to 4 (which includes genuinely non-overlapping pairs such as {AAB, BBBA} and {AABB, BBAA}) from all 126 initial strings of length 1-6. Run time about 3 s."
    }
  }
}
rows {
  name {
    value: "passCriterion"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Pre-registered: among all enumerated (rule set, initial string) pairs whose rule set is syntactically non-overlapping and which admit at least two distinct complete evolutions, 100% have exactly one causal-network isomorphism class (and one final string) over all complete evolutions; and at least 10% of the overlapping rule sets exhibit at least two non-isomorphic causal networks for some initial string (otherwise the test has no discriminating power and the verdict is \'inconclusive\', reason \'not-operationalizable\')."
    }
  }
}
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-17"
  }
}
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: "exhaustive finite family; non-overlapping systems are the test set, overlapping ones the control"
    }
  }
}
rows {
  name {
    value: "license"
  }
}
rows {
  quad {
    p_iri {
      name_id: 38
    }
    o_literal {
    }
  }
}
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: All one- and two-rule string substitution systems over {A,B} with left-hand blocks of length 1-3 and strictly shorter right-hand sides, all initial strings of length 1-5, all complete evolutions (generated by analysis.py)"
    }
  }
}
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-0123)"
    }
  }
}
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-17: supports, confidence 0.93"
    }
  }
}
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: "RfbSyKroBZEqR4uQMDVpy+r85P15Bdv9WxcgSqV1vJISUR6xvn+FD5+RAJfs3GXHX9IXwnhrC2qUA2NL/jJJFe1AcplvORgR6NPiZQ7uizSdlw/39TdlR9LObEgNDb/lbBgWR21mKzcrxblHOxcYytERddgSY63IXdUYcs+ktA3VZE9QmSwHa/+Kx9eJWAYT2SauYTAhB1c7w5Hv8WLSLQ+v9Eg6TeGoZpZMv9AnNmmOOuxUrC26OOIDojAzjRu7Xdwe95jOz3VOqFFseGJBTol5L3W+73zrngYCUHFHvdd7MgydZtALl1PgB6QXSTzY3dVqEf+56CGms+lWPKfMEw=="
    }
  }
}
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
    }
  }
}