{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T11:12:09Z","timestamp":1730200329529,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T00:00:00Z","timestamp":1607558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T00:00:00Z","timestamp":1607558400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T00:00:00Z","timestamp":1607558400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,12,10]]},"DOI":"10.1109\/bigdata50022.2020.9377995","type":"proceedings-article","created":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T21:10:21Z","timestamp":1616188221000},"page":"5828-5830","source":"Crossref","is-referenced-by-count":1,"title":["Graph Based CIA in Requirements Engineering"],"prefix":"10.1109","author":[{"given":"Maninder","family":"Singh","sequence":"first","affiliation":[]},{"given":"Vaibhav","family":"Anu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3172871.3172880"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-018-9623-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-54045-0_26"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/FIE43999.2019.9028461"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/RE.2018.00062"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ESEM.2017.62"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISSREW.2016.39"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2010.04.002"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985819"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.48"},{"key":"ref5","first-page":"993","article-title":"Latent Dirichlet Allocation","volume":"3","author":"blei","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICIMTR.2012.6236428"},{"key":"ref7","volume":"40","author":"liu","year":"2014","journal-title":"Managing and Mining Graph Data"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1080\/01638539809545028"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/978-3-030-32587-9_10","article-title":"A Vertical Breadth-First Multilevel Path Algorithm to Find All Paths in a Graph. Data Management and Analysis","volume":"65","author":"singh","year":"2020","journal-title":"Studies in Big Data"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICPC.2017.20"}],"event":{"name":"2020 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2020,12,10]]},"location":"Atlanta, GA, USA","end":{"date-parts":[[2020,12,13]]}},"container-title":["2020 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9377717\/9377728\/09377995.pdf?arnumber=9377995","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T16:12:46Z","timestamp":1656346366000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9377995\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,10]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/bigdata50022.2020.9377995","relation":{},"subject":[],"published":{"date-parts":[[2020,12,10]]}}}