PAPER PLAINE

Analog circuit design currently requires extensive trial-and-error and knowledge locked behind non-disclosure agreements, slowing innovation and limiting who can participate. This database removes those barriers by making proven designs reusable and machine-readable, enabling AI tools to find and adapt existing solutions automatically. For companies and researchers, that means faster design cycles and fewer errors; for the field, it means knowledge can accumulate and compound rather than staying trapped in individual labs.

As companies deploy larger language models on phones, servers, and edge devices, quantization compression is essential to cut costs and latency. This finding changes how engineers should allocate limited precision budgets: instead of hunting for problem layers, spreading improvements evenly across the model works better in practice and is simpler to implement. This could reduce the engineering overhead of tuning quantization for each new model.

Machine learning teams routinely use synthetic data to fix imbalanced datasets, but have lacked clear guidance on which generation methods work best. This framework provides a principled way to evaluate synthetic data quality before deploying it, potentially saving teams from investing time in high-fidelity generators that won't improve actual performance. It also shows that simpler oversampling methods are sometimes more reliable than complex generative models—a finding that could reshape how practitioners choose their augmentation strategy.

Drug discovery relies on predicting how experimental molecules will bind their targets before expensive testing begins. This work exposes a critical gap: most peptide-binding models are benchmarked in unrealistic conditions and would fail in the real world, where researchers must predict binding to new disease targets they've never seen before. The findings demand that future benchmarks test what actually matters—whether methods can handle unfamiliar targets—and reveal which representation strategies hold up under that harder test.

Language models deployed to millions of users encounter rare failure modes that standard testing never catches. BLOOM-WILT makes it cheap and practical to continuously hunt for these hidden safety problems after deployment, meaning developers can catch and fix harms that would otherwise slip through to real users. The system's rankings also revealed that some models previously thought safer than others actually weren't—a correction that affects which systems get deployed.

Heavy-ion collisions at facilities like the Large Hadron Collider create extreme conditions that reveal fundamental physics, but are hard to simulate because particles don't forget their past interactions instantly. This framework opens the door to using next-generation quantum computers to model these collisions more accurately, potentially unlocking new insights into how matter behaves under the most violent conditions in nature.

As companies increasingly hand off coding work to AI agents pulling from repositories they don't fully control, understanding how simple invocation choices affect safety is critical. A developer asking for test execution instead of general setup could expose their system to attack 4.5 times more, and they'd likely never notice. This work gives teams concrete guidance on safer ways to phrase their requests and which tasks pose the highest risk.

Language models spend enormous compute power converting every intermediate thought into discrete tokens, even though these internal reasoning steps are never seen by users. This work shows those internal steps don't need to be tokenized at all, potentially making AI systems faster and cheaper to run while improving their ability to solve hard problems.

Blockchain developers often assume faster blocks help protect traders who provide liquidity to exchanges, but this research shows there's a hard limit to what speed can achieve. The optimal block time turns out to be around 8 seconds regardless of how big the pool is or how volatile prices are—meaning some losses are structural to markets with sudden price movements and cannot be engineered away.

Leavitt path algebras appear in operator theory, symbolic dynamics, and quantum physics. Understanding when these algebras have predictable structural properties lets mathematicians and physicists apply them reliably in theory and computation, and simplifies the problem of determining when two seemingly different weighted graphs produce equivalent algebraic structures.

As AI agents tackle longer and more complex tasks, they accumulate massive amounts of context that slows them down and costs more to run. By teaching models to edit their own memory intelligently, ContextPilot makes them faster and cheaper to operate without sacrificing accuracy—a practical gain for any real-world AI system handling lengthy customer conversations, research queries, or multi-step planning.

Understanding how people behave under ambiguous uncertainty matters for everything from financial regulation to insurance pricing to public health policy, where real decisions often involve incomplete information. This dataset is large and detailed enough that researchers can now test competing theories about ambiguity-aversion side by side, and replicate findings that might otherwise stay trapped in individual labs.