Copertina

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

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Lewis, Seth C., Markowitz, David M., Bunquin, Jon Benedik
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Computational Complexity Artificial Intelligence Computation and Language
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Before and After ChatGPT: Revisiting AI-Based Dialogue Systems for Emotional Support
di: Lee, Daeun, et al.
Pubblicazione: (2026)

Generative AI Adoption in Postsecondary Education, AI Hype, and ChatGPT's Launch
di: Pedersen, Isabel
Pubblicazione: (2025)

Examining Linguistic Shifts in Academic Writing Before and After the Launch of ChatGPT: A Study on Preprint Papers
di: Bao, Tong, et al.
Pubblicazione: (2025)

Ask ChatGPT: Caveats and Mitigations for Individual Users of AI Chatbots
di: Wang, Chengen, et al.
Pubblicazione: (2025)

How would Stance Detection Techniques Evolve after the Launch of ChatGPT?
di: Zhang, Bowen, et al.
Pubblicazione: (2022)

Comparative Analysis of ChatGPT, GPT-4, and Microsoft Bing Chatbots for GRE Test
di: Abu-Haifa, Mohammad, et al.
Pubblicazione: (2023)

Physical complexity and black hole quantum computers
di: Reilly, Michele, et al.
Pubblicazione: (2025)

Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields
di: Dwivedi, Ashish, et al.
Pubblicazione: (2024)

ChatEd: A Chatbot Leveraging ChatGPT for an Enhanced Learning Experience in Higher Education
di: Wang, Kevin, et al.
Pubblicazione: (2023)

The Social Impact of Generative AI: An Analysis on ChatGPT
di: Baldassarre, Maria T., et al.
Pubblicazione: (2024)

A Brief Introduction to Quantum Query Complexity
di: Hamoudi, Yassine
Pubblicazione: (2025)

The rotation-invariant Hamiltonian problem is QMA$_{\rm EXP}$-complete
di: Nelson, Jon, et al.
Pubblicazione: (2025)

Beyond Bits: An Introduction to Computation over the Reals
di: Miltzow, Tillmann
Pubblicazione: (2026)

Inference Scaling vs Reasoning: An Empirical Analysis of Compute-Optimal LLM Problem-Solving
di: AbdElhameed, Marwan, et al.
Pubblicazione: (2024)

Benchmarking of Quantum and Classical Computing in Large-Scale Dynamic Portfolio Optimization Under Market Frictions
di: Chen, Ying, et al.
Pubblicazione: (2025)

Hardness of the Binary Covering Radius Problem in Large $\ell_p$ Norms
di: Bennett, Huck, et al.
Pubblicazione: (2026)

Boolean PCSPs through the lens of Fourier Analysis
di: Banakh, Demian, et al.
Pubblicazione: (2026)

The Counting General Dominating Set Framework
di: Zheng, Jiayi, et al.
Pubblicazione: (2026)

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

A Smoothed Analysis of the Space Complexity of Computing a Chaotic Sequence
di: Okada, Naoaki, et al.
Pubblicazione: (2024)

New Pseudorandom Generators and Correlation Bounds Using Extractors
di: Kumar, Vinayak M.
Pubblicazione: (2025)

A Pseudorandom Generator for Functions of Low-Degree Polynomial Threshold Functions
di: Yao, Penghui, et al.
Pubblicazione: (2025)

One-way Communication Complexity of Minimum Vertex Cover in General Graphs
di: Derakhshan, Mahsa, et al.
Pubblicazione: (2025)

Optimal Inapproximability of Generalized Linear Equations over a Finite Group
di: Bhangale, Amey, et al.
Pubblicazione: (2026)

Exponential Separation Between Powers of Regular and General Resolution Over Parities
di: Bhattacharya, Sreejata Kishor, et al.
Pubblicazione: (2024)

The computational power of discrete chemical reaction networks with bounded executions
di: Doty, David, et al.
Pubblicazione: (2024)

Reverse-Robust Computation with Chemical Reaction Networks
di: Kini, Ravi, et al.
Pubblicazione: (2026)

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

Is ChatGPT Involved in Texts? Measure the Polish Ratio to Detect ChatGPT-Generated Text
di: Yang, Lingyi, et al.
Pubblicazione: (2023)

Large Language Models on Small Resource-Constrained Systems: Performance Characterization, Analysis and Trade-offs
di: Seymour, Liam, et al.
Pubblicazione: (2024)

ChatGPT vs Teachers vs Students: Large-Scale Analysis of Generative AI Discourse in Education Communities on Reddit
di: Yüce, Pelin, et al.
Pubblicazione: (2026)

Direct Product Theorems for Randomized Query Complexity
di: Ben-David, Shalev, et al.
Pubblicazione: (2025)

Dual-Tape Perspective and Generator Independence: The Algebraic Foundation of Real Boolean Turing Machines
di: Zheng, Jingwen, et al.
Pubblicazione: (2026)

Improved Condensers for Chor-Goldreich Sources
di: Goodman, Jesse, et al.
Pubblicazione: (2024)

An Oracle with no $\mathrm{UP}$-Complete Sets, but $\mathrm{NP}=\mathrm{PSPACE}$
di: Dingel, David, et al.
Pubblicazione: (2024)

Complexity of adaptive testing in scenarios defined extensionally
di: Rodriguez, Ismael, et al.
Pubblicazione: (2026)

Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant Gates
di: Nelson, Jon, et al.
Pubblicazione: (2024)

Fairness of ChatGPT
di: Li, Yunqi, et al.
Pubblicazione: (2023)

Complexity analysis and practical resolution of the data classification problem with private characteristics
di: Pantoja, David, et al.
Pubblicazione: (2026)

Hamiltonians whose low-energy states require $Ω(n)$ T gates
di: Coble, Nolan J., et al.
Pubblicazione: (2023)