{
  "ml": {
    "v": "4",
    "fs": [
      {
        "id": 0,
        "prob": 0.9333333373069763,
        "class": 2
      }
    ],
    "prob": 0.93333334,
    "class": 2,
    "models": [
      {
        "m": "az",
        "prob": 0.6687533,
        "class": 0
      },
      {
        "m": "az/documents",
        "prob": 0.93333334,
        "class": 2
      },
      {
        "m": "az/pdf",
        "prob": 0.90040654,
        "class": 2
      }
    ],
    "version": "v16.16",
    "thresholds": [
      0.9961373,
      0.9998425
    ],
    "analyzed_at": "2026-05-12T22:56:15Z"
  },
  "path": "Reducing the Space Requirement of Suffix Trees (Kurtz_SWPracticeandExperiment_1999).pdf",
  "raw": {
    "v": "4",
    "fs": [
      {
        "f": "H(Db)Md(Pd)",
        "k": {
          "header.version": "1.2",
          "shape.eof_count": 2,
          "filter_chains[0]": "FlateDecode",
          "filter_chains[1]": "FlateDecode",
          "filter_chains[2]": "FlateDecode",
          "filter_chains[3]": "FlateDecode",
          "filter_chains[4]": "FlateDecode",
          "filter_chains[5]": "FlateDecode",
          "filter_chains[6]": "FlateDecode",
          "filter_chains[7]": "FlateDecode",
          "filter_chains[8]": "FlateDecode",
          "filter_chains[9]": "FlateDecode",
          "shape.linearized": true,
          "filter_chains[10]": "FlateDecode",
          "filter_chains[11]": "FlateDecode",
          "filter_chains[12]": "FlateDecode",
          "filter_chains[13]": "FlateDecode",
          "filter_chains[14]": "FlateDecode",
          "filter_chains[15]": "CCITTFaxDecode",
          "filter_chains[16]": "FlateDecode",
          "filter_chains[17]": "FlateDecode",
          "filter_chains[18]": "CCITTFaxDecode",
          "filter_chains[19]": "FlateDecode",
          "filter_chains[20]": "FlateDecode",
          "filter_chains[21]": "FlateDecode",
          "filter_chains[22]": "FlateDecode",
          "filter_chains[23]": "FlateDecode",
          "filter_chains[24]": "FlateDecode",
          "filter_chains[25]": "FlateDecode",
          "filter_chains[26]": "FlateDecode",
          "filter_chains[27]": "FlateDecode",
          "filter_chains[28]": "FlateDecode",
          "filter_chains[29]": "FlateDecode",
          "filter_chains[30]": "CCITTFaxDecode",
          "filter_chains[31]": "FlateDecode",
          "filter_chains[32]": "FlateDecode",
          "filter_chains[33]": "FlateDecode",
          "filter_chains[34]": "FlateDecode",
          "filter_chains[35]": "FlateDecode",
          "filter_chains[36]": "FlateDecode",
          "filter_chains[37]": "FlateDecode",
          "filter_chains[38]": "ASCII85Decode,LZWDecode",
          "filter_chains[39]": "ASCII85Decode,LZWDecode",
          "filter_chains[40]": "ASCII85Decode,LZWDecode",
          "filter_chains[41]": "ASCII85Decode,LZWDecode",
          "filter_chains[42]": "ASCII85Decode,LZWDecode",
          "filter_chains[43]": "ASCII85Decode,LZWDecode",
          "filter_chains[44]": "ASCII85Decode,LZWDecode",
          "filter_chains[45]": "ASCII85Decode,LZWDecode",
          "filter_chains[46]": "ASCII85Decode,LZWDecode",
          "filter_chains[47]": "ASCII85Decode,LZWDecode",
          "filter_chains[48]": "ASCII85Decode,LZWDecode",
          "filter_chains[49]": "ASCII85Decode,LZWDecode",
          "filter_chains[50]": "ASCII85Decode,LZWDecode",
          "filter_chains[51]": "ASCII85Decode,LZWDecode",
          "filter_chains[52]": "ASCII85Decode,LZWDecode",
          "filter_chains[53]": "ASCII85Decode,LZWDecode",
          "filter_chains[54]": "ASCII85Decode,LZWDecode",
          "filter_chains[55]": "ASCII85Decode,LZWDecode",
          "filter_chains[56]": "ASCII85Decode,LZWDecode",
          "filter_chains[57]": "ASCII85Decode,LZWDecode",
          "filter_chains[58]": "ASCII85Decode,LZWDecode",
          "filter_chains[59]": "ASCII85Decode,LZWDecode",
          "filter_chains[60]": "ASCII85Decode,LZWDecode",
          "filter_chains[61]": "ASCII85Decode,LZWDecode",
          "shape.object_count": 310,
          "header.header_count": 1
        },
        "x": 2,
        "id": 0,
        "ms": {
          "file": {
            "size": 212628.0
          }
        },
        "sz": 212628,
        "ts": [
          {
            "a": "T1566.001",
            "c": 0.8600000143051147,
            "d": "PDF annotation object",
            "e": [
              "/Type /Annot"
            ],
            "i": "objectives/execution/lure/document::pdf-annotation-object",
            "l": 1
          },
          {
            "c": 0.75,
            "d": "PDF chained stream filter array",
            "e": [
              "/Filter ["
            ],
            "i": "micro-behaviors/data/encode/custom::pdf-multi-filter",
            "l": 3
          },
          {
            "c": 0.8999999761581421,
            "d": "PDF contains producer metadata tag",
            "e": [
              "/Producer ("
            ],
            "i": "metadata/document/pdf/properties::has-producer",
            "l": 2
          },
          {
            "c": 0.8999999761581421,
            "d": "PDF stream uses multi-step filter chain",
            "e": [
              "ASCII85Decode,LZWDecode"
            ],
            "i": "metadata/document/pdf/properties::pdf-filter-chain-multi",
            "l": 3
          }
        ],
        "sha": "fa3caafb0502bc85a6c324304ca4821d10768f76af288c22d32d6ca2acae6ba1",
        "path": "Reducing the Space Requirement of Suffix Trees (Kurtz_SWPracticeandExperiment_1999).pdf",
        "type": "pdf"
      }
    ],
    "tv": "f2a89"
  }
}