Researchers have published a paper claiming to disprove the Exponential Time Hypothesis, a major conjecture in computer science regarding the computational complexity of NP-hard problems. The mathematical development and proofs for this claim are being hosted on GitHub within OpenAI's dedicated math repository.