{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T04:29:10Z","timestamp":1768364950865,"version":"3.49.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031212505","type":"print"},{"value":"9783031212512","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-21251-2_3","type":"book-chapter","created":{"date-parts":[[2022,11,16]],"date-time":"2022-11-16T09:03:44Z","timestamp":1668589424000},"page":"35-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Fairness Testing Through Hash-Based Sampling"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5965-5832","authenticated-orcid":false,"given":"Zhenjiang","family":"Zhao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9004-6146","authenticated-orcid":false,"given":"Takahisa","family":"Toda","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8903-3161","authenticated-orcid":false,"given":"Takashi","family":"Kitamura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,15]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Lohia, P., Nagar, S., Dey, K., Saha, D.: Black box fairness testing of machine learning models. In: Proceedings of ESEC\/SIGSOFT FSE, pp. 625\u2013635 (2019)","DOI":"10.1145\/3338906.3338937"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Byanjankar, A., Heikkil\u00e4, M., Mezei, J.: Predicting credit risk in peer-to-peer lending: a neural network approach. In: Proceedings of SSCI 2015, pp. 719\u2013725. IEEE (2015)","DOI":"10.1109\/SSCI.2015.109"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-662-46681-0_25","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Chakraborty","year":"2015","unstructured":"Chakraborty, S., Fremont, D.J., Meel, K.S., Seshia, S.A., Vardi, M.Y.: On parallel scalable uniform SAT witness generation. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 304\u2013319. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46681-0_25"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-642-39799-8_40","volume-title":"Computer Aided Verification","author":"S Chakraborty","year":"2013","unstructured":"Chakraborty, S., Meel, K.S., Vardi, M.Y.: A scalable and nearly uniform generator of SAT witnesses. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 608\u2013623. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_40"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Meel, K.S., Vardi, M.Y.: Balancing scalability and uniformity in SAT witness generator. In: Proceedings of DAC 2014, DAC 2014, pp. 1\u20136 (2014)","DOI":"10.1145\/2593069.2593097"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Duenas-Osorio, L., Meel, K., Paredes, R., Vardi, M.: Counting-based reliability estimation for power-transmission grids. In: Proceedings of AAAI 2017, vol. 31, no. 1, February 2017","DOI":"10.1609\/aaai.v31i1.11178"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Dwork, C., Hardt, M., Pitassi, T., Reingold, O., Zemel, R.: Fairness through awareness. In: Proceedings of ITCS 2012, pp. 214\u2013226 (2012)","DOI":"10.1145\/2090236.2090255"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Galhotra, S., Brun, Y., Meliou, A.: Fairness testing: testing software for discrimination. In: Proceedings of ESEC\/FSE 2017, pp. 498\u2013510 (2017)","DOI":"10.1145\/3106237.3106277"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Gomes, C.P., Sabharwal, A., Selman, B.: Near-uniform sampling of combinatorial spaces using XOR constraints. In: Proceedings of NIPS 2006, pp. 481\u2013488 (2006)","DOI":"10.7551\/mitpress\/7503.003.0065"},{"key":"3_CR10","unstructured":"Goodfellow, I.J., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples. In: Proceedings of ICLR (2015)"},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1093\/qje\/qjx042","volume":"133","author":"M Hoffman","year":"2018","unstructured":"Hoffman, M., Kahn, L., Li, D.: Discretion in hiring. Q. J. Econ. 133(2), 765\u2013800 (2018)","journal-title":"Q. J. Econ."},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10601-015-9204-z","volume":"21","author":"A Ivrii","year":"2016","unstructured":"Ivrii, A., Malik, S., Meel, K.S., Vardi, M.Y.: On computing minimal independent support and its applications to sampling and counting. Constraints 21(1), 41\u201358 (2016). https:\/\/doi.org\/10.1007\/s10601-015-9204-z","journal-title":"Constraints"},{"key":"3_CR13","unstructured":"Angwin, J., Larson, J., Mattu, S., Kirchner, L.: Machine bias (2016). https:\/\/www.propublica.org\/article\/machine-bias-risk-assessments-in-criminal-sentencing"},{"key":"3_CR14","unstructured":"Kuhn, R., Kacker, R.: Introduction to Combinatorial Testing. Chapman & Hall CRC (2013)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Kurakin, A., Goodfellow, I.J., Bengio, S.: Adversarial examples in the physical world. In: Proceedings of ICLR 2017. OpenReview.net (2017)","DOI":"10.1201\/9781351251389-8"},{"key":"3_CR16","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-030-79474-3_13","volume-title":"Computer and Information Science 2021\u2014Summer","author":"D Perez Morales","year":"2021","unstructured":"Perez Morales, D., Kitamura, T., Takada, S.: Coverage-guided fairness testing. In: Lee, R. (ed.) ICIS 2021. SCI, vol. 985, pp. 183\u2013199. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79474-3_13"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Mothilal, R.K., Sharma, A., Tan, C.: Explaining machine learning classifiers through diverse counterfactual explanations. In: Proceedings of FACCT 2020, pp. 607\u2013617. ACM (2020)","DOI":"10.1145\/3351095.3372850"},{"key":"3_CR18","unstructured":"Naveh, Y., et al.: Constraint-based random stimuli generation for hardware verification. In: Proceedings of IAAI 2006, pp. 1720\u20131727. AAAI Press (2006)"},{"key":"3_CR19","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-030-43883-8_7","volume-title":"Recent Trends in Learning From Data","author":"L Oneto","year":"2020","unstructured":"Oneto, L., Chiappa, S.: Fairness in machine learning. In: Oneto, L., Navarin, N., Sperduti, A., Anguita, D. (eds.) Recent Trends in Learning From Data. SCI, vol. 896, pp. 155\u2013196. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43883-8_7"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Patel, A.R., Chandrasekaran, J., Lei, Y., Kacker, R.N., Kuhn, D.R.: A combinatorial approach to fairness testing of machine learning models. In: Proceedings of IWCT 2022, pp. 1135\u20131144. IEEE (2022)","DOI":"10.1109\/ICSTW55395.2022.00030"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: \u201cwhy should I trust you?\u201d: Explaining the predictions of any classifier. In: Proceedings of KDD 2016, pp. 1135\u20131144. ACM (2016)","DOI":"10.18653\/v1\/N16-3020"},{"issue":"1","key":"3_CR22","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(94)00092-1","volume":"82","author":"D Roth","year":"1996","unstructured":"Roth, D.: On the hardness of approximate reasoning. Artif. Intell. 82(1), 273\u2013302 (1996)","journal-title":"Artif. Intell."},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Sharma, A., Demir, C., Ngomo, A.N., Wehrheim, H.: MLCHECK-property-driven testing of machine learning classifiers. In: Proceedings of ICMLA 2021, pp. 738\u2013745 (2021)","DOI":"10.1109\/ICMLA52953.2021.00123"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-030-64881-7_16","volume-title":"Testing Software and Systems","author":"A Sharma","year":"2020","unstructured":"Sharma, A., Wehrheim, H.: Automatic fairness testing of machine learning models. In: Casola, V., De Benedictis, A., Rak, M. (eds.) ICTSS 2020. LNCS, vol. 12543, pp. 255\u2013271. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64881-7_16"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Sharma, A., Wehrheim, H.: Higher income, larger loan? Monotonicity testing of machine learning models. In: Proceedings of ISSTA 2020, pp. 200\u2013210. ACM (2020)","DOI":"10.1145\/3395363.3397352"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Sipser, M.: A complexity theoretic approach to randomness. In: Proceedings of STOC 1983, pp. 330\u2013335. ACM (1983)","DOI":"10.1145\/800061.808762"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Udeshi, S., Arora, P., Chattopadhyay, S.: Automated directed fairness testing. In: Proceedings of ASE 2018, pp. 98\u2013108 (2018)","DOI":"10.1145\/3238147.3238165"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Zhang, P., et al.: White-box fairness testing through adversarial sampling. In: Proceedings of ICSE 2020, pp. 949\u2013960 (2020)","DOI":"10.1145\/3377811.3380331"}],"container-title":["Lecture Notes in Computer Science","Search-Based Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21251-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T22:22:31Z","timestamp":1701382951000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21251-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031212505","9783031212512"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21251-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSBSE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Search Based Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ssbse2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/ssbse-2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This volume includes 1 paper of NIER and RENE tracks and 1 paper of Challenge Track, as well 2 keynote speaker abstracts and 1 tutorial abstract in the front matter.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}