I think this is where Terry Tao hit the nail on the head. OpenAI has made claims, but the mathematics community does not accept garbage. It's less that they've done a disservice to the community; more that they've done a disservice to their own reputation.
I agree. Prompting 5.6 Sol to "Review these writeups and include appropriate citations and credit where appropriate" probably would have been a step in the right direction.
Then again, this would require them to actually care about the mathematics.
I'm an active researcher in TCS. For me, AI has not been very helpful on technical things (or even technical writing), but has been super helpful for (1) literature reviews; (2) editing papers (e.g., changing a convention everywhere in the paper); and (3) generating Tikz figures/animations.
For perspective, the CS programs in the NSF already have a two-submission limit per year [1].
Besides reducing the incentive to spam, this rule has had another positive effect: As a researcher without funding, you don't have to spend your whole year writing grants. You can, instead, spend your time on actual research.
With that said, NIH grants tend to me much more narrow than CS ones, and I imagine that it takes a lot more grants to keep a lab going...
Describing this as a limit on "CS programs" is a common, but erroneous, understanding of the proposal limit.
This specific solicitation — CISE Core Programs — has a 2-proposal-per-year limit. However, that only applies to this solicitation, and only counts proposals submitted to this solicitation. CISE Core Programs is an important CS funding mechanism, but there are quite a few other funding vehicles within CISE (Robust Intelligence, RETTL, SATC, and many more, including CAREER). Each has its own limits, that generally don't count or count against the Core Programs limit.
For perspective, in the same time period, The number of employees at Google multiplied by five. I wouldn't be surprised if the growth of the software industry, at least, actually outpaced the increase in H-1B visas.
For perspective, in the same time period, The number of employees at Google multiplied by five. It seems likely that the number of highly educated positions, in general, increased by quite a bit during that time.
As a small comment, this seems closely related to another recent paper: History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures (PODS 2024, Best Paper).
I'm not sure how they compare, since neither paper seems to know about the other. And I'm also not sure which paper came first, since the geometric search paper does not seem to post a publication date.
Whoah, cool. I'm one of the authors of the geometric search tree paper, and we totally hadn't see that paper, but will for sure dig in! Thanks for mentioning it.
I don't think the claim is true in quite as much generality as the author claims. Some deterministic data structures use much more space than time, for example, the deterministic implementation of a Van Emde Boas tree.
I think you're missing out on the time it takes to build the tree in the first place, which is O(M), equal the space complexity. People usually ignore this cost as a "preprocessing" factor, but it's a cost that's really there.
After this initial O(M) time and space cost, you do additional operations which only take up time, not space, so the claim Time >= Space holds here as well.
Example: https://nitter.poast.org/henryquantum/status/208362369543662...
Seems like a disservice to the community that openai put so little effort into producing good writeups...