Image de couverture de livre

Journalists, Emotions, and the Introduction of Generative AI Chatbots: A Large-Scale Analysis of Tweets Before and After the Launch of ChatGPT

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lewis, Seth C., Markowitz, David M., Bunquin, Jon Benedik
Format:	Preprint
Publié:	2024
Sujets:	Computational Complexity Artificial Intelligence Computation and Language
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Before and After ChatGPT: Revisiting AI-Based Dialogue Systems for Emotional Support
par: Lee, Daeun, et autres
Publié: (2026)

Generative AI Adoption in Postsecondary Education, AI Hype, and ChatGPT's Launch
par: Pedersen, Isabel
Publié: (2025)

Examining Linguistic Shifts in Academic Writing Before and After the Launch of ChatGPT: A Study on Preprint Papers
par: Bao, Tong, et autres
Publié: (2025)

Ask ChatGPT: Caveats and Mitigations for Individual Users of AI Chatbots
par: Wang, Chengen, et autres
Publié: (2025)

How would Stance Detection Techniques Evolve after the Launch of ChatGPT?
par: Zhang, Bowen, et autres
Publié: (2022)

Comparative Analysis of ChatGPT, GPT-4, and Microsoft Bing Chatbots for GRE Test
par: Abu-Haifa, Mohammad, et autres
Publié: (2023)

Physical complexity and black hole quantum computers
par: Reilly, Michele, et autres
Publié: (2025)

Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields
par: Dwivedi, Ashish, et autres
Publié: (2024)

ChatEd: A Chatbot Leveraging ChatGPT for an Enhanced Learning Experience in Higher Education
par: Wang, Kevin, et autres
Publié: (2023)

The Social Impact of Generative AI: An Analysis on ChatGPT
par: Baldassarre, Maria T., et autres
Publié: (2024)

A Brief Introduction to Quantum Query Complexity
par: Hamoudi, Yassine
Publié: (2025)

The rotation-invariant Hamiltonian problem is QMA$_{\rm EXP}$-complete
par: Nelson, Jon, et autres
Publié: (2025)

Beyond Bits: An Introduction to Computation over the Reals
par: Miltzow, Tillmann
Publié: (2026)

Inference Scaling vs Reasoning: An Empirical Analysis of Compute-Optimal LLM Problem-Solving
par: AbdElhameed, Marwan, et autres
Publié: (2024)

Benchmarking of Quantum and Classical Computing in Large-Scale Dynamic Portfolio Optimization Under Market Frictions
par: Chen, Ying, et autres
Publié: (2025)

Hardness of the Binary Covering Radius Problem in Large $\ell_p$ Norms
par: Bennett, Huck, et autres
Publié: (2026)

Boolean PCSPs through the lens of Fourier Analysis
par: Banakh, Demian, et autres
Publié: (2026)

The Counting General Dominating Set Framework
par: Zheng, Jiayi, et autres
Publié: (2026)

Structural Origin and the Minimal Syntax of NP-Hardness: Analysis of SAT from Syntactic Generativity and Compositional Collapse
par: Nishiyama, Yumiko
Publié: (2025)

A Smoothed Analysis of the Space Complexity of Computing a Chaotic Sequence
par: Okada, Naoaki, et autres
Publié: (2024)

New Pseudorandom Generators and Correlation Bounds Using Extractors
par: Kumar, Vinayak M.
Publié: (2025)

A Pseudorandom Generator for Functions of Low-Degree Polynomial Threshold Functions
par: Yao, Penghui, et autres
Publié: (2025)

One-way Communication Complexity of Minimum Vertex Cover in General Graphs
par: Derakhshan, Mahsa, et autres
Publié: (2025)

Optimal Inapproximability of Generalized Linear Equations over a Finite Group
par: Bhangale, Amey, et autres
Publié: (2026)

Exponential Separation Between Powers of Regular and General Resolution Over Parities
par: Bhattacharya, Sreejata Kishor, et autres
Publié: (2024)

The computational power of discrete chemical reaction networks with bounded executions
par: Doty, David, et autres
Publié: (2024)

Reverse-Robust Computation with Chemical Reaction Networks
par: Kini, Ravi, et autres
Publié: (2026)

Computational Complexity of UAP Reverse Engineering: A Formal Analysis of Automaton Identification and Data Complexity
par: Daghbouche, Karim
Publié: (2025)

Is ChatGPT Involved in Texts? Measure the Polish Ratio to Detect ChatGPT-Generated Text
par: Yang, Lingyi, et autres
Publié: (2023)

Large Language Models on Small Resource-Constrained Systems: Performance Characterization, Analysis and Trade-offs
par: Seymour, Liam, et autres
Publié: (2024)

Direct Product Theorems for Randomized Query Complexity
par: Ben-David, Shalev, et autres
Publié: (2025)

ChatGPT vs Teachers vs Students: Large-Scale Analysis of Generative AI Discourse in Education Communities on Reddit
par: Yüce, Pelin, et autres
Publié: (2026)

Dual-Tape Perspective and Generator Independence: The Algebraic Foundation of Real Boolean Turing Machines
par: Zheng, Jingwen, et autres
Publié: (2026)

Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant Gates
par: Nelson, Jon, et autres
Publié: (2024)

Improved Condensers for Chor-Goldreich Sources
par: Goodman, Jesse, et autres
Publié: (2024)

An Oracle with no $\mathrm{UP}$-Complete Sets, but $\mathrm{NP}=\mathrm{PSPACE}$
par: Dingel, David, et autres
Publié: (2024)

Complexity of adaptive testing in scenarios defined extensionally
par: Rodriguez, Ismael, et autres
Publié: (2026)

Fairness of ChatGPT
par: Li, Yunqi, et autres
Publié: (2023)

Complexity analysis and practical resolution of the data classification problem with private characteristics
par: Pantoja, David, et autres
Publié: (2026)

Hamiltonians whose low-energy states require $Ω(n)$ T gates
par: Coble, Nolan J., et autres
Publié: (2023)