Tootfinder

Series A, Episode 10 - Breakdown
BLAKE: Jenna, you take my place. Brief Cally.
[Computer room, Gan tries to pull piping from wall]
AVON: Gan, no! You'll break the computer links, we'll never get them started. [Avon tries to stop Gan, who thows him off]
https://blake.torpidity.net/m/110/295

cora: CORA citations (1998)
Citations among papers indexed by CORA, from 1998, an early computer science research paper search engine. If a paper i cites a paper j also in this data set, then a directed edge connects i to j. (Papers not in the data set are excluded.) Self-loops may be present. The dates of these snapshots are uncertain.
This network has 23166 nodes and 91500 edges.
Tags: Informational, Citation, Unweighted

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Abductive forgetting
Paolo Liberatore
https://

Political Leaning and Politicalness Classification of Texts
Matous Volf (DELTA High school of computer science and economics, Pardubice, Czechia), Jakub Simko (Kempelen Institute of Intelligent Technologies, Bratislava, Slovakia)
https://arxiv.org/abs/2507.13913

Political Leaning and Politicalness Classification of Texts
This paper addresses the challenge of automatically classifying text according to political leaning and politicalness using transformer models. We compose a comprehensive overview of existing datasets and models for these tasks, finding that current approaches create siloed solutions that perform poorly on out-of-distribution texts. To address this limitation, we compile a diverse dataset by combining 12 datasets for political leaning classification and creating a new dataset for politicalness …

Why AI can't possibly make you more productive; long
#AI and "productivity", some thoughts:
Edit: fixed some typos.
Productivity is a concept that isn't entirely meaningless outside the context of capitalism, but it's a concept that is heavily inflected in a capitalist context. In many uses today it effectively means "how much you can satisfy and/or exceed your boss' expectations." This is not really what it should mean: even in an anarchist utopia, people would care about things like how many shirts they can produce in a week, although in an "I'd like to voluntarily help more people" way rather than an "I need to meet this quota to earn my survival" way. But let's roll with this definition for a second, because it's almost certainly what your boss means when they say "productivity", and understanding that word in a different (even if truer) sense is therefore inherently dangerous.
Accepting "productivity" to mean "satisfying your boss' expectations," I will now claim: the use of generative AI cannot increase your productivity.
Before I dive in, it's imperative to note that the big generative models which most people think of as constituting "AI" today are evil. They are 1: pouring fuel on our burning planet, 2: psychologically strip-mining a class of data laborers who are exploited for their precarity, 3: enclosing, exploiting, and polluting the digital commons, and 4: stealing labor from broad classes of people many of whom are otherwise glad to give that labor away for free provided they get a simple acknowledgement in return. Any of these four "ethical issues" should be enough *alone* to cause everyone to simply not use the technology. These ethical issues are the reason that I do not use generative AI right now, except for in extremely extenuating circumstances. These issues are also convincing for a wide range of people I talk to, from experts to those with no computer science background. So before I launch into a critique of the effectiveness of generative AI, I want to emphasize that such a critique should be entirely unnecessary.
But back to my thesis: generative AI cannot increase your productivity, where "productivity" has been defined as "how much you can satisfy and/or exceed your boss' expectations."
Why? In fact, what the fuck? Every AI booster I've met has claimed the opposite. They've given me personal examples of time saved by using generative AI. Some of them even truly believe this. Sometimes I even believe they saved time without horribly compromising on quality (and often, your boss doesn't care about quality anyways if the lack of quality is hard to measure of doesn't seem likely to impact short-term sales/feedback/revenue). So if generative AI genuinely lets you write more emails in a shorter period of time, or close more tickets, or something else along these lines, how can I say it isn't increasing your ability to meet your boss' expectations?
The problem is simple: your boss' expectations are not a fixed target. Never have been. In virtue of being someone who oversees and pays wages to others under capitalism, your boss' game has always been: pay you less than the worth of your labor, so that they can accumulate profit and thus more capital to remain in charge instead of being forced into working for a wage themselves. Sure, there are layers of management caught in between who aren't fully in this mode, but they are irrelevant to this analysis. It matters not how much you please your manager if your CEO thinks your work is not worth the wages you are being paid. And using AI actively lowers the value of your work relative to your wages.
Why do I say that? It's actually true in several ways. The most obvious: using generative AI lowers the quality of your work, because the work it produces is shot through with errors, and when your job is reduced to proofreading slop, you are bound to tire a bit, relax your diligence, and let some mistakes through. More than you would have if you are actually doing and taking pride in the work. Examples are innumerable and frequent, from journalists to lawyers to programmers, and we laugh at them "haha how stupid to not check whether the books the AI reviewed for you actually existed!" but on a deeper level if we're honest we know we'd eventually make the same mistake ourselves (bonus game: spot the swipe-typing typos I missed in this post; I'm sure there will be some).
But using generative AI also lowers the value of your work in another much more frightening way: in this era of hype, it demonstrates to your boss that you could be replaced by AI. The more you use it, and no matter how much you can see that your human skills are really necessary to correct its mistakes, the more it appears to your boss that they should hire the AI instead of you. Or perhaps retain 10% of the people in roles like yours to manage the AI doing the other 90% of the work. Paradoxically, the *more* you get done in terms of raw output using generative AI, the more it looks to your boss as if there's an opportunity to get enough work done with even fewer expensive humans. Of course, the decision to fire you and lean more heavily into AI isn't really a good one for long-term profits and success, but the modern boss did not get where they are by considering long-term profits. By using AI, you are merely demonstrating your redundancy, and the more you get done with it, the more redundant you seem.
In fact, there's even a third dimension to this: by using generative AI, you're also providing its purveyors with invaluable training data that allows them to make it better at replacing you. It's generally quite shitty right now, but the more use it gets by competent & clever people, the better it can become at the tasks those specific people use it for. Using the currently-popular algorithm family, there are limits to this; I'm not saying it will eventually transcend the mediocrity it's entwined with. But it can absolutely go from underwhelmingly mediocre to almost-reasonably mediocre with the right training data, and data from prompting sessions is both rarer and more useful than the base datasets it's built on.
For all of these reasons, using generative AI in your job is a mistake that will likely lead to your future unemployment. To reiterate, you should already not be using it because it is evil and causes specific and inexcusable harms, but in case like so many you just don't care about those harms, I've just explained to you why for entirely selfish reasons you should not use it.
If you're in a position where your boss is forcing you to use it, my condolences. I suggest leaning into its failures instead of trying to get the most out of it, and as much as possible, showing your boss very clearly how it wastes your time and makes things slower. Also, point out the dangers of legal liability for its mistakes, and make sure your boss is aware of the degree to which any of your AI-eager coworkers are producing low-quality work that harms organizational goals.
Also, if you've read this far and aren't yet of an anarchist mindset, I encourage you to think about the implications of firing 75% of (at least the white-collar) workforce in order to make more profit while fueling the climate crisis and in most cases also propping up dictatorial figureheads in government. When *either* the AI bubble bursts *or* if the techbros get to live out the beginnings of their worker-replacement fantasies, there are going to be an unimaginable number of economically desperate people living in increasingly expensive times. I'm the kind of optimist who thinks that the resulting social crucible, though perhaps through terrible violence, will lead to deep social changes that effectively unseat from power the ultra-rich that continue to drag us all down this destructive path, and I think its worth some thinking now about what you might want the succeeding stable social configuration to look like so you can advocate towards that during points of malleability.
As others have said more eloquently, generative AI *should* be a technology that makes human lives on average easier, and it would be were it developed & controlled by humanists. The only reason that it's not, is that it's developed and controlled by terrible greedy people who use their unfairly hoarded wealth to immiserate the rest of us in order to maintain their dominance. In the long run, for our very survival, we need to depose them, and I look forward to what the term "generative AI" will mean after that finally happens.

Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules
Sushmita Gupta, Pallavi Jain, Souvik Saha, Saket Saurabh, Anannya Upasana

I am super-pleased to be serving on the PC of the excellent and much-needed "Undone Science in CS" 2026: "to provide an opportunity to pause and reflect on the epistemological and ethical aspects of computer science". For much more information, please see:
https://www.undonecs.org/2026/…

cora: CORA citations (1998)
Citations among papers indexed by CORA, from 1998, an early computer science research paper search engine. If a paper i cites a paper j also in this data set, then a directed edge connects i to j. (Papers not in the data set are excluded.) Self-loops may be present. The dates of these snapshots are uncertain.
This network has 23166 nodes and 91500 edges.
Tags: Informational, Citation, Unweighted

LibLMFuzz: LLM-Augmented Fuzz Target Generation for Black-box Libraries
Ian Hardgrove, John D. Hastings
https://arxiv.org/abs/2507.15058 https://

LibLMFuzz: LLM-Augmented Fuzz Target Generation for Black-box Libraries
A fundamental problem in cybersecurity and computer science is determining whether a program is free of bugs and vulnerabilities. Fuzzing, a popular approach to discovering vulnerabilities in programs, has several advantages over alternative strategies, although it has investment costs in the form of initial setup and continuous maintenance. The choice of fuzzing is further complicated when only a binary library is available, such as the case of closed-source and proprietary software. In respon…

Initiating and Replicating the Observations of Interactional Properties by User Studies Optimizing Applicative Prototypes
Guillaume Rivi\`ere
https://arxiv.org/abs/2507.13923

Initiating and Replicating the Observations of Interactional Properties by User Studies Optimizing Applicative Prototypes
The science of Human-Computer Interaction (HCI) is populated by isolated empirical findings, often tied to specific technologies, designs, and tasks. This paper proposes a formalization of user interaction observations (instead of user interfaces) and an associated revealing method (interaction loop diffraction). The resulting interactional properties that are studied in a calibrated manner, are well suited to replication across various conditions (prototypes, technologies, tasks, and user prof…

Tech companies think that, if they make products *look* futuristic, you will think that they are actually innovating. In reality what we get is not "Star Trek communicators inspired cell phones" but "every experience with your computer is going to be like begging HAL to open the pod bay doors" except less evil and more frustrating.

Imitating the future, breaking the present
Tech companies are only pretending to innovate, through copying futuristic aesthetics from science fiction without understanding their purpose.

Interesting article on how #GenAI can be used effectively in a classroom setting, what methods the instructor uses to make sure students learn how and when (not) to use it, and how they ensure the students still learn what they need to learn.

Quantum Pattern Matching with Wildcards
Masoud Seddighin, Saeed Seddighin
https://arxiv.org/abs/2507.13885 https://arxiv.org/pdf/2507…

Quantum Pattern Matching with Wildcards
Pattern matching is one of the fundamental problems in Computer Science. Both the classic version of the problem as well as the more sophisticated version where wildcards can also appear in the input can be solved in almost linear time $\tilde O(n)$ using the KMP algorithm and Fast Fourier Transform, respectively. In 2000, Ramesh and Vinay~\cite{ramesh2003string} give a quantum algorithm that solves classic pattern matching in sublinear time and asked whether the wildcard problem can also be so…

Proceedings of the 15th International Workshop on Non-Classical Models of Automata and Applications
Nelma Moreira (Universidade do Porto), Luca Prigioniero (Loughborough University)
https://arxiv.org/abs/2507.14082

Proceedings of the 15th International Workshop on Non-Classical Models of Automata and Applications
The Fifteenth International Workshop on Non-Classical Models of Automata and Applications (NCMA 2025) was held in Loughborough, UK, on July 21 and 22, 2025, organized by the Department of Computer Science at Loughborough University and co-located with the 26th International Conference on Descriptional Complexity of Formal Systems (DCFS 2025, 22-24 July). The NCMA workshop series was established in 2009 as an annual event for researchers working on non-classical and classical models of automat…

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Asynchronous Composition of LTL Properties over Infinite and Finite Traces
Alberto Bombardelli, Stefano Tonetta

Introducing Quantum Computing to High-School Curricula: A Global Perspective
Mar\'ia Gragera Garc\'es, Luis G\'omez Orzechowski, Juan Francisco Rodr\'iguez Hern\'andez
https://arxiv.org/abs/2505.14809

Introducing Quantum Computing to High-School Curricula: A Global Perspective
Quantum computing is an emerging field with growing implications across science and industry, making early educational exposure increasingly important. This paper examines how quantum computing concepts can be introduced into high-school STEM curricula within existing structures to enhance foundational learning in mathematics, computer science, and physics. We outline a modular integration strategy introducing key quantum ideas into standard courses, leveraging open-source educational resources…

[2025-05-21 Wed (UTC), no new articles found for cs.OH Other Computer Science]
#toXiv_bot_toot

cs_department: Aarhus Computer Science department relationships
Multiplex network consisting of 5 edge types corresponding to online and offline relationships (Facebook, leisure, work, co-authorship, lunch) between employees of the Computer Science department at Aarhus. Data hosted by Manlio De Domenico.
This network has 61 nodes and 620 edges.
Tags: Social, Relationships, Multilayer, Unweighted

A Review of Generative AI in Computer Science Education: Challenges and Opportunities in Accuracy, Authenticity, and Assessment
Iman Reihanian, Yunfei Hou, Yu Chen, Yifei Zheng
https://arxiv.org/abs/2507.11543

A Review of Generative AI in Computer Science Education: Challenges and Opportunities in Accuracy, Authenticity, and Assessment
This paper surveys the use of Generative AI tools, such as ChatGPT and Claude, in computer science education, focusing on key aspects of accuracy, authenticity, and assessment. Through a literature review, we highlight both the challenges and opportunities these AI tools present. While Generative AI improves efficiency and supports creative student work, it raises concerns such as AI hallucinations, error propagation, bias, and blurred lines between AI-assisted and student-authored content. Hum…

Computer science programs at Carnegie Mellon and other US universities are rethinking how to incorporate AI into curricula, including a focus on AI literacy (Steve Lohr/New York Times)
https://www.nytimes.com/2025/06/30/technology/computer-science-…

How Do You Teach Computer Science in the A.I. Era?
Universities across the country are scrambling to understand the implications of generative A.I.’s transformation of technology.

Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- Learning in Strategic Queuing Systems with Small Buffers
Ariana Abel, Yoav Kolumbus, Jeronimo Martin Duque, Cristian Palma Foster, Eva Tardos

[2025-07-22 Tue (UTC), 9 new articles found for cs.LO Logic in Computer Science]
toXiv_bot_toot

What Doesn’t Change
https://terriblesoftware.org/2025/07/14/what-doesnt-change/

Prediction: a year from now, US computer science departments will find their enrollment at 50% of what they have been the past few years. I'm willing to bet a peppercorn on it for someone who really wants to hold me to it. (-:

[2025-07-21 Mon (UTC), no new articles found for cs.OH Other Computer Science]
toXiv_bot_toot

[2025-07-21 Mon (UTC), 4 new articles found for cs.LO Logic in Computer Science]
toXiv_bot_toot

[2025-07-21 Mon (UTC), 2 new articles found for cs.GT Computer Science and Game Theory]
toXiv_bot_toot

Construction workers are putting in the landscaping for the new Computer Science building across the street from my office
#photo #photography #building

Simple ways of preparing qudit Dicke states
Noah B. Kerzner, Federico Galeazzi, Rafael I. Nepomechie
https://arxiv.org/abs/2507.13308 https://

Simple ways of preparing qudit Dicke states
Dicke states are permutation-invariant superpositions of qubit computational basis states, which play a prominent role in quantum information science. We consider here two higher-dimensional generalizations of these states: $SU(2)$ spin-$s$ Dicke states and $SU(d)$ Dicke states. We present various ways of preparing both types of qudit Dicke states on a qudit quantum computer, using two main approaches: a deterministic approach, based on exact canonical matrix product state representations; and …

FLIP: Flowability-Informed Powder Weighing
Nikola Radulov (Department of Computer Science University of Liverpool UK), Alex Wright (Department of Computer Science University of Liverpool UK), Thomas little (Department of Computer Science University of Liverpool UK), Andrew I. Cooper (Department of Chemistry university of Liverpool UK), Gabriella Pizzuto (Department of Computer Science University of Liverpool UK, Department of Chemistry university of Liverpool UK)

FLIP: Flowability-Informed Powder Weighing
Autonomous manipulation of powders remains a significant challenge for robotic automation in scientific laboratories. The inherent variability and complex physical interactions of powders in flow, coupled with variability in laboratory conditions necessitates adaptive automation. This work introduces FLIP, a flowability-informed powder weighing framework designed to enhance robotic policy learning for granular material handling. Our key contribution lies in using material flowability, quantifie…

from my link log —
Phil Rogaway on radical computer science.
https://csrc.nist.gov/Presentations/2023/radical-cs
saved 2025-01-14

Computational-Statistical Tradeoffs from NP-hardness
Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
https://arxiv.org/abs/2507.13222 https://

Computational-Statistical Tradeoffs from NP-hardness
A central question in computer science and statistics is whether efficient algorithms can achieve the information-theoretic limits of statistical problems. Many computational-statistical tradeoffs have been shown under average-case assumptions, but since statistical problems are average-case in nature, it has been a challenge to base them on standard worst-case assumptions. In PAC learning where such tradeoffs were first studied, the question is whether computational efficiency can come at th…

REST in Pieces: RESTful Design Rule Violations in Student-Built Web Apps
Sergio Di Meglio, Valeria Pontillo, Luigi Libero Lucio Starace
https://arxiv.org/abs/2507.11689

REST in Pieces: RESTful Design Rule Violations in Student-Built Web Apps
In Computer Science Bachelor's programs, software quality is often underemphasized due to limited time and a focus on foundational skills, leaving many students unprepared for industry expectations. To better understand the typical quality of student code and inform both education and hiring practices, we analyze 40 full-stack web applications developed in a third-year Web Technologies course. Using an automated static analysis pipeline, we assess adherence to REST API design rules. Results rev…

[2025-07-22 Tue (UTC), 6 new articles found for cs.GT Computer Science and Game Theory]
toXiv_bot_toot

Yah, that is going to go over so well. About half my career is now supporting old stuff where the 'experts' claimed that it will replace programmers. Most of what I work on to be charitable is unmaintainable and inefficient code unless we use the developer package from the vendor. It has the potential to be a good tool that generates parts of the boring code, but needs someone who knows what the hell they are doing to make it secure and efficient! It also needs great (or a least …

@… I appreciate that you’re passing on the message. 😄
I read a book called “Why We Sleep” a while back, which went into the science, and I found it fascinating, but still… I’ve always got one more thing I want to do first.
I like your phrasing of “a present” because it makes me think of it as self-care, which is something I’m bad at, but would li…

Design and Reliability of a User Space Write-Ahead Log in Rust
Vitor K. F. Pellegatti, Gustavo M. D. Vieira
https://arxiv.org/abs/2507.13062 https://

Design and Reliability of a User Space Write-Ahead Log in Rust
Write-ahead logs (WALs) are a fundamental fault-tolerance technique found in many areas of computer science. WALs must be reliable while maintaining high performance, because all operations will be written to the WAL to ensure their stability. Without reliability a WAL is useless, because its utility is tied to its ability to recover data after a failure. In this paper we describe our experience creating a prototype user space WAL in Rust. We observed that Rust is easy to use, compact and has a…

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 433 nodes and 1941 edges.
Tags: Informational, Web gra…

A very odd thing about Artificial Intelligence as a discipline in computer science is that it historically shifted from “understanding the human brain better” to “we give up on understanding the brain and will just replace humans despite having no fucking clue”

dblp_cite: DBLP citations (2014)
Citations among papers contained in the DBLP computer science bibliography. If a paper i cites a paper j also in this data set, then a directed edge connects i to j. (Papers not in the data set are excluded.) Self-loops may be present. This snapshot from May 2014.
This network has 12590 nodes and 49759 edges.
Tags: Informational, Citation, Unweighted

Permutation patterns in streams
Benjamin Aram Berendsohn
https://arxiv.org/abs/2507.11291 https://arxiv.org/pdf/2507.11291

Permutation patterns in streams
Permutation patterns and pattern avoidance are central, well-studied concepts in combinatorics and computer science. Given two permutations $τ$ and $π$, the pattern matching problem (PPM) asks whether $τ$ contains $π$. This problem arises in various contexts in computer science and statistics and has been studied extensively in exact-, parameterized-, approximate-, property-testing- and other formulations. In this paper, we study pattern matching in a \emph{streaming setting}, when the in…

[2025-06-20 Fri (UTC), no new articles found for cs.LO Logic in Computer Science]
toXiv_bot_toot

The Teacher's Dilemma: Balancing Trade-Offs in Programming Education for Emergent Bilingual Students
Emma R. Dodoo, Tamara Nelson-Fromm, Mark Guzdial
https://arxiv.org/abs/2506.14147

The Teacher's Dilemma: Balancing Trade-Offs in Programming Education for Emergent Bilingual Students
K-12 computing teachers must navigate complex trade-offs when selecting programming languages and instructional materials for classrooms with emergent bilingual students. While they aim to foster an inclusive learning environment by addressing language barriers that impact student engagement, they must also align with K-12 computer science curricular guidelines and prepare students for industry-standard programming tools. Because programming languages predominantly use English keywords and most…

Computer Science Education in the Age of Generative AI
Russell Beale
https://arxiv.org/abs/2507.02183 https://arxiv.org/pdf/2507.0218…

Computer Science Education in the Age of Generative AI
Generative AI tools - most notably large language models (LLMs) like ChatGPT and Codex - are rapidly revolutionizing computer science education. These tools can generate, debug, and explain code, thereby transforming the landscape of programming instruction. This paper examines the profound opportunities that AI offers for enhancing computer science education in general, from coding assistance to fostering innovative pedagogical practices and streamlining assessments. At the same time, it highl…

[2025-05-20 Tue (UTC), no new articles found for cs.OH Other Computer Science]
#toXiv_bot_toot

@… @… I believe that style of science is usually called “engineering”.

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 348 nodes and 33250 edges.
Tags: Informational, Web gr…

Social Media Reactions to Open Source Promotions: AI-Powered GitHub Projects on Hacker News
Prachnachai Meakpaiboonwattana, Warittha Tarntong, Thai Mekratanavorakul, Chaiyong Ragkhitwetsagul, Pattaraporn Sangaroonsilp, Raula Kula, Morakot Choetkiertikul, Kenichi Matsumoto, Thanwadee Sunetnanta
https://arxiv.org/abs/2506.12643

Social Media Reactions to Open Source Promotions: AI-Powered GitHub Projects on Hacker News
Social media platforms have become more influential than traditional news sources, shaping public discourse and accelerating the spread of information. With the rapid advancement of artificial intelligence (AI), open-source software (OSS) projects can leverage these platforms to gain visibility and attract contributors. In this study, we investigate the relationship between Hacker News, a social news site focused on computer science and entrepreneurship, and the extent to which it influences de…

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- A Logic of Knowledge and Justifications, with an Application to Computational Trust
Francesco A. Genco

[2025-06-20 Fri (UTC), no new articles found for cs.GT Computer Science and Game Theory]
toXiv_bot_toot

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 334 nodes and 32988 edges.
Tags: Informational, Web gr…

[2025-06-20 Fri (UTC), no new articles found for cs.OH Other Computer Science]
toXiv_bot_toot

glass: ordered set data structure for client-side order books
Viktor Krapivensky
https://arxiv.org/abs/2506.13991 https://arxiv.org/p…

glass: ordered set data structure for client-side order books
The "ordered set" abstract data type with operations "insert", "erase", "find", "min", "max", "next" and "prev" is ubiquitous in computer science. It is usually implemented with red-black trees, $B$-trees, or $B^+$-trees. We present our implementation of ordered set based on a trie. It only supports integer keys (as opposed to keys of any strict weakly ordered type) and is optimized for market data, namely for what we call sequential locality. The following is the list of what we believe to be …

Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- Self-Play Q-learners Can Provably Collude in the Iterated Prisoner's Dilemma
Quentin Bertrand, Juan Duque, Emilio Calvano, Gauthier Gidel

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 8361 nodes and 15751 edges.
Tags: Social, Collaboration…

[2025-06-19 Thu (UTC), no new articles found for cs.LO Logic in Computer Science]
toXiv_bot_toot

FAIR-CS: Framework for Interdisciplinary Research Collaborations in Online Computing Programs
Breanna Shi, Thomas Deatherage, Jeanette Schofield, Charles R. Clark, Thomas Orth, Nicholas Lytle
https://arxiv.org/abs/2507.11802

FAIR-CS: Framework for Interdisciplinary Research Collaborations in Online Computing Programs
Research experience is crucial for computing master's students pursuing academic and scientific careers, yet online students have traditionally been excluded from these opportunities due to the physical constraints of traditional research environments. This paper presents the Framework for Accelerating Interdisciplinary Research in Computer Science (FAIR-CS), a method for achieving research goals, developing research communities, and supporting high quality mentorship in an online research envi…

Super Kawaii Vocalics: Amplifying the "Cute" Factor in Computer Voice
Yuto Mandai, Katie Seaborn, Tomoyasu Nakano, Xin Sun, Yijia Wang, Jun Kato
https://arxiv.org/abs/2507.06235

Super Kawaii Vocalics: Amplifying the "Cute" Factor in Computer Voice
"Kawaii" is the Japanese concept of cute, which carries sociocultural connotations related to social identities and emotional responses. Yet, virtually all work to date has focused on the visual side of kawaii, including in studies of computer agents and social robots. In pursuit of formalizing the new science of kawaii vocalics, we explored what elements of voice relate to kawaii and how they might be manipulated, manually and automatically. We conducted a four-phase study (grand N = 512) with…

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Boolformer: Symbolic Regression of Logic Functions with Transformers
d'Ascoli, Renard, Papadopoulos, Bengio, Susskind, Abb\'e

DNA Probe Computing System for Solving NP-Complete Problems
Jin Xu, XiaoLong Shi, Xin Chen, Fang Wang, Sirui Li, Pali Ye, Boliang Zhang, Di Deng, Zheng Kou, Xiaoli Qiang
https://arxiv.org/abs/2507.12470

DNA Probe Computing System for Solving NP-Complete Problems
Efficiently solving NP-complete problems-such as protein structure prediction, cryptographic decryption, and vulnerability detection-remains a central challenge in computer science. Traditional electronic computers, constrained by the Turing machine's one-dimensional data processing and sequential operations, struggle to address these issues effectively. To overcome this bottleneck, computational models must adopt multidimensional data structures and parallel information processing mechanisms. …

cs_department: Aarhus Computer Science department relationships
Multiplex network consisting of 5 edge types corresponding to online and offline relationships (Facebook, leisure, work, co-authorship, lunch) between employees of the Computer Science department at Aarhus. Data hosted by Manlio De Domenico.
This network has 61 nodes and 620 edges.
Tags: Social, Relationships, Multilayer, Unweighted

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
Distributed controller synthesis for deadlock avoidance
https://

[2025-05-19 Mon (UTC), no new articles found for cs.OH Other Computer Science]
#toXiv_bot_toot

[2025-06-19 Thu (UTC), 2 new articles found for cs.GT Computer Science and Game Theory]
toXiv_bot_toot

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 16706 nodes and 121251 edges.
Tags: Social, Collaborati…

Martin Davis: An Overview of his Work in Logic, Computer Science, and Philosophy
Liesbeth De Mol, Yuri V. Matiyasevich, Eugenio G. Omodeo, Alberto Policriti, Wilfried Sieg, Elaine J. Weyuker
https://arxiv.org/abs/2506.08588

Martin Davis: An Overview of his Work in Logic, Computer Science, and Philosophy
In his autobiographic essay written in 1999, ``From logic to computer science and back'', Martin David Davis (3/8/1928--1/1/2023) indicated that he viewed himself as a logician \emph{and} a computer scientist. He expanded the essay in 2016 and expressed a new perspective through a changed title, ``My life as a logician''. He points out that logic was the unifying theme underlying his scientific career. Our paper attempts to provide a consistent vision that illuminates Davis' successive contribu…

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 31163 nodes and 120029 edges.
Tags: Social, Collaborati…

Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
Market Making without Regret
https://arxiv.org/abs…

[2025-06-19 Thu (UTC), no new articles found for cs.OH Other Computer Science]
toXiv_bot_toot

dblp_coauthor_snap: DBLP authors (2012)
A coauthorship network extracted from the DBLP computer science manuscript database, in 2012. This network is a one-mode projection from the bipartite graph of computer scientists and their publications.
This network has 425957 nodes and 1049866 edges.
Tags: Social, Collaboration, Unweighted, Metadata, Projection

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Coinductive Streams in Monoidal Categories
Elena Di Lavore, Giovanni de Felice, Mario Rom\'an

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
Automata Linear Dynamic Logic on Finite Traces
https://

Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
Online Learning for Equilibrium Pricing in Markets under Incomplete Information

cs_department: Aarhus Computer Science department relationships
Multiplex network consisting of 5 edge types corresponding to online and offline relationships (Facebook, leisure, work, co-authorship, lunch) between employees of the Computer Science department at Aarhus. Data hosted by Manlio De Domenico.
This network has 61 nodes and 620 edges.
Tags: Social, Relationships, Multilayer, Unweighted

[2025-07-18 Fri (UTC), 6 new articles found for cs.LO Logic in Computer Science]
toXiv_bot_toot

cs_department: Aarhus Computer Science department relationships
Multiplex network consisting of 5 edge types corresponding to online and offline relationships (Facebook, leisure, work, co-authorship, lunch) between employees of the Computer Science department at Aarhus. Data hosted by Manlio De Domenico.
This network has 61 nodes and 620 edges.
Tags: Social, Relationships, Multilayer, Unweighted

Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- MVP-Shapley: Feature-based Modeling for Evaluating the Most Valuable Player in Basketball
Haifeng Sun, Yu Xiong, Runze Wu, Kai Wang, Lan Zhang, Changjie Fan, Shaojie Tang, Xiang-Yang Li

[2025-06-18 Wed (UTC), 8 new articles found for cs.LO Logic in Computer Science]
toXiv_bot_toot

[2025-06-18 Wed (UTC), 2 new articles found for cs.GT Computer Science and Game Theory]
toXiv_bot_toot

[2025-07-18 Fri (UTC), 2 new articles found for cs.GT Computer Science and Game Theory]
toXiv_bot_toot

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Fuzzy Aristotelian Diagrams
Apostolos Syropoulos
https://

faculty_hiring: Faculty hiring networks (Comp. Sci., Business, History)
Three networks of faculty hiring in Computer Science Departments, Business Schools, and History Departments. Each node is a PhD-granting institution in the respective field, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2013). All data collected from faculty public rosters at the sampled institutions.
Thi…

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
A bargain for mergesorts -- How to prove your mergesort correct and stable, almost for free

dblp_coauthor_snap: DBLP authors (2012)
A coauthorship network extracted from the DBLP computer science manuscript database, in 2012. This network is a one-mode projection from the bipartite graph of computer scientists and their publications.
This network has 425957 nodes and 1049866 edges.
Tags: Social, Collaboration, Unweighted, Metadata, Projection

[2025-07-17 Thu (UTC), 5 new articles found for cs.LO Logic in Computer Science]
toXiv_bot_toot

Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- Assignment Markets with Budget Constraints
Eleni Batziou, Martin Bichler, Maximilian Fichtl

faculty_hiring: Faculty hiring networks (Comp. Sci., Business, History)
Three networks of faculty hiring in Computer Science Departments, Business Schools, and History Departments. Each node is a PhD-granting institution in the respective field, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2013). All data collected from faculty public rosters at the sampled institutions.
Thi…

[2025-06-17 Tue (UTC), 1 new article found for cs.LO Logic in Computer Science]
toXiv_bot_toot

Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
Ad Auctions for LLMs via Retrieval Augmented Generation
https://

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 346 nodes and 26832 edges.
Tags: Informational, Web gr…

[2025-07-17 Thu (UTC), 3 new articles found for cs.GT Computer Science and Game Theory]
toXiv_bot_toot

[2025-07-16 Wed (UTC), 9 new articles found for cs.LO Logic in Computer Science]
toXiv_bot_toot

[2025-06-17 Tue (UTC), 4 new articles found for cs.GT Computer Science and Game Theory]
toXiv_bot_toot

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 16726 nodes and 47594 edges.
Tags: Social, Collaboratio…

[2025-06-16 Mon (UTC), 1 new article found for cs.LO Logic in Computer Science]
toXiv_bot_toot

cora: CORA citations (1998)
Citations among papers indexed by CORA, from 1998, an early computer science research paper search engine. If a paper i cites a paper j also in this data set, then a directed edge connects i to j. (Papers not in the data set are excluded.) Self-loops may be present. The dates of these snapshots are uncertain.
This network has 23166 nodes and 91500 edges.
Tags: Informational, Citation, Unweighted

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Tractable and Intractable Entailment Problems in Separation Logic with Inductively Defined Predic...
Mnacho Echenim, Nicolas Peltier

dblp_cite: DBLP citations (2014)
Citations among papers contained in the DBLP computer science bibliography. If a paper i cites a paper j also in this data set, then a directed edge connects i to j. (Papers not in the data set are excluded.) Self-loops may be present. This snapshot from May 2014.
This network has 12590 nodes and 49759 edges.
Tags: Informational, Citation, Unweighted

faculty_hiring: Faculty hiring networks (Comp. Sci., Business, History)
Three networks of faculty hiring in Computer Science Departments, Business Schools, and History Departments. Each node is a PhD-granting institution in the respective field, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2013). All data collected from faculty public rosters at the sampled institutions.
Thi…

cora: CORA citations (1998)
Citations among papers indexed by CORA, from 1998, an early computer science research paper search engine. If a paper i cites a paper j also in this data set, then a directed edge connects i to j. (Papers not in the data set are excluded.) Self-loops may be present. The dates of these snapshots are uncertain.
This network has 23166 nodes and 91500 edges.
Tags: Informational, Citation, Unweighted