Adithya Bhaskara
@adithyacolorado.bsky.social
Honors Computer Science and Mathematics Student at University of Colorado Boulder | Undergraduate Researcher | 2022 Boettcher Scholar.
https://officialadithya.github.io
Applying to Ph. D. programs to start in Fall 2026!
https://officialadithya.github.io
Applying to Ph. D. programs to start in Fall 2026!
For the last month or so, I’ve gone down a rabbit hole of understanding recent work in computational redistricting, and the associated case law. I’m excited to give a "tutorial-style" talk today on some of the basics, focusing on legal aspects!
January 30, 2026 at 6:16 PM
For the last month or so, I’ve gone down a rabbit hole of understanding recent work in computational redistricting, and the associated case law. I’m excited to give a "tutorial-style" talk today on some of the basics, focusing on legal aspects!
Reposted by Adithya Bhaskara
"We analyze all papers published at ACL, NAACL, and EMNLP in 2024 and 2025... nearly 300 papers contain at least one HalluCitation... Notably, half of these papers were identified at EMNLP 2025 ... indicating that this issue is rapidly increasing."
https://www.arxiv.org/abs/2601.18724
https://www.arxiv.org/abs/2601.18724
HalluCitation Matters: Revealing the Impact of Hallucinated References with 300 Hallucinated Papers in ACL Conferences
Recently, we have often observed hallucinated citations or references that do not correspond to any existing work in papers under review, preprints, or published papers. Such hallucinated citations pose a serious concern to scientific reliability. When they appear in accepted papers, they may also negatively affect the credibility of conferences. In this study, we refer to hallucinated citations as "HalluCitation" and systematically investigate their prevalence and impact. We analyze all papers published at ACL, NAACL, and EMNLP in 2024 and 2025, including main conference, Findings, and workshop papers. Our analysis reveals that nearly 300 papers contain at least one HalluCitation, most of which were published in 2025. Notably, half of these papers were identified at EMNLP 2025, the most recent conference, indicating that this issue is rapidly increasing. Moreover, more than 100 such papers were accepted as main conference and Findings papers at EMNLP 2025, affecting the credib
www.arxiv.org
January 28, 2026 at 5:40 PM
"We analyze all papers published at ACL, NAACL, and EMNLP in 2024 and 2025... nearly 300 papers contain at least one HalluCitation... Notably, half of these papers were identified at EMNLP 2025 ... indicating that this issue is rapidly increasing."
https://www.arxiv.org/abs/2601.18724
https://www.arxiv.org/abs/2601.18724
I’ve never opened advertisements so fast!
Now that we’re in the thick of Ph. D. application season, I’ve observed that I’ve never been *this* on top of my email :)!
January 28, 2026 at 5:35 PM
I’ve never opened advertisements so fast!
Nothing is scarier than almost triggering a thumbs down reaction in a really interesting research talk on Zoom because you moved your hand the wrong way…thanks Zoom!
January 27, 2026 at 5:16 PM
Nothing is scarier than almost triggering a thumbs down reaction in a really interesting research talk on Zoom because you moved your hand the wrong way…thanks Zoom!
Reposted by Adithya Bhaskara
To all who teach matrices/linear algebra, I highly recommend vol. 24, issue 1 (Jan. 1993) of The College Mathematics Journal, a special issue dedicated to the teaching of linear algebra. Different ways of interpreting matrix multiplication is one of the themes of the issue.
Teaching matrix mult, noticed that I mentally pick up the rows in the first and align them with the columns in the second before multiplying and adding, realised that that is actually the wrong way round: it makes more sense to pick up the columns in the second and align with the rows in the first.
January 25, 2026 at 5:49 PM
To all who teach matrices/linear algebra, I highly recommend vol. 24, issue 1 (Jan. 1993) of The College Mathematics Journal, a special issue dedicated to the teaching of linear algebra. Different ways of interpreting matrix multiplication is one of the themes of the issue.
Reposted by Adithya Bhaskara
Teaching matrix mult, noticed that I mentally pick up the rows in the first and align them with the columns in the second before multiplying and adding, realised that that is actually the wrong way round: it makes more sense to pick up the columns in the second and align with the rows in the first.
January 24, 2026 at 12:34 PM
Teaching matrix mult, noticed that I mentally pick up the rows in the first and align them with the columns in the second before multiplying and adding, realised that that is actually the wrong way round: it makes more sense to pick up the columns in the second and align with the rows in the first.
As someone whose full name is one letter off from that of a prominent theoretician, I wholeheartedly agree!
Arxiv's lack of commitment to its author page feature is so disappointing. Why, when I click on the link that is an author's name, am I sent to a search page of "F. Lastname"? This is ridiculous
January 23, 2026 at 12:49 AM
As someone whose full name is one letter off from that of a prominent theoretician, I wholeheartedly agree!
Reposted by Adithya Bhaskara
New ACM Fellows include Swarat Chaudhuri, Javier Esparza, Paolo Ferragina, Ken-Ichi Kawarabayashi, Aggelos Kiayias, Alistair Moffat, Noam Nisan, Ariel Procaccia, Oded Regev, Natarajan Shankar, Stephanie Weirich, Adam Wierman and Ke Yi.
awards.acm.org/fello...
awards.acm.org/fello...
January 21, 2026 at 4:32 PM
New ACM Fellows include Swarat Chaudhuri, Javier Esparza, Paolo Ferragina, Ken-Ichi Kawarabayashi, Aggelos Kiayias, Alistair Moffat, Noam Nisan, Ariel Procaccia, Oded Regev, Natarajan Shankar, Stephanie Weirich, Adam Wierman and Ke Yi.
awards.acm.org/fello...
awards.acm.org/fello...
In a post unrelated to TCS, AGT, or computational social choice, I thought I’d mention that for anyone curious, that I have a list of symphony recommendations on my website!
All of them are a pleasure to listen to, and I’d love any suggestions :)
officialadithya.github.io/symphonies/
All of them are a pleasure to listen to, and I’d love any suggestions :)
officialadithya.github.io/symphonies/
symphonies | Adithya Bhaskara symphonies | Adithya Bhaskara
I love classical music, especially symphonic works. I have a preference towards works composed in the late-classical or romantic eras, but really I enjoy anything! Here, I provide a loose ranking of s...
officialadithya.github.io
January 21, 2026 at 2:10 PM
In a post unrelated to TCS, AGT, or computational social choice, I thought I’d mention that for anyone curious, that I have a list of symphony recommendations on my website!
All of them are a pleasure to listen to, and I’d love any suggestions :)
officialadithya.github.io/symphonies/
All of them are a pleasure to listen to, and I’d love any suggestions :)
officialadithya.github.io/symphonies/
Reposted by Adithya Bhaskara
The National Science Foundation sign on our Eisenhower Av building is now gone.
The NSF mural in the foyer is removed and torn off in sheets.
We were supposed to celebrate the 75th anniversary of the agency in May 2025. That never happened.
The NSF mural in the foyer is removed and torn off in sheets.
We were supposed to celebrate the 75th anniversary of the agency in May 2025. That never happened.
January 18, 2026 at 2:00 AM
The National Science Foundation sign on our Eisenhower Av building is now gone.
The NSF mural in the foyer is removed and torn off in sheets.
We were supposed to celebrate the 75th anniversary of the agency in May 2025. That never happened.
The NSF mural in the foyer is removed and torn off in sheets.
We were supposed to celebrate the 75th anniversary of the agency in May 2025. That never happened.
Reposted by Adithya Bhaskara
I asked around about Fourier analysis but I got mixed signals.
January 18, 2026 at 12:30 AM
I asked around about Fourier analysis but I got mixed signals.
I want to publicize cmmrs.mpi-sws.org (@ the MPI-SWS campus in Saarbrücken) to any predoctoral students interested in learning more about different areas of computer science research! Application due February 14 AOE.
My experience with the program: officialadithya.github.io/blog/2025/my...
My experience with the program: officialadithya.github.io/blog/2025/my...
The Cornell, Maryland, Max Planck Pre-doctoral Research School in Computer Science (CMMRS 2026)
cmmrs.mpi-sws.org
January 7, 2026 at 7:16 PM
I want to publicize cmmrs.mpi-sws.org (@ the MPI-SWS campus in Saarbrücken) to any predoctoral students interested in learning more about different areas of computer science research! Application due February 14 AOE.
My experience with the program: officialadithya.github.io/blog/2025/my...
My experience with the program: officialadithya.github.io/blog/2025/my...
Now that we’re in the thick of Ph. D. application season, I’ve observed that I’ve never been *this* on top of my email :)!
January 7, 2026 at 6:46 PM
Now that we’re in the thick of Ph. D. application season, I’ve observed that I’ve never been *this* on top of my email :)!
Reposted by Adithya Bhaskara
I wrote up a little blog post proposing a slightly different way to write asymptotic notation. www.solipsistslog.com/a-simple-and...
In short, I think asymptotic notation should usually be written with an INequality. E.g., f(n) <= O(n^2), f(n) < o(log n), f(n) > 2^{-o(n)}, f(n) >= n^{-O(1)}, etc.
In short, I think asymptotic notation should usually be written with an INequality. E.g., f(n) <= O(n^2), f(n) < o(log n), f(n) > 2^{-o(n)}, f(n) >= n^{-O(1)}, etc.
A simple and modest proposal for improving asymptotic notation | Solipsist's Log
www.solipsistslog.com
January 7, 2026 at 6:32 PM
I wrote up a little blog post proposing a slightly different way to write asymptotic notation. www.solipsistslog.com/a-simple-and...
In short, I think asymptotic notation should usually be written with an INequality. E.g., f(n) <= O(n^2), f(n) < o(log n), f(n) > 2^{-o(n)}, f(n) >= n^{-O(1)}, etc.
In short, I think asymptotic notation should usually be written with an INequality. E.g., f(n) <= O(n^2), f(n) < o(log n), f(n) > 2^{-o(n)}, f(n) >= n^{-O(1)}, etc.
Reposted by Adithya Bhaskara
Revisit the biggest moments in computer science from 2025.
The Year in Computer Science | Quanta Magazine
Explore the year’s most surprising computational revelations, including a new fundamental relationship between time and space, an undergraduate who overthrew a 40-year-old conjecture, and the…
www.quantamagazine.org
December 27, 2025 at 8:00 PM
Revisit the biggest moments in computer science from 2025.
Reposted by Adithya Bhaskara
In the days after the Trump administration’s outrageous and reckless announcement to dismantle the National Center for Atmospheric Research, I worked to build a bipartisan coalition of over 100 lawmakers committed to protecting NCAR.
And we won’t back down!
trib.al/5RfVoNT
And we won’t back down!
trib.al/5RfVoNT
Colorado leaders mobilize bipartisan congressional coalition to protect NCAR
Elected leaders representing Boulder and Colorado in Congress have assembled a bipartisan coalition of nearly 80 lawmakers to push for continued funding for the National Center for Atmospheric Rese…
trib.al
December 27, 2025 at 5:46 PM
In the days after the Trump administration’s outrageous and reckless announcement to dismantle the National Center for Atmospheric Research, I worked to build a bipartisan coalition of over 100 lawmakers committed to protecting NCAR.
And we won’t back down!
trib.al/5RfVoNT
And we won’t back down!
trib.al/5RfVoNT
Reposted by Adithya Bhaskara
Time for the Computational Complexity Year-in-Review and this year's theorem of the year
blog.computationalco...
New this year, The Complexity Blog Wrapped by Claude
lance.fortnow.com/bl...
blog.computationalco...
New this year, The Complexity Blog Wrapped by Claude
lance.fortnow.com/bl...
Complexity Year in Review
An easy choice for paper of the year, a paper that has nothing to do with randomness, interaction, quantum, circuits or codes. Just a near q...
blog.computationalcomplexity.org
December 22, 2025 at 6:27 PM
Time for the Computational Complexity Year-in-Review and this year's theorem of the year
blog.computationalco...
New this year, The Complexity Blog Wrapped by Claude
lance.fortnow.com/bl...
blog.computationalco...
New this year, The Complexity Blog Wrapped by Claude
lance.fortnow.com/bl...
Reposted by Adithya Bhaskara
Winners of the #FOCS2025 Cartoon Caption Contest:
- "This guy is about to blow up the polynomial hierarchy." [ Rachel Zhang ]
- "Not exactly what I meant by 'increase FOCS acceptance rate.'" [ @mahdi.ch ]
- "This guy is about to blow up the polynomial hierarchy." [ Rachel Zhang ]
- "Not exactly what I meant by 'increase FOCS acceptance rate.'" [ @mahdi.ch ]
The conference is starting in a few hours! We'll post here information about #FOCS2025 as it goes, including the blog posts attendees write about the talks and events.
And the "cartoon caption contest" (courtesy of Mary Wootters) has started, along with the offline scavenger hunt! Here's a teaser:
And the "cartoon caption contest" (courtesy of Mary Wootters) has started, along with the offline scavenger hunt! Here's a teaser:
December 15, 2025 at 10:35 AM
Reposted by Adithya Bhaskara
You can’t have a “unitary” executive if norms change during a transformation. That’s just math.
December 12, 2025 at 7:58 PM
You can’t have a “unitary” executive if norms change during a transformation. That’s just math.
Along with www.doi2bib.org, that @sophie.huiberts.me mentioned in this thread, there’s also this list of converters I just found: www.bibtex.com/converters/ (including ISBN to BibTeX)!
Is there a better way to access BibTeX entries for papers online without downloading the .bib file, and then copy-pasting the entry into my project’s references.bib file?
I have so many unnecessary .bib downloads with only one entry…
I have so many unnecessary .bib downloads with only one entry…
December 11, 2025 at 4:01 AM
Along with www.doi2bib.org, that @sophie.huiberts.me mentioned in this thread, there’s also this list of converters I just found: www.bibtex.com/converters/ (including ISBN to BibTeX)!
Reposted by Adithya Bhaskara
My thoughts on the late 80'-early 90's transition for research paper distribution from mail to email to the web.
Finding Papers Before the Web
Inspired by Daniel Litt's X Post Started asking mathematicians whose career started before the internet if they think Google, email, etc. ha...
blog.computationalcomplexity.org
December 5, 2025 at 12:45 AM
My thoughts on the late 80'-early 90's transition for research paper distribution from mail to email to the web.
Reposted by Adithya Bhaskara
📢Mark your calendars, the #ACMEC26 deadline is February 9! (Abstracts due the 2nd.)
All further details at ec26.sigecom.org, now live!
All further details at ec26.sigecom.org, now live!
Home - EC 2026
The Twenty-Seventh ACM Conference on Economics and Computation (EC'26), Rome, Italy, July 06-10, 2026.
ec26.sigecom.org
December 2, 2025 at 11:07 PM
📢Mark your calendars, the #ACMEC26 deadline is February 9! (Abstracts due the 2nd.)
All further details at ec26.sigecom.org, now live!
All further details at ec26.sigecom.org, now live!
Reposted by Adithya Bhaskara
What does counting pigeons have to do with Turing machines? More than you might think. In @quantamagazine.bsky.social, my latest foray into the wild world of meta-complexity, this time through the lens of mathematical logic:
‘Reverse Mathematics’ Illuminates Why Hard Problems Are Hard | Quanta Magazine
Researchers have used metamathematical techniques to show that certain theorems that look superficially distinct are in fact logically equivalent.
www.quantamagazine.org
December 1, 2025 at 3:31 PM
What does counting pigeons have to do with Turing machines? More than you might think. In @quantamagazine.bsky.social, my latest foray into the wild world of meta-complexity, this time through the lens of mathematical logic:
Reposted by Adithya Bhaskara
In 1936, Alan Turing conceived of hypothetical machines that could help mathematically model the process of computation. Built from just three parts, Turing machines can in principle compute the answer to any solvable problem. www.quantamagazine.org/amateur-math...
November 26, 2025 at 4:46 PM
In 1936, Alan Turing conceived of hypothetical machines that could help mathematically model the process of computation. Built from just three parts, Turing machines can in principle compute the answer to any solvable problem. www.quantamagazine.org/amateur-math...
Reposted by Adithya Bhaskara
🚨 EC'26 website is now live! 🚨
Deadline for abstracts 2 Feb & for papers 9 Feb ⏱️ 1st round decisions 26 March 😥 Rebuttal period 21-25 April 🙅 Decisions by 18 May 🎯 Conference 6-10 July in Rome 🍕🇮🇹🍝.
Instead of tracks, there are 13 amazing track chairs!
ec26.sigecom.org/index.html
Deadline for abstracts 2 Feb & for papers 9 Feb ⏱️ 1st round decisions 26 March 😥 Rebuttal period 21-25 April 🙅 Decisions by 18 May 🎯 Conference 6-10 July in Rome 🍕🇮🇹🍝.
Instead of tracks, there are 13 amazing track chairs!
ec26.sigecom.org/index.html
November 19, 2025 at 10:21 PM
🚨 EC'26 website is now live! 🚨
Deadline for abstracts 2 Feb & for papers 9 Feb ⏱️ 1st round decisions 26 March 😥 Rebuttal period 21-25 April 🙅 Decisions by 18 May 🎯 Conference 6-10 July in Rome 🍕🇮🇹🍝.
Instead of tracks, there are 13 amazing track chairs!
ec26.sigecom.org/index.html
Deadline for abstracts 2 Feb & for papers 9 Feb ⏱️ 1st round decisions 26 March 😥 Rebuttal period 21-25 April 🙅 Decisions by 18 May 🎯 Conference 6-10 July in Rome 🍕🇮🇹🍝.
Instead of tracks, there are 13 amazing track chairs!
ec26.sigecom.org/index.html