{
    "ok": true,
    "doi": "10.46243/jst.2023.v8.i12.pp219-229",
    "references_in_record": 5,
    "not_read": [],
    "own_doi": [],
    "total": 4,
    "page": 1,
    "pages": 1,
    "per_page": 20,
    "items": [
        {
            "position": 1,
            "key": "ref1",
            "doi": "10.1109/infocomwkshps47286.2019.9093762",
            "doi_url": "https://doi.org/10.1109/infocomwkshps47286.2019.9093762",
            "unstructured": "S. Shaham, M. Ding, B. Liu, Z. Lin, and J. Li, “Machine learning aided anonymization of spatiotemporal trajectory datasets,” arXiv preprint arXiv:1902.08934, 2019",
            "held": false
        },
        {
            "position": 3,
            "key": "ref3",
            "doi": "10.1145/2351476.2351486",
            "doi_url": "https://doi.org/10.1145/2351476.2351486",
            "unstructured": "T. Takahashi and S. Miyakawa, “Cmoa: Continuous moving object anonymization,” in Proceedings of the 16th International Database Engineering & Applications Sysmposium. ACM, 2012, pp. 81–90",
            "held": false
        },
        {
            "position": 4,
            "key": "ref4",
            "doi": "10.1007/978-3-030-05755-8_44",
            "doi_url": "https://doi.org/10.1007/978-3-030-05755-8_44",
            "unstructured": "X. Zhou and M. Qiu, “A k-anonymous full domain generalization algorithm based on heap sort,” in International Conference on Smart Computing and Communication. Springer, 2018, pp. 446–",
            "held": false
        },
        {
            "position": 5,
            "key": "ref5",
            "doi": "10.1145/1066157.1066164",
            "doi_url": "https://doi.org/10.1145/1066157.1066164",
            "unstructured": "K. LeFevre, D. J. DeWitt, and R. Ramakrishnan, “Incognito: Efficient full-domain k-anonymity,” in Proceedings of the 2005 ACM SIGMOD international conference on Management of data. ACM, 2005, pp. 49–60",
            "held": false
        }
    ]
}