Katharina Anna Zweig
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Katharina Anna Zweig has a total of 114 co-authors. Here are the top co-authors by number of shared publications:
- Tobias D. Krafft
Technische Universität Kaiserslautern
8 shared publications - Marc P. Hauer
Algorithm Accountability Lab TU Kaiserslautern Gottlieb-Daimler-Straße 48 67663 Kaiserslautern Germany
5 shared publications Michael Kaufmann
Wilhelm-Schickard-Institute, University of Tübingen
5 shared publicationsDagmar Tenfelde-Podehl
Technische Universität Kaiserslautern
3 shared publicationsDirk Koschützki
IPK Gatersleben
3 shared publications- Emőke-Ágnes Horvát
Interdisciplinary Center for Scientific Computing, University of Heidelberg, Heidelberg, Germany
3 shared publications
Latest Publications
- Open Access
- 30 June 2026
- Published by IMR Press in management revue
- Vol. 37 (2)
Detached Digital Automated Side Hustle (D-DASH)—A New Form of Digital Business?
This paper introduces the Detached Digital Automated Side Hustle (D-DASH) as a novel form of digital entrepreneurship that departs fundamentally from traditional side-hustle models. Using Job Characteristics Theory and a netnographic approach, we examine how automation, outsourcing, and platform-based systems reshape key dimensions of side hustles. Unlike conventional models centered on personal involvement and skill development, D-DASH emphasizes minimal input, faceless operation, and passive income generation. Our analysis reveals shifts in five core work characteristics: autonomy becomes strategic detachment, task significance and task identity diminish, skill variety decreases, and feedback is mediated through metrics. These changes reflect a broader reconfiguration of business models in the platform economy, wherein side hustlers transition from labor-intensive micro-entrepreneurs to orchestrators of automated systems. We contribute to the literature on gig-economy business models by identifying D-DASH as a distinct archetype characterized by reduced input requirements, high scalability, and a transformed experience of autonomy and meaning.
- 30 June 2026
- Published by IMR Press in management revue
- Vol. 37 (2)
Open AccessDetached Digital Automated Side Hustle (D-DASH)—A New Form of Digital Business?
This paper introduces the Detached Digital Automated Side Hustle (D-DASH) as a novel form of digital entrepreneurship that departs fundamentally from traditional side-hustle models. Using Job Characteristics Theory and a netnographic approach, we examine how automation, outsourcing, and platform-based systems reshape key dimensions of side hustles. Unlike conventional models centered on personal involvement and skill development, D-DASH emphasizes minimal input, faceless operation, and passive income generation. Our analysis reveals shifts in five core work characteristics: autonomy becomes strategic detachment, task significance and task identity diminish, skill variety decreases, and feedback is mediated through metrics. These changes reflect a broader reconfiguration of business models in the platform economy, wherein side hustlers transition from labor-intensive micro-entrepreneurs to orchestrators of automated systems. We contribute to the literature on gig-economy business models by identifying D-DASH as a distinct archetype characterized by reduced input requirements, high scalability, and a transformed experience of autonomy and meaning.
- Open Access
- 25 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 4511-4551
Developing an Assessment Tool for AI Guidelines
- 25 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 4511-4551
Open AccessDeveloping an Assessment Tool for AI Guidelines
- 8 May 2026
- Published by Springer Nature
- p. 396-411
A Socioinformatic Approach to xAI
- Open Access
- 25 May 2024
- Published by Springer Nature in Minds and Machines
- Vol. 34 (2) , 1-31
Black-Box Testing and Auditing of Bias in ADM Systems
For years, the number of opaque algorithmic decision-making systems (ADM systems) with a large impact on society has been increasing: e.g., systems that compute decisions about future recidivism of criminals, credit worthiness, or the many small decision computing systems within social networks that create rankings, provide recommendations, or filter content. Concerns that such a system makes biased decisions can be difficult to investigate: be it by people affected, NGOs, stakeholders, governmental testing and auditing authorities, or other external parties. Scientific testing and auditing literature rarely focuses on the specific needs for such investigations and suffers from ambiguous terminologies. With this paper, we aim to support this investigation process by collecting, explaining, and categorizing methods of testing for bias, which are applicable to black-box systems, given that inputs and respective outputs can be observed. For this purpose, we provide a taxonomy that can be used to select suitable test methods adapted to the respective situation. This taxonomy takes multiple aspects into account, for example the effort to implement a given test method, its technical requirement (such as the need of ground truth) and social constraints of the investigation, e.g., the protection of business secrets. Furthermore, we analyze which test method can be used in the context of which black box audit concept. It turns out that various factors, such as the type of black box audit or the lack of an oracle, may limit the selection of applicable tests. With the help of this paper, people or organizations who want to test an ADM system for bias can identify which test methods and auditing concepts are applicable and what implications they entail.
- 25 May 2024
- Published by Springer Nature in Minds and Machines
- Vol. 34 (2) , 1-31
Open AccessBlack-Box Testing and Auditing of Bias in ADM Systems
For years, the number of opaque algorithmic decision-making systems (ADM systems) with a large impact on society has been increasing: e.g., systems that compute decisions about future recidivism of criminals, credit worthiness, or the many small decision computing systems within social networks that create rankings, provide recommendations, or filter content. Concerns that such a system makes biased decisions can be difficult to investigate: be it by people affected, NGOs, stakeholders, governmental testing and auditing authorities, or other external parties. Scientific testing and auditing literature rarely focuses on the specific needs for such investigations and suffers from ambiguous terminologies. With this paper, we aim to support this investigation process by collecting, explaining, and categorizing methods of testing for bias, which are applicable to black-box systems, given that inputs and respective outputs can be observed. For this purpose, we provide a taxonomy that can be used to select suitable test methods adapted to the respective situation. This taxonomy takes multiple aspects into account, for example the effort to implement a given test method, its technical requirement (such as the need of ground truth) and social constraints of the investigation, e.g., the protection of business secrets. Furthermore, we analyze which test method can be used in the context of which black box audit concept. It turns out that various factors, such as the type of black box audit or the lack of an oracle, may limit the selection of applicable tests. With the help of this paper, people or organizations who want to test an ADM system for bias can identify which test methods and auditing concepts are applicable and what implications they entail.
- Open Access
- 24 November 2023
- Published by Cambridge University Press (CUP) in Data & Policy
- Vol. 5, e36
Overview of transparency and inspectability mechanisms to achieve accountability of artificial intelligence systems
Several governmental organizations all over the world aim for algorithmic accountability of artificial intelligence systems. However, there are few specific proposals on how exactly to achieve it. This article provides an extensive overview of possible transparency and inspectability mechanisms that contribute to accountability for the technical components of an algorithmic decision-making system. Following the different phases of a generic software development process, we identify and discuss several such mechanisms. For each of them, we give an estimate of the cost with respect to time and money that might be associated with that measure.
- 24 November 2023
- Published by Cambridge University Press (CUP) in Data & Policy
- Vol. 5, e36
Open AccessOverview of transparency and inspectability mechanisms to achieve accountability of artificial intelligence systems
Several governmental organizations all over the world aim for algorithmic accountability of artificial intelligence systems. However, there are few specific proposals on how exactly to achieve it. This article provides an extensive overview of possible transparency and inspectability mechanisms that contribute to accountability for the technical components of an algorithmic decision-making system. Following the different phases of a generic software development process, we identify and discuss several such mechanisms. For each of them, we give an estimate of the cost with respect to time and money that might be associated with that measure.
- 31 October 2023
- Published by Freiwillige Selbstkontrolle Fernsehen e.V. in mediendiskurs: Rache. Vergeltung in den Medien
- Vol. 27 (4/2023 (10)
Ersetzt wird der, der KI nicht nutzt
In ihrem neuen Buch Die KI war’s! beschreibt die Sozioinformatikerin und Wissenschaftskommunikatorin Katharina Anna Zweig die Möglichkeiten und Tücken generativer künstlicher Intelligenz (KI). Anhand zahlreicher Beispiele wird auch Fachfremden verständlich, unter welchen Bedingungen maschinelle Entscheidungen fehlerhaft sind und wie man sich dagegen wehren kann.
- 31 October 2023
- Published by Freiwillige Selbstkontrolle Fernsehen e.V. in mediendiskurs: Rache. Vergeltung in den Medien
- Vol. 27 (4/2023 (10)
Ersetzt wird der, der KI nicht nutzt
In ihrem neuen Buch Die KI war’s! beschreibt die Sozioinformatikerin und Wissenschaftskommunikatorin Katharina Anna Zweig die Möglichkeiten und Tücken generativer künstlicher Intelligenz (KI). Anhand zahlreicher Beispiele wird auch Fachfremden verständlich, unter welchen Bedingungen maschinelle Entscheidungen fehlerhaft sind und wie man sich dagegen wehren kann.
- Open Access
- 9 April 2022
- Published by Springer Nature in Philosophy & Technology
- Vol. 35 (2) , 1-31
Promises and Pitfalls of Algorithm Use by State Authorities
Algorithmic systems are increasingly used by state agencies to inform decisions about humans. They produce scores on risks of recidivism in criminal justice, indicate the probability for a job seeker to find a job in the labor market, or calculate whether an applicant should get access to a certain university program. In this contribution, we take an interdisciplinary perspective, provide a bird’s eye view of the different key decisions that are to be taken when state actors decide to use an algorithmic system, and illustrate these decisions with empirical examples from case studies. Building on these insights, we discuss the main pitfalls and promises of the use of algorithmic system by the state and focus on four levels: The most basic question whether an algorithmic system should be used at all, the regulation and governance of the system, issues of algorithm design, and, finally, questions related to the implementation of the system on the ground and the human–machine-interaction that comes with it. Based on our assessment of the advantages and challenges that arise at each of these levels, we propose a set of crucial questions to be asked when such intricate matters are addressed.
- 9 April 2022
- Published by Springer Nature in Philosophy & Technology
- Vol. 35 (2) , 1-31
Open AccessPromises and Pitfalls of Algorithm Use by State Authorities
Algorithmic systems are increasingly used by state agencies to inform decisions about humans. They produce scores on risks of recidivism in criminal justice, indicate the probability for a job seeker to find a job in the labor market, or calculate whether an applicant should get access to a certain university program. In this contribution, we take an interdisciplinary perspective, provide a bird’s eye view of the different key decisions that are to be taken when state actors decide to use an algorithmic system, and illustrate these decisions with empirical examples from case studies. Building on these insights, we discuss the main pitfalls and promises of the use of algorithmic system by the state and focus on four levels: The most basic question whether an algorithmic system should be used at all, the regulation and governance of the system, issues of algorithm design, and, finally, questions related to the implementation of the system on the ground and the human–machine-interaction that comes with it. Based on our assessment of the advantages and challenges that arise at each of these levels, we propose a set of crucial questions to be asked when such intricate matters are addressed.
- 23 February 2022
- Published by Elsevier in Computer Law & Security Review
- Vol. 44
Fairness by awareness? On the inclusion of protected features in algorithmic decisions
- 23 February 2022
- Published by Elsevier in Computer Law & Security Review
- Vol. 44
Fairness by awareness? On the inclusion of protected features in algorithmic decisions
- Open Access
- 1 January 2022
- Published by Springer Nature
- p. 39-56
Increasing the Sampling Efficiency for the Link Assessment Problem
Complex graphs are at the heart of today’s big data challenges like recommendation systems, customer behavior modeling, or incident detection systems. One reoccurring task in these fields is the extraction of network motifs, which are subgraphs that are reoccurring and statistically significant. To assess the statistical significance of their occurrence, the observed values in the real network need to be compared to their expected value in a random graph model.In this chapter, we focus on the so-called Link Assessment (LA) problem, in particular for bipartite networks. Lacking closed-form solutions, we require stochastic Monte Carlo approaches that raise the challenge of finding appropriate metrics for quantifying the quality of results (QoR) together with suitable heuristics that stop the computation process if no further increase in quality is expected. We provide investigation results for three quality metrics and show that observing the right metrics reveals so-called phase transitions that can be used as a reliable basis for such heuristics. Finally, we propose a heuristic that has been evaluated with real-word datasets, providing a speedup of $$15.4\times $$ over previous approaches.- 1 January 2022
- Published by Springer Nature
- p. 39-56
Open AccessIncreasing the Sampling Efficiency for the Link Assessment Problem
Complex graphs are at the heart of today’s big data challenges like recommendation systems, customer behavior modeling, or incident detection systems. One reoccurring task in these fields is the extraction of network motifs, which are subgraphs that are reoccurring and statistically significant. To assess the statistical significance of their occurrence, the observed values in the real network need to be compared to their expected value in a random graph model.In this chapter, we focus on the so-called Link Assessment (LA) problem, in particular for bipartite networks. Lacking closed-form solutions, we require stochastic Monte Carlo approaches that raise the challenge of finding appropriate metrics for quantifying the quality of results (QoR) together with suitable heuristics that stop the computation process if no further increase in quality is expected. We provide investigation results for three quality metrics and show that observing the right metrics reveals so-called phase transitions that can be used as a reliable basis for such heuristics. Finally, we propose a heuristic that has been evaluated with real-word datasets, providing a speedup of $$15.4\times $$ over previous approaches.