{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:23:22Z","timestamp":1765887802057},"reference-count":0,"publisher":"National Library of Serbia","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ComSIS","COMPUT SCI INF SYST","COMPUT SCI INFORM SY","COMPUTER SCI INFORM","COMSIS J"],"published-print":{"date-parts":[[2016]]},"DOI":"10.2298\/csis160227022b","type":"journal-article","created":{"date-parts":[[2016,6,21]],"date-time":"2016-06-21T10:21:20Z","timestamp":1466504480000},"page":"677-689","source":"Crossref","is-referenced-by-count":21,"title":["K maximum probability attack paths dynamic generation algorithm"],"prefix":"10.2298","volume":"13","author":[{"given":"Kun","family":"Bi","sequence":"first","affiliation":[]},{"given":"Dezhi","family":"Han","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Wang","sequence":"additional","affiliation":[]}],"member":"1078","container-title":["Computer Science and Information Systems"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T08:32:51Z","timestamp":1685349171000},"score":1,"resource":{"primary":{"URL":"https:\/\/doiserbia.nb.rs\/Article.aspx?ID=1820-02141600022B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.2298\/csis160227022b","relation":{},"ISSN":["1820-0214","2406-1018"],"issn-type":[{"value":"1820-0214","type":"print"},{"value":"2406-1018","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}