{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T17:00:08Z","timestamp":1781283608943,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,23]]},"DOI":"10.1145\/3800506.3803506","type":"proceedings-article","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T16:24:42Z","timestamp":1781281482000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Mining for the Minimum Number of Roles from Hard Inputs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3137-1635","authenticated-orcid":false,"given":"Puneet","family":"Gill","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3615-9393","authenticated-orcid":false,"given":"Mahesh","family":"Tripunitara","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3450569.3463566"},{"key":"e_1_3_2_1_2_1","first-page":"0","article-title":"Constrained k-means clustering","volume":"20","author":"Bradley Paul S","year":"2000","unstructured":"Paul S Bradley, Kristin P Bennett, and Ayhan Demiriz. 2000. Constrained k-means clustering. Microsoft Research, Redmond, Vol. 20, 0 (2000), 0.","journal-title":"Microsoft Research, Redmond"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1377836.1377838"},{"key":"e_1_3_2_1_4_1","unstructured":"Puneet Gill. 2026. MinRoles Hard Instances. https:\/\/github.com\/puneetgill05\/minroles_hard_instances. GitHub repository."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3734436.3734443"},{"key":"e_1_3_2_1_6_1","unstructured":"Google. 2025a. Access control. https:\/\/docs.cloud.google.com\/kubernetes-engine\/docs\/concepts\/access-control. Accessed: 2025-12-31."},{"key":"e_1_3_2_1_7_1","unstructured":"Google. 2025b. Access control lists (ACLs). https:\/\/docs.cloud.google.com\/storage\/docs\/access-control\/lists. Accessed: 2025-12-31."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3532105.3535030"},{"key":"e_1_3_2_1_9_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907","author":"Kipf TN","year":"2016","unstructured":"TN Kipf. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)."},{"key":"e_1_3_2_1_10_1","volume-title":"Variational graph auto-encoders. arXiv preprint arXiv:1611.07308","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling. 2016. Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 (2016)."},{"key":"e_1_3_2_1_11_1","unstructured":"Josh Levy-Kramer. 2025. K-Means clustering constrained with minimum and maximum cluster size. https:\/\/pypi.org\/project\/k-means-constrained. Accessed: 2025-12-08."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497438"},{"key":"e_1_3_2_1_13_1","volume-title":"Unsupervised learning for solving the travelling salesman problem. Advances in neural information processing systems","author":"Min Yimeng","year":"2023","unstructured":"Yimeng Min, Yiwei Bai, and Carla P Gomes. 2023. Unsupervised learning for solving the travelling salesman problem. Advances in neural information processing systems, Vol. 36 (2023), 47264-47278."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2871148"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1377836.1377840"},{"key":"e_1_3_2_1_16_1","unstructured":"Gurobi Optimization. 2026. Gurobi 12.0. https:\/\/www.gurobi.com\/"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1038\/s43246-022-00315-6"},{"key":"e_1_3_2_1_18_1","volume-title":"Advances in computers.","author":"Sandhu Ravi S","unstructured":"Ravi S Sandhu. 1998. Role-based access control. In Advances in computers. Vol. 46. Elsevier, 237-286."},{"key":"e_1_3_2_1_19_1","unstructured":"L.J. Stockmeyer. 1975. The Set Basis Problem is Np-complete. IBM Thomas J. Watson Research Division. https:\/\/books.google.ca\/books?id=NtDmtgAACAAJ"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3734436.3734442"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1266840.1266870"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1544133.1544137"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180424"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2295136.2295146"}],"event":{"name":"CODASPY '26: Sixteenth ACM Conference on Data and Application Security and Privacy","location":"Frankfurt am Main Germany","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the Sixteenth ACM Conference on Data and Application Security and Privacy"],"original-title":[],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T16:26:20Z","timestamp":1781281580000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3800506.3803506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,22]]},"references-count":24,"alternative-id":["10.1145\/3800506.3803506","10.1145\/3800506"],"URL":"https:\/\/doi.org\/10.1145\/3800506.3803506","relation":{},"subject":[],"published":{"date-parts":[[2026,6,22]]},"assertion":[{"value":"2026-06-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}