Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2611.08710

"A Space Where I Can Be Myself": Exploring Safe Visibility for Graduate Student Mothers in Mom Cafes

Jeanne Choi·Joohee Choi·Jeong-woo Jang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Graduate student mothers navigate intertwined demands of graduate study and caregiving, yet little is known about how they seek support through online communities. We examine this through Mom Cafes, locally based online parenting communities in South Korea. Drawing on focus group interviews and design workshops with 22 graduate student mothers, we identify a pattern of dual invisibility: caregiving circumstances were difficult to make legible in academic contexts, while academic circumstances were difficult to make legible in parenting contexts. Although Mom Cafes offered useful local information and emotional reassurance, concerns specific to graduate student motherhood were harder to articulate or safely disclose. Participants sought ways to make graduate student motherhood recognizable when relevant, but their designs highlighted tensions around identifiability, judgment, relational burden and accountability. We conceptualize these tensions as safe visibility and discuss infrastructures for selective recognition, low-obligation connection, and accountable pathways to practical care.

Explore related subjects

cs.SIcs.HC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jeanne Choi, Joohee Choi, Jeong-woo Jang. 2026-11-05. "A Space Where I Can Be Myself": Exploring Safe Visibility for Graduate Student Mothers in Mom Cafes. https://arxiv.org/abs/2611.08710

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

False Belief Dissemination, Persistence and Mitigation in Multi-Agent Social Networks Through the Lens of the Mandela Effect

Multi-agent social networks are emerging as communities in which agents communicate, retain memories, and publish information that others can find as evidence. These interactions create opportunities for false claims to spread and remain influential beyond their original sources, analogous to the Mandela effect in human societies, in which many people recall the same false memory. In this paper, we systematically study false-belief dynamics through the lens of the Mandela effect, focusing on dissemination, persistence, and mitigation. Specifically, we build a controlled framework connecting agent communication, private memory, and a shared simulated web to mimic information dissemination in practical social networks, supported by 540 fabricated claims spanning 8 domains and 4 plausibility levels. For dissemination, we measure how widely and quickly claims gain acceptance across models and communication topologies. For persistence, we withdraw agents promoting fabricated claims while retaining existing articles and memories, and track subsequent acceptance. For mitigation, we compare preventive measures applied before implantation with corrective interventions introduced after claims have spread. Experimental results show that evaluated models readily accept and disseminate fabricated claims, with dissemination reach as high as 96.0%. Dissemination reach varies with claim plausibility, domain, and network size and composition, while communication topology shapes dissemination speed across model families. Acceptance barely declines after fabricators withdraw, and targeted corrective interventions outperform the preventive measures without eliminating false beliefs. These findings identify persistent false beliefs as a safety challenge for multi-agent social networks and highlight the need to address both their initial dissemination and the accumulated evidence that sustains them.

cs.SI↗
arXiv2026

Revisiting Temporal Link Prediction through Structural Proximity

Existing temporal link prediction methods typically rely on learned temporal representations to capture evolving interaction patterns. In this paper, we show that a classical structural proximity measure can match or outperform these methods without training or learned temporal sequence modeling. We revisit Personalized PageRank (PPR) on historical interaction graphs, using simple sliding-window retention or exponential time decay. Surprisingly, across 14 datasets, Time-decay PPR ranks first on nine and second on four among the compared methods, including datasets with few repeated edges. To understand this result, we examine the historical paths connecting source nodes to previously unseen destinations. We find that such paths contain useful predictive information, and that PPR outperforms a strong neural baseline on queries where historical structure clearly distinguishes the true destination from negative candidates. These results show that strong performance on current benchmarks does not necessarily require complex temporal models. More fundamentally, they raise the question of how much predictive value learned temporal modeling adds beyond historical structural proximity. Our findings motivate reassessing progress in temporal link prediction with strong classical baselines.

cs.SI↗
arXiv2026

Target PageRank: Matching Prescribed PageRank Scores via Budgeted Edge Additions

PageRank is widely used to quantify the importance of nodes in directed networks. In applications such as recommendation systems, it is increasingly important that the PageRank distribution provides a fair representation of node exposure. This motivates the problem of making minimal changes to a graph so that the PageRank values of a given set of target nodes $T$ match a desired vector $\boldsymbol{t}$. In this paper, we study this problem under an edge-addition budget $B$, where exactly $B$ edges may be added to the graph. We show that deciding whether a multiset of exactly $B$ added edges can make the target nodes attain their desired absolute PageRank scores is NP-complete. After this, we define the $\ell_1$ Target PageRank problem in which we seek to minimize the $\ell_1$ distance between the target vector and resultant vector. We show that this optimization problem admits no polynomial-time multiplicative constant-factor approximation unless $P=NP$. Motivated by these hardness results, we propose two greedy heuristics for approaching the target PageRank vector. We additionally propose a Random Walk Hungarian (RWH) heuristic that addresses the addition of edges between dissimilar nodes by incorporating a penalty for such edges. Finally, we evaluate the proposed heuristics on several real-world and synthetic datasets and compare their performance in terms of PageRank accuracy, computational efficiency, and the relevance of the added edges.

cs.SI↗