{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:09Z","timestamp":1773376989500,"version":"3.50.1"},"reference-count":46,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"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":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195552","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Private Counterfactual Retrieval with Immutable Features"],"prefix":"10.1109","author":[{"given":"Shreya","family":"Meel","sequence":"first","affiliation":[{"name":"University of Maryland,Department of Electrical and Computer Engineering,College Park,MD,USA,20742"}]},{"given":"Pasan","family":"Dissanayake","sequence":"additional","affiliation":[{"name":"University of Maryland,Department of Electrical and Computer Engineering,College Park,MD,USA,20742"}]},{"given":"Mohamed","family":"Nomeir","sequence":"additional","affiliation":[{"name":"University of Maryland,Department of Electrical and Computer Engineering,College Park,MD,USA,20742"}]},{"given":"Sanghamitra","family":"Dutta","sequence":"additional","affiliation":[{"name":"University of Maryland,Department of Electrical and Computer Engineering,College Park,MD,USA,20742"}]},{"given":"Sennur","family":"Ulukus","sequence":"additional","affiliation":[{"name":"University of Maryland,Department of Electrical and Computer Engineering,College Park,MD,USA,20742"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-62328-8"},{"key":"ref2","article-title":"Counterfactual explanations without opening the black box: Automated decisions and the gdpr","volume-title":"Cybersecurity","author":"Wachter","year":"2017"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-023-00930-y"},{"key":"ref4","first-page":"16926","article-title":"Towards robust and reliable algorithmic recourse","volume":"34","author":"Upadhyay","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref5","first-page":"12351","article-title":"Robust counterfactual explanations for neural networks with probabilistic guarantees","volume-title":"International Conference on Machine Learning","author":"Hamman","year":"2023"},{"key":"ref6","first-page":"5742","article-title":"Robust counterfactual explanations for tree-based ensembles","volume-title":"International Conference on Machine Learning","author":"Dutta","year":"2022"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2024.3401407"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3375627.3375850"},{"key":"ref9","article-title":"Explaining machine learning classifiers through diverse counterfactual explanations","volume":"abs\/1905.07697","author":"Mothilal","year":"2019","journal-title":"CoRR"},{"key":"ref10","first-page":"1","article-title":"Counterfactual explanations for machine learning: A review","volume":"2","author":"Verma","year":"2020","journal-title":"arXiv preprint"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-022-00831-6"},{"key":"ref12","article-title":"A survey on the robustness of feature importance and counterfactual explanations","author":"Mishra","year":"2021","journal-title":"arXiv preprint"},{"key":"ref13","article-title":"On the privacy risks of algorithmic recourse","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"Pawelczyk","year":"2023"},{"key":"ref14","article-title":"Differentially private counterfactuals via functional mechanism","author":"Yang","year":"2022","journal-title":"arXiv preprint"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3608482"},{"key":"ref16","article-title":"Privacy-preserving algorithmic recourse","author":"Pentyala","year":"2023","journal-title":"arXiv preprint"},{"key":"ref17","article-title":"Model extraction from counterfactual explanations","author":"A\u00efvodji","year":"2020","journal-title":"arXiv preprint"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3531146.3533188"},{"key":"ref19","article-title":"Model reconstruction using counterfactual explanations: A perspective from polytope theory","volume-title":"Advances in Neural Information Processing Systems (NeurIPS)","author":"Dissanayake","year":"2024"},{"key":"ref20","article-title":"Private counterfactual retrieval","author":"Nomeir","year":"2024","journal-title":"arXiv preprint"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2848977"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3100476"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977058"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2828310"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2964762"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2869154"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2884891"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2918207"},{"key":"ref32","article-title":"On the capacity of private information retrieval from coded, colluding, and adversarial servers","volume-title":"IEEE ITW","author":"Holzbaurand","year":"2019"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777490"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2916079"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2833050"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2883302"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3188610"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3142358"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3023016"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2903206"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3010988"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977919"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2884891"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3136583"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2815607"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3201375"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195552.pdf?arnumber=11195552","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:49Z","timestamp":1773347389000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195552\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195552","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}