A structural answer for three-dimensional spaces
Three-dimensional spaces can be understood through a proved geometric decomposition, resolving the Poincaré conjecture along the way.
Published grades for specific contributions, within their fields.
C · B · A · S support optional − / + placements. SS · SSS are available for evidence-bound nomination and assessment; none is assigned in this edition. Z · U are horizon nominations only. A grade is separate from scientific correctness.
Three-dimensional spaces can be understood through a proved geometric decomposition, resolving the Poincaré conjecture along the way.
A candidate argument and a reported Lean formalization are available for checking; WRS has not established the full claim.
A large proof combining mathematical arguments and computation was translated into a proof-assistant verification workflow.
Terrestrial and celestial motion became parts of one mathematical account.
Electric, magnetic and optical phenomena could be treated within one field theory.
Adaptation and changes in varieties gained a general selection-based explanation.
A molecular structure connected DNA chemistry with a plausible copying mechanism.
Computation received a precise machine model with provable limits on general decision procedures.
Compression and reliable communication could be studied through common mathematical limits.
A semiconductor device could provide electronic amplification.
Sequence transduction gained an attention-based architecture with greater parallelism than recurrent designs.
A learned prediction system substantially improved the accuracy of many protein-structure predictions.
A specific matrix product gained an algorithm using fewer scalar multiplications.
RNA sequence could direct programmable DNA cleavage in the demonstrated system.
An antibacterial observation was developed into material and procedures for early human treatment.
The usual cubic operation count was no longer an unavoidable cost of multiplying general square matrices.
Redundant check bits could locate and correct specified transmission errors through an explicit code construction.
An existing programmable nuclease became more selective in the reported experiments.
Describes gravity through the relation between spacetime geometry and matter.
Developed a relativistic account of time, simultaneity and electrodynamics from the relativity principle and invariant light propagation, deriving transformations between inertial frames.
Describes quantization through eigenvalue problems in wave mechanics.
Structural relations between continuous symmetries, conservation laws and variational equations.
Demonstrated electromagnetic induction with a ring-and-coil experiment, a foundation for transformers and generators.
Connects macroscopic equilibrium behavior with counts of microstates, laying foundations for a statistical interpretation of entropy.
Gives the equilibrium black-body spectrum, using discrete energy elements in its statistical derivation.
Establishes limits to formal provability in sufficiently strong, effectively axiomatized systems of arithmetic.
Uses differential notation and calculation rules for tangents, maxima and minima, in an important early publication on calculus.
For an integer n > 2, no positive integers a, b and c satisfy a^n + b^n = c^n.
Turned laboratory ammonia synthesis into an operating high-pressure industrial process, expanding the practical supply of fixed nitrogen.
Organized elements by atomic weight and chemical analogy, identified periodic properties and left positions for undiscovered elements.
Collected cases and inoculation observations suggesting that cowpox exposure could protect against smallpox, helping establish vaccination as a reproducible research approach.
Developed pancreatic extracts, purification and early clinical use that made insulin treatment possible for people with diabetes.
Isolated artemisinin following an antimalarial plant-extract research program, creating a new foundation for malaria drug development.
Reported that incorporating selected modified nucleosides reduced RNA-triggered Toll-like-receptor activity and dendritic-cell activation in the tested cellular systems.
Bigelow’s report described surgical operations performed after inhalation of ether. It supplied published clinical evidence that anesthesia could make major procedures possible without the usual conscious experience of surgical pain.
Koch identified and investigated the bacillus responsible for tuberculosis, connecting a major disease to a specific microbial cause. The work supplied a basis for subsequent diagnosis, prevention and treatment research.
A controlled clinical study used an oral glucose–electrolyte solution for cholera maintenance therapy and reported a reduced need for intravenous replacement fluids.
Showed how spatially varying fields and projections can turn nuclear magnetic resonance signals into images of an object’s internal distribution.
Uses pea crosses and counts of offspring traits to establish quantitative patterns of segregation and combination.
Combined dwarfing traits, disease resistance, breeding and field testing to develop productive wheat varieties and extend them across growing regions.
Developed rice hybrids with increased yield potential and a production system for hybrid seed, followed by release to farmers.
IRRI’s breeding, selection and field-testing programme produced IR8, released in 1966. Its short stature and yield response helped change rice improvement and seed deployment in suitable production environments.
Fisher explained how replication, randomization and deliberate arrangement of plots support valid comparisons in agricultural experiments. The work helped turn variable field conditions into a problem that experimental design could address.
Organized data through n-ary relations, separated users and programs from internal storage representation, and discussed relational operations, normal form, redundancy and consistency.
Developed the public-key and digital-signature framework and described a shared-key exchange using modular exponentiation in a finite field.
Ritchie and Thompson described a multi-user system combining a hierarchical file system, common input/output conventions, processes and a programmable shell.
Cerf and Kahn proposed how hosts could communicate across different packet networks through gateways and end-to-end transport mechanisms.
Berners-Lee proposed a linked information system to make distributed research information easier to connect and navigate.
Kilby demonstrated circuit elements formed in semiconductor material; Noyce developed a planar interconnection concept drawing on Hoerni’s process. These complementary advances opened a route to integrated electronic circuits.
Encoded polynomial-time nondeterministic computations as satisfiability instances and established a completeness result using the paper’s definition of P-reducibility.
Reorganized discrete Fourier computation through factorization of the transform length, reducing operation counts for the factorizable lengths treated and describing machine implementation.
Demonstrated how propagating output errors backward can adjust weights in multilayer networks and learn useful internal representations from examples.
Read DNA sequences using nucleotide analogues that terminate DNA-polymerase extension at specific bases, with a bacteriophage sequence demonstration.
Demonstrated enzymatic amplification of human beta-globin genomic sequences followed by restriction-site analysis.
Explained major ocean-ridge magnetic anomaly patterns through alternating normal and reversed magnetization carried away from spreading ridges, linking geological observations to magnetic-field reversals.
Measured an unexplained, nearly isotropic microwave antenna-temperature excess after estimating atmospheric, instrumental and ground contributions; the letter connected it to a possible cosmological explanation in a companion paper.
Proposed that sunlight breaks down chlorofluoromethanes in the stratosphere, releasing chlorine that catalytically destroys ozone.
Studies heat engines through cyclic processes and reversible reasoning, relating ideal motive power to hot and cold conditions rather than the working substance.
Organized a large body of geometry and number theory into a systematic deductive treatment in the Elements.
Presented systematic procedures for solving linear and quadratic equations by completion and balancing.
Developed a sustained mathematical and experimental study of light and vision in the Book of Optics.
Replaced the lengths and shapes of a bridge layout with its connection pattern and a parity argument, ruling out a walk that crosses each of the seven bridges exactly once.
Organized higher arithmetic around congruences, residues and quadratic forms, with new investigations connecting arithmetic and the division of the circle.
Developed a way to discuss spaces of arbitrary dimension, local measurement and curvature, separating geometrical hypotheses from the question of which geometry describes physical space.
Used complex analysis and modular transformations to derive precise asymptotic estimates for the number of partitions of an integer, developing a route that became part of the circle method.
Systematically develops trigonometric-series methods through the problem of heat conduction.
Turns the difference between local hidden-variable theories and quantum correlations into testable constraints.
The E8 lattice attains the greatest sphere-packing density in eight-dimensional Euclidean space.
GW150914 provides direct observational evidence of gravitational waves from merging black holes.
Progress on proportions of zeta zeros discovered by Claude and checked and communicated by researchers; subsequent papers give constants including 2/3, 5/6 and approximately 0.6725.
Reports a complete Lean formalization of an existing proof of Fermat’s Last Theorem.
Extends structure prediction to complexes involving proteins, nucleic acids and ligands.
Discovers faster small sorting programs and reports their inclusion in an LLVM standard library.
Combines language models with evaluators to improve cap-set constructions and bin-packing heuristics.
Combines Gemini with computational evaluators to search for algorithms and mathematical constructions.
Deep learning and computational screening expand the space of candidate stable crystals.
Uses machine learning to generate ensemble weather forecasts and evaluates probabilistic prediction.
Uses diffusion models to design protein structures and functions, with experimental examples.
Reports Gauss completing the final stage of an existing human-led Lean project.
Constructs a field theory using local isotopic gauge invariance.
Proves that the Leech lattice achieves optimal sphere-packing density in 24 dimensions.
Every planar map can be colored with at most four colors so adjacent regions have different colors.
Uses the light-quantum hypothesis to explain the production and transformation of light and derive the relation between photoelectron energy and incident frequency.
Examines limits on descriptions of position and momentum in quantum kinematics and explains uncertainty through thought experiments.
Connects relativity with the quantum theory of the electron, incorporating spin structure in a first-order wave equation.
Describes conventional superconductivity using paired-electron states and explains the energy gap, phase transition and multiple observables.
The two experiments separately report signals of a new particle, central observations in the discovery of the Higgs boson.
Using 24 extragalactic objects with distance estimates, analyzed individually and in nine groups, reports an approximately linear distance–radial velocity relation in the historical sample.
Gives polynomial-time algorithms for integer factorization and discrete logarithms in the quantum computation model.
Uses relations between quantities and their rates of change to address tangents and quadrature, including a method for deriving rate relations from variable relations.
An international collaboration publishes and opens a draft human genome, reporting sequence assembly and initial analysis of genome structure.
Reports whole-genome random shotgun sequencing, two assembly approaches and initial analysis, explicitly acknowledging use of published public-project data in assembly.
Expresses Kadanoff scaling near an Ising ferromagnet’s critical point as renormalization-group differential equations and relates scaling laws to fixed points.
Compared mechanical work with heat produced by friction in water, mercury and cast iron, establishing an experimental conversion relationship.
Introduced the named state quantity entropy and related reversible heat exchange to temperature while expressing the direction of irreversible change.
Published the 3.055-billion-base T2T-CHM13 human genome assembly, resolving previously unfinished regions with gapless assemblies for every chromosome except Y.
Constructed a draft human pangenome reference from 47 phased diploid assemblies, comprising 94 haplotypes, to represent sequence variation across the sampled genomes.
Two independent papers analyzed the ultraviolet behavior of non-Abelian gauge theories, establishing the mechanism by which interactions weaken at high energies.
Constructed paired public and secret operations through exponentiation modulo a composite integer, providing methods for public-key encryption and digital signatures.
Gave a method for finding a shortest path in a graph with positive edge lengths; the original note also treats construction of a minimum-total-length tree.
A constructive proof joins a cycle factor through explicitly described six-cycles to obtain a Hamilton cycle in the middle levels of an odd-dimensional cube.
Established existence of a mixed-strategy equilibrium for every finite game by applying a fixed-point theorem to the correspondence of best replies.
Matiyasevich supplied a Diophantine representation of exponential growth, completing the prior Davis–Putnam–Robinson route from enumerable predicates to polynomial equations and the impossibility of a general integer-solvability algorithm.
Defined efficiently checkable witness-search problems and reductions between them, identified universal examples and stated an optimal-search construction in the specified computation model.
Showed an incompatibility between unrestricted preference orderings over at least three alternatives and the stated social-ordering, positive-association, independence, non-imposition and non-dictatorship requirements.
Found 27^5 + 84^5 + 110^5 + 133^5 = 144^5 by computer search, disproving Euler’s proposed lower bound on the number of like powers needed to sum to another.
Recast linear estimation in a state-space formulation with recursively updated estimates and error covariance, supporting nonstationary as well as stationary problems.
Constructed configuration-space samples using symmetric trial moves and energy-based acceptance, counting retained states after rejected moves, with a two-dimensional rigid-sphere calculation on MANIAC.
Generalized the Metropolis construction through proposal probabilities and acceptance ratios chosen to preserve a target distribution, while treating dependence and estimation error in Markov-chain samples.
EQP found a proof in 1996 that every Robbins algebra is Boolean, completing a longstanding algebraic problem after earlier human and automated work on sufficient conditions.
Proposed learning a generator through a minimax game against a discriminator, with an idealized distribution-matching optimum and an alternating gradient-based implementation.
Reformulated stacked layers to learn residual functions around shortcut connections, making much deeper image-recognition networks easier to optimize in the reported experiments.
Introduced recurrent memory cells with controlled access to constant error flow, addressing learning over long temporal gaps and demonstrating the method on constructed sequence tasks.
Extended the support-vector approach beyond perfectly separable training data, using linear decision surfaces in transformed feature spaces and evaluating classification on character-recognition tasks.
Used the constructible universe to establish that adjoining choice and the generalized continuum hypothesis preserves consistency relative to the underlying set theory. The 1938 notice states the theorem and its proof strategy.
Developed forcing to construct models in which the continuum hypothesis fails while choice holds. Together with Gödel’s consistency direction, this establishes independence from the usual set-theoretic axioms, conditional on their consistency.
Connected stellar evolution, nuclear reaction mechanisms and observed element abundances in a detailed synthesis. Its account distinguishes fusion and slow and rapid neutron-capture processes, with capture rates compared against beta decay.
Combined relativistic electron degeneracy with a polytropic stellar model to obtain an upper mass for an ideal white dwarf.
Fitted voltage-clamp measurements with sodium, potassium and leakage currents, then used the resulting equations to predict action potentials and other electrical responses of a squid giant axon.
Explained large-angle particle scattering through encounters with a concentrated central atomic charge, using the experimental evidence of Geiger and Marsden.
Interpreted recoil measurements from penetrating beryllium radiation as evidence for a neutral particle with mass close to the proton, testing that account against the high-energy photon alternative.
Reported a mould-associated antibacterial effect, named the active culture filtrate penicillin, and used differences in bacterial susceptibility to aid isolation of influenza bacilli.
Connected fermentation and spoilage to specific microbial activity, investigating how oxygen availability changes the relationship between growth and fermentation.
Obtained yeast press juice that fermented sugars after removal of intact yeast cells, separating fermenting activity from the living-cell apparatus.
Presented shorter three-value sorting routines and hardware-specific speed comparisons, exposing the importance of the permitted program space and benchmark setup.
Observed a frequency-shifted component of scattered light in liquids and gases, opening a route to study molecular energy changes through light.
Interpreted neutron-induced uranium disintegration as the splitting of a heavy nucleus, explaining the large energy release.
Demonstrated stimulated optical emission from optically pumped ruby, establishing a working solid-state laser.
Found unusually stable clusters of 60 carbon atoms and proposed a closed, football-shaped molecular structure.
Isolated atomically thin carbon films and measured their electronic field effect, establishing graphene as an experimentally accessible two-dimensional electronic material.
Demonstrated reversible lithium extraction from lithium cobalt oxide, with substantially higher voltage than the compared titanium-disulfide system.
Used organolead-halide perovskites as light absorbers in photoelectrochemical solar cells, with a reported conversion efficiency of 3.8% for the iodide-based cell.
Combined neural-network screening with laboratory experiments to identify antibacterial activity of halicin, including activity in the reported mouse infection models.
Used a neural network to prioritize compounds against Acinetobacter baumannii, followed by experiments identifying abaucin and activity in a mouse wound model.
Integrated hypothesis generation, experiment selection and automated yeast experiments to investigate gene functions in a defined biological system.
Used learned patterns and attribution to guide human research in knot theory and representation theory, leading to new mathematical relationships and conjectures.
Linked automated screening and active learning with biological assays, identifying repurposing opportunities including TNP-470 against a malaria-parasite enzyme.
Isolated and characterized streptomycin’s antibacterial activity, extending the range of organisms addressable by antibiotic research.
Reported curved bacteria in gastric biopsies and an association with active gastritis and peptic ulceration, challenging prevailing explanations of ulcer disease.
Combined X-ray measurements from many angles with computation to reconstruct cross-sectional absorption images and distinguish soft tissues.
Developed an X-ray reflection and spectrometry approach to connect diffraction with atomic planes in crystals.
Proposed large-scale movement of continents as an explanation for linked geological and geographical observations.
Purified a pneumococcal transforming fraction and presented chemical and enzymatic evidence that its activity resided principally in DNA.
Used synthetic poly-U RNA in a cell-free system to direct phenylalanine incorporation, providing a decisive entry point into deciphering the genetic code.
Observed penetrating radiation produced around a discharge tube, opening a way to investigate structures hidden from visible light.
Separated a strongly radioactive barium-associated fraction from pitchblende and proposed a new element, radium, using chemical and spectroscopic evidence.
Connected discrete atomic energies and light emission in a model explaining hydrogen-like spectra.
Identified the lack of decisive tests of parity conservation in weak interactions and proposed experiments.
Measured an asymmetry in electron emission from polarized cobalt-60 nuclei, demonstrating parity violation in beta decay.
Used cosmic-ray cloud-chamber tracks to identify light positively charged particles, now called positrons.
Derived Planck’s radiation law through a new counting of quantum states, establishing a foundation for bosonic statistics.
Related the irregular motion of suspended particles to molecular thermal motion through a quantitative diffusion relation.
Established a variational foundation for describing an interacting electronic ground state through its density.
Developed self-consistent equations that organize electronic-structure calculations around an effective single-particle system.
Produced a condensate in trapped, cooled rubidium-87 gas and observed characteristic changes in its velocity distribution.
Measured reproducible Hall-resistance plateaus in a two-dimensional electron system, linking a material measurement to fundamental constants.
Observed a Hall plateau at one-third Landau-level filling in a high-mobility two-dimensional electron system.
Measured photon-polarization correlations with rapidly changing analyzers and observed a violation of Bell inequalities.
Observed sharp diffraction and icosahedral orientational order in an aluminium–manganese alloy, incompatible with a periodic crystal lattice.
Reported superconducting behaviour in a barium–lanthanum–copper oxide system, opening the cuprate research program.
Identified and studied remarkably regular radio pulses from an astronomical source, opening a new way to investigate compact stars.
Inferred a close-orbiting planetary companion to 51 Pegasi from periodic changes in the star’s radial velocity.
Two independent supernova programs found distance–redshift evidence consistent with an accelerating cosmic expansion.
Detected large-scale temperature anisotropy in the cosmic microwave background using the first-year COBE DMR maps.
Measured extended rotation curves across 21 spiral galaxies, strengthening evidence for substantial mass beyond the bright central regions.
Estimated how changes in atmospheric carbon dioxide could alter surface temperature through radiative effects.
Reported systematic atmospheric carbon-dioxide measurements revealing seasonal and geographic variation and a persistent increase at the Antarctic stations.
Used maize genetics to describe mobile controlling elements and their effects on gene expression and chromosome behaviour.
Used isotope labelling and density separation to distinguish semiconservative DNA replication from competing models in E. coli.
Explained coordinated control of protein synthesis through regulatory genes and an operon model.
Purified and characterized a restriction enzyme from Haemophilus influenzae, enabling controlled cleavage of DNA.
Joined DNA fragments into plasmids that replicated and expressed inherited properties after introduction into bacteria.
Fused immune cells and myeloma cells to create cell lines producing antibodies with a defined specificity.
Used defined factors to turn mouse fibroblasts into cells with pluripotent stem-cell properties.
Showed that double-stranded RNA could strongly and specifically interfere with gene expression in C. elegans.
Isolated and characterized a T-lymphotropic retrovirus from a patient at risk for AIDS.
Identified a distinct papillomavirus DNA type in cervical-cancer tissue and tested its prevalence in additional biopsy samples.
Achieved a live birth following in vitro fertilization and embryo transfer through the work of Steptoe, Edwards, Purdy and their clinical team.
Observed an atmospheric-neutrino pattern consistent with flavour oscillation, providing evidence for nonzero neutrino mass differences.
Proposed a protocol for transferring an unknown quantum state using shared entanglement, measurement and classical communication.
Generated medium-range global forecasts with a graph neural network trained on reanalysis data and evaluated against operational forecasts.
Used Earth-specific neural-network structure and temporal aggregation to produce accurate medium-range global weather forecasts.
Predicted pathogenicity-related effects of missense variants and published a large set of predictions for human amino-acid substitutions.
Inferred protein structures from sequences using a protein language model, enabling a large metagenomic structure-prediction atlas.
Generated amino-acid sequences for target backbones, with structural and functional experiments supporting selected designs.
Optimized antisymmetric neural-network wavefunctions with variational Monte Carlo to calculate electronic energies for tested atoms and molecules.
Combined a physics-informed wavefunction ansatz with learning and variational Monte Carlo to improve electronic-structure calculations.
Prioritized faint transit signals and supported statistical validation of Kepler-80g and Kepler-90i.
Used graph-based explanations to prioritize a structural class with antibacterial activity, followed by laboratory and mouse-infection experiments.
Recorded four satellites moving around Jupiter, showing directly that not every celestial body revolves around Earth.
Presented a mathematical planetary system in which Earth rotates and travels around the Sun.
Used astronomical observations to describe elliptical orbits and equal-area motion, followed by a relation between orbital periods and sizes.
Combined anatomical observations, experiments and quantitative reasoning to argue that blood circulates through the body.
Published detailed microscopic observations and illustrations of plants, insects and materials, including the cellular appearance of cork.
Described tiny organisms in water and infusions through microscopy in a dated letter to the Royal Society.
Expressed the relationship between current, voltage and resistance in a mathematical treatment of electrical conduction.
Described a stack of dissimilar metals and moist separators producing a sustained electrical current.
An axiomatic framework made program properties expressible through assertions and rules of inference, supporting systematic reasoning about code.
Lamport, Shostak and Pease analyzed agreement when some participants send inconsistent or malicious messages, with different results for oral and authenticated messages.
Fischer, Lynch and Paterson showed that deterministic consensus can have a nonterminating execution in an asynchronous system even with one possible process failure.
ImageNet organized a large collection of labeled images around a semantic hierarchy, providing a reusable resource for visual recognition research.
A large convolutional network trained with GPUs demonstrated strong large-scale image classification, using architectural and training choices that made deep learning practical at this scale.
Rosenblatt proposed a trainable pattern-recognition model connecting weighted responses, experience and classification.
Kingma and Welling used reparameterization to make variational learning in continuous latent-variable models amenable to stochastic gradient optimization.
BERT pretrained deep bidirectional Transformer representations and adapted them to a range of language tasks with task-specific fine-tuning.
The GPT-3 paper studied a large autoregressive language model performing many tasks from instructions and examples in its prompt, without task-specific gradient updates.
Ho, Jain and Abbeel developed an effective image-generation approach by learning to reverse a noise-adding process, connecting variational learning with denoising score matching.
A deep reinforcement-learning system learned action values from visual observations and rewards across a range of Atari games.
A deep reinforcement-learning controller produced and maintained multiple plasma configurations in physical experiments on the TCV tokamak.
A mobile laboratory robot used Bayesian optimization to choose and perform photocatalyst experiments, improving hydrogen-production performance within a defined search space.
A-Lab combined source-derived recipes, machine learning, active learning and robotics for inorganic synthesis. The corrected article reports 36 compounds realized from 57 targets during a 17-day campaign.
The AlphaProteo report describes a learned system for designing protein binders and reports experimental binding results across several target proteins.
Lewis framed chemical bonding using valence electrons and shared electron pairs, providing a practical way to reason about molecular structure.
Bassham, Benson and colleagues traced radioactive carbon through photosynthetic intermediates to explain regeneration of the carbon-dioxide acceptor in a cyclic pathway.
Hatch and Slack traced carbon through four-carbon acids and into sugar precursors, supporting a distinct photosynthetic carbon-fixation pathway in sugarcane.
Chapin, Fuller and Pearson developed a silicon junction device that converted sunlight into usable electrical power, helping establish practical photovoltaics.
Turner, Clough, Martin and Topp described assembling structural stiffness from smaller units, imposing equilibrium and continuity at nodes for computation of complex structures.
Neyman and Pearson organized statistical tests around error rates and power, deriving most-powerful tests for specified hypothesis comparisons.
Bayes’s posthumous essay developed an inverse-probability calculation, connecting observed outcomes to uncertainty about an unknown chance.
Li, Eddaoudi, O’Keeffe and Yaghi reported a metal–organic framework that remained crystalline after solvent removal, supporting a reusable approach to porous-material design.
The NIF collaboration measured fusion output exceeding laser energy delivered to the target in its December 2022 experiment. LLNL reports that machine-learning-assisted simulation supported pre-shot predictions alongside expert design.
Krebs and Johnson connected metabolic reactions into a cycle explaining how carbon compounds are oxidized in animal tissues.
Ziegler’s catalyst development and Natta’s stereospecific extensions enabled production of polymers with more controlled molecular structures.
Boole developed an algebraic treatment of logical classes and propositions. It made symbolic calculation a systematic tool for reasoning and belongs among the mathematical foundations on which later digital logic was built.
Church connected effective calculation with formal notions of definability and established an undecidability result in elementary number theory. This helped turn the limits of computation into mathematical questions with explicit definitions.
The circulated EDVAC draft described a computer organized around memory, arithmetic, control and input/output, with instructions represented in memory. It provided an influential account of the stored-program approach.
Hamming showed how redundant check bits can make specified transmission or storage errors detectable and correctable. The work supplied constructive tools for reliable digital information, beyond simply stopping when an error is noticed.
The FORTRAN team built a language and compiler that let scientific programmers express formulas at a higher level while producing efficient machine code. The 1957 system helped make compiled scientific programming practical.
McCarthy described symbolic expressions, recursively defined functions and their realization in the Lisp programming system. Programs could manipulate structured symbols, providing a foundation for symbolic computing and AI research tools.
Baran studied networks that route standard message blocks through multiple possible paths using local decisions. The report investigated how distributed connectivity and adaptive routing could preserve communication after damage.
The Intel and Busicom project realized a programmable four-bit CPU within the MCS-4 chip set. Integrating processor functions on one chip helped make general programmable electronics accessible to smaller systems.
Härder and Reuter organized transaction-oriented recovery around atomicity, consistency, isolation and durability. Their framework made assumptions about failures and recovery explicit and comparable across database implementations.
Semmelweis introduced chlorinated hand disinfection in a maternity clinic and linked the change with a major fall in maternal mortality. The historical intervention helped establish the importance of preventing infection during care.
Lister set out an antiseptic approach to surgical practice, connecting the control of contamination with better wound outcomes. It changed the research and practice of preventing postoperative infection.
Landsteiner distinguished patterns of blood agglutination between people, helping explain why blood from different donors cannot always be mixed safely. The work established a foundation for blood-group compatibility testing.
The Medical Research Council compared streptomycin plus bed rest with bed rest alone for pulmonary tuberculosis using randomized allocation and concealed assignments. The report made both the treatment comparison and its evaluation method inspectable.
Doll and Hill compared smoking histories in patients with lung carcinoma and controls. Their case-control study became an important early contribution to the accumulating evidence on tobacco and lung cancer.
The clinical team reported a successful kidney transplant between identical twins. It demonstrated that a transplanted human kidney could sustain function in a setting that greatly reduced the immunological barrier.
Development, large-scale evaluation and licensing of an inactivated poliovirus vaccine made widespread preventive vaccination possible. The 1955 milestone was followed by other vaccine designs and extensive public-health programmes.
A phase 1 trial of the BCR-ABL inhibitor STI571, later known as imatinib, reported substantial antileukemic activity in chronic-phase CML after interferon treatment had failed. It provided clinical evidence for targeting a specific molecular abnormality.
The randomized BNT162b2 trial provided clinical evidence that an mRNA vaccine could prevent symptomatic COVID-19 under the trial’s conditions. It connected a molecular vaccine platform with a measured disease-prevention outcome.
Broadbalk established long-running comparisons of manure, mineral fertilizers and untreated plots in wheat. Its continuing measurements and retained samples made long-term questions about soil nutrients and crop production researchable.
The double-cross approach used crosses between hybrids derived from inbred lines to make hybrid maize seed production more practical. Jones’s work helped translate hybrid-vigour research into a usable seed-production method.
Researchers developed and field-tested the release of sterilized screwworm flies so that mating would not produce viable offspring. The approach offered an area-wide way to control a damaging livestock parasite.
Stern and colleagues described integrating biological and chemical control rather than treating them as competing approaches. Pest abundance, natural enemies and economic injury informed when and how to intervene.
Barton and colleagues regenerated tobacco plants containing engineered T-DNA and followed its transmission to progeny. The experiment connected plant transformation with recovery of whole plants and inheritance.
Lander and Botstein developed methods for locating factors underlying quantitative traits using genetic linkage maps, including interval mapping and selective genotyping. The framework helped connect measured traits to regions of a genome.
Koziel and colleagues reported field performance of maize engineered to express an insecticidal protein derived from Bacillus thuringiensis. The study linked a molecular construct with protection against a target insect in field trials.
Xu and colleagues identified a SUB1A allele that improves rice survival during complete submergence and tested its function. The paper also reported transferring the SUB1 region into a widely grown variety using marker-assisted selection.
Connected an emitted amount of light energy to a corresponding loss of a body's mass, establishing the mass–energy relationship in a separate short paper.
Related atomic transition probabilities to thermal radiation, distinguishing emission processes and absorption and developing the induced-emission mechanism later used in coherent light sources.
Formulated a joint thought experiment relating predictions on separated systems to a criterion of physical reality, creating a precise challenge about the completeness of the wave-function description.
Represented relay and switching arrangements with algebraic equations, connecting logical operations to circuit analysis and synthesis.
Used a silicon oxide insulated gate to control conduction at a semiconductor surface, establishing a working device path that could later be developed into MOS integrated circuits.
Compared cholera occurrence with water exposure and water suppliers, using observations across households and outbreaks to investigate a route of transmission and possible prevention.
Studied specialized microbial transformations from ammonia through nitrite to nitrate and growth using inorganic substrates, helping explain microbial roles in soil nutrient cycling.
Isolated the aerobic nitrogen-fixing microorganism named Azotobacter, adding a distinct route for investigating biological nitrogen acquisition outside a plant-root symbiosis.
Quantum energy elements became a working explanatory device for a bulk material property, not only radiation.
Macroscopic solution measurements became a quantitative probe of molecular scale.
Quantum theory acquired a nonclassical kinematic starting point capable of systematic generalization.
Perturbative quantum-electrodynamic processes became representable and calculable through a reusable graphical and space-time organization.
Chemistry acquired a coherent quantitative language and operational structure for identifying substances and reactions.
Chemical combining proportions acquired a reusable particulate explanatory framework and quantitative programme.
Equilibrium across phases and components became expressible in a general mathematical thermodynamic language.
Electrolytic solutions acquired a reusable microscopic explanatory model rather than a current-created decomposition picture.
Interactive computer traffic gained a concrete network design based on independently queued packets rather than dedicated circuits.
Digital logic gained a low-static-power circuit architecture that later became central to dense integrated electronics.
Distributed systems gained a general language and implementable mechanism for causal ordering without a shared clock.
A wide class of sequential optimization problems became expressible through reusable state recurrences.
Noisy experiments could be organized into a convergent iterative search for an unknown target.
Probability theory gained a general rigorous language in which finite and infinite constructions could be developed consistently.
The mosquito hypothesis gained direct parasitological evidence and a concrete experimental route.
Yellow-fever transmission shifted from competing conjectures toward an experimentally discriminated vector mechanism.
Controlled cell deletion became a recognizable general biological process rather than disconnected pathological observations.
Legume nitrogen gain became an experimentally localized biological symbiosis problem rather than an unexplained crop anomaly.
Plant nutrition became testable through quantitative input-output balance rather than qualitative speculation alone.
Plant disease could be investigated through controlled inoculation and causal pathogen testing.
A broad body of agricultural technique became systematically organized and reproducible through print.
A resource-constrained regional positioning architecture became a concrete research programme.
Earth history became explainable through continuing natural process cycles operating over deep time.
Orbital forcing became a quantitative paleoclimate programme rather than a qualitative hypothesis.
Cosmic expansion became a physically and observationally connected relativistic model.
Option pricing became a systematic model-based hedging and valuation problem rather than primarily heuristic appraisal.
The new pricing framework gained broader contracts, conditions and theoretical clarification.
Radiocarbon measurement became an empirically checked dating capability.
Complex mixtures gained a general physical separation and visualization method.
Buoyancy and floating equilibrium became subjects of systematic mathematical demonstration.
Human anatomy gained an integrated observational and visual reference that made direct dissection central to evaluating anatomical claims.
Botany gained a durable common naming reference that made species claims easier to identify, compare and revise.
A treatment claim was tested through an explicit concurrent multi-arm comparison rather than anecdote alone.
Food preservation gained a reproducible heat-and-seal process that could be applied beyond a single recipe.
Electricity and magnetism became experimentally linked, opening a new unified research track.
Botanical structure gained a unifying cellular unit, despite an incorrect proposed formation mechanism.
A common cellular structural principle became available for comparing plant and animal organization.
Mathematics gained a rigorous distinction between different sizes of infinite collections.
Matter acquired an experimentally grounded subatomic charged constituent common across cathode-ray sources.
Analysis gained a more powerful integration language for discontinuous functions and passage to limits.
Physics gained evidence for a new zero-resistance low-temperature regime.
Variable-star period became a usable indicator of relative luminosity in a common-distance population.
Polymer substances became interpretable as genuine giant molecules with chain structure.
Quantum statistics became applicable to ideal material particles rather than radiation alone.
Quantum statistics predicted a new collective low-temperature state of matter.
Quantum amplitudes gained an operational probabilistic meaning for experimental outcomes.
Electron optics became an integrated microscopy method rather than only a lens experiment.
A previously hypothetical weakly interacting particle became directly experimentally detectable.
Weak and electromagnetic interactions gained a shared gauge-model architecture.
Electroweak unification gained a concrete broken-symmetry lepton model with testable structure.
A key class of broken gauge theories acquired a defensible perturbative calculation framework.
Eukaryotic origins gained a concrete symbiotic research program, with some proposed components later revised.
Molecular evolution acquired a quantitative neutral alternative to pervasive adaptive explanation.
A physically coupled atmospheric model made CO2-driven temperature response quantitatively tractable under stated assumptions.
Glass fiber became a credible low-loss optical communication medium.
Computers gained a working architecture for distributed high-speed local packet communication.
A fungal compound offered a concrete route to experimentally suppress cholesterol synthesis.
Conducting surfaces became directly mappable through scanning tunnelling current at extremely fine spatial scale.
Hydrated biological material gained a practical path to electron imaging in a glass-like water matrix.
A severe seasonal Antarctic ozone-loss phenomenon became an evidenced scientific problem.
Network names gained a coherent distributed resolution protocol with delegation and caching.
Large biomolecules became amenable to mass spectrometric measurement through multiply charged electrospray ions.
Biological sequence similarity could be searched rapidly across expanding databases.
Tabular model-free action-value learning acquired a stated convergence guarantee under specified conditions.
Practical high-brightness blue semiconductor emission became experimentally demonstrated.
A link-aware, large-scale web-search prototype made a new retrieval architecture concrete.
Individual-cell transcriptomes became directly sequenceable at broad gene coverage in the demonstrated setting.
A concrete architecture for general programmable calculation was expressed, though not realized as a complete working engine.
Programmable calculation was illustrated by a detailed procedure and extended conceptually beyond numerical quantity.
Neural networks became analyzable as formal logical computing structures.
Experience-dependent neural organization became a concrete explanatory research programme linking cells to behavior.
Symbolic proof search became a concrete computational problem-solving method.
A program could improve its checkers decisions through recorded experience and adjustment.
Heuristic search gained a systematic method for minimum-cost paths under stated conditions.
A program could generate chemically constrained structure explanations for measured spectra.
Goal-directed action planning became a concrete symbolic search process over state-changing operators.
Recurrent networks gained a tractable dynamical account of associative recall.
Complex uncertain evidence could be organized as a network of local probabilistic dependencies and propagated computationally.
Medical expert knowledge could be encoded into an interactive system that explained its recommendations.
Prediction could be learned incrementally from temporal differences without waiting for a final outcome.
A structured backpropagation network demonstrated practical handwritten digit recognition.
Interactive computer graphics became a working medium for structured geometric design.
Relational data could be queried through a structured, composable language accessible beyond formal calculus notation.
Module boundaries could be selected around hidden design decisions rather than execution phases.
Replicated systems acquired a precise consensus construction with a stated correctness argument.
Interference became a unifying explanatory principle for light and colours.
A central expected ether-drift signal was not observed at the experiment's sensitivity.
The discrete-charge pattern and numerical elementary charge were measured more precisely.
Atomic-beam behavior gave striking experimental evidence for discrete orientation states.
Scattered X-rays gained a quantitative quantum-mechanical explanation matching wavelength shifts.
Geometric problems could be treated through a systematic algebraic method.
Core analysis concepts were given a more systematic definition-and-proof framework.
Estimator quality and information content became explicit comparative concepts in a likelihood-centered theory.
Exfoliated-cell microscopy became a practical route to detecting uterine carcinoma.
A pharmacologic intervention produced observed temporary remissions in an otherwise severe disease.
Prospective cohort data gave a systematic basis for identifying coronary risk factors.
A plausible bedside surfactant-replacement capability was demonstrated in a small severe neonatal series.
A human cardiac transplantation procedure was performed and publicly reported.
A robust, reusable tree-ensemble method with internal error analysis became available.
An end-to-end recurrent system showed competitive variable-length translation performance.
Neural translation could dynamically select source context instead of relying on one fixed vector.
A surprising, reproducible class of classifier failures became an explicit evaluation target.
Large changing ordered indexes gained a page-efficient balanced data structure with analyzed operations.
A precise record-level privacy criterion linked to a generic noise-calibration mechanism.
Developers could express many large data jobs in a compact model while runtime handled distribution and failures.
A working storage design demonstrated how routine component failure could be managed at large data scale.
Wave–particle duality was extended conceptually from radiation to matter.
A standard way to estimate survival from incomplete event-time observations became available.
Event-time outcomes could be analyzed with covariate effects while leaving baseline hazard unspecified.
Large-corpus word embeddings became cheaper to train while retaining useful linguistic relationships.
A relatively simple policy-update method achieved favorable benchmark tradeoffs.
Complex agents could learn from relatively sparse human preference comparisons in tested environments.
Model-training tradeoffs could be summarized and forecast approximately within measured regimes.
Natural-language prompts could specify many visual categories without task-specific training in the tested benchmarks.
A human-feedback pipeline improved evaluated instruction-following preferences over a larger base model.
An Internet standards-track secure-transport protocol was concretely specified for independent implementations.
A coherent open-participation electronic-cash design linked consensus, economic incentives and transaction verification.
Consensus could be presented and implemented through a comparatively understandable leader-centered decomposition.
Proof could be analyzed not only for convincing power but for what it reveals to a verifier.
Early Web clients and servers could exchange hypertext documents through a minimal interoperable protocol.
Large-project source histories could be managed in a fast distributed model.
Motion could be characterized by quantitative relations and geometrical proofs.
Electrostatic force became quantifiable by a distance law anchored in torsion measurements.
Uranium-associated penetrating emission became a distinct experimental phenomenon.
Electron behavior supplied direct diffraction evidence consistent with matter waves.
A working molecular stimulated-emission oscillator made the maser a demonstrated microwave device.
Radar round-trip delay became a specified observational test of general relativity.
A concrete gauge-theory route to massive vector bosons entered the contemporary symmetry-breaking literature.
Solvability questions could be decided through a structural condition on permutations rather than ad hoc formulas.
Integration acquired a workable condition for bounded functions with discontinuities.
Geometry could be studied as an explicit formal system with separable axiom groups.
Small-sample uncertainty could be calibrated using the estimated rather than known variance.
A general-purpose procedure made linear-programming optimization computationally tractable in practice.
A workable extracorporeal dialyser was reported as a route toward clinical renal replacement.
An anti-oestrogenic candidate showed a reported response signal in late/recurrent breast cancer patients.
CD19-directed engineered T cells showed a high response signal in a hard-to-treat ALL cohort.
A reusable symbolic template for means-ends problem solving was made concrete in a program.
Symbolic AI perception and planning were demonstrated together in a mobile robot research system.
Machine translation became a concrete corpus-estimated probabilistic decoding problem.
Large collections of individual records could be tallied and cross-tabulated electromechanically.
A working electronic stored-program machine demonstrated execution from changeable memory without rewiring.
A practical stored-program calculator's operating architecture and input scheme were explicitly documented.
Programs could reclaim abandoned list structures without users manually freeing each cell.
Interactive multi-user computing was concretely implemented and analyzed on an IBM 7090.
Interactive computing for structured collaborative intellectual work was specified and demonstrated as an integrated environment.
Host-network software questions were formulated in a shared, iterative technical document.
A practical typed systems language enabled substantial operating-system implementation above assembly level.
Objects communicating by messages became a concrete language design in early personal computing.
Large sets of messages or keys could be authenticated with compact root commitment and logarithmic proof data.
A reduced instruction set became a concrete VLSI processor design and performance strategy.
A publicly available 386 Unix-like kernel seed became available for collaborative development.
Membership could be treated as a degree rather than only present or absent.
Convolutional vision and task-level optimization formed a concrete document-recognition system.
A trainable encoder-decoder design produced strong reported biomedical segmentation with scarce annotations.
Tree boosting could be trained at larger scale with explicit algorithmic and systems techniques.
A general-purpose microkernel's C code was linked to its formal specification by a machine-checked proof.
A mature molecular-simulation engine was organized for several complementary hardware parallel scales.
Protein amounts could be measured sensitively with a practical colorimetric procedure.
A direct ground-state approach avoided a fictitious electronic dynamics instability for simulated liquid metals.
Model comparison gained a compact operational estimate of expected information loss.
Agreement became assessable by bias and spread of paired differences rather than association alone.
A simple difference-vector mutation scheme became an implementable global-search heuristic.
Routine measured lipids could yield an LDL estimate without ultracentrifugation in suitable samples.
Quantum states could be represented in phase space for equilibrium-correction calculations.
Correlated measurements could be transformed into ordered orthogonal components for analysis.
A scale-dependent dynamical criterion organized the transition between direct and eddying flow.
The liquid-gas distinction was shown to terminate at a critical point in measured carbon-dioxide behavior.
Complex observer-reliability data could be analyzed with explicit bias and agreement statistics.
Molecular assemblies and simulated trajectories could be examined in one interactive analysis environment.
Study teams could define and capture research data through a repeatable metadata-driven web workflow.
Molecular-structure exploration gained an extensible platform for multiple analysis modes.
Replicated digital-expression counts could be analyzed in an accessible negative-binomial framework.
Existing evolutionary-analysis workflows could handle larger input and tree displays.
A shared package workflow covered microarrays and RNA-seq with broader downstream analyses.
Small interaction energies could be calculated with explicitly balanced computational errors.
Routine gas-exchange observations could be converted into metabolic expenditure with explicit protein treatment.
Transport properties of gases were tied systematically to molecular dynamics and velocity moments.
Binocular depth could be created and investigated with controlled image pairs.
Researchers gained a concrete test of whether index construction itself manufactures association.
Instrument design and spectral interpretation could be tied to diffraction-limited separation.
A recognizable pediatric inflammatory-joint pattern became more legible to clinical classification.
Speech impairment could be analysed by mode of use as well as by vocabulary or lesion location.
Immediate numerical apprehension became experimentally measurable.
Visceral disease could be studied through reproducible patterns of referred sensation.
Pairwise association became a quantified empirical object in anthropometric data.
A low-complexity 32-bit processor became practical in the Acorn setting.
Speech could be generated by controlled components modeled on its acoustic structure.
A coherent public case and recruitment document for GNU became available.
A coherent set of protection-design criteria became available for system designers.
The community had a single citable procedural specification for its standards path.
A shared learning-and-search recipe was demonstrated across three distinct board games.
One IR and tool framework supported multiple languages and optimization stages.
A broad class of processor security assumptions was experimentally falsified.
A robust topological distinction for 2D time-reversal-invariant insulators became available.
A major additive-combinatorial property of primes became proved.
Primality was placed constructively in deterministic P.
A long-standing sphere-packing conjecture received a published proof.
PD-1 became a named molecular object for later functional study.
Checkpoint blockade became a demonstrated antitumor strategy in mouse models.
High-quality novel views could be synthesized from sparse posed images by optimizing a continuous neural field.
Network depth could be treated as a continuous integration variable in trainable models.
Decentralized lookup gained a concrete logarithmic-state and logarithmic-hop construction.
A shared portable low-level target for web execution received a rigorous design and semantics.
A topological Hall phase could be realized in principle without Landau levels.
A predicted 2D topological phase gained material-system experimental evidence.
A rigorous route connected sparse structure, undersampled Fourier measurements and convex reconstruction.
Topological structure became computable across scales as a persistence quantity.
HER2-targeted antibody benefit was demonstrated in a defined metastatic treatment setting.
Technical feasibility of catheter-based aortic valve implantation was shown in one patient.
Therapeutic genome editing showed early human feasibility in two monogenic blood diseases.
Sofosbuvir-based treatment gained pivotal genotype-specific clinical evidence.
A working conversational interface architecture was publicly specified.
Distributed nodes could negotiate task allocation through a reusable protocol pattern.
Storage designers gained a reusable array design space and tradeoff language.
A working at-scale availability-first storage architecture was documented.
The thermal origin of the microwave background gained stringent spectral confirmation.
Gravitational-radiation damping received a demanding astrophysical consistency test.
Optical frequencies became directly countable against microwave references with a comb.
A central Fourier-series convergence question received a positive resolution in L2.
Knot theory gained a powerful new polynomial invariant and bridge to operator algebra.
A faster first-order rate became constructive for smooth convex objectives.
Task-related human cortical activity could be mapped with intrinsic MRI contrast.
Protection against hepatitis B was demonstrated in a rigorous human trial.
Human hand allografting feasibility received a detailed early clinical report.
Machine intelligence became discussable through an explicit behavioral experimental setup.
A practical modular reactive control style was demonstrated.
An autonomous driving stack demonstrated robust extended operation in a defined desert competition.
Architects could quantify why parallel resources alone fail to remove serial bottlenecks.
A durable analytical distinction and testable productivity prediction entered software-engineering discourse.
Interactive verification gained an exact complexity-class characterization.
A new path to sharp nuclear gamma resonance in solids was experimentally identified.
Three-dimensional laser cooling of neutral atoms was demonstrated at roughly 240 microkelvin.
A single experiment tested local-realist constraints without the major locality and detection loopholes.
A compact deterministic model made sensitive, nonperiodic dynamics concrete.
The generalized Poincaré problem was solved in smooth dimensions five and higher.
Multiple testing could target expected false-discovery proportion rather than only any false positive.
A concise repeatable bedside score standardized immediate newborn assessment.
A continuously propagating human cancer-cell strain was available for laboratory research.
Researchers could record small currents with much lower noise and flexible membrane configurations.
A hierarchical neural model demonstrated position-tolerant visual pattern recognition.
Uniform generalization could be analyzed through the complexity of a class of events.
Reported computer procedures for proving large collections of propositional and elementary predicate-calculus theorems and framed a broader programme of machine-assisted formal mathematics.
Specified SIMULA as an ALGOL-based language for discrete-event simulation, including processes, event scheduling and quasi-parallel execution.
Presented the partition-based recursive sorting method now known as Quicksort and analyzed its storage and running-time behavior.
Proposed a short-range interaction between protons and neutrons mediated by a new massive quantum and connected the construction to beta disintegration.
Showed that electromagnetic potentials can produce quantum effects on charged particles in regions where the local fields and forces vanish, and proposed experimental tests.
Related thermal ionization to temperature, pressure and ionization potential and used the relation to explain stellar and solar spectral behavior.
Solved the prescribed-Ricci-form problem for compact Kähler manifolds through the complex Monge–Ampère equation, establishing the Calabi conjecture in the stated setting.
Developed a representation of the stated class of normed rings with involution as operator rings on Hilbert space, forming a foundation for C-star algebra theory.
Proved the modulo 5 and modulo 7 partition congruences and stated a wider family of congruence phenomena for the partition function.
Isolated and serially propagated in striped field mice the etiologic agent of Korean hemorrhagic fever, with patient-serum evidence linking the agent to disease.
Described bacilli recovered from plague buboes in Hong Kong, their cultivation and animal-inoculation observations supporting a causal role in bubonic plague.
Reported a repeatable procedure for fertilizing rabbit ova in vitro and evidence for normal in-vivo development after transfer of the fertilized ova.
Presented CYC as a long-term effort to build a large common-sense knowledge base intended to reduce brittleness and knowledge-acquisition bottlenecks in artificial-intelligence systems.
Developed procedures for deriving structured descriptions of polyhedral three-dimensional objects from line drawings and photographs and for using those descriptions in scene analysis.
Introduced a wake–sleep learning procedure that alternately adapts bottom-up recognition connections and top-down generative connections in multilayer neural networks.
Analyzed risks in a sequential large-software development process and proposed added design, documentation, pilot development, testing and customer-involvement steps to reduce them.
Provided the first-edition reference and tutorial for C++, documenting its C-compatible design together with type checking, data abstraction, operator overloading and object-oriented programming facilities.
Described Bigtable’s sparse distributed multidimensional data model, design and implementation for structured data at petabyte scale across thousands of commodity servers.
Reported a caesium resonator apparatus operated as an atomic standard of frequency and time interval at the National Physical Laboratory.
Reported a stable single-beam gradient-force optical trap for dielectric particles in water over sizes from roughly ten micrometres to about twenty-five nanometres.
Developed a topological-defect account of ordering and phase-transition behavior in two-dimensional systems, including vortex-pair binding and unbinding.
Presented a hierarchical algorithm evaluating Coulombic or gravitational interactions for N particles with work proportional to N to the stated accuracy, instead of direct quadratic pairwise evaluation.
Used moduli spaces of anti-self-dual connections to derive strong restrictions on intersection forms of smooth simply connected four-manifolds.
Introduced the lasso for linear-model estimation, constraining the sum of absolute coefficient values so that some coefficients become exactly zero while retaining shrinkage stability.
Reported early clinical application of a mechanical heart–lung apparatus to permit intracardiac surgery under direct vision.
Reported biochemical evidence that the scrapie agent required a protein for infectivity, resisted procedures targeting nucleic acids and warranted the proposed term prion.
Demonstrated genetically targeted expression of channelrhodopsin-2 in neurons and millisecond-timescale control of neuronal spiking with light.
Presented a modular ACTOR formalism in which computational agents communicate by messages, with the architecture intended to expose parallelism and support artificial-intelligence systems.
Introduced latent Dirichlet allocation as a generative probabilistic model for collections of discrete data, with documents represented through mixtures of latent topics.
Presented TREPAN, which queries a trained neural network to induce a compact decision tree intended to approximate the network while making its learned behavior more comprehensible.
Described the conceptual memex and associative trails as a way for an individual to store, consult and connect records beyond conventional indexing.
Introduced cuckoo hashing, using two hash tables and displacement of existing keys to obtain constant worst-case lookup time with expected constant amortized update time under the paper’s model.
Described the Tesla unified graphics and computing architecture and its massively multithreaded processor design for graphics and general-purpose parallel workloads.
Formulated similarity hypotheses for the local statistical structure of high-Reynolds-number incompressible turbulence in the small-scale range governed by viscosity and dissipation.
Developed hydromagnetic models for the regeneration and amplification of magnetic fields in rotating conducting fluids, including wave-like behavior connected to solar magnetic activity.
Measured interaction cross sections for light isotopes and inferred unexpectedly large matter radii for neutron-rich nuclei, including the lithium isotopes highlighted in the paper.
Constructed orthonormal bases of compactly supported wavelets with arbitrarily high regularity, with regularity increasing with support width.
Introduced the foundational definitions and mutation framework for cluster algebras, a class of commutative rings generated by overlapping clusters of variables.
Positional cloning identified the mouse obese gene and its human homologue and supported a model in which its product participates in signalling from adipose tissue to regulate body-fat stores.
Reported fertilization, embryo transfer, pregnancies and live births after direct intracytoplasmic injection of a single spermatozoon in couples with severe male-factor infertility and prior assisted-fertilization failure.
Described a combined PET/CT tomograph that acquired co-registered functional and anatomical images in one session and reported performance measurements and clinical studies in more than 110 oncology patients.
Introduced a stochastic parallel-network learning rule derived from statistical-mechanical search, adjusting connection strengths so that the network learns internal representations of task constraints.
Established an iterative transformation and inequality for maximizing likelihoods in a broad class of probabilistic functions of Markov chains, forming the core of the Baum–Welch estimation procedure.
Articulated a Web architecture in which machine-processable meaning, shared ontologies and reasoning rules enable software agents and people to cooperate over linked information.
Introduced the domain-style namespace, distributed name servers, resolvers, resource records, delegation and caching framework for Internet host, mail and other resource naming.
Argued that simpler instruction sets and control could improve processor performance by avoiding costs imposed by increasingly complex instruction-set designs.
Specified the monitor as a structured synchronization mechanism that combines shared data, procedures and condition variables for controlling concurrent processes.
Formulated the end-to-end argument that certain functions can be implemented completely and correctly only with application-level knowledge, constraining what lower communication layers should provide.
Derived an equality connecting an equilibrium free-energy difference to an exponential average of work measured over finite-time nonequilibrium switching processes.
Measured a 650 ± 150 attosecond soft-X-ray pulse and its synchronization with the driving light field, demonstrating access to sub-femtosecond electronic dynamics.
Reported WMAP’s first-year full-sky microwave maps in five frequency bands, separated foreground emission and characterized calibration, anisotropy statistics and basic cosmological results.
Developed a general theory of complete normed linear spaces and included the contraction fixed-point principle for proving existence and uniqueness by successive approximation.
Introduced and analyzed the Ricci-flow evolution equation to show that a compact three-manifold with positive Ricci curvature admits a metric of constant positive curvature.
Introduced least angle regression as a model-selection algorithm and showed modifications that efficiently trace lasso and forward-stagewise regression paths.
Developed a deterministic compartmental epidemic model with susceptible, infected and removed populations, deriving threshold and final-size behavior for a single outbreak.
Synthesized epidemiological evidence across exposure categories and produced bounded quantitative estimates of the proportions of United States cancer mortality attributable to potentially avoidable causes.
Synthesized cancer biology into six acquired functional capabilities proposed as an organizing framework for understanding multistep tumor development.
Presented a general expectation–maximization framework for iteratively computing maximum-likelihood estimates from incomplete-data problems and established monotonic likelihood behavior under its stated conditions.
Introduced a supervised modular learning procedure in which a gating network allocates cases among expert networks and learning localizes weight changes to the experts responsible for each subtask.
Formulated sequence induction using priors tied to the lengths of programs for a universal Turing machine and related several models of inductive prediction to a Bayesian formulation.
Presented a language-oriented approach in which user-defined abstractions are specified through their operations and behavior while hiding representation details, enabling extensible high-level programming.
Argued that unrestricted go-to statements obstruct useful coordinates for reasoning about program progress and advocated structured control constructs that preserve intelligible program structure.
Systematized requirements for military cryptography, including the principle that a cryptosystem should remain secure even when everything about the system except the key is public knowledge.
Derived symmetry relations between coupled linear irreversible fluxes and forces from microscopic reversibility and connected them to a generalized dissipation function.
Developed a statistical-mechanical linear-response theory expressing transport and response coefficients through equilibrium time-correlation functions for magnetic and conduction problems.
Showed that quantum effects cause black holes to emit an approximately thermal particle spectrum with a temperature set by surface gravity, linking quantum field theory, gravitation and thermodynamics.
Announced a general formula identifying the analytical index of an elliptic operator on a compact oriented differentiable manifold with a topological expression, encompassing major special cases.
Introduced categories, functors and natural equivalences as a general language for expressing mappings, constructions and naturality across algebra and topology.
Developed homological algebra in broad abelian-category settings and established structural conditions supporting injective objects and derived-functor methods beyond module categories.
Set out nine considerations for judging whether an observed association can reasonably receive a causal interpretation in occupational and environmental epidemiology.
Developed stratified procedures for testing association and estimating a common relative risk from retrospective disease-study data while controlling categorical confounding factors.
Developed and validated a weighted comorbidity index for estimating mortality risk in longitudinal studies using development and independent follow-up cohorts.
Defined a class of two-player zero-sum stochastic games with state transitions and proved the existence and characterization of values for the discounted finite-state setting treated in the paper.
Described the ID3 approach to synthesizing decision trees from examples and examined extensions for noisy or incomplete information and a stated shortcoming of the basic procedure.
Formulated model selection by minimizing the description length of observed data under a model, jointly addressing discrete model structure and real-valued parameter estimation.
Developed an information-theoretic framework for secrecy systems, including formal treatment of equivocation and perfect secrecy under the paper’s stated assumptions.
Demonstrated how a compiler can be modified to insert a Trojan horse into target programs and reproduce the attack when compiling a clean compiler source, exposing a source-level verification limit.
Formulated non-relativistic quantum mechanics through sums of complex contributions over paths and connected the construction to the Schrödinger equation and operator formulation.
Presented a disordered-lattice model in which sufficiently strong randomness localizes states and prevents diffusion, with criteria for the onset of transport in the model.
Developed a phenomenological order-parameter theory of superconductivity with coupled equations for spatial variation and electromagnetic response near the transition.
Established finite and infinite homogeneous-set results now known as Ramsey’s theorem while addressing a restricted decision problem in formal logic.
Analyzed an abstract closure operation through axioms for extensivity, union preservation, the empty set and idempotence, helping formalize topological structure through closure.
Developed multistage numerical approximations for ordinary differential equations that evaluate derivatives at intermediate points instead of requiring higher analytic derivatives.
Extended Runge’s multistage approach and systematically derived explicit formulas of several orders, including the four-stage fourth-order scheme associated with the classical Runge–Kutta method.
Reported string-galvanometer registration of the human electrocardiogram and compared it with capillary-electrometer recording, establishing a substantially improved physiological measurement method.
Described operative vascular-anastomosis techniques, including triangulation and vessel suturing intended to restore circulation for experimental transplantation work.
Reported percutaneous transluminal coronary angioplasty using a balloon-catheter system and described the procedure and observed outcomes in the paper’s treated patients.
Proposed frames as structured data representations for stereotyped situations, carrying expectations, defaults and procedures for adapting stored knowledge to a current situation.
Defined the SHAP framework for local feature attribution, identified a class of additive feature-attribution methods and gave uniqueness results under the paper’s stated properties.
Presented a multi-agent actor-critic method using centralized critics during training and decentralized policies at execution, evaluated in cooperative, competitive and mixed environments.
Analyzed approximate membership structures that reduce storage by allowing bounded false-positive membership errors, including the bit-array method now associated with Bloom filters.
Described a peer-to-peer key-value lookup system organized by an XOR distance metric, with symmetric routing information, parallel asynchronous queries and stated consistency and performance properties.
Explained the LINPACK benchmark based on solving dense systems of linear equations and set out how the computation and reported performance were organized for comparing high-performance systems.
Used numerical experiments on a nonlinear oscillator chain to test energy sharing among modes and observed unexpected recurrence rather than the anticipated rapid approach to equipartition.
Used numerical study of the Korteweg–de Vries equation to exhibit stable interacting solitary waves, introduced the term soliton and connected their interactions to recurrence.
Analyzed electromagnetic propagation when electric permittivity and magnetic permeability are simultaneously negative, deriving reversed relations among wave, energy-flow and refraction directions.
Developed invariants and constructions for manifolds, including homology, Betti numbers and the fundamental group, helping establish algebraic topology as a systematic field.
Unified dependent and polymorphic typing in a constructive calculus for proofs and programs.
Built regularity structures, modelled distributions, reconstruction and renormalized solutions for broad singular SPDEs.
Demonstrated monkey protection and antibody response in eight human recipients of cultured virus.
Established long-term self-organization of mouse intestinal epithelium from one Lgr5+ stem cell without mesenchymal niche.
Model-guided small-molecule ACE inhibitors showed oral activity and blood-pressure lowering in rats.
Derived stochastic weight updates following the gradient of expected reinforcement in the paper's model.
Derived adaptive boosting without advance weak-learner performance knowledge in a general decision-theoretic framework.
Specified dropout training and test-time approximation, reporting benchmark generalization gains.
Proved undirected st-connectivity in deterministic logarithmic space.
Provided integrated language-and-tool exposition, examples and a reference for writing and checking specifications.
Machine-checked semantic preservation for a Cminor-to-PowerPC lightly optimizing back-end.
Quantified universal scaling constants for a class of maps and introduced a renormalization fixed-point mechanism.
Derived tunable effective permeability from subwavelength nonmagnetic conducting microstructures.
Analyzed amplification of evanescent components through an idealized negative-index slab.
Analyzed emergence of periodic solutions near an equilibrium as characteristic exponents cross.
Posed least-cost transfer of excavated earth to fill locations as a geometric optimization problem.
Developed hyperbolic groups through Cayley-graph geometry, boundaries and algorithmic consequences.
Linked a distinctive clinical course in Auguste Deter to plaques and intracellular fibrillary changes.
Published reproducible scalp electrical recordings and rhythmic human EEG observations.
Identified a case-series association between maternal early-pregnancy rubella and infant cataracts and other anomalies.
Integrated trainable mini-batch normalization into deep networks, accelerating reported experiments.
Combined first/second moment adaptation and bias correction in a practical stochastic optimizer.
Unified image-to-box/class prediction in one network with reported real-time operation.
Published a general plan-calculus notation for schematic-combinatorial problems.
Described regenerative cathode-ray charge storage and operation in a digital memory.
Presented packet-conservation-based congestion avoidance, slow start and adaptive controls.
Compared mappings with integrations and matched chaotic-zone boundary to the observed 3/1 gap.
Showed deterministic Boolean lattice gases can simulate Navier–Stokes hydrodynamics.
Reported sensitive electron-counting tube for weak ionizing radiation.
Introduced systematic quantified formal inference in an arithmetic-like concept script.
Established lower bounds for monotone complexity of the logical permanent.
Proved l2 decoupling for positively curved compact hypersurfaces and the cone.
Reported transmission-ultrasound hyperphonography of the human head.
Reported 36 uncomplicated coelioscopic cholecystectomies with short-term outcomes.
Reported early human self-expanding stent implantation in coronary and peripheral arteries.
Developed resolution as a machine-oriented first-order inference principle.
Documented operational rule-based configuration of VAX orders at DEC.
Combined local surrogate fitting with representative submodular explanation selection.
Patented photoelectric pattern matching between search plate and records.
Introduced immutable partitioned datasets with lineage recomputation and evaluated Spark implementation.
Specified modular user-level ISA base and extensions in a public technical report.
Used star counts and nebula observations to propose structured stellar-system geography.
Implemented perpendicular-path interferometric test for ether-drift prediction.
Reported three correlated decay chains assigned to isotope 294 of element 118.
Derived comparison and zero-location results for second-order linear ODEs.
Accelerated shrinkage-thresholding iterations with proven objective-rate improvement.
Packaged forty concise MATLAB examples into a computational spectral-method teaching framework.
Reported small superficial skin-piece grafting onto granulating wounds.
Reported central/lower face allograft feasibility and four-month recipient course.
Validated multiplexed sequencing against karyotyping in high-risk pregnancies, with protocol-dependent performance.
Set out flow-diagram, planning and coding discipline for electronic numerical computation.
Numerically sampled 2501 five-billion-year orbits including lunar and relativistic effects, finding rare collisional paths.
Reported curved bacteria on gastric epithelium with active chronic gastritis in the 1983 Lancet correspondence.
Characterized iron-dependent nonapoptotic cell death and ferrostatin-sensitive oxidative mechanism.
Made target-trial protocols explicit for emulating comparisons in observational databases.
Showed selective inhibition of Bcr-Abl-positive cells, tumors and CML colony formation.
Combined apparatus, surgical diagnosis and infant/pregnancy imaging sections.
In 20 inpatient adults, randomized two-week diet order produced higher ad-libitum intake and short-term weight gain on ultra-processed food.
Observed a transverse electrical effect in a current-carrying conductor under magnetic field.
Connected metric completeness with global geodesic existence and related properties for surfaces.
Developed concentration and isoperimetric inequalities across product probability spaces.
Constructed conditional conformally invariant scaling-limit candidate via Brownian Loewner evolution.
Built sound homotopy-theoretic models of identity types under model-category hypotheses.
Recorded preparation, dosing, diuresis and toxicity across dropsy cases.
Designed a method to illuminate and inspect the living retinal fundus.
Proposed cooperative stereo correspondence and demonstrated disparity extraction.
Presented input/output primitives and parallel composition as CSP program structure.
Derived path-dependent geometric phase for adiabatic closed parameter circuits.
Proved positive-upper-density sets contain arbitrarily long finite arithmetic progressions.
Presented original CONSORT checklist and flow-diagram framework for reporting randomized trials.
Applied weighted-sample Bayesian position belief to efficient mobile-robot localization.
Applied confidence-guided sampling to planning trees with stated consistency result.
Documented Deep Blue's parallel search, evaluation and database design for 1997 match.
Presented Mach kernel foundation with threads, virtual memory and communication.
Specified stable Haskell 98 language and standard libraries.
Documented integrated Alto workstation hardware and interaction facilities.
Predicted attractive force for ideal conducting parallel plates from altered modes.
Related forward/reverse nonequilibrium work statistics to free-energy difference under microscopic reversibility.
Established finiteness theorems for abelian varieties yielding Mordell rational-point finiteness.
Established a smooth isometric embedding existence theorem for broad Riemannian manifolds in Euclidean space.
Proved the fundamental lemma for Lie algebras and Waldspurger variant using geometric methods.
Reported suppression of tremor with high-frequency VIM stimulation in a small surgical series.
Demonstrated early renal-allograft clinical promise in seven recipients while documenting serious toxicity.
Documented substantial symptomatic response under slowly escalated chronic oral L-Dopa in 28 patients.
Proposed the Advice Taker architecture: formal common knowledge and deduction of action-relevant consequences.
Defined resource-bounded learnability protocols and proved learnability for nontrivial propositional classes.
Organized five concrete ML accident-risk problems and research directions.
Explained THE as a layered hierarchy of cooperating sequential processes enabling tractable system design.
Presented an integrated personal dynamic-media vision and interim Smalltalk-based implementation.
Engineered and evaluated a usable RPC package covering binding, semantics, transport and exceptions.
Constructed a real representation allowing a neutral spin-half particle to coincide with its antiparticle.
Synthesized an argument for emergent organizing principles at higher complexity.
Constructed seven-manifolds homeomorphic but not diffeomorphic to the standard sphere.
Presented the geometrization picture for compact three-manifolds and surveyed supporting geometry and topology.
Proved existence of deformation quantization for finite-dimensional Poisson manifolds via a stronger formality result.
Organized criteria for when screening is justified, including test, treatment, natural history, facilities, cost and continuity.
Described the prospective Framingham design with standardized recurring examinations in a defined population.
Derived greedy layer-wise training for deep belief networks using restricted Boltzmann machines and complementary priors.
Integrated graphical independence and local belief propagation into a systematic book-length framework.
Defined corpus BLEU from clipped n-gram precision and brevity penalty with reported human-correlation checks.
Constructed an optimal prefix-code algorithm for given finite symbol weights.
Developed a universal sequential parsing compressor with asymptotic bounds for constrained individual sequences.
Introduced randomized multilevel skip lists with expected logarithmic operations.
Measured the hydrogen fine-structure separation now called the Lamb shift.
Measured the gravitational frequency shift of photons over a laboratory height.
Predicted DC and AC pair currents and radio-frequency-induced voltage relations across a barrier.
Proved finite equidecomposition of bounded subsets with interior in dimensions at least three.
Proved the Riemann-hypothesis component of the Weil conjectures by weight arguments.
Established projective algebraic–analytic equivalence and matching coherent-sheaf cohomology.
Reported a new beta-adrenergic antagonist and early pharmacological/clinical effects.
Found inverse employment-grade gradient in CHD mortality in 17,530 civil servants.
Separated causes of individual cases from causes of population incidence and contrasted prevention strategies.
Introduced planning graphs and Graphplan search/extraction for STRIPS-like tasks.
Presented integrated statistical estimation and decoding methods for continuous speech recognition.
Demonstrated self-play temporal-difference neural learning in a strong backgammon system.
Introduced dynamic R-tree indexing and search/update algorithms for spatial objects with extent.
Described an extensible process-oriented nucleus separating basic process/communication functions.
Described an implemented one-level store using automatic block transfers and address translation.
Introduced density-matrix truncation for real-space quantum renormalization and showed strong chain results.
Combined electronic-structure calculation and molecular dynamics in a unified simulation scheme.
Proved a Gaussian limiting law for normalized additive arithmetic functions including distinct prime-factor counts.
Gave a projective interior-point algorithm with polynomial worst-case convergence.
Established fixed-point structure for monotone self-maps of complete lattices and developed applications.
Introduced mouse spleen-colony readout for proliferative marrow cells and radiation sensitivity.
Detected Tetrahymena extract activity adding telomeric repeats to primers.
Showed wild-type p53 suppresses oncogene-driven transformation in rat fibroblast assays.
Presented error-driven trainable adaptive switching circuits and ADALINE demonstrations.
Integrated syntax, semantics, inference and action in a restricted blocks-world dialogue system.
Defined persistent intention using a modal structure of choice, commitment, belief and action.
Constructed local-rule examples that converge to legitimacy from arbitrary states.
Implemented Sprite LFS with sequential log segments and segment cleaning.
Synthesized defining principles of direct manipulation for interface design.
Showed accelerated particle-detector response in flat vacuum and analyzed its black-hole analogy.
Defined measurable higher-order field-correlation functions and coherence hierarchy.
Introduced molecular-beam RF resonance to measure nuclear magnetic moments.
Established set-representation methods for Boolean algebras via ideal-based constructions.
Introduced resampling from empirical data to estimate a statistic's sampling distribution and linked jackknife approximation.
Studied fixed-edge labelled random graphs and derived connectivity/isolated-vertex threshold behavior.
Defined eye, verbal and motor response categories for practical consciousness assessment.
Observed herpes-like virus particles in cultured Burkitt-lymphoma lymphoblasts.
Reported the serum antigen system later recognized as Australia antigen.
Designed Rete to retain partial matches and update many-pattern/many-object matching efficiently.
Combined associative search and adaptive critic elements to learn cart-pole control without equations.
Connected BDI concepts to an agent architecture and applications.
Organized design hints on interfaces, implementation, faults and completeness.
Constructed finite-field polynomial evaluation codes with strong symbol-error correction.
Reconstructed and prioritized Internet design goals including survivability, service diversity and fate sharing.
Proposed exponential early expansion to address horizon and flatness, while identifying exit difficulties.
Derived an experimentally usable inequality and optical test proposal.
Demonstrated nuclear magnetic induction in bulk matter with RF fields and pickup coils.
Proved every finite group of odd order is solvable.
Established resolution of singularities for algebraic varieties in characteristic zero across two papers.
Developed a multidimensional sieve proving bounded intervals with arbitrarily many primes for fixed multiplicity.
Cultivated Lansing poliovirus in several human embryonic tissues outside nervous tissue.
Argued for systematic distinction of effectiveness and efficiency and greater use of randomized evidence.
Demonstrated extracted penicillin's protection in infected mice with toxicity and assay observations.
Encoded bounded planning as satisfiability and used SAT search for plans.
Unified partial-observability planning and presented offline solution/controller extraction methods.
Jointly learned distributed word embeddings and neural sequence probabilities with reported corpus gains.
Defined sequential consistency and sufficient ordering requirements for multiprocess execution.
Proposed symmetric/public-key authentication protocols and message-integrity uses.
Derived linear-time strongly connected and biconnected component algorithms using DFS.
Exactly evaluated zero-field two-dimensional Ising partition function and critical behavior.
Proposed horizon-area entropy and a generalized second law.
Formulated low-energy quasiparticle description and interactions near the Fermi surface.
Introduced higher algebraic K-group constructions and structural results for exact categories.
Built multiple-recurrence ergodic framework and gave a new proof of Szemerédi's theorem.
Completed proof that finite graphs are well-quasi-ordered by minors.
Presented a simple noniterative random-effects meta-analysis procedure.
Developed three-item trial-report score and compared blind/open rating.
Clarified evidence-based medicine as integration of clinical expertise and best external evidence.
Reduced sequential imitation to no-regret learning and introduced iterative data aggregation.
Proposed attribution axioms and integrated gradients using a baseline path integral.
Planned with a learned reward/policy/value model and reported strong Atari and board-game results.
Introduced viewstamp-based replication to preserve ordering across modeled crashes and communication failures.
Proved a consistency–availability impossibility under the stated asynchronous partition model.
Specified conditions and examples for deterministic convergence of independently updated replicas.
Connected logical irreversibility to unavoidable entropy generation in switching models.
Introduced a simplified narrow-band interacting-electron model and approximate solution.
Proposed incompressible quantum-fluid wavefunctions and fractionally charged excitations.
Related indices and counts of critical points to global topological invariants.
Systematically developed schemes in EGA I as a reusable foundation.
Formulated multiplier necessary conditions and saddle-point analysis for nonlinear constraints.
Proposed staged epidemiologic-transition framework linking disease and mortality changes to social development.
Linked archived infant weights to later ischaemic-heart mortality in traced Hertfordshire men.
Reported an enzyme-linked quantitative immunoglobulin G assay.
Injected trainable low-rank updates while freezing pretrained Transformer weights, with measured parameter and memory savings.
Demonstrated that few-shot exemplars with intermediate steps can improve several reported reasoning benchmarks for large language models.
Coupled a seq2seq generator to a dense Wikipedia index and compared sequence-level and token-level latent retrieval for generation.
Introduced minimally disruptive consistent hashing within probabilistically analyzed distributed caching protocols.
Used right-to-left comparisons plus bad-character and good-suffix shifts to skip text positions efficiently.
Documented a global replicated database whose TrueTime uncertainty bounds support externally consistent transactions and timestamped reads.
Derived a logarithmic scattering-resistivity term from perturbative s-d exchange, explaining the observed minimum under stated assumptions.
Formulated lattice gauge quantization and exhibited confinement in a computable strong-coupling limit.
Proposed concrete CFT/string-theory dual descriptions in anti-de Sitter product geometries with parameter-regime arguments.
Proved topological four-manifold existence/classification results through intersection-form methods, including the topological four-dimensional Poincare consequence.
Established a parabolic Hausdorff-measure bound on the singular set of suitable three-dimensional weak solutions.
Proved that a finitely generated group of polynomial growth is virtually nilpotent.
Reported feasible repeated intermittent hemodialysis for chronic uremia in an early preliminary clinical series.
Documented long-term implantation and sustained electronic cochlear stimulation in a human participant.
In a prospective double-blind 100-patient study, related eradication under tested regimens to healing and lower duodenal-ulcer relapse.
Integrated HMM inference, decoding, learning and practical speech implementation into a detailed engineering tutorial.
Provided rigorous analysis of representational limits and capabilities for specified perceptron classes.
Specified a mental-state-based agent programming framework with communication primitives and an implemented interpreter.
Introduced a marker-based algorithm to record a consistent distributed snapshot and detect stable properties.
Formalized time-bounded multitape computation and derived hierarchy and simulation results.
Distinguished hierarchy roles and articulated that subtype behavior must support use wherever its supertype is expected.
Observed two-pion decays of the long-lived neutral kaon inconsistent with exact CP conservation.
Proved absence of ferromagnetic and antiferromagnetic order in specified one- and two-dimensional isotropic Heisenberg models.
Worked out nuclear reaction cycles, especially the catalytic carbon-nitrogen route, under stellar conditions.
Introduced linear logic with resource-sensitive connectives, modalities and proof rules.
Analyzed the Yang-Mills functional on Riemann surfaces through equivariant Morse theory and extracted moduli-space topology.
Built perfectoid rings and spaces and a tilting correspondence, yielding almost-purity and stated weight-monodromy cases.
Used electrophoresis to distinguish normal, disease and trait hemoglobin, supporting a molecular-disease account.
Reported a recurrent minute chromosome in seven chronic-granulocytic-leukemia cases and suggested disease relevance.
Transferred size-separated DNA fragments to a filter and probed complementary sequences by labeled hybridization.
Proved density of finite superpositions of continuous sigmoids in continuous functions on a compact cube.
Demonstrated an Elman-style recurrent context network on structured temporal and simple linguistic sequences.
Developed temperature-softened knowledge distillation and reported compact-student and specialist results.
Formulated probabilistic encryption and computational indistinguishability with a quadratic-residuosity-based scheme.
Specified a temporal-logic check for finite-state synchronization skeletons and discussed synthesis.
Introduced Fibonacci heaps with amortized bounds improving several asymptotic network-optimization results.
Formulated a contact-interaction beta-decay theory with electron and neutrino creation in nuclear transitions.
Constructed a four-dimensional topological quantum field model relating observables to Donaldson and Floer structures.
Developed a two-dimensional anyonic scheme for encoding and manipulating quantum information topologically.
Proved the maximum size of a pairwise-intersecting uniform family under the stated ground-set condition.
Organized invariant-theoretic quotients through stable and semistable loci for algebraic-geometric moduli problems.
Formulated conjectural links between automorphic representations and Galois or Weil-group data in the 1967 letter.
Issued a short clinical warning linking maternal thalidomide use to a characteristic pattern of congenital abnormalities.
Reported selected platinum compounds' antitumour activity in mouse models.
Isolated a cDNA clone derived from the hepatitis C agent and linked it to antigenic evidence.
Proved correctness and analyzed bounded search effort and optimality under specified game-tree models.
Introduced Church's Lisp-like generative-model semantics, conditioning, memoization and generic inference examples.
Argued for situated intelligence without a centralized explicit world representation, grounded in behavior-based robotics.
Gave the bakery ticket algorithm and a correctness argument tolerant of overlapping reads and writes returning arbitrary values.
Described BitTorrent's piece exchange, peer incentives and load-distribution mechanisms.
Presented Xen paravirtualization and evaluated resource management and performance across commodity OS workloads.
Proposed quark constituents with fractional quantum numbers to organize baryon and meson multiplets.
Analyzed CP violation in a renormalizable theory and proposed extended quark-family mixing possibilities.
Used strong spin-orbit splitting to explain closed shells and observed nuclear spins in Part II.
Established existence of nonzero translation-invariant measure for the groups under the paper's topological assumptions.
Proved the condition for choosing distinct representatives from each set in a finite family.
The 1951 paper made the finite-game proof more direct and added symmetry and equilibrium-set structure beyond the 1950 existence note.
Proposed antigen selection and expansion of pre-existing lymphocyte clones to explain antibody specificity and memory.
Mapped motor and sensory responses during human cortical stimulation, revealing ordered unequal somatic representation.
Distinguished two reproducible cytokine and lymphokine patterns among antigen-specific murine helper T-cell clones.
Proposed computer translation as a research programme using cryptography, statistics, information theory and context.
Synthesized computational, algorithmic and implementation levels in a staged theory of visual representation.
Developed belief functions and a combination calculus as a coherent evidence-theoretic framework.
Described deployed Chubby locking, leader election, metadata and caching under operational constraints.
Bound data directly to native document elements and applied dynamic transforms in D3.
Presented a one-pass COBOL compiler design with separable coroutine modules and measured prototype components.
Measured subpicosecond arrival-time differences via two-photon interference from parametric down-conversion.
Modeled coupling of collective nuclear-surface oscillations with individual nucleon motion.
Argued that quantum physics suggests computational resources different from ordinary classical digital simulation.
Proved recovery from specified integral data under stated regularity assumptions.
Developed conjugate-gradient algorithms for SPD systems with finite-step exact-arithmetic properties.
Extended labelled-tree enumeration with degree-sensitive formulas in the 1889 note.
Proposed faster two- or three-dimensional spin-density imaging using echo trains and time-dependent gradients.
Reported self-inoculation, bacterial colonization and histologically verified acute gastritis in one volunteer.
Reported six selected patients receiving subgenual-cingulate stimulation with clinical and blood-flow observations.
Developed mathematical and machine-oriented models of neural-analog reinforcement learning.
Described sensor-circuit tortoises exhibiting exploratory, phototactic and recharging behavior.
Defined Dec-MDP/Dec-POMDP decision problems and proved NEXP-level complexity under formal assumptions.
Proved PCP-type verification for NP and conditional hardness-of-approximation consequences.
Introduced Count-Min sketch with compact randomized counters and stated point, range and inner-product error bounds.
Described automatic printing-telegraph enciphering by combining message and key signals.
Developed statistical correlations and length/time scales for homogeneous turbulent motion in Part I.
Proposed color-screening suppression of J/psi formation as a plasma indicator.
Measured relative harmonic phases and inferred a phase-locked train of roughly 250-attosecond pulses.
Analyzed mesh-limit convergence and characteristic-dependent restrictions for hyperbolic difference problems.
Proved a coefficient-based polynomial nonvanishing criterion and applied it to discrete problems.
Demonstrated in-vitro OCT cross sections of retina and coronary tissue at micrometre scale.
Derived and characterized human embryonic stem-cell lines with sustained pluripotent traits.
Transmitted chicken sarcoma using cell-free filtrate, implicating a filterable agent.
A local-neighbourhood learning process ordered feature representations into topology-preserving maps, illustrated analytically and by simulation.
Set out backpropagation through time for dynamic systems, propagating sensitivities over an unfolded temporal computation.
Established polynomial-time reductions showing twenty-one specified combinatorial problems NP-complete.
Introduced a seven-multiplication 2-by-2 construction and recursive subcubic matrix multiplication, with related elimination consequences.
Built a finite-state multi-keyword matcher with preprocessing and text scan time linear in input size plus reported occurrences.
Derived electron wave behaviour in an ideal periodic crystal potential and consequences for motion and conduction.
Calculated transverse electromagnetic-hydrodynamic waves in a magnetized conducting fluid.
Observed correlated detector-output intensity fluctuations from two beams of light and connected them to optical intensity interferometry.
Proved invariance of domain for continuous one-to-one maps between equal-dimensional Euclidean regions.
Proved the Bieberbach coefficient bounds in full for normalized univalent analytic maps of the disk.
Developed pseudo-holomorphic curves and applied compactness and existence arguments to symplectic-geometric constraints.
Derived and tested a serum-creatinine, age and weight equation for predicting creatinine clearance, with a female adjustment.
Fitted and assessed categorical risk-factor equations for coronary heart disease using Framingham follow-up.
Reported lower observed major complications and deaths following multicentre implementation of the surgical safety checklist.
Introduced contrastive divergence as a tractable approximate learning objective and demonstrated product-of-experts training.
Adapted influence-function approximations with Hessian-vector methods to rank training-point effects on learned predictions.
Formulated Harmony Theory as a mathematical dynamical account of subsymbolic representations and processing.
Proved NEXP has no polynomial-size nonuniform ACC circuits via a faster-satisfiability-to-lower-bound connection.
Defined the working set and linked its size to paging-resource allocation and process demand.
Associated assertions with flowchart points and gave rules for checking program partial correctness and termination.
Proposed baryon-number violation, C/CP asymmetry and nonequilibrium dynamics as enabling conditions for cosmological baryon asymmetry.
Proved null geodesic incompleteness from trapped-surface, causal and energy hypotheses without exact spherical symmetry.
Reported a sharp heavy-particle J signal around 3.1 GeV in Brookhaven collision data.
Built a new quantitative proof using higher-order uniformity and additive-combinatorial structure.
Introduced the theta upper bound and determined the five-cycle's Shannon capacity.
Constructed a Chern-Simons field-theory account of the Jones polynomial and related three-manifold invariants.
Developed and assessed an ICU severity score from acute physiology, age and chronic health status.
Standardized one-dimensional lesion measurement and categorical solid-tumour treatment-response assessment in RECIST 1.0.
Validated the laboratory-variable survival model in four independent liver-disease cohorts.
Defined a CTC objective and decoding scheme that sums over alignments to train recurrent sequence labellers from unsegmented targets.
Coupled a neural controller to differentiable read/write memory and demonstrated copying, sorting and associative recall.
Derived a scalable first-order graph convolutional propagation rule and evaluated node classification on citation and knowledge-graph data.
Found maximum-cardinality bipartite matchings in O((m+n)sqrt(n)) steps via shortest-augmenting-path phases.
Presented and implemented an optimized Byzantine-fault-tolerant state-machine replication protocol with an NFS evaluation.
Used matched-prefix structure to search a text for all occurrences of one pattern in linear combined length.
Measured magnetic-field redistribution across the transition in lead and tin, establishing flux-expulsion behaviour.
Formulated a collisionless distribution-function description for collective electron-gas oscillations.
Derived an expanding transonic solar wind and the magnetic-field geometry generated by solar rotation.
Established a local probabilistic nonoccurrence lemma within the hypergraph-colouring analysis.
Gave a randomized bad-event resampling algorithm with an analysis making the variable form of the local lemma constructive.
Developed transversality and realization methods and derived foundational unoriented cobordism results.
Demonstrated antiglobulin-mediated agglutination of sensitized red cells in the 1945 laboratory paper.
Presented a structured mini-mental examination and initial clinical differentiation results.
Specified the SOFA scoring categories across six organ systems in a consensus-development paper.
Introduced bootstrap aggregating of predictors by averaging or voting over bootstrap-trained models.
Converted classifiers into fully convolutional pixel predictors and fused coarse and fine features via skip connections.
Combined historical innovation markings, speciation and incremental topology growth with weight evolution in NEAT.
Designed queue-based local-spinning locks and scalable barriers with bounded remote-reference behaviour.
Catalogued 23 named patterns with intent, applicability, collaborations and trade-offs.
Analyzed random edge contraction for global min-cuts and used it for RNC and cut-count consequences.
Analyzed flux penetration and a quantized mixed state in type-II superconductors above the GL parameter threshold.
Solved the linearized electron-plasma initial-value problem and derived collisionless decay through velocity-space phase mixing.
Computed and visualized the self-similar single-band spectrum against magnetic flux per lattice cell.
Developed Boolean-space topology and its algebraic maps and topological approximation consequences.
Established foundational coherent algebraic-sheaf theory and cohomological finiteness tools for varieties.
Proved a local Coulomb-gauge result under small critical curvature norm and weak compactness with Lp curvature bounds.
Detailed an antibody-based assay and measurements of endogenous plasma insulin in human clinical settings.
Reported Prontosil protection in infected mice and other bounded animal observations.
Developed and reported initial clinical use of a 21-category depression severity inventory.
Derived stagewise functional-gradient boosting methods for multiple losses, including tree-based refinements.
Proved weak/strong PAC learnability equivalence and constructed an accuracy-amplifying learner under the paper's assumptions.
Unified practical CART construction and pruning methods with statistical analysis in the four-author book.
Introduced splaying and proved logarithmic amortized bounds for standard search-tree operations.
Designed a multi-component log-structured merge index that batches updates and merges disk-resident runs.
Published a reversible block-sorting transform and demonstrated a complete lossless compression pipeline.
Expressed gapped filled-band Hall conductance as an integer topological invariant.
Mapped the chain to an O(3) nonlinear sigma model and identified the spin-parity distinction.
Related nontrivial vacuum topology after cosmological phase transitions to possible defect formation.
Proved a normal limit theorem under a condition suppressing contributions from large summands.
Constructed an integration framework on continuous paths underpinning Wiener measure.
Reported a bacterial-inhibition phenylalanine assay suitable for screening large newborn cohorts.
Reported external chest-compression technique and an uncontrolled 20-patient experience.
Reported visible-light exposure associated with reduced bilirubin in jaundiced infants.
Proved asymptotic nearest-neighbor error bounds under the stated probabilistic model.
Interleaved real experience, model learning and simulated planning in Dyna-PI and Dyna-Q demonstrations.
Compared five tests and introduced/evaluated the 5x2 cross-validation paired test.
Introduced bulk-synchronous supersteps with computation, communication and barrier parameters.
Presented Ceph's CRUSH-based placement, distributed metadata design and measured prototype behaviour.
Used word-frequency and sentence-distribution criteria to automate extractive abstracts on IBM 704.
Stated conditions for persistence of many invariant tori under sufficiently small analytic Hamiltonian perturbations.
Introduced the stochastic KPZ growth equation and exact one-dimensional scaling within its model.
Observed gravitationally induced neutron interference phase using a neutron interferometer.
Defined integration against Brownian motion for random integrands and proved fundamental properties.
Located the near-uniform mixing transition using symmetric-group Fourier analysis.
Proved conformally invariant critical triangular-site-percolation crossing limits and Cardy's formula.
Reported a recurring rat physiological-response pattern across distinct damaging agents.
Reported balloon-tipped flow-directed catheter permitting bedside right-heart and wedge-pressure measurements.
Showed rabbit-vessel relaxation requires intact endothelium and inferred released relaxing substance.
Introduced iterative random minimal-subset model fitting and consensus selection.
Specified scale-space keypoint detection and invariant local descriptors for matching.
Combined efficient summed-area features, AdaBoost selection, and cascade classification.
Documented compatible System/360 architectural interface spanning diverse workloads.
Documented CRAY-1 vector architecture and compiler route for scientific workloads.
Specified first BGP interdomain reachability and AS-path exchange over reliable transport.
Exhibited an exact algebraically special rotating vacuum solution of Einstein equations.
Proved linear quantum dynamics forbids universal perfect copying of an unknown state.
Derived multipartite quantum versus local-realistic contradiction without an inequality.
Established differentiable-manifold results and finite-dimensional Euclidean embedding/regular-map statements.
Proved the historical pointwise ergodic theorem for the paper's flow setting.
Established maximin=minimax for finite two-person zero-sum games with mixed strategies.
Published systematic tubular-instrument auscultation and clinical-pathological chest-sound correlations.
Passed catheter through arm vein to right heart and documented placement radiographically.
Reported external electrical pacing in two patients with ventricular standstill.
Formalized explanation-based generalization from a training example and a domain theory.
Described Hearsay-II hypothesis construction using opportunistic interacting knowledge sources.
Introduced the decoding algorithm with performance error bounds for convolutional codes.
Used modular fingerprints for efficient randomized pattern matching with controlled false hits.
Presented preliminary POSTGRES design with complex objects, extensibility, rules, and history.
Proposed secure resource multiplexing by a minimal kernel with abstractions in library operating systems.
Reported magnetic-field broadening and splitting structure in emitted spectral lines.
Observed radiofrequency resonance absorption by nuclear moments in solid paraffin.
Observed abrupt electron-current changes associated with discrete energy loss in mercury vapour.
Proved intersecting-convex-hull partition for d+2 points in d-dimensional space.
Tested antepartum betamethasone in 282 mothers and reported neonatal respiratory outcomes.
Formulated the inverse care law and linked service availability to need and market exposure.
Reported an ecological association across England and Wales regions and cohorts.
Identified recurrent clinical features in 12 adults with acute respiratory distress.
Articulated physical-symbol-system hypothesis as an empirical program for intelligent action.
Reported directional visible emission associated with fast charged particles in matter.
Characterized finite planar graphs by absence of K5 and K3,3 subdivisions.
Established chromatic-number-governed asymptotic forbidden-graph edge density.
Extended finite-dimensional fixed-point existence to upper-semicontinuous convex-valued maps.
Introduced graph attention networks and tested transductive and inductive tasks.
Described constructed mechanical differential analyzer for solving ODEs.
Observed grating-associated visible light and wavelength-angle behavior.
Proved persistence of invariant curves under small smooth area-preserving annulus-map perturbations.
Synthesized hospital construction and administration recommendations from observational evidence.
Reported timed capacitor-discharge cardioversion avoiding vulnerable ventricular period.
Introduced feature-based neighborhood sampling and aggregation for inductive node embeddings.
Used visible-patch encoder and lightweight decoder to reconstruct masked image patches.
Trained a controller to propose architectures and tested them on CIFAR-10 and Penn Treebank.
Outlined head-coupled visual output and force-feedback goals for an ultimate display.
Developed intention-lock multigranularity protocol and articulated consistency degrees.
Observed rotation-dependent, sign-reversing interference fringe displacement.
Proposed repeated magnetic-cloud interactions yielding a power-law acceleration tendency.
Observed laser-driven acceleration and trapping of dielectric particles.
Developed higher-topos and infinity-category machinery with systematic limits, adjunctions, and presentability.
Identified fractional Laplacian as Dirichlet-to-Neumann operator for degenerate elliptic extension.
Constructed percentile curves from 5,635 live-born infants spanning 24-42 weeks.
Reported early compound E and ACTH responses in rheumatoid arthritis patients.
Mapped triggers in 45 selected patients and found most foci in pulmonary veins.
Introduced conditional random fields for sequence segmentation and labeling.
Argued for behavior-grounded intelligence as a distinct research program.
Proposed model cards and illustrated reporting on two models.
Described NTP synchronization architecture, algorithms, and measured operation.
Built scheduler activations and measured a prototype for multiprocessor threading.
Introduced lottery tickets and currencies with a Mach prototype.
Discovered and initially characterized PSR 1913+16 as a binary pulsar.
Derived gauge-consistent superconducting response with collective quasiparticle-pair excitations.
Introduced Cabibbo mixing angle in unitary-symmetry analysis of leptonic decays.
Formulated production optimization and resolving-multiplier interpretation in 1939 work.
Constructed arithmetic from simply infinite systems, induction and recursive definition.
Gave diagonal nonenumerability argument for infinite binary sequences.
Applied SVD to term-document matrices for latent semantic indexing and retrieval.
Connected Gibbs distributions, Markov random fields, and image restoration with a sampling/annealing algorithm.
Introduced PLSI latent-class model and evaluated retrieval.
Specified 1982 SMTP commands, transactions, replies, and relay semantics.
Formalized document/query vector geometry and tested vocabulary-density implications.
Established the finite-dimensional self-map fixed-point result through topological mapping arguments.
Represented continuous linear functionals on C[0,1] as Stieltjes integrals against bounded-variation functions.
Generalized Radon's integral-density representation under the 1930 paper's measure hypotheses.
Documented four cases with marked helper-T-cell depletion and acquired cellular immune failure.
Reported clinical administration and immune/protection observations for the live attenuated Jeryl Lynn mumps vaccine.
Built a balanced evaluation set and quantified large subgroup error disparities in three commercial gender classifiers.
Proposed a structured dataset datasheet covering motivation, composition, collection and recommended use.
Organized costs and harms of large-language-model scaling and recommended documentation and stakeholder-oriented alternatives.
Set out the augmentation-system framework and a research program for direct computer assistance in complex intellectual work.
Made security classes and permitted flows into a lattice framework for reasoning about program mechanisms.
Modeled active message manipulation and gave security characterizations and algorithms for specified public-key protocols.
Seven balloon ascents showed a high-altitude increase in penetrating radiation, supporting incoming radiation from above.
Tracked a radio-noise component on a sidereal cycle and associated its strongest direction with the Milky Way's central region.
Measured the phase displacement in a large enclosed optical path associated with Earth's rotation.
Proved infinitely many primes in every coprime arithmetic progression using character-series methods.
Used rational-approximation bounds to prove existence of explicit transcendental-number classes.
Established local solutions for systems of ordinary differential equations under continuous right-hand sides without a uniqueness requirement.
Reported reflectoscope recordings of moving heart walls, an early time-motion echocardiographic method.
Introduced guidewire-through-needle followed by catheter-over-wire placement for arteriography.
Reported selective coronary catheterization and cine imaging in more than 1,020 patients.
Combined graph triangulation and local probability representations for exact evidence propagation.
Presented the bootstrap particle filter for recursive state-density approximation by resampled simulations.
Used causal diagrams to test identifiability and derive causal-effect expressions from observational assumptions.
Published Algorithm 97 for all-pairs shortest-path computation via intermediate-vertex updates.
Gave the Boolean matrix recurrence to compute transitive closure.
Linked maximum flow to minimum cut and supplied an augmenting-flow scheme for the stated network model.
Measured microwave prism scattering consistent with negative refraction in a structured composite's band.
Demonstrated strontium atoms trapped near a magic wavelength with narrow clock spectroscopy.
Distinguished uranium-radiation components by absorption and penetrating behavior while studying ionization.
Introduced and analyzed GMRES residual minimization over Arnoldi Krylov subspaces.
Proposed the Dantzig selector and established oracle-style error bounds under specified design and sparsity assumptions.
Derived the normal-shaped approximation for symmetric binomial terms and sums.
Reported a wireless capsule endoscope and in-human small-bowel images.
Demonstrated a flexible fiberscope gastroscope for direct visualization.
Reported three early systemic-to-pulmonary shunt operations with immediate clinical improvement.
Presented an open-source communication and tooling framework for reusable heterogeneous robot software.
Characterized invariant set-function form under stated conditions and designed pooling-based Deep Sets models.
Derived telegraph pulse-shaping and signaling-rate conditions for bandwidth-limited transmission.
Defined information from selectable symbol sequences by a logarithmic count and related its transmission to frequency range and time.
Specified memory, control, arithmetic and programming organization for a proposed electronic stored-program ACE.
Observed mechanical rotation associated with a change in magnetization.
Interferometrically measured light-propagation changes in flowing water consistent with partial drag.
Derived separated-oscillating-field transition curves predicting sharper, less inhomogeneity-broadened resonances.
Published a rapidly converging algebraic root-approximation procedure with examples.
Developed an early organized topology vocabulary and spatial examples including complexes and orientation.
Developed finite-difference schemes and applied them to masonry-dam stress calculations.
Reported clinical improvement with yeast extract in pregnancy and tropical macrocytic anaemia cases.
Compared rabbit autografts and homografts and identified rejection behavior consistent with active immunity.
Detected OB protein in plasma and showed recombinant protein reduced weight and intake in selected mice, not db/db mice.
Introduced a two-stage text-conditional image generator that predicts a CLIP image embedding from a caption and decodes an image conditioned on that embedding, enabling image variations and language-guided manipulations.
Estimated a compute-optimal balance of model parameters and training tokens, then tested it with the 70-billion-parameter Chinchilla model trained on substantially more tokens than the earlier Gopher model at a comparable training-compute budget.
Developed a family of 7B–65B-parameter foundation language models trained on publicly available datasets and reported competitive language-task performance relative to much larger contemporary models.
Trained the 1.3B-parameter phi-1 code model using selected web data and synthetic textbook-style material, reporting strong Python coding benchmark results for its size and training budget.
Reported SDXL, a larger latent-diffusion text-to-image architecture with additional conditioning, multiple aspect ratios and a refinement model to improve high-resolution image synthesis.
Used sparse-feature synthetic data and small ReLU networks to demonstrate regimes in which models encode more features than available dimensions, with interpretable geometric changes as feature sparsity and importance vary.
Built a math-specialized 7B language model using a selected large math corpus and introduced group relative policy optimization, which estimates a reward baseline from grouped outputs without a separate critic model.
Trained GPT-2 as a large autoregressive transformer on WebText and documented zero-shot transfer to several language tasks without task-specific fine-tuning.
Cast diverse natural-language tasks into a unified text-to-text format, systematically compared transfer-learning choices, and introduced the C4 corpus and T5 model family.
Introduced a style-based GAN generator architecture with scale-specific synthesis control and measured improvements in interpolation and disentanglement on face-image generation.
Proposed compound scaling that jointly balances convolutional-network depth, width and input resolution, then used architecture search to build the EfficientNet model family.
Introduced a promptable image-segmentation task and model plus the SA-1B dataset of over one billion masks on 11 million images, with reported zero-shot transfer evaluations.
Trained a multilingual, multitask speech-recognition model on 680,000 hours of weakly supervised audio and reported improved zero-shot robustness across diverse test sets.
Introduced a deep autoregressive model that generates raw audio waveforms sample by sample, with applications to text-to-speech and music generation.
Reported the Qwen-VL vision-language model family for image understanding, object localization and text reading, including conversational and higher-resolution variants.
Combined transformer language-model pre-training on unlabeled text with supervised fine-tuning and reported transfer improvements across language-understanding tasks.
Introduced mobile and embedded vision networks built with depthwise-separable convolutions and size/latency trade-off controls.
Reinterpreted Inception modules through depthwise-separable convolutions and proposed Xception, reporting image-classification gains at similar parameter count to Inception V3.
Simplified sparse mixture-of-experts routing for transformers with one expert selected per token and reported faster large-scale pre-training and trillion-parameter models.
Learned a shared representation across image, text, audio, depth, thermal and inertial signals using image-paired training data.
Extended promptable segmentation to images and videos with a streaming-memory transformer and video data engine.
Trained a 12-billion-parameter autoregressive transformer over text and image tokens and demonstrated text-conditioned image synthesis and concept combinations.
Evaluated GPT-family models fine-tuned on code and introduced HumanEval, a benchmark of Python programming problems tested for functional correctness.
Released and evaluated Llama 2 pretrained models from 7B to 70B parameters and fine-tuned dialogue variants, documenting training and safety methods.
Trained and evaluated the dense 540-billion-parameter PaLM language model using the Pathways system, reporting few-shot performance across language and reasoning tasks.
Modeled discrete neural-audio-codec tokens for zero-shot text-to-speech synthesis, with reported speaker adaptation from a three-second acoustic prompt.
Redesigned StyleGAN normalization and training, addressing characteristic image artifacts and adding path-length regularization for more stable image generation.
Proposed training an assistant through principle-guided self-critique/revision and reinforcement learning from AI-generated preference feedback.
Scaled self-supervised vision representation learning with a curated image corpus and training recipe, reporting transferable visual features without task labels.
Trained one transformer policy on serialized data spanning Atari, image captioning, dialogue and robot control, demonstrating task switching through context.
Co-fine-tuned vision-language models on web data and robot trajectories while representing robot actions as tokens, reporting transfer to new robotic tasks.
Transferred text-image generation to video by learning appearance from paired text-image data and motion from uncaptioned video, without paired text-video training data.
Combined frozen visual and language components with cross-attention layers to process interleaved images, videos and text, reporting few-shot transfer across multimodal tasks.
Released a 7B language model using grouped-query and sliding-window attention, reporting strong benchmark performance for its size.
Released and evaluated Mixtral 8x7B, routing each token through two of eight feed-forward experts per layer with a reduced active-parameter count.
Introduced fine-grained expert segmentation and shared experts for sparse language models, reporting improved expert specialization and efficiency.
Applied a pure transformer to sequences of image patches for classification, reporting strong transfer after large-scale image pretraining.
Introduced DenseNet, connecting each convolutional layer to preceding feature maps to encourage feature reuse and improve gradient propagation.
Extended Faster R-CNN with a parallel object-mask prediction branch and alignment method, reporting strong instance-segmentation and pose results.
Simplified contrastive self-supervised vision training using strong augmentations, a projection head and large batches, without a memory bank.
Recast object detection as direct set prediction using a transformer and bipartite matching, reducing hand-designed detection components.
Pretrained a sequence-to-sequence transformer by corrupting text and reconstructing it, reporting strong generation and comprehension transfer.
Introduced inverted residuals and linear bottlenecks for mobile vision networks, with reported classification, detection and segmentation trade-offs.
Learned speech representations from unlabeled audio with masked latent prediction and contrastive training, then fine-tuned with limited transcriptions.
Separated token content and position representations in attention and used an enhanced mask decoder, reporting improvements over BERT/RoBERTa baselines.
Combined a frozen large text encoder with cascaded diffusion models for text-to-image synthesis and evaluated image fidelity and text alignment.
Used a momentum-updated encoder and queue of image representations to train contrastive visual features independently of very large batches.
Systematically revisited BERT training choices and reported stronger language-understanding results with longer training, more data and altered masking choices.
Released a family of 125M–175B-parameter decoder-only language models with training logs and evaluation, expanding access to large-scale model research.
Introduced focal loss to down-weight easy negatives in dense object detection and demonstrated it with RetinaNet.
Trained GAN generators and discriminators by progressively increasing resolution, improving training stability and high-resolution image generation.
Combined convolution and self-attention in a parameter-efficient encoder for speech recognition, capturing local and global sequence patterns.
Proposed replaced-token detection as a sample-efficient discriminative pre-training objective for language representations.
Reduced BERT-style model parameters through factorized embeddings and cross-layer sharing while evaluating language-understanding performance.
Described and evaluated an attention-based deep neural translation system with wordpieces and inference optimizations deployed at production scale.
Conditioned a language model on robot sensor and visual observations and evaluated embodied planning and visual-language transfer.
Improved Inception-style image classifiers using factorized convolutions and regularization to use computation more efficiently.
Trained a transformer-based real-world robot control model on diverse tasks and evaluated scaling and generalization across model and data choices.
Proposed region-based fully convolutional detection with position-sensitive score maps to share most computation across an image.
Pre-trained a language model with a latent document retriever whose retrieval decisions receive a masked-language-model learning signal.
Developed a conditional PixelCNN decoder with gated convolutional layers for image generation and autoencoder decoding.
Demonstrated text-conditional high-definition video synthesis with a cascade of video diffusion and super-resolution models.
Proposed Fast R-CNN to train and evaluate region-based convolutional object detectors more efficiently through joint multi-task training.
AlphaGenome predicts multiple types of genomic activity from long DNA sequences, combining broad sequence context with high-resolution outputs. The study reports strong held-out variant-effect prediction and analysis of known regulatory mechanisms.
Researchers used protein language models to propose CRISPR-associated proteins and experimentally tested generated editors. The study reports functional genome editing with OpenCRISPR-1 and compatibility with base editing.
ESM3 generated protein candidates conditioned on sequence, structure and function. Human laboratory testing identified a bright fluorescent protein with substantial sequence differences from known fluorescent proteins.
Aharonov and Anandan defined a geometric phase for a cyclic pure-state evolution by removing the dynamical phase, identifying its holonomy on the space of Hilbert-space rays without an adiabatic requirement.
Ahmed, Natarajan and Rao introduce a discrete cosine transform with an FFT-based computation and report close performance to the Karhunen-Loeve transform for specified correlated-signal models and filtering/rate-distortion comparisons.
Supplies an explicit two-transmitter symbol sequence and simple coherent combiner, with a receiver-count diversity extension and implementation/power qualifications.
Alon, Matias and Szegedy developed a randomized small-memory estimator for the second frequency moment and a framework relating one-pass frequency-moment approximation to space complexity.
AlphaGeometry2 expanded geometric language, symbolic deduction and knowledge-sharing search, reporting solutions to 42/50 formalized 2000–2024 IMO geometry cases, up from 27/50 for AlphaGeometry1 on that set.
AlphaProof combined Lean-grounded reinforcement learning, AND–OR proof search and test-time training on related problem variants, proving three non-geometry problems from the 2024 IMO with expert formalization and multi-day computation.
Reformulates radiation/matter expansion withdensity boundaryconditions andinterprets survivingfewkelvin radiation asbackground, while exposing model/initial-condition limits.
Arıkan introduced channel polarization and polar codes that achieve the symmetric capacity of binary-input discrete memoryless channels, with encoding and successive cancellation decoding costs of O(N log N) under the stated operation model.
Arlazarov, Dinitz, M.A.Kronrod and Faradzhev tabulated unions over small blocks of intermediate vertices to compute Boolean relation products and acyclic graph closure in O(n^3/ln n) elementary operations.
A randomly shifted geometric dissection has a near-optimal Euclidean tour with few boundary crossings; portal-based dynamic programming gives an approximation scheme in any fixed dimension.
SipHash combines a compact keyed ARX construction with fast short-input processing and an explicit PRF security goal for message authentication and secret-key hash-table defenses.
Ba, Kiros and Hinton introduced layer normalization, computing activation mean and variance within each example instead of across a mini-batch, with learnable gains and biases and a recurrent-network formulation.
Banach proves that a bounded real-linear scalar functional on a subspace of a real normed space extends to the whole space with the same norm, and derives separation and closure criteria.
Connects bounded completeness and sufficiency to independence of every parameter-distribution-invariant statistic within the stated model, with a short general argument and distribution-theory illustrations.
Bellman applies dynamic-programming cost-to-go equations to positive-time finite routing and gives policy-initialized monotone successive approximations that reach the optimal travel cost after a bounded number of iterations.
Ben-Or presents randomized binary-agreement protocols for fully asynchronous message-passing systems: crash tolerance with N>2t and a Byzantine construction with N>5t, with probability-one termination under the stated admissible scheduling model.
Benders partitions a mixed-variable optimization problem into a master problem and a linear subproblem, generating only the dual constraints needed to identify an optimum or detect infeasibility or unboundedness, under explicit solution and compactness assumptions.
Berrou, Glavieux and Thitimajshima combine interleaved recursive convolutional encoders with iterative soft-information decoding and report close-to-channel-limit error performance under a specified long-block Gaussian-channel simulation.
Closed-subspace lattice operations express a proposed quantum-proposition calculus, expose nondistributivity and explore finite-dimensional projective reconstruction under explicit extra assumptions.
Organizes atmospheric diagnosis, coupled physical time advance, approximate computation and later observational correction into a coherent research programme with named unresolved needs.
Bond, Cole, Efstathiou and Kaiser replace single-scale threshold counting with first crossings across smoothing scales, derive the Press-Schechter factor of two for sharp-k Gaussian walks, and extend the framework to conditional mass histories.
Bondi solves the steady spherical polytropic accretion problem, identifies subsonic and critical transonic branches, and derives the mass-rate scaling and critical coefficient under an explicit inner-domain assumption.
Replaces explicit sign-correction branching with a uniform pair-transition signed binary add/subtract/shift procedure.
Born and Oppenheimer organized electronic, vibrational and rotational energies of stable molecules into a perturbation expansion in the fourth root of the electron-to-nuclear mass ratio.
Boyer, Brassard, Hoyer and Tapp analyze quantum-search success after a specified number of iterations and give a randomized procedure with order sqrt(N/t) expected query cost when the positive number t of marked items is unknown.
Bresenham described a compact integer-update algorithm that selects adjacent plotter-grid points to follow a straight line between integer-coordinate endpoints, handling all eight octants without per-step multiplication or division.
Buckingham organizes a complete dimensionally homogeneous physical relation into independent dimensionless products and derives conditional scaling rules for geometrically and physically similar systems.
An edge-detector design balances detection, localization and duplicate responses, leading to an efficient Gaussian-gradient approximation with hysteresis and multiscale integration.
Chandra and Toueg define unreliable failure detectors through completeness and accuracy, construct crash-tolerant consensus algorithms using them, and reduce consensus and atomic broadcast to one another under the stated asynchronous model.
Chandrasekhar connects stellar gravitational fluctuations to systematic velocity deceleration and derives an approximate dynamical-friction coefficient from binary encounters in an isotropic stellar background.
A continuous vertical-shear atmosphere can generate growing long waves; the paper connects a constrained stability eigenproblem to wave speed, thermal asymmetry and near-onset vertical structure.
Charney, Fjörtoft and von Neumann implement a limited-area barotropic-vorticity forecast on ENIAC, reporting four 24-hour experiments from observed 500-mb charts and analysing numerical, observational and model errors.
Factorial/prime-power identities yield rigorous weighted-prime bounds and an all-admissible-integer Bertrand proof with explicit analytic/finite-case separation.
Chern gives an intrinsic differential-form proof that integrates curvature to the Euler characteristic for closed oriented even-dimensional Riemannian manifolds, avoiding the earlier proof's use of local Euclidean embeddings.
A practical graphical procedure integrates selected line/load variables and vector terms into an apparatus for voltage/current ratios and phase relations.
Candidate-key and transitive-dependency criteria articulate second and third normal forms to distinguish relations combining different facts.
Coppersmith and Winograd combined trilinear tensor constructions with progression-free hashing and pruning to obtain an asymptotic matrix-multiplication exponent below2.376, extending earlier Strassen and Schönhage machinery.
Courant described variational approximations using continuous piecewise-linear functions on flexible triangular nets and demonstrated them on planar torsion problems, an early step toward finite-element methods.
Crank and Nicolson develop a time-centred implicit finite-difference procedure for heat-conduction-type equations, combining a stable linear error treatment with practical iteration for nonlinear terms and boundary conditions.
Excess activity is followed through pitchblende fractions to a bismuth-associated concentrate, supporting a conditional inference of another element named polonium.
Cytron, Ferrante, Rosen, Wegman and Zadeck used dominance frontiers to place merge functions and rename variables into minimal static single-assignment form, and reused the reverse-graph construction to compute control dependence.
The published completeness theorem factors any derivable instance judgment through W's result and yields principal schemes/typeability decidability for the chosen discipline.
An acoustic elastic-mode spectrum with finite3N cutoff replaces a single frequency and predicts a cubic lowT lattice law, highT classical limit and elastic-property characteristic temperature within one model.
Proper rational cuts define real numbers, equivalent rational-endpoint partitions are identified, and the completed order supports a cut-completeness principle linked to bounded monotone convergence.
DeepSeek-Prover-V2 used recursive subgoal decomposition and Lean-checked training traces for formal proof search, reporting 217/244 miniF2F test problems at 8192 samples and 47 PutnamBench problems in the selected corrected v2 evaluation.
Dehn established a necessary angle relation for finite polyhedral dissection into congruent pieces and proved that a regular tetrahedron cannot be reassembled into a prism, even when their volumes agree.
Atomic semaphore P/V operations and systematic examples express resource waiting and producer–consumer coordination among independently executing processes.
A guarded-command language linked nondeterministic alternatives and repetition to weakest-precondition reasoning, with invariants and variants connecting desired results to program construction.
Dinitz organized shortest augmenting paths into a maintained layered referent, deleting saturated arcs and dead ends until the shortest source-to-sink distance increases, obtaining an O(n²m) arithmetic-operation maximum-flow bound.
Nonintegrable phases and permitted magnetic singularities lead to a quantization relation between electric charge and magnetic-pole strength.
Dwork, Lynch and Stockmeyer define partial synchrony and give deterministic consensus constructions and fault-tolerance bounds when timing bounds are unknown or start holding after an unknown stabilization time.
Conditioned blossom contraction,alternating-tree search and expansion give a conceptual polynomial cardinality-matching method in general graphs, together with odd-set-cover duality.
Edmonds and Karp bounded shortest-path flow augmentations independently of capacity precision, used nonnegative reduced costs for minimum-cost flow, and developed capacity scaling with repair of lost optimality.
Efron and Stein used orthogonal interaction decomposition to characterize the expected upward bias of the natural deletion-based jackknife variance estimate and distinguish its sample-size target and nonlinear correction limits.
The original conference work provides randomized encrypted-message pairs based on inherited key exchange and a distinct publicly verifiable signature relation with signing/verification procedures.
The paper formalized schedule consistency and proved two-phase locking guarantees under well-formed transaction assumptions, then proposed predicate locks to protect logical sets including phantom records.
An exact reciprocal-square value connects an arithmetic infinite series with the circle constant, together with specified even-power extensions in the work.
Mass continuity and pressure/body-force momentum balance organize three-dimensional fluid motion in spatial velocity/density fields; nonpotential examples establish the broader admissible flow class.
Fagin connected multivalued dependencies to lossless projection joins, defined fourth normal form beyond Boyce–Codd normal form, and proved finite-schema decomposition can reach it without information loss.
Common-circuit comparisons organize decomposition by passed electricity and chemical equivalents, with secondary reactions distinguished through experimental controls.
Controlled field switching and reversal connect a magnetic field to polarization rotation in transparent matter, distinguishing its directional behavior from natural optical rotation.
An at-most-one occupation hypothesis is extended to ideal-gas state counting and thermodynamics, yielding a degeneracy distribution and low-temperature pressure/heat-capacity consequences.
Specified two-component and no-gradient assumptions yield equal-magnitude vector and axial weak couplings in a proposal connecting several decay processes.
Finkelstein constructs a regular analytic continuation across the Schwarzschild surface and explains its one-way causal character in time-reversed branches, while the paper itself records that this continuation is not the complete Schwarzschild spacetime.
Fizeau measures light propagation over a terrestrial round-trip path by observing when a rotating toothed wheel blocks or transmits the returning beam.
HyperLogLog estimates the number of distinct stream items by combining per-bucket bit-pattern registers through a normalized harmonic mean, reducing variance while keeping a small mergeable state.
Hashed-bit occupancy and stochastic averaging estimate distinct cardinalities in one pass with small mergeable bitmap summaries, supported by asymptotic analysis under an independent uniform-hash model.
Flynn developed a hierarchical request/service model and used explicit workload and resource assumptions to compare the effectiveness of single- and multiple-stream computer organizations.
The extra-coordinate transformation exposes a compensating unit-modulus scalar-wavefunction phase under changes of electromagnetic potentials in the stated representation.
Foucault observes a gradual change in the direction of a carefully released pendulum swing and interprets its local precession as an observable consequence of Earth rotation.
The paper constructed static sparse-set representations with constant worst-case membership query time and linear space, then refined word storage to n plus a sublinear remainder under its stated model.
Friedmann shows that the Einstein equations under a positively curved pressureless cosmological ansatz allow a time-dependent curvature radius, and classifies monotone and expanding-contracting possibilities depending on constants.
Gale and Shapley construct stable two-sided matchings by deferred acceptance and show applicant-optimality among stable college assignments under strict preferences, acceptable applications and stated quotas.
Couples a regular sparse code ensemble and typical-distance/error analysis with local soft-information iterative decoding, explicitly distinguishing tree-valid inference from later-cycle approximation.
The curvature of a regular surface patch is expressed through its metric data, showing that bending preserving those data preserves Gaussian curvature.
An implicit-pattern LP formulation made computationally usable by knapsack pricing, with a small working basis and an explicit distinction between finding a column heuristically and certifying no improving column.
Godunov constructs conservative gas-dynamics updates from local discontinuity-resolution problems and proves a linear monotonicity/order barrier, while the paper’s nonlinear limit and stability claims retain explicit convergence and time-step conditions.
Goemans and Williamson combine a semidefinite vector relaxation with random hyperplane rounding to obtain an expected approximately 0.87856 approximation for nonnegative weighted MAXCUT, with an epsilon loss for finite-precision optimization.
Goldberg and Tarjan developed a maximum-flow method that temporarily permits excess flow at intermediate vertices, then uses local pushes and valid height labels to restore conservation and obtain a maximum feasible flow.
Golub and Kahan develop a two-stage scheme that reduces a rectangular matrix to bidiagonal form, then computes its singular values and paired vectors for pseudoinverse and least-squares calculations.
A mechanical fractional-tableau cut that preserves integer feasibility while excluding the fractional incumbent; a finite integer algorithm is announced, with its complete termination argument deferred.
Defines a generally noncyclic binary code family with polynomial-controlled redundancy and distance, retaining the distinct-root hypothesis for the stronger designed-distance bound.
GPT-f combines transformer-generated Metamath proof steps with guided backward search, reporting56.22% held-out theorem reproduction at32 search attempts per theorem and23 shortened proofs contributed to set.mm.
Graham bounded how much a fixed-list schedule can worsen when task priorities, durations, precedence constraints or the number of identical processors are changed.
Gronwall used an integral bound to extend direct parameter-differentiability arguments from a single differential equation to a system, and treated derivatives with respect to initial values and initial time.
Grover gives a quantum algorithm for finding a unique marked item in an unstructured search space using order sqrt(N) oracle iterations, by combining a conditional phase flip with inversion about the average amplitude.
Gustafson argued that parallel computing should also be evaluated with workloads that expand as processor counts grow, deriving scaled speedup and reporting near-linear results for three Sandia applications on a 1,024-processor system.
Gutenberg and Richter compare earthquake frequencies in California with worldwide counts and fit a log-linear relationship between magnitude bins and event frequency, with explicit regional and extrapolation limits.
Noise-contrastive estimation learns an unnormalized statistical model by distinguishing observed data from samples drawn from a known noise distribution, treating the normalization constant as a learnable parameter.
A local intensity-change matrix and determinant/trace response distinguish corners from edges without relying on a few sampled shift directions, supporting combined feature extraction.
Introduces inverse-eigenvalue quantum-state preparation and selectedobservable estimation for suitable linear systems, connecting numerical tasks to quantum algorithmic complexity.
Hausdorff extended small-scale covering measures to fractional powers and more general gauge functions, and constructed perfect sets with positive finite measure at prescribed scales under explicit assumptions.
The report integrates continuous sounding tracks into a reusable physiographic diagram/classification workflow and organizes North Atlantic ridge/valley morphology, while retaining interpolation and interpretive limits.
Henkin proved completeness of a simple type calculus for general models whose function domains satisfy the interpretation closure conditions, and constructed countable models of consistent theories in the stated language.
Hertz uses a spark oscillator, resonant detector and conducting reflector to reveal spatial interference patterns supporting electromagnetic-wave propagation and reflection in air.
Hertz solves the local frictionless contact of smooth isotropic elastic solids, obtaining an elliptical pressure patch and nonlinear load-indentation scaling, with a conditional quasi-static collision application.
A rising-ridge and moving-mantle model connects ocean-basin observations with transport of continents without their ploughing through a fixed ocean crust.
Hoeffding organized finite tail bounds for bounded independent sums, extended a range-only bound to unequal intervals, and transferred exponential bounds to explicitly represented dependent statistics and finite-population sampling.
Hopcroft supplied an n log n state-minimization algorithm for complete deterministic finite automata with fixed alphabet, using partition refinement and carefully scheduled splitters.
LOWPT-ordered DFSpath addition and linked stack constraints support linear planarity decision in the original list/RAM model.
A compiling routine selects, adjusts and assembles catalogued subroutines to construct a UNIVAC program from a higher-level specification of routine use.
A brightness-change constraint combined with spatial smoothness yields a global variational optical-flow model and an iterative neighbor-coupled velocity estimate.
A plane transformation converts image points on locally straight particle tracks into intersecting lines whose common knot gives the track segment parameters, with an electronic scanning and storage embodiment.
Householder uses successive orthogonal reflections to triangularize a real matrix while preserving Euclidean geometry, reducing the square-root count compared with a sequence of plane rotations.
A photographic system distinguishes ellipticals, normal/barred spirals and irregular forms, supplying reproducible categories for comparing populations.
Determinant sign conditions characterize strict left-half-plane roots without separately solving each root.
HyperTree Proof Search explores all required branches of a candidate proof and couples transformer tactic generation with online policy/critic training; Evariste reports gains on Metamath and Lean under explicit adaptive and held-out protocols.
Hyvarinen introduced score matching: estimate a smooth continuous statistical model by matching data-gradients of log density, using integration by parts to obtain a sample objective that does not require its normalization constant.
Immerman and Szelepcsényi independently established that nondeterministic space at least logarithmic in input length is closed under complement, including NL = co-NL and complement closure of context-sensitive languages.
Configuration counting and generating-function summation calculate the nearest-neighbor two-state chain's equilibrium response; the source negative result is isolated from its incorrect spatial extrapolation.
Unified array-oriented notation for algorithm description and analysis.
Inverse-amplitude functions, complementary-modulus/imaginary-argument relations and H/theta quotients organize a coherent elliptic-function representation framework.
Jensen organized inequalities of weighted means around midpoint convexity, used continuity to extend rational averages to positive real weights and integrals, and derived regularity from upper boundedness.
Jiang and Shu develop derivative-based smoothness indicators and efficient finite-difference WENO implementations that recover fifth-order spatial accuracy in regular smooth regions while reducing the contribution of stencils crossing discontinuities.
Introduces a three-recursive-square multiplication mechanism alongside separately attributed grouped machine-size/time tradeoffs.
Kelly connected mutual information to the optimal long-run logarithmic growth rate of repeated symbol-conditioned bets at fair odds, and treated unequal odds and a track take with separate formulas.
Kirchhoff gives a combinatorial solution of steady linear wire-network currents using independent cycles, resistance products and sums of electromotive forces around the remaining cycles.
Kirchhoff states and derives steady-circuit junction and loop relations: current balances at a junction, and signed resistance drops around a closed path equal the electromotive forces on that path.
Kitaev constructed a one-dimensional superconducting chain with unpaired boundary Majorana modes and related their presence to a bulk parity invariant for gapped quadratic fermion systems.
A structured dancing-links implementation applies reversible removal/restoration to exact-cover backtracking and organizes changing constraints efficiently.
Inherited and synthesized attributes are organized by production-specific semantic functions, expressing local values together with contextual dependencies over a derivation tree.
A shared document interleaves explanation and named code sections, with WEAVE and TANGLE producing human-oriented and machine-oriented presentations in different orders.
LR(k) formalizes unique prefix/lookahead-driven reductions and connects a fixed-k grammar test with finite state-set shift/reduce recognizer construction.
Boxes, glue and penalties support paragraph-wide optimization of line breaks rather than independent greedy choices.
Kochen and Specker constructed a finite three-dimensional quantum-observable structure that cannot receive noncontextual values preserving functional relations for compatible measurements, while exhibiting a contrasting two-dimensional classical model.
Description length under optimal methods supplies a non-probabilistic account of the information in an individual object, invariant up to an additive constant and generally noncomputable.
Kruskal gives a simple global coordinate representation of the maximal singularity-free analytic Schwarzschild extension, displaying two exterior and two interior regions while retaining the intrinsic center singularity.
Kuhn combines bipartite matching and an adequate-budget dual certificate into a finite method for maximum-score one-to-one assignment with positive integer ratings, supplying explicit transfer and budget-improvement routines.
A common analytical organization formulates constrained mechanical problems with independent variables and kinetic-energy variations instead of bespoke geometric constructions.
Lanczos develops progressive polynomial and minimized-iteration procedures for spectral and resolvent problems, including the symmetric three-term orthogonal recurrence and a two-sided nonsymmetric construction, with numerical vibration examples and proposed integral/differential operator extensions.
Landau counts the partly discrete quantum energies of nonrelativistic electrons in a uniform magnetic field and derives a nonzero orbital diamagnetic response, distinct from spin paramagnetism, with an explicit smooth-field approximation and separate conjectures about real materials and transport.
Places viscous relaxation and molecular forcing in one particle equation; averages it to recover an inherited long-time diffusion relation under statedextra closure.
The first1812 edition organizes coefficient/generating calculations, finite-difference methods, large-power approximations and explicitly modeled conditional/inverse probability into a systematic analytical framework.
Makes a specified consistent linear approximation converge for all initial data exactly when its update powers satisfy the uniform finite-horizon stability condition.
Lax and Wendroff identify the weak limit of a boundedly convergent conservative difference scheme and construct higher-accuracy difference formulas with artificial-viscosity treatments for shock calculations.
LeanDojo extracts source-linked premises and proof states and provides programmatic Lean interaction; ReProver uses accessible-premise retrieval to improve proof generation on explicit random and novel-premise benchmark splits.
The curated original proposal adds a higher-velocity inner region as a candidate explanation and leaves explicit conditions and uncertainty for later investigators.
Lenstra showed that integer linear feasibility can be solved in polynomial input-length time when the number of integer variables is fixed, using lattice geometry and reduction to lower-dimensional problems.
Binary edit metrics characterize correction of deletion, insertion and bit-flip errors; equal-length deletion and insertion correction are equivalent, and checksum constructions address one-error synchronization.
Conditional vector-field regression yields the marginal FM parameter gradient under exchange/integrability assumptions; Gaussian path design includes conditional straight displacement paths and simulation-free CNF training.
Little proved L=λW for consistently defined queue occupancy, arrival rate and sojourn time under finite-mean strict stationarity and an ergodic interarrival process, extending earlier heuristic and special-model uses of the relation.
Lenstra, Lenstra and Lovász gave a polynomial-time lattice-basis reduction algorithm with short-vector approximation guarantees and used it to factor univariate polynomials over the rational numbers in polynomial time.
Lomb analyzes sinusoidal least-squares spectra for unequally spaced observations, deriving fixed-frequency Gaussian-noise behavior and the correlation of spectral heights at different frequencies, with astronomical numerical illustrations.
A phenomenological magnetic-response law distinguishes Meissner screening from simple flux freezing while leaving microscopic/interface questions open.
Changes of spatial, local-time and field variables seek a common corresponding-state explanation for selected electromagnetic/optical consequences under uniform subluminal translation and additional material assumptions.
Lorenz formulates atmospheric available potential energy relative to an adiabatic minimum reference, derives approximate temperature-variance measures and organizes zonal/eddy energy generation, conversion and dissipation.
Spatial image gradients guide iterative local least-squares registration, reducing candidate searches and permitting translation, affine and brightness-adjustment extensions.
Martin-Löf constructs universal effective tests and defines infinite random binary sequences by avoidance of effectively specified null tests, connecting finite-string randomness to conditional description complexity.
A coherent modal framework retaining latitude-varying rotation resolves the mixed lowest westward branch, the separate Kelvin-like solution and a controlled forced-response example.
Mattern formulated vector-valued logical time that captures potential causal order and concurrency, connected possible time vectors with the lattice of consistent cuts, and described distributed debugging applications.
Characteristic-root behavior links a regulator's parameters to decaying or growing disturbances and oscillations in specified low-order models.
McKenzie and Parker modeled rigid plates as rotations on a sphere and tested a common North Pacific rotation pole against published shallow-earthquake slip directions.
Merkle describes selecting a shared key over a publicly readable but integrity-protected channel using many deliberately solvable encrypted puzzles, producing a quadratic passive-search work gap in the stated classical model.
Miller gives deterministic compositeness-witness algorithms and establishes polynomial-bit-length primality testing conditional on the stated Extended Riemann Hypothesis, alongside number-theoretic functional reductions under declared assumptions.
Let-local polymorphism and constrained non-generic parameter variables are organized into a usable type discipline, a recursive inference algorithm and separate semantic/syntactic soundness theorems for Exp.
Morgan extended transform-boundary geometry to rigid spherical blocks, estimated relative poles and half-spreading rates in several ocean regions, and examined motion-circuit closure with stated uncertainties.
Morrison described a compact binary-text index that records only genuine branching positions, finds a candidate from selected key bits, verifies it in the text, and enumerates marked occurrences without scanning the entire library.
Moseley measured characteristic X-ray spectra and showed that their frequencies follow an approximately regular relation to element number, providing physical evidence for ordering elements by atomic number rather than atomic weight.
Munk develops a depth-integrated wind-driven ocean-circulation model with lateral eddy viscosity, coupling inherited interior transport balance to asymmetric coastal layers and comparing predicted currents with observations.
Munkres gives a constructive starred/primed-zero variant of Kuhn's assignment algorithm, proves finite termination without requiring integer costs and provides an explicit polynomial bound in the paper's line-operation model, then states a transportation generalization.
Nagle proposes letting acknowledgments trigger the sending of buffered TCP data instead of creating a new packet for every small application write, reducing small-packet overhead without a fixed inter-packet timer.
Nemhauser, Wolsey and Fisher established a sharp worst-case guarantee for greedily maximizing a nondecreasing submodular set function under a cardinality limit.
Selection with a second prism and recomposition organize white sunlight as a mixture with differing refractive behavior, instead of colours generated solely by the first prism.
The 2008 CUDA article explains a GPU programming model in which independently schedulable thread blocks combine local cooperation, shared memory and barriers, allowing a fixed problem decomposition to run across different processor counts.
Ascending-chain/finite-generation conditions organize ideal decomposition: ideals in the specified commutative rings can be expressed as finite intersections of primary ideals, with scoped structural uniqueness statements.
Connects transient decay to winding of the one-round-trip response about +1, explains conditional stability and exposes missing high-frequency assumptions.
Oort compares nearby stellar radial velocities and proper motions with a first-order differential-rotation model, finding a longitude-dependent velocity pattern supporting Lindblad's rotating Galactic system.
Oppenheimer and Snyder construct an explicit pressureless spherical gravitational-collapse model matched to an exterior Schwarzschild geometry, distinguishing finite comoving time from asymptotic external-clock behavior.
Oppenheimer and Volkoff formulate general-relativistic hydrostatic equilibrium for a static spherical fluid and apply it to an ideal cold neutron gas, finding a model-dependent maximum gravitational mass near 0.7 solar masses.
The PageRank report formalized recursive hyperlink-based ranking with a rank-source/random-surfer interpretation, described computation on large web-link graphs and explored personalized restart sources.
Paige and Saunders present LSQR, using Golub-Kahan bidiagonalization and orthogonal transformations to solve sparse rectangular linear equations and least-squares problems using matrix and transpose actions, with inexpensive norm estimates and data-aware stopping criteria.
Paige and Saunders derive the Lanczos-based MINRES residual-minimizing and SYMMLQ LQ-factorization methods for large sparse real symmetric linear systems, avoiding the intermediate factorization failures that can defeat ordinary conjugate gradients on indefinite matrices.
Composite-residuosity classes provide a factorization trapdoor for probabilistic public-key encryption whose ciphertext multiplication implements plaintext addition modulo n, with explicit computational and decisional security assumptions.
Pauli proposes that no two equivalent atomic electrons can occupy the same complete four-quantum-number state, using strong-field spectral bookkeeping to account for closed electron groups and restricted atomic terms, without deriving a general spin-statistics theorem.
The 1925 monograph joined comparable stellar spectra with ionization analysis to estimate atmospheric temperatures and relative abundances, exposing extreme hydrogen/helium estimates while explicitly questioning those values.
Peano explicitly constructs a continuous mapping from the closed unit interval onto the whole unit square through ternary digits and parity-controlled complements, showing that continuity alone does not restrict a parametrized curve to an arbitrarily small enclosing area.
Two-generator perfectly hiding commitments combine with polynomial shares so recipients verify consistency non-interactively; secret privacy is information-theoretic while share consistency relies on the dealer not knowing the generator discrete-log relation.
A conditioned latent-patch transformer backbone with adaLN-Zero and controlledsize/patch ablations broadens diffusion architectural options while retaining establisheddiffusion/VAE/ViT methods.
Perlman gives a distributed protocol that selects a root and forwarding subset of a bridged extended LAN, preserving connectivity while removing forwarding loops after convergence, with explicit aging and reconfiguration delays.
Petri develops communication nets built from discrete locations and local actions, with explicit causality, parallelism and conflict, and presents constructions for asynchronous, extensible computation instead of assuming one global sequence of machine states.
Pollard introduced a low-storage iterative method for finding integer factors through collisions modulo an unknown factor, with a heuristic square-root operation estimate in the factor size under a random-mapping model.
Poynting derives a local electromagnetic energy balance from Maxwell’s theory and represents field-energy transport by a cross product of electric and magnetic intensities, illustrating how power reaches circuits and waves.
Prandtl introduces a thin viscous boundary region coupled to the outer flow, derives reduced equations for small-viscosity incompressible motion, and relates boundary-layer separation to observed wakes and a suction experiment.
Press and Schechter develop a statistical model connecting small gravitating seeds to a growing condensation mass spectrum, with a Gaussian-tail construction, a surviving maximum-variance self-similar branch and limited N-body tests.
Rabi solves the four-component Dirac electron equations in a homogeneous magnetic field, obtains discrete transverse energy branches with continuous longitudinal momentum, and explains a special lowest-state current condition, without deriving thermodynamic diamagnetism.
Rabin analyzes randomized compositeness-witness sampling: for each fixed composite, independent uniform trials give exponentially decreasing false acceptance, while a witness certifies compositeness; the journal paper includes implementation and reported experiments.
Rabin gives a public-key function based on modular quadratic equations and a randomized reduction showing that inversion on a substantial fraction of its invertible unit-domain outputs enables factorization of the modulus.
Rafailov and colleagues reparameterize a KL-regularized preference-learning objective as a direct policy classification loss, removing the separate learned-reward/PPO optimization stage and reporting results on sentiment, summarization and single-turn dialogue.
Information gives regular unbiased scalar/multiparameter covariance lower bounds, while the same matrix becomes an invariant local metric on identifiable statistical populations.
A mean/postulate-sensitive order family extends the Shannon limiting case and characterizes finite generalized information measures without equating weaker additivity to full grouping.
Richter constructs an empirical local earthquake magnitude scale from the logarithm of standardized instrumental amplitudes corrected for epicentral distance, separating event size from intensity at a particular site.
Cut-system period increments obey bilinear constraints; normalized periods have symmetry and a definite quadratic form compatible with convergent multivariable theta series and their transformations.
Complex functions are organized through local conformal behavior, branched multisheeted domains and connectivity, supporting study by domains and boundary/singularity data rather than only expressions.
Roe constructed approximate Riemann solvers with consistent flux-jump linearizations and a parameter-vector representation simplifying perfect-gas Euler equations, while explicitly identifying entropy and multidimensional limitations.
Thelatitude-gradientvorticitymechanism givesanexplicitrelationshipbetweenzonalwind,wavelengthandpatternspeedandboundedstationary-waveconditions.
A1968 published construction joins weak/electromagnetic leptonic fields with neutral mixing and spontaneous breaking that produces massive modes while preserving a massless electromagnetic mode.
Schwarz derived a dimension-dependent log-sample penalty for asymptotic Bayesian model comparison in regular finite-dimensional settings, giving the criterion now called BIC.
Schwarzschild derives an exact static spherically symmetric exterior solution of Einstein gravitational equations under specified asymptotic and coordinate conditions, and relates its geodesics to Einstein perihelion calculations.
Schwarzschild derives the exact static spherical interior geometry and pressure of an incompressible homogeneous fluid, matches it to exterior vacuum, and identifies the finite-positive-central-pressure compactness limit of this model.
Schwinger reports a finite radiative correction to the electron spin magnetic moment after expressing electrodynamic interactions in terms of measured mass and charge, and compares it with contemporary atomic measurements.
PRG-2 combines information approximation, complete-lattice types, continuity, effective bases and a recursive self-function-space outline to model higher-order computation mathematically.
Uniform random polynomial coefficients over a finite field make any k valid shares sufficient to recover a secret, while fewer shares have secret-independent distributions.
The paper formulates ideal reconstruction of bandlimited signals from sufficiently spaced samples and connects that representation to the geometry of communication signals.
Move-generation routines, position evaluation and fixed-depth versus selective continuations make limited-computation game search an explicit programming design.
The 2017 sparsely-gated mixture-of-experts layer routes each input to a small subset of learned networks, coupling large stored capacity to selective computation and explicit load-balancing mechanisms.
Absorption and emission are combined in a detailed-balance calculation that constrains ideal p-n junction conversion as band gap and radiative recombination vary.
An iid correlated pair can be compressed separately down to conditional-entropy individual limits and joint-entropy total limit when decoded jointly.
Exposes unequal-parameter asymptotic loss limitation, fixes teacher update under stopgradient, and combines inherited robust loss with empirical weighting/schedule/architecture choices for stronger direct training.
A boundary-constrainedtrajectory-endpoint map supports one/fewstep generation, teacher distillation anddirect-data training interface; originalfiniteexperiments andlaterCTargumentlimits separated.
Stark reported that an electric field separates selected gas spectral lines into polarized components, with a detailed 1914 experimental account following his 1913 announcement.
Steinitz organizes abstract commutative fields using prime fields, algebraic closure and transcendence bases, and classifies algebraically closed fields by characteristic and transcendence degree.
Stommel shows that a symmetric idealized heat-and-salt convection system can admit two locally stable flow regimes, with a separating unstable equilibrium and parameter-dependent transitions.
Latitude dependence of rotation generates western concentration of streamlines in a specified idealized wind/friction/pressure model.
Strang constructs a half-step/full-step/half-step composition that retains second-order accuracy under the stated smoothness and substep assumptions, with conditional stability and cost comparisons for multidimensional difference schemes.
Tarjan established nearly linear amortized bounds for weighted union with path compression, with inverse-Ackermann dependence, and a matching lower-bound analysis within the studied tree-algorithm model.
Tesla explains how phase-displaced alternating currents create a rotating magnetic field and describes synchronous and closed-rotor-coil motor forms that use it.
A spacelike-surface state functional and local-deformation formalism exposes Lorentz-compatible free/interaction separation under explicit commutation/density conditions.
Toomre analyzes the competition between rotation, stellar random motion and self-gravity, deriving with Kalnajs a local neutral-stability relation and the Gaussian stellar-disk threshold sigma_R approximately3.36G Sigma/kappa.
Tracy and Widom derive differential equations for Airy-kernel Fredholm determinants and characterize the soft-edge gap distribution on a half-line through a specified Painleve II solution, giving computable distributions for the largest ordered eigenvalues in the declared unitary random-matrix limit.
Tully and Fisher developed and calibrated an extragalactic distance method connecting corrected global neutral-hydrogen profile width with intrinsic photographic luminosity or galaxy diameter, and applied it to nearby calibrators and two galaxy clusters.
Makes the odd-component deletion obstruction necessary and sufficient for perfect matching across the defined finite graph class, linked to the symbolic Pfaffian representation.
A neural interpolator proposes simplifying symmetries/separability for recursive symbolic recovery, combined with existing units/fitting/search tools; reported known-equation benchmark recovery is scoped and revisable.
Unifies normality and second countability into an explicit metrization criterion, with a countable continuous-separator construction and two-direction topology compatibility.
Volder presents signed binary shift-add coordinate operations for real-time trigonometric rotation and vectoring, with a fixed gain correction and finite-word navigation implementation.
The inspected specification isolates a hot working vessel from a cold condensation vessel and provides non-condensable-air removal, changing the inherited thermal arrangement.
A chosen polynomial uniformly approximates the continuous real function across a specified finite interval to a prescribed positive error; polynomial-series organization retains local uniform convergence.
Welch presents a practical adaptive dictionary compressor that sends codes for previously encountered strings while its decoder reconstructs the dictionary, with simple mechanisms suited to high-throughput storage systems.
Local unit-modulus phase freedom is compensated by a potential transformation in covariant differentiation; the specified action connects gauge invariance with electromagnetic current conservation.
Wheatstone develops practical adjustable-resistance and balance methods for comparing electrical circuit constants, including a differential resistance measurer whose original principle he credits to Christie.
Constrains full temperature-dependent equilibrium spectra through reversible compression/Doppler reasoning, preserving a constant wavelength-temperature coordinate and appropriate spectral-density rescaling.
Supplies a concrete equilibrium thermal spectral model with explicit uncertain microscopic hypotheses, temperature/peak properties and experimentally testable limits.
Wilson defined transform faults as shear boundaries ending at other tectonic features and used their geometry to explain apparent ridge offsets and the connected boundaries of rigid crustal regions.
The article makes progressive task/data design, revisable choices, representation delay and reuse visible through one developed and extended nontrivial program.
Wu and He introduced group normalization, computing mean and variance across spatial positions and groups of channels within each example, enabling visual-network normalization without batch statistics.
Zeldovich extrapolates a growing-mode Lagrangian displacement from linear pressureless Newtonian cosmology and obtains density through its deformation Jacobian, predicting generic first compression into sheet-like structures while explicitly retaining uncertain nonlinear accuracy and post-compression limits.
Zhang and Sennrich introduced RMSNorm, replacing LayerNorm mean-and-variance normalization with root-mean-square scaling, and studied partial RMS estimation as a cheaper variant.
Ziegler and Nichols give practical proportional, integral-reset and derivative-pre-act tuning rules based on measured ultimate sensitivity and period or on a process reaction curve, with a declared decay-versus-offset compromise.
The exact 1978 joint paper broadens the encoder class to generalized variable-rate lossless coding and supplies a constructive incremental-parsing family with converse/attainment results for the finite-state compressibility of every individual infinite sequence.
An explicit Coma gravitational/velocity comparison exposes a large mass discrepancy and articulates conditional extra-dark-matter implications with alternative cases.
Computed exact attention with tiled GPU operations and recomputation, reducing transfers between high-bandwidth memory and on-chip storage without materializing the full attention matrix.
Reorganized exact-attention work across GPU blocks and warps and reduced non-matrix-multiplication operations to improve accelerator utilization.
Combined asynchronous data movement, overlapped matrix and softmax operations, and low-precision processing to accelerate attention on Hopper GPUs.
Fine-tuned low-rank adapters through frozen four-bit model weights, combining NormalFloat storage, double quantization and paged optimizers to reduce memory use.
Managed attention key-value caches with paged blocks, flexible sharing and copy-on-write, supporting higher-throughput serving in the vLLM system.
Shared key-value attention heads within query-head groups and described uptraining multi-head checkpoints to obtain a speed-quality compromise.
Encoded token position through rotations of query and key vectors, making their attention inner products depend on relative offsets.
Biased attention scores with head-specific linear distance penalties and evaluated language-model extrapolation beyond training sequence lengths.
Made state-space parameters depend on the input and used a hardware-aware recurrent scan to selectively retain sequence information in an attention-free model.
Connected structured state-space models and attention variants through semiseparable matrix representations, using this duality to design Mamba-2 computation.
Used a faster draft model and parallel target-model scoring with corrected acceptance sampling to produce multiple tokens per target call while preserving its sampling distribution.
Added trainable spatial-conditioning branches to frozen text-to-image diffusion models using zero-initialized connections.
Bound a subject to a learned identifier by fine-tuning a pretrained image diffusion model on a few reference images with a prior-preservation objective.
Constructed non-Markovian diffusion processes sharing a denoising training objective, enabling implicit reverse samplers and faster generation with fewer steps.
Combined conditional and unconditional diffusion score estimates to adjust the tradeoff between sample fidelity and diversity without a separate classifier.
Ran diffusion generation in pretrained autoencoder latent spaces and used cross-attention for conditioning, reducing image-generation computational requirements.
Developed a policy-improvement surrogate and practical constrained-update approximation for optimizing large nonlinear policies.
Interleaved generated reasoning traces with task actions and environment observations, evaluating question answering, fact verification and interactive tasks.
Generated and filtered API-call annotations by their effect on language-model prediction loss, then trained a model to select and use external tools.
Sampled diverse reasoning paths and aggregated their answers to improve measured performance relative to greedy chain-of-thought decoding.
Learned continuous input prompts while freezing a pretrained language model and studied how task performance changes with model scale.
Kept model parameters frozen while learning task-specific continuous prefixes that later tokens can attend to during generation.
Used approximate second-order information for one-shot post-training weight quantization of large pretrained language models.
Used activation statistics and equivalent channel scaling to protect salient weight channels during low-bit weight-only quantization.
Applied equivalent offline rescaling to shift activation outliers into easier-to-quantize weights, enabling eight-bit weight and activation inference.
Combined vector-wise eight-bit quantization with higher-precision treatment of outlier feature dimensions for large Transformer inference.
Built an evaluation framework from real repository issues and corresponding fixes, testing whether language models can edit code to resolve them.
Introduced a broad subject-based multiple-choice test for evaluating pretrained language models and identifying uneven performance and calibration.
Reported a large-scale model accepting text and images and producing text, together with capability, limitation and scaling-prediction evaluations.
Developed Ultra, Pro and Nano models jointly trained across text, images, audio and video, spanning server and device-oriented resource regimes.
Released dense and mixture-of-experts base and instruction-tuned language models with multilingual, coding and mathematical evaluations.
Documented large-scale pre-training, post-training and evaluation of the Llama 3 family, including the 405B multilingual model with extended context.
Combined loss-balancing changes, multi-token prediction, FP8 training and pipeline communication overlap in a large mixture-of-experts model.
Studied reasoning reinforcement learning without a supervised cold start in R1-Zero, then combined cold-start examples and staged training in R1 and distilled reasoning outputs to smaller models.
Combined low-resource language data mining and sparsely gated translation models with FLORES-200 evaluation across a large set of language directions.
Combined local, random and global attention connections for long text sequences.
Used permutations of autoregressive factorization and a two-stream attention design to learn bidirectional language representations.
Combined sliding-window attention and task-selected global tokens to process long documents; extended the design to encoder-decoder tasks.
Combined locality-sensitive hashing attention, reversible layers and chunked feed-forward computation to reduce long-sequence training costs.
Measured answering open-domain questions from fine-tuned model parameters without supplying a retrieved context, including scaling with model size.
Evaluated GLU-style Transformer feed-forward blocks, including GEGLU and SwiGLU, under matched parameter and computation budgets.
Fine-tuned shared BERT-based sentence encoders with siamese and triplet structures so embeddings can be compared without a cross-encoder pass per pair.
Projected sequence-length key and value dimensions into a lower-dimensional representation to reduce attention computation and storage.
Used positive orthogonal random features to estimate softmax attention with a computation order linear in sequence length at fixed feature count.
Compared learned and random synthetic alignment matrices with conventional query-key dot-product attention on language tasks.
Shared key and value representations across query heads to reduce decoder state traffic and improve incremental inference efficiency.
Learned region proposals using convolutional features shared with the detector, replacing a separate proposal-computation bottleneck.
Compressed key-value state into a joint latent representation for efficient decoding and integrated it into the DeepSeek-V2 expert model.
Used teacher-distribution training for smaller models together with local/global attention and grouped-query attention in an open-weight language-model family.
Integrated thinking and non-thinking responses in a unified model family and introduced inference-budget control with model-to-model knowledge transfer.
Reused hidden states across text segments with relative positional encoding to extend language-model context beyond a fixed segment.
Reordered kernel-feature attention computation associatively, allowing linear sequence-length computation and a recurrent autoregressive implementation.
Conditioned generation on retrieved text chunks using a frozen retriever and trainable encoding and cross-attention, testing large external text stores.
Introduced a shared long-sequence test suite across text, images and mathematical expressions to compare efficient Transformer designs.
Interleaved implicit long convolutions with input-dependent multiplicative gates as a subquadratic sequence operator for language modeling.
Defined multi-scale retention with parallel, recurrent and chunkwise-recurrent computations to combine parallel training and fixed-state incremental decoding.
Combined human-game imitation with a league of main and exploiter policies, reaching Grandmaster-level results in evaluated online StarCraft II games for all three races.
Extracted sparse learned features from a one-layer Transformer's activations and evaluated their interpretability, interventions and feature-splitting behavior.
Scaled sparse-autoencoder dictionaries to a production language model, investigating abstract multilingual and multimodal features and feature-based behavioral interventions.
Built prompt-specific attribution graphs using cross-layer transcoders as an interpretable replacement for model MLP computation, with intervention and faithfulness checks.
Partitioned optimizer states, gradients and model parameters across data-parallel workers to reduce replicated training memory.
Partitioned Transformer operations within layers across accelerators with targeted communication, enabling large language-model training.
Combined an imperative Python execution model with automatic differentiation and efficient accelerator-aware runtime components.
Combined graph-level optimization, operator scheduling and learned cost modeling to generate efficient neural-network code across hardware backends.
Split training batches into micro-batches and pipelined layer partitions over accelerators to train larger sequential networks.
Integrated ring-based collective reduction and a small training-code interface to simplify multi-accelerator data-parallel training.
Unified computation and mutable shared state in dataflow graphs mapped over heterogeneous devices and distributed machines for training and inference.
Scheduled inter-batch forward and backward work over automatically partitioned layer pipelines and retained parameter versions for matching computations.
Introduced tile-level tensor-program abstractions and compiler optimizations to generate efficient GPU kernels for neural-network computation.
Learned an ODE vector field from straight interpolations between coupled distributions and used repeated rectification to simplify generative transport paths.
Integrated the linear part of diffusion ODE dynamics analytically and approximated the remaining weighted neural-network integral with higher-order updates.
Used data-prediction parameterization, thresholding and multistep updates to improve stability of fast diffusion sampling with strong guidance.
Separated diffusion-model design choices and combined network preconditioning, training and sampler changes to improve image-generation efficiency.
Applied continuous-signal and filtering principles to generator design to reduce coordinate-tied texture artifacts and improve transformation consistency.
Combined a unified higher-order predictor and corrector, reusing model evaluations to improve few-step diffusion sampling.
Combined rectified-flow training-scale choices with separate text/image weights and bidirectional token interactions for high-resolution text-to-image generation.
Unified noise-conditioned generative processes through reverse-time SDEs and associated probability-flow ODEs, with predictor-corrector sampling.
Estimated gradients of noise-perturbed data densities at multiple scales and generated samples with annealed Langevin dynamics.
Trained a reverse stochastic chain to recover structure after a forward noising process, using a tractable probabilistic training construction.
Reported a text-and-image-input language-model family, with shared vision capabilities and evaluated capability/latency tradeoffs across Opus, Sonnet and Haiku.
Introduced grade-school multi-step word-problem evaluation and trained verifiers to rank generated candidate solutions.
Constructed questions designed to expose false answers learned from common human misconceptions and evaluated model answer truthfulness.
Selected challenging BIG-bench tasks and compared answer-only with chain-of-thought prompting on those tasks.
Used adversarially filtered generated distractors to create a challenging multiple-choice event-continuation dataset.
Built difficult expert-written multiple-choice questions with expert and non-expert validation to study model evaluation and scalable oversight.
Combined multi-turn questions, crowdsourced pairwise preferences and analysis of strong language models as judges for open-ended assistant evaluation.
Created questions requiring combinations of reasoning, browsing, multimodal interpretation and tool use, with controlled reference answers.
Evaluated policy-following API agents in conversations with simulated users, checking final database states and repeated-trial reliability.
Organized model-use scenarios and multiple quality, robustness and efficiency metrics in a shared evaluation toolkit with inspectable prompts and completions.
Built self-hostable functional websites and task-specific success checks for evaluating long-horizon language-guided web interactions.
Provided real operating-system environments, reproducible task setup and execution-based evaluators for multi-application computer tasks.
Combined multiple interactive environments to evaluate language-model reasoning, decision-making and instruction following as agents.
Constructed tool-use instructions and solution traces, trained a tool-oriented model with API retrieval, and evaluated multi-step API use.
Collected interleaved image/text questions demanding college-level knowledge and visual reasoning across multiple subjects.
Combined a curated visual question set, circular option testing and model-assisted mapping from free-form outputs to choices for multimodal evaluation.
Built a broad collaboratively contributed task suite and evaluation interface to characterize language-model behavior and scaling across diverse tasks.
Used receptance-weighted key-value computation to combine parallelizable sequence training with a recurrent decoding state.
Combined QK-clipped Muon optimization with large-scale expert-model training and synthetic/interactive agentic post-training.
Combined staged pre-training, expert-model iteration and reinforcement learning in a hybrid thinking/direct-response expert-model family.
Integrated a vision encoder and expert language model through staged multimodal training and post-training for understanding, reasoning and graphical-interface tasks.
Combined a spatiotemporal variational autoencoder, diffusion-Transformer training, data curation and evaluation in an open video-generation suite.
Developed a video-generation framework spanning data preparation, model architecture, progressive scaling and training/inference infrastructure.
Integrated sparse expert modeling with long-context training and serving, reporting retrieval and long-document, audio and video evaluations across million-token inputs.
Developed a multimodal model family combining reasoning-oriented post-training, adjustable thinking computation, long-context inputs and native tool use, with sparse-teacher distillation and resilient distributed training.
Combined diverse multilingual data and mixed pretraining objectives with compute-aware model/data allocation, reporting a more inference-efficient language-model family and a larger-scale scaling study.
Built and documented the original Qwen pretraining and human-alignment pipeline, including multilingual tokenization, context extension and chat models evaluated on tool use, code interpretation and specialized reasoning.
Released pretrained and instruction-tuned lightweight language-model checkpoints with a documented training, filtering and evaluation recipe adapted from Gemini research.
Integrated a high-compression video VAE, bilingual prompt encoders, full spatiotemporal attention and staged flow-matching/preference training, accompanied by an openly released video model and evaluation set.
Compared step-level and outcome-only supervision for mathematical reward models, reporting stronger solution selection with process feedback and active-learning gains, and releasing the PRM800K human-label resource.
Trained reasoning models to internalize explicit safety specifications through specification-referencing synthetic supervision followed by reinforcement learning, reporting better jailbreak resistance and less overrefusal on the evaluated tasks.
Constructed deliberately backdoored language models and tested whether supervised, reinforcement and adversarial safety training removed the triggered behavior, finding persistence in the studied settings.
Demonstrated context-dependent compliance and alignment-faking reasoning when an existing assistant was informed about a conflicting training objective, and examined synthetic-document exposure and actual reinforcement learning.
Separated weight shrinkage from the adaptive gradient transformation in AdamW, clarifying its difference from adding an L2 penalty and reporting improved image-classification generalization.
Approximated matrix-valued second-moment accumulators from row and column statistics and combined update clipping, decay scheduling and relative-step scaling for low-memory adaptive optimization.
Maintained separate matrix preconditioners for tensor dimensions to exploit parameter structure, with an online/convex analysis and empirical neural-network optimization comparisons.
Used evolutionary program search, selection and simplification to discover Lion, a momentum-based sign-update optimizer, and evaluated its transfer from proxy tasks to larger vision and language training.
Built a compiler and runtime that jointly searches inter-operator pipeline plans and intra-operator sharding to distribute deep-learning training across device meshes.
Optimized tensor placement and access over GPU, CPU and disk with linear-program-guided offloading and compression for high-throughput, latency-insensitive language-model generation.
Partitioned model training between GPU execution and CPU optimizer state/computation, combining communication-aware placement, a CPU optimizer and delayed updates with ZeRO data parallelism.
Jointly trained convolutional audio encoding/decoding with residual vector quantization, reconstruction/adversarial losses and quantizer dropout to support several bitrates within one streamable model.
Developed a streamable quantized audio codec using a multiscale spectrogram adversary, gradient-based loss balancing and optional language-model compression of latent codes.
Combined coarse self-supervised semantic tokens with fine neural-codec tokens in hierarchical language modeling, generating prompted speech and piano continuations without transcript-based supervision.
Learned policies and values by propagating gradients through imagined trajectories in a compact learned dynamics model, with visual-control evaluations.
Used discrete latent dynamics and separately trained imagined behavior learning to obtain strong aggregated Atari performance and extend latent-world-model control to discrete-action tasks.
Combined robustness-oriented model and learning changes to train across diverse observation, action and reward regimes with fixed hyperparameters, including a Minecraft diamond-collection demonstration.
Learned a video tokenizer, latent-action representation and autoregressive dynamics from unlabeled videos to generate environments controllable frame by frame.
Combined self-supervised video representation prediction with action-conditioned post-training on robot trajectories, enabling image-goal planning experiments on robot arms without local task-specific training.
Trained a token-sequence generative model conditioned on video, text and driving actions to synthesize controllable future driving scenarios.
Compared step-level, outcome-based and learned-reward feedback for GSM8K reasoning, separating final-answer accuracy from correctness of the reasoning trace.
Unified text/exemplar-prompted detection, segmentation and video tracking with decoupled recognition/localization, a scalable data engine and the companion SA-Co evaluation benchmark.
Learned visual representations from video through feature prediction without pixel reconstruction, text labels, negative examples or pretrained image encoders, evaluating frozen backbones on appearance and motion tasks.
Adapted a multimodal foundation model into embodied-reasoning and vision-language-action models, reporting manipulation generalization and few-shot specialization across tasks and embodiments.
Trained agents on natural-language instructions and visual observations across diverse 3D environments, acting through keyboard-and-mouse interfaces rather than privileged game state.
Integrated multi-GPU execution and architecture-aware inference with CPU/NVMe offloading to support dense and expert Transformer models under different latency and throughput constraints.
Released open-weight expert reasoning models with quantized expert weights, variable-effort reasoning, tool-use training and accompanying inference implementations and tokenizers.
Scaled self-supervised image representation learning and introduced Gram anchoring to stabilize dense features during long training, with adaptable model sizes and resolution strategies.
Trained language models with reinforcement learning for extended reasoning, reporting improvements with additional training and inference computation across coding and mathematical evaluations.
Scheduled autoregressive inference one iteration at a time and selectively batched operations, enabling finished requests to leave and new requests to enter active generation batches.
Combined momentum with inexpensive approximate Newton–Schulz orthogonalization of matrix-valued hidden-layer updates, with empirical neural-network training evaluations.
Integrated low-latency satellite inputs and observation-targeted learning into probabilistic global forecasting, producing hourly updates and finer spatiotemporal outputs including station-conditioned surface predictions.
Combined compressed sparse and heavily compressed attention with manifold-constrained residual connections and Muon optimization in an openly released long-context expert-model family.
Trained and openly documented a hybrid Mamba-Transformer expert model with granular sparse routing and multi-environment post-training for reasoning and tool-use workloads.
Scaled a hybrid linear/softmax attention expert-model architecture with optimized parallel execution and communication overlap, releasing text and vision-language models for long-context tasks.
Combined efficient hybrid-attention reasoning with CISPO reinforcement learning, which clips importance-sampling weights, and trained on reasoning and software-environment tasks.
Interleaved attention and selective state-space layers with sparsely activated experts, studying architecture choices for a long-context language model with reduced inference-memory cost.
Integrated device and server language models with mixed-bit compression, task adapters and post-training procedures including teacher-committee rejection sampling and mirror-descent-based preference optimization.
Combined a parallel-track mixture-of-experts server architecture with a device-model design using KV-cache sharing and two-bit quantization-aware training, alongside multilingual/multimodal post-training.
Released a documented English/Korean instruction-tuned language-model resource with bilingual tokenization, pretraining and alignment details and public/in-house evaluation.
Developed open language-model checkpoints with a web-data curation pipeline and distributed cloud-training tooling, documenting data mixtures, architecture decisions and large-scale training.
Documented a long-context language-model training pipeline and conditional online RLHF designed to handle conflicting preferences and reward hacking, releasing intermediate model stages.
Scaled filtered web and synthetic training data to produce compact general-purpose language models with on-device deployment experiments and documented post-training.
Released language-model weights together with training data, training/evaluation code and intermediate research artifacts to enable inspectable studies of model development.
Released compact dense and mixture-of-experts models with documented two-stage data-mixture selection, training and post-training procedures, supporting inspectable enterprise-oriented customization.
Provided models trained on the same ordered data across scales, with intermediate checkpoints and dataloader reconstruction tools for controlled studies of language-model learning dynamics.
Released a documented multi-source pretraining corpus and reproducible curation toolkit, with analyses of filtering, deduplication and source mixing for language-model research.
Used offline clustering to create hidden-unit targets for masked-region prediction, iterating the target construction to learn acoustic and linguistic representations from unlabeled speech.
Extended HuBERT-style pretraining with mixed-utterance denoising and gated relative positional bias to retain content and speaker information for multiple speech-processing tasks.
Modeled parallel compressed audio-token streams with a single autoregressive Transformer and interleaving patterns, supporting text- and melody-conditioned music generation.
Trained a non-autoregressive flow-matching model to infill speech from transcript and surrounding audio, enabling multiple synthesis and editing tasks through contextual conditioning.
Combined discrete audio-token language modeling with text conditioning and audio-mixture augmentation for compositional sound generation and continuation.
Connected joint music-text representations to hierarchical audio-token generation, allowing text/melody conditioning with mostly audio-only model training and releasing the MusicCaps evaluation resource.
Implemented low-precision NVFP4 pretraining with latent-expert Mamba/attention hybrids and native multi-token prediction, then consolidated specialist agentic teachers in the Ultra post-training system.
Documented a scaling-ladder model/data selection process, a custom distributed training stack and long-running reinforcement-learning recipe with adaptive entropy control and specialist consolidation.
Pretrained vision Transformers by predicting discrete visual tokens for masked image patches, transferring the learned encoder to image classification and segmentation.
Introduced multiway Transformer blocks and a shared masked-modeling objective across images, text and paired modalities, supporting deep fusion and modality-specific encoding.
Combined text representations with two-dimensional document layout and visual information in a pretrained model for scanned-document understanding.
Added text-image alignment and matching objectives with spatial-aware attention to jointly learn text, layout and image interactions for document understanding.
Unified masked text and image modeling and introduced word-patch alignment, using a common document Transformer representation for text- and image-centered tasks.
Used a shared Transformer with different attention masks to train unidirectional, bidirectional and sequence-to-sequence language objectives, enabling both understanding and generation.
Compressed pretrained Transformers by distilling attention distributions and value-vector relations from the teacher's self-attention module into a smaller student.
Combined modified residual normalization with depth-dependent initialization to stabilize very deep Transformer training, including reported thousand-layer experiments.
Used dilated attention with exponentially growing receptive fields and sequence-partitioned execution to reduce long-sequence attention computation and communication.
Stacked a cross-decoder over a self-decoder that produces reusable global key-value caches, reducing repeated layer-cache storage and enabling early-exit prefill.
Introduced BitLinear-based Transformer training with binary forward-pass weights, investigating scaling and inference-memory/computation savings from training low-bit models from scratch.
Extended the binary-weight design with absolute-mean ternary quantization into negative, zero and positive values, paired with an adapted Transformer training recipe and eight-bit activations.
Computed attention through a learned difference of two softmax maps, seeking to suppress irrelevant context while improving retrieval and language-model behavior in reported experiments.
Combined a low-rate continuous speech tokenizer with next-token diffusion to model long-form, multi-speaker speech within a language-model context.
Combined fast-response and reinforcement-learned extended-thinking modes in a model family with controllable thinking budgets, later extending the system to tool use during thinking and summarized long reasoning traces.
Extended gated delta updates with finer-grained memory gating and a specialized chunkwise algorithm, integrating the module with latent attention in a hybrid language model.
Replaced uniform residual accumulation with learned input-dependent attention over earlier layer outputs, with a blockwise variant and communication/computation strategy for scalable training.
Used a lightweight index branch for group-specific key-value block selection and a co-designed block-sparse execution kernel to make long-context attention cheaper.
Projected routed payloads and expert computation into a lower-dimensional latent space while retaining routing decisions in the original representation, trading communication and weight traffic for expert capacity.
Combined adaptive forgetting gates with targeted delta-rule memory updates, developing a hardware-oriented parallel training algorithm and hybrid sequence models.
Used a memory-efficient representation of Householder-matrix products to parallelize delta-rule linear-transformer training across sequence positions.
Derived a chunk-parallel gated linear-attention form that permits data-dependent matrix-memory forgetting while using ordinary tensor-core operations for training.
Integrated balanced expert execution, memory-aware hybrid-model kernels and persistent rollout/sandbox states to train long-horizon agents with million-token trajectories in Kimi K3.
Released a customizable multimodal model family with documented asynchronous reinforcement learning, controllable token effort, calibration rewards and complementary rubric/factual-claim verification training.
Combined a prompt-caching autoregressive encoder with a bidirectional diffusion decoder that denoises text canvases in parallel, then appends completed canvases for continued generation.
Adapted Muon updates by attention head, shared multi-token prediction parameters and decoupled rollout generation from training in an asynchronous agent-learning system.
Built a heterogeneous expert architecture combining shared and modality-specific parameters, with a documented multimodal training/deployment toolkit and open model family.
Trained multimodal understanding and generation under a common next-group-of-tokens objective, with elastic depth, expert capacity and routing sparsity to support multiple deployment budgets from one run.
Dynamically aligned text and speech units before interleaving in the Talker, reducing tokenization-rate mismatch in streaming multimodal speech generation.
Separated text reasoning and speech generation into end-to-end connected Thinker and Talker modules, with time-aligned audiovisual positions and streaming speech decoding.
Combined a Thinker-Talker mixture-of-experts system with multi-codebook speech prediction and a lightweight causal waveform decoder to start streaming from the first codec frame.
Reused selected token indices across layers to reduce sparse-attention indexing cost, with calibration-based layer selection and an optional multi-layer distillation objective.
Combined early multimodal fusion with alternating gated-delta and global attention layers in a sparse expert model family, releasing weights and implementation-facing architecture details.
Alternated centralized instruction tuning with separately optimized capability experts, parameter merging and polishing to integrate multilingual, retrieval and tool-use capabilities in Command A; documented an interleaved local/global attention implementation.
Released instruction-tuned multilingual models with multilingual data mixtures and expanded evaluation coverage; compared broad 101-language coverage with a later 23-language depth-focused allocation using the same instruction resource.
Combined a human-maintained task/knowledge taxonomy, teacher-generated instructions with quality filtering and multi-phase tuning to add skills and knowledge to pretrained chat models; powered the collaborative InstructLab workflow.
Adapted lightweight mixer blocks for pretrained forecasting across heterogeneous temporal resolutions using adaptive patching, resolution sampling/prefixes and channel-independent pretraining followed by channel/exogenous mixing during fine-tuning.
Released a layer-scaled language-model family with public-data preparation, training recipes, checkpoints, logs and evaluation framework, plus conversion paths for Apple-device inference and fine-tuning.
Integrated reassignment of capacity-dropped tokens, expert-specific learning-rate scaling and combined head/layer KV sharing into an open MoE training system, with published recipes and model checkpoints.
Documented and released bilingual pretrained/chat research models with cascaded data deduplication and filtering, manually verified instruction data, and context/depth adaptation experiments in one model-family resource.
Documented output-head normalization, maximum-logit regularization, elastic distributed-training choices and intermediate checkpoints for bilingual language-model training, enabling training-dynamics research.
Integrated spatial-temporal causal video compression, text/video expert-adaptive normalization, full spatiotemporal attention and progressive-duration/resolution training into an openly released video diffusion system.
Moved patchification into a high-compression video autoencoder and assigned its decoder the final pixel-space denoising step, co-designing compressed latent generation and fine-detail reconstruction for efficient video synthesis.
Integrated reasoning-based answer verification and pairwise preference rewards with online prompt-distribution adaptation and a streaming rollout scheduler that continues partial generations across policy versions.
Trained and released code models on deduplicated project-level repositories with dependency-aware code organization and fill-in-the-middle training, documenting a reusable code-generation and infilling pipeline.
Combined compressed-block context, selected fine-grained blocks and local attention in a trainable hierarchical sparse design, co-designed with GPU-friendly kernels for forward, backward and decoding workloads.
Added a low-cost lightning indexer with top-k latent KV selection and staged dense-to-sparse continued training, alongside scalable reasoning/tool-use training and synthetic interactive tasks.
Constrained multi-stream residual mixing through Sinkhorn-normalized nonnegative matrices and integrated fused kernels, recomputation and communication overlap to make expanded residual connections more stable at scale.
Combined asymmetric probability-ratio clipping, filtering of zero-advantage prompt groups and token-weighted policy optimization in an openly documented large-scale reasoning-model RL pipeline.
Introduced response-length-adaptive advantage estimation within a value-based long-reasoning training framework, integrating value pretraining, decoupled estimators, clipping and positive-example learning.
Combined single-controller orchestration with distributed model-worker execution and hierarchical dataflow APIs, plus actor resharding between training and generation through a hybrid engine.
Recast preference-based language-model optimization at sequence level and empirically compared simple REINFORCE and leave-one-out baselines against more elaborate actor-critic pipelines.
Scaled and quantized time-series values into a fixed token vocabulary, pretrained language-model architectures with cross-entropy and sampled future trajectories for probabilistic forecasts; supplemented public data with Gaussian-process synthetic series.
Pretrained a patched decoder on a broad time-series corpus to support forecasting across varying input histories, output horizons and temporal granularities without task-specific retraining.
Developed a masked-encoder forecasting architecture for heterogeneous frequencies, variable numbers of channels and varying output distributions, trained on the accompanying LOTSA time-series collection.
Combined an entropy-regularized stochastic actor with off-policy value/policy updates for sample-efficient continuous control.
Combined clipped double-critic targets, delayed policy updates and target-action smoothing to reduce approximation-error amplification in deterministic actor-critic control.
Integrated six complementary DQN extensions and used ablations to characterize their joint effects on Atari learning efficiency and final performance.
Showed that a predictor and stop-gradient operation can train a simple shared-weight Siamese representation learner without negative pairs, momentum encoders or unusually large batches.
Trained an online encoder/predictor to match another augmented view encoded by a slowly moving target network, obtaining visual representations without explicit negative pairs.
Learned visual features by predicting cluster assignments across augmented views and introduced mixed-resolution multi-crop training to improve representation learning without exhaustive pairwise feature comparisons.
Optimized cross-view feature cross-correlation toward an identity matrix, combining invariance on matched dimensions with suppression of redundant dimensions.
Combined cross-view invariance, per-dimension variance control and covariance decorrelation to stabilize joint-embedding self-supervision without relying on negative-pair sampling.
Used teacher-student self-distillation on masked patch tokens and global image tokens so the visual tokenizer learns jointly with masked-image pretraining.
Integrated a language-consistency reward with verified reasoning tasks and continuous asynchronous generator/trainer updates, documenting reasoning training and release of a smaller research model.
Trained a variable-resolution/aspect-ratio vision encoder with interleaved image/text decoding and released a multiturn multimodal benchmark plus standardized prompt/parsing evaluation tools.
Integrated chunked audio encoding and downsampled audio-language adaptation for long-audio conversations, released open weights and speech understanding/reasoning evaluation resources, and documented transcription-versus-understanding training tradeoffs.
Specialized an open language model for repository-level software agents using test-checked environment trajectories, two-stage quality filtering and further policy optimization within an established coding-agent scaffold.
Combined autoregressive semantic-token generation with a flow-matching acoustic decoder and a hybrid semantic-VQ/acoustic-FSQ codec, adapting preference training and streaming execution to this discrete/continuous architecture.
Jointly optimized a generation policy and a policy that improves its outputs through a regularized adversarial preference objective, deriving an offline supervised training formulation and evaluating iterative self-revision.
Documented super-selective activation checkpointing, asynchronous checkpoint discovery and communication/allocator adjustments in a multimodal model-training system spanning Trainium and GPU clusters.
Jointly trained a prompt-conditioned sparsity predictor and language model to choose structured feed-forward parameter masks, keeping selected parameters fixed for an input or task to reduce repeated weight loading.
Separated temporal and codec-depth processing and reused a fully shared, stage-conditioned depth decoder across quantization levels, combining it with a fixed-window cache for streaming semantic-to-audio detokenization.
Stored a larger sparse model in flash and selected prompt-dependent expert subsets into DRAM, combining always-active shared weights, periodic expert reselection and task-dependent active capacity for on-device multimodal inference.
Mapped varying image resolutions to variable visual-token counts and decomposed rotary position encoding across text, image and video axes within a unified visual-language model.
Extended dynamic visual processing to frame-rate variation, aligned temporal rotary indices to absolute time and integrated window attention in a native-resolution vision encoder.
Used language-only teacher-generated visual instruction data and a vision-encoder/language-model connector to train an open multimodal instruction-following assistant.
Integrated long-context reasoning RL with reusable partial rollouts, policy optimization and multimodal data, and transferred longer reasoning behavior toward shorter-response models through length control and merging.
Released an integrated video curation/orchestration pipeline, visual tokenizers and pretrained generative video models with examples of domain post-training for robot and driving research.
Coupled a vision-language environment/instruction module with a diffusion-transformer action module, trained end-to-end on real, simulated, human-video and synthetic experience for cross-embodiment manipulation.
Paired trainable multiresolution hash-grid features with small neural networks and fused GPU kernels to accelerate fitting and rendering of neural graphics primitives.
Optimized anisotropic Gaussian scene primitives with adaptive density control and visibility-aware differentiable splatting to enable high-quality novel-view rendering at interactive rates.
Used a pretrained two-dimensional text-image diffusion prior to optimize renderings of a three-dimensional representation through score distillation, avoiding a separately trained text-3D generator.
Combined a perceptual/adversarially trained discrete image autoencoder with transformer modeling of latent image tokens for conditional high-resolution synthesis.
Combined learned vector-quantized latent codes, encoder/decoder training and an autoregressive prior to learn discrete representations for generative modeling.
Organized discrete latent image representations across multiple scales with stronger conditional autoregressive priors to separate global structure and fine detail in image synthesis.
Trained bidirectional image-token prediction on random masks and generated images through parallel prediction and iterative refinement rather than fixed raster-order decoding.
Combined frozen language embeddings with low/high-resolution discrete image tokenizers and masked base/upsampling models for parallel text-conditioned image synthesis and editing.
Documented encoder-decoder modeling of discrete image tokens and released a broad compositional-prompt evaluation resource to characterize scaling, content fidelity and failure modes in text-to-image synthesis.
Combined scalable conditional GAN architectural/training changes with generator orthogonal regularization and a truncation-based control of image fidelity versus variety.
Used gradients from a separately trained classifier to steer diffusion sampling, with architecture ablations and upsampling integration to control image quality versus diversity.
Learned reverse-process variances and used modified objectives/noise schedules and importance sampling to improve diffusion likelihood and reduce required sampling steps.
Compressed audio through a multi-scale discrete autoencoder and modeled the codes with autoregressive transformers, integrating lyric/artist/genre conditioning for longer music-and-singing generation.
Expanded residual streams into multiple hidden vectors and learned their depth and width mixing, with input-dependent connection matrices in the dynamic variant.
Related linear attention to normalized outer-product fast-weight programmers and replaced additive writes with a learned-strength delta update that corrects the value currently associated with a key.
Learned an embedding in episodic few-shot tasks and classified queries by distance to each support class's mean embedding, extending the same prototype framework to description-based zero-shot cases.
Split prompt prefills into uniform chunks and batched one compute-intensive chunk with pending token decodes, improving decode utilization and reducing pipeline imbalance.
Jointly pretrained a dense retriever and Fusion-in-Decoder generator for knowledge-intensive few-shot tasks, studying adaptation strategies and updating the external document index.
Co-designed a structured generation language and execution runtime with radix-tree LRU caching of attention KV states, enabling prefix reuse across dependent generation calls.
Mapped labeled support examples and a query through learned representations and attention to predict unseen-class labels, training on episodes that mimic the one-shot test setting.
Repeatedly sampled a task, trained on it and moved a shared parameter initialization toward the resulting weights, learning an initialization for fast adaptation without differentiating through the inner optimization.
Encoded queries and documents independently with BERT, retained multiple contextualized token vectors and used lightweight late interaction to support offline document encoding and scalable passage search.
Trained independent question and passage encoders from question-passage supervision and used dense similarity retrieval to supply evidence for an open-domain answer reader.
Trained dense text retrieval through contrastive learning without labeled query-document pairs, then tested cross-domain retrieval and optional supervised adaptation.
Encoded each retrieved question-passage context independently and let one decoder attend to their concatenated representations, enabling evidence fusion across more passages without joint encoder self-attention over all contexts.
Optimized shared initial parameters so that a few task-specific gradient updates yield useful performance on a sampled new task, applying the same outer objective across classification, regression and policy learning.
Combined composable block-sparse KV-cache representations, JIT-customizable attention templates and dynamically load-balanced scheduling compatible with static CUDA graphs.
Placed prefill and decoding on different GPUs and jointly selected per-phase resource allocation, parallelism and placement to improve goodput subject to first-token and per-output-token latency targets.
Coupled residual compression of multivector token representations with denoised supervision, reducing late-interaction index footprint while improving retrieval quality.
Integrated interleaved temporal/spatial rotary frequencies, intermediate-ViT feature injection into multiple language layers and explicit timestamp tokens, together with balanced text/multimodal training.
Integrated a causal autoregressive reasoner and a bidirectional diffusion generator through shared attention over text, vision, audio and action tokens, aligning differing media/action sampling rates on physical time.
Standardized heterogeneous manipulation datasets across robots and institutions and demonstrated cross-robot policy transfer with RT-X models.
Combined flexible observation/task tokenization, block-structured transformer processing and diffusion action decoding into an open policy initialization adaptable to new sensors, action spaces and robots.
Released a multi-robot vision-language-action model and training pipeline combining fused pretrained visual features, a language backbone and tokenized robot actions, with efficient target-robot fine-tuning.
Represented action-sequence policies as observation-conditioned denoising diffusion and combined visual conditioning, temporal modeling and receding-horizon execution for multimodal manipulation behavior.
Paired an accessible leader–follower bimanual teleoperation platform with transformer-based generation of action sequences, learning fine manipulation from short demonstration sets.
Coupled a pretrained vision-language backbone to a separate continuous-action flow-matching expert and trained across dexterous robot embodiments, supporting direct prompting and task-specific adaptation.
Co-trained on robot trajectories, web vision-language tasks, object grounding and semantic subtask prediction, combining high-level instructions and a low-level action expert to transfer manipulation to unseen household environments.
Introduced ARC as a few-example abstraction/generalization benchmark organized around explicit prior assumptions, separating acquired task skill from broader skill-acquisition efficiency.
Continuously collected timestamped programming-contest problems and evaluated generation, repair, execution and test-output prediction to assess coding models beyond a static generation-only test.
Designed GPU-efficient k-selection and memory-aware similarity-search pipelines; the later library report documents composable indexing, compression and search tradeoffs in the evolving FAISS toolkit.
Weighted quantization error by high-inner-product query/data pairs, optimizing approximate retrieval relevance rather than only Euclidean vector reconstruction error.
Built nested proximity-graph layers with randomized maximum levels and searched from coarse upper layers toward the base, combining distance-scale separation and neighbor-selection heuristics.
Combined a multimode encoder–decoder training framework with synthetic captioning and filtering of both web and generated captions, improving reuse across understanding and generation tasks.
Trained a lightweight querying transformer in representation-learning and generative-alignment stages to bridge frozen pretrained image encoders and language models.
Used asymmetric cross-attention to distill high-dimensional multimodal inputs into a fixed-size latent array processed through iterative attention, separating input size from latent network depth.
Extended Perceiver with learned output queries that read the latent representation to produce structured outputs of varying size and semantics while retaining decoupled latent processing.
Adapted label-free teacher–student self-distillation, momentum targets and multi-crop training to visual transformers, producing transferable features and emergent object-region attention.
Replaced globally normalized softmax image-text contrastive loss with pairwise sigmoid classification, decoupling the objective from global batch normalization and enabling efficient distributed scaling.
Integrated sigmoid image-text training with captioning, self-distillation, masked prediction and online curation, releasing multilingual encoder variants with stronger dense/localization features and flexible resolution.
Distributed groups of visual tokens across aligned language/vision transformer layers through residual injection, allowing richer visual inputs without placing all tokens in the language input sequence.
Assembled competition mathematics problems with normalized-answer evaluation, difficulty/subject labels and worked solutions, plus auxiliary mathematical pretraining material for research on model reasoning.
Applied preference modeling and RLHF to helpful/harmless assistants and iterated online human feedback with regularly refreshed preference and policy models, studying capability compatibility and reward–KL behavior.
Rewrote a subset of static mathematics problems as executable functional templates and compared model performance on original problems against newly instantiated snapshots.
Assembled difficult multimodal academic questions with known short or multiple-choice answers, staged expert review and public/private evaluation splits to probe frontier-model accuracy and calibration.
Conditioned sequential flow-based multimodal generation on images, camera poses and depth in a shared spatial context, integrating novel-view generation, geometry reconstruction and explicit3D outputs.
Compressed continuous action chunks through discrete-cosine-transform-based tokenization before autoregressive learning, releasing a tokenizer trained across diverse robot embodiments and control rates.
Generated the next diffusion/flow action chunk while executing the current one, freezing already committed actions and inpainting the remaining sequence to reduce latency-induced discontinuities.
Simulated inference delay during training and conditioned on action prefixes directly, replacing inference-time inpainting while retaining asynchronous action-chunk execution.
Trained the vision-language backbone with discrete-action/text prediction while separately training a continuous flow-action expert, stopping the expert's gradients into the backbone to preserve useful representations.
Combined demonstrations, autonomous rollouts and human interventions with value-based advantage estimates and conditioned policy extraction, iterating offline RL and real-robot deployment data collection.
Combined compressed video history for short-term spatial context with language summaries for long-term semantic events, integrating both into a robot policy for partially observed multistage tasks.
Exposed a compact task-relevant token from a pretrained VLA and trained lightweight actor/critic heads with a regularizer anchoring actions to the frozen VLA, enabling online adaptation of precise manipulation.
Conditioned heterogeneous robot and non-robot training episodes on detailed language, performance/strategy metadata, control modality and visual subgoals, supporting steerable composition rather than naive mixed-quality behavior averaging.
Co-designed gated short-convolution/GQA backbones through hardware-in-the-loop search and combined them with tempered decoupled top-k distillation, releasing dense, sparse and multimodal edge-oriented variants.
Integrated modular text/image/video/audio input encoders with a text-generating backbone and staged data/objective/context curricula, including synthetic reverse instruction construction from long documents.
Integrated a balanced Korean/multilingual/code pretraining mixture with Korean-centered human demonstration/preference alignment, documenting bilingual and cross-lingual evaluation in one model family.
Copied a pretrained transformer, removed complementary top/bottom layer blocks and concatenated retained layers before continued training, increasing depth while reducing discontinuity at the join.
Integrated data, operator-model, pipeline and optimizer parallelism with rematerialization in MindSpore Auto-parallel for large Chinese autoregressive model training on Ascend accelerators.
Integrated LLM-based idea generation, experiment coding/execution, analysis, manuscript drafting and simulated reviewing within human-provided ML research templates.
Replaced fixed experiment templates with an experiment-manager agent and progressive experiment tree search, adding vision-language feedback for figure/content refinement.
Maintained a diverse archive of coding-agent programs, selected variants for LLM-guided self-modification and evaluated them on coding benchmarks, allowing improvements to the agent harness itself.
Combined archive-parent sampling, code-novelty rejection and bandit-based model selection to allocate program-evolution attempts, testing sample efficiency across computational tasks.
Learned compact task-specific scales for singular weight components with RL, then dispatched or mixed these expert vectors in a two-pass adaptation process at inference.
Evolved a learned memory-management network conditioned on attention values to select retained KV context separately across layers/heads, studying transfer across model/task settings.
Optimized model-merging recipes in parameter and inference-dataflow spaces using evolutionary search, combining capabilities of existing models without retraining each from scratch.
Iteratively proposed and evaluated preference-training loss code with an LLM, yielding a logistic/exponential blending objective and testing transfer to held-out tasks.
Adaptively chose between fresh candidate expansion and feedback-based refinement of existing solution nodes, balancing broad sampling and deep search during language-model inference.
Systematized image pretraining, large-scale video pretraining and high-quality video fine-tuning, studying captioning/filtering pipelines for transferable latent-video models.
Released documented text-to-video and reference-image-conditioned video models, supporting experiments on content-preserving video generation beyond closed commercial tools.
Compressed videos with a temporally causal discrete tokenizer and generated tokens with a text-conditioned masked transformer, combining image/text and video/text data for variable-length prompt sequences.
Scaled flow-matching media models and post-training to combine video synthesis, synchronized audio, reference-based personalization and instruction editing within a documented model cast.
Combined progressively harder text-rendering training with multitask reconstruction/editing and separate semantic/reconstructive image encodings to align a vision-language encoder with a diffusion transformer.
Integrated dual-branch audio/video diffusion with cross-modal coupling, staged data curation and multidimensional post-training rewards to generate synchronized visual and audio sequences.
Trained a decoder-only transformer on mixed multimodal generation objectives over video, image, text and audio representations, then adapted the pretrained model to conditioned video-generation tasks.
Extended a sparse language backbone with semantic/latent visual encodings and diffusion image modeling, integrating reasoning-style prompting and progressive multimodal training into an open image-generation resource.
Jointly trained text-to-video and image-to-video tasks with native multishot support, combining curated caption data, video-specific post-training rewards and multistage inference distillation.
Added spatiotemporal blocks to a pretrained latent image model and used variable-frame joint image/video training, releasing a reproducible text-to-video baseline.
Inserted and trained temporal components in pretrained image latent-diffusion models and upsamplers, reusing spatial weights for coherent higher-resolution video and personalized-model transfer.
Trained a motion module on video while freezing a base text-to-image model, then inserted that module into compatible personalized variants to animate them without variant-specific video tuning.
Integrated a scalable single-stream diffusion transformer, curated training curriculum, few-step distillation and reward post-training into an accessible image-generation/editing model family.
First generated an image from text, then generated a video conditioned on both that image and the prompt, using adjusted noise schedules and staged training rather than a deep model cascade.
Used text/image semantic context through sequence concatenation in a flow-matching model to unify local and generative editing, introducing a benchmark for single-turn quality and multi-turn consistency.
Conditioned video diffusion on adjustable-detail monocular depth and text/image content, jointly training on images/videos to balance structural fidelity and desired edits.
Developed bilingual text/image encoding and glyph-aware training, extended the pipeline with defect-aware sampling and accelerated generation, and integrated text generation, image editing and multi-image composition.
Applied different noise levels across token subsets and matched mixed-input features to a cleaner internal target, combining representation prediction with standard flow loss without an externally pretrained representation teacher.
Compared semantic and perceptual autoencoder spaces under mostly controlled flow-training settings, varying noise/sampling schedules and assessing reconstruction fidelity, compression and generative learnability.
Aligned projected noisy-input hidden features with clean-image features from a pretrained visual encoder as an auxiliary loss for diffusion and flow transformers.
Paired frozen pretrained representation encoders with trained decoders and adapted diffusion training to high-dimensional semantic latents using width, noise-schedule and decoder-robustness changes.
Trained a causal denoising sequence model with independent per-token noise levels, permitting variable-horizon generation, guidance and planning within one training/sampling framework.
Trained one transformer on interleaved text and continuous image latents with next-token text loss, image diffusion loss and causal-text/bidirectional-image attention.
Decoupled semantic-understanding and image-generation visual encoders while retaining a shared autoregressive transformer, reducing the empirically observed representation tradeoff.
Integrated rectified-flow image generation with an autoregressive language backbone, retaining separate understanding/generation encoders and aligning intermediate representations during training.
Combined two modality-specific transformer experts and distinct visual encoders with shared self-attention, training on curated interleaved text/image/video/web data and releasing a unified understanding/generation system.
Developed stable early-fusion training and mixed-modal alignment for a transformer generating interleaved discrete image/text tokens, with architectural normalization changes and a long-form mixed-modal evaluation.
Studied uniform and validation-greedy weight averaging across independently fine-tuned models from a shared pretrained initialization, retaining a single-model inference footprint.
Trimmed small task-vector updates, elected a parameter-wise sign and merged only aligned updates to reduce empirical interference between models fine-tuned from a common base.
Randomly removed task-delta entries, rescaled retained entries and combined homologous fine-tuned models with existing merging methods, studying when sparse deltas preserve measured abilities.
Integrated language/visual understanding and continuous image/video/action generation through two expert streams with shared attention/KV state, combining next-token and flow objectives in a research-preview system.
Released compact game-trained inverse-motion models, comparing optical-flow inputs with direct pixels and using filtered/resampled game controls to infer movement/camera labels for unlabeled videos.
Defined persistent genesis/first-frame context with timestamped subject/scene events and per-frame camera inputs, fine-tuned an audiovisual model on that representation and integrated causal sliding-window generation.
Kept initial attention-sink tokens alongside recent tokens in a fixed rolling KV cache, enabling stable streaming generation beyond the model's training context without fine-tuning.
Distilled transformer representations and predictions in general-domain and task-specific learning stages to produce compact BERT students.
Extended LLMLingua with question-aware coarse/fine selection, document reordering, dynamic compression budgets and subsequence recovery for long-context prompts.
Performed autoregressive generated-context rollouts with KV caching during training and video-level losses, using few-step denoising and stochastic gradient truncation to reduce exposure mismatch.
Allocated different KV-cache budgets across layers based on observed information-funneling patterns, retaining more entries in lower layers.
Integrated DeepSpeed-MII/Inference with Dynamic SplitFuse to compose prompt and decoding work into better-balanced forward passes for throughput/latency tradeoffs.
Combined recency and accumulated attention heavy hitters in a dynamic KV-cache eviction policy and evaluated its memory/inference tradeoff.
Distilled BERT during pretraining with language-modeling, teacher-distillation and cosine-distance losses, yielding a reusable smaller representation model.
Adapted consistency distillation to guided latent diffusion and added latent-consistency fine-tuning for few-step high-resolution synthesis.
Used attention in a final prompt observation window to select clustered important KV positions independently for attention heads without model fine-tuning.
Removed paired-trajectory regression from DMD, stabilized synthetic-score learning with two-timescale updates, added real-data adversarial loss and simulated multi-step inference inputs during training.
Distilled a one-step generator using the difference between target and synthetic score estimates plus paired-trajectory regression, matching distributions rather than only individual teacher paths.
Integrated deep-compression autoencoding, linear diffusion attention, a decoder-only text encoder and Flow-DPM sampling/caption-selection choices for efficient high-resolution synthesis. Later Sprint combines continuous-time consistency and latent adversarial distillation with step-adaptive sampling and interactive ControlNet.
Combined a prompt-component budget controller, iterative token compression and small-model distribution alignment to compress inputs for an otherwise black-box language model.
Repeatedly distilled a deterministic diffusion sampler into a student taking half as many steps, with parameterizations designed for few-step stability.
Scored corpus tokens with a reference model and focused training loss on higher excess-loss tokens, evaluating token-selection effects in math and general language-model training.
Initialized a causal video student from teacher ODE trajectories and applied asymmetric distribution-matching distillation for few-step cached streaming generation.
Distilled trajectory-based image/video generators to predict several denoising steps per network evaluation, learning a mean-velocity representation without derivative regression.
Trained a dual visual/text encoder with contrastive alignment on a large, lightly filtered image/alt-text corpus and studied transfer and cross-modal retrieval.
Used hierarchical patch merging and alternating shifted local-attention windows to connect regions while limiting per-layer spatial attention cost.
Systematically modernized a ResNet design with transformer-inspired training and architectural choices while retaining standard convolutional building blocks.
Co-designed a convolutional masked-autoencoding framework with Global Response Normalization to enhance inter-channel feature competition.
Combined hardware-aware architecture search, NetAdapt and manual architecture changes for mobile CPUs, with a lightweight LR-ASPP dense-prediction decoder.
Jointly optimized training speed and parameter efficiency through architecture search/scaling and adjusted regularization as training resolution increased.
Combined pointwise group convolution with channel shuffling to permit cross-group information flow in compute-limited mobile convolutional networks.
Designed squeeze/expand Fire modules and channel/filter allocation strategies to reduce parameters while maintaining measured ImageNet classification performance.
Introduced residual learning around space-to-channel features and a decoupled adaptation/training procedure to retain reconstruction quality at high spatial compression.
Modeled time-interval average velocity and trained against an identity linking it with instantaneous velocity, enabling a from-scratch one-step flow generator.
Conditioned one generative network on noise level and desired step size to support one-step and variable-budget sampling within a single training phase.
Reworked continuous-time diffusion/consistency parameterizations, architecture and objectives to address unstable consistency training at larger scale.
Combined teacher score-distillation signals with adversarial loss to train few-step foundation-image generators.
Replaced ADD's pixel-space fixed visual discriminator features with features from pretrained latent diffusion models, simplifying high-resolution/multi-aspect distillation.
Integrated hierarchical filtering/annotation, progressive training, VideoDC-AE/DiT architecture and system optimizations in an openly released video-generation training system.
Introduced attention-based distillation through a dedicated token and a data-efficient supervised ViT training recipe; the later III study simplified and strengthened supervised augmentation/training baselines.
Released a modular PyTorch framework integrating diffusion/flow distillation approaches, network/data adapters and distributed training/inference configuration for cross-method research.
Released the Grok-1 base checkpoint and JAX reference implementation with explicit sparse-expert, grouped-KV and tokenizer specifications, enabling public model-level research.
Released a text-prompted generative audio system and code/model resources for multilingual speech and non-speech audio, documenting inherited GPT-style semantic/acoustic generation and EnCodec representation.
Combined a compact dual-softmax recurrent waveform model with sparse weights and a subscale generation scheme to improve audio sampling efficiency.
Combined a linear-prediction spectral envelope with a WaveRNN-derived neural excitation model to reduce speech-synthesis complexity.
Combined Glow-style invertible transformations and WaveNet-derived components in a likelihood-trained parallel waveform synthesizer conditioned on mel spectrograms.
Developed a non-autoregressive convolutional generator and multi-scale adversarial training choices for conditional mel-spectrogram inversion.
Integrated multi-period and multi-scale discrimination with a multi-receptive-field generator to improve efficient mel-conditioned waveform synthesis.
Combined conditional variational inference, normalizing flows and adversarial waveform training with a stochastic duration predictor for parallel text-to-speech.
Trained a character-conditioned sequence-to-sequence acoustic model with spectrogram reconstruction to simplify feature-engineered text-to-speech pipelines.
Integrated a recurrent character-to-mel predictor with a modified WaveNet vocoder and evaluated compact acoustic conditioning choices.
Used a feed-forward transformer and predicted phoneme durations/length regulation to generate mel spectrograms in parallel, learning alignment from an autoregressive teacher.
Replaced distilled acoustic targets with ground-truth speech features and added explicit duration, pitch and energy conditioning/prediction, including a waveform-generation extension.
Used a generative flow and monotonic alignment search to learn text/speech alignment internally for parallel acoustic synthesis without an external teacher aligner.
Padded character text with filler tokens and trained flow-based mel infilling to support non-autoregressive zero-shot speech without explicit phoneme alignment/duration modules.
Refined filler-token text representations with ConvNeXt and introduced Sway sampling for an E2TTS-style flow/DiT speech generator.
Modeled user and assistant speech as parallel codec-token streams and predicted time-aligned text before audio tokens, combining a neural codec with a language backbone for duplex dialogue.
Inserted vector quantization into a multilingual recognition encoder to obtain supervised semantic tokens, coupling text-to-token language modeling with conditional-flow speech rendering.
Combined finite-scalar speech-token quantization, a pretrained text-language backbone and chunk-aware causal flow rendering to support streaming and non-streaming speech in one system.
Extended supervised speech token learning across semantic, prosodic and speaker tasks and introduced differentiable-reward post-training alongside a broader training corpus.
Integrated a serial fast/slow autoregressive design and grouped finite-scalar audio quantization with language-model linguistic processing for multilingual speech synthesis.
Separated low-rate semantic codes and fixed-length global speaker attributes in BiCodec and integrated them with a Qwen-based synthesis system and annotated VoxBox resource.
Released a unified speech/text interaction system with a synthetic speech-data engine, a distilled TTS model and instruction/control/tool-use training plus evaluation resources. Step-Audio2 adds a latent audio encoder and reasoning-centric reinforcement learning while integrating paralinguistic speech generation and audio/text retrieval.
Modeled interleaved text/audio history with a zeroth-codebook backbone and smaller residual-codebook decoder, subsampling decoder training frames and evaluating contextual pronunciation/prosody.
Combined summarized history memory, left-context KV caching and parallel block training for low-latency acoustic transformers.
Integrated end-to-end recurrent speech recognition, multi-GPU training and synthesized noisy training data to reduce hand-engineered recognition stages.
Learned raw-audio representations through a convolutional future-versus-negative contrastive objective and transferred them to supervised acoustic modeling.
Jointly trained a pyramidal recurrent listener and attention-based recurrent character speller for speech transcription.
Shared an encoder-decoder between speech/text tasks through modality-specific pre/post networks and random-mixed cross-modal quantization during pretraining.
Combined a text-language backbone with audio-token modeling to transfer text pretraining into speech understanding, generation and translation.
Predicted subword text then discrete acoustic units in a jointly optimized two-pass model, with text-decoder pretraining and coordinated search.
Integrated self-supervised speech representation, automatically aligned speech-translation data and a multitask speech/text translation system with released research artifacts.
Combined prosody/style-preserving speech translation with Efficient Monotonic Multihead Attention and streaming generation, integrating released evaluation and watermark resources.
Integrated speech and general-audio encoders with a pretrained language model and used few-shot activation tuning to elicit broader audio-conditioned behavior.
Combined an ASR-derived vector-quantized speech tokenizer with synthesized interleaved text/speech pretraining and conversational adaptation of a text-language model.
Factorized speech codes into content/prosody/detail and timbre components and generated those attributes with conditioned diffusion models.
Adapted a speech-native model with synthetic spoken question/answer supervision and verifiable-reward reinforcement learning, studying reasoning-token and streaming tradeoffs.
Developed hierarchical task-tag conditioning for heterogeneous audio-language pretraining; the later Qwen2 stage replaced tags with natural-language task prompts and added audio-instruction preference adaptation.
Integrated sliding audio features/cross-attention with in-context retrieval/dialogue; extended the family through LongAudio resources, AFWhisper/five-stage curriculum and timestamp-grounded Temporal Audio Chain-of-Thought.
Constructed content- and timing-related preference pairs from multi-turn spoken interactions using transcription, AI feedback and speech resynthesis, then applied offline preference alignment to full-duplex speech models.
Compressed variable numbers of unposed RGB views into fixed-size global latent tokens and decoded oriented surface points using conditional flow matching, with photometric/depth guidance to reduce local inconsistency.
Measured FID variability on a two-axis panel of training and generation seeds for hundreds of SiT image models and introduced per-cell guidance tuning and multi-training-seed reporting recommendations.
Trained a full-duplex model to trigger selective asynchronous retrieval and incorporate textual references during the gap between response onset and key information delivery.
Extracted short conversation segments for pause handling, turn-taking, backchannels and user interruptions and optimized axis-specific rewards with GRPO plus a semantic-quality judge reward.
Added trainable residual adapter capacity with domain-aware gating, near-neutral initialization and local sparsity/domain objectives, jointly studying data mixing and training for new-language extension.
Augmented Moshi with lightweight cross-attention and dynamic visual gating, training adapters in one stage using mixed image-text and image-speech data to support spoken conversations about images.
Built a temporally grounded question benchmark and compared6B models pretrained on chronological versus shuffled versions of CommonCrawl data at a fixed token budget.
Used a decoder-only multistream model over pre-aligned streams at a shared frame rate, introducing relative delays to trade latency against quality for streaming speech recognition and synthesis.
Generated pseudo-target views by lifting single images with a frozen monocular-depth estimator, then trained a direct novel-view predictor with losses masked to valid reprojections.
Trained a representation-autoencoder latent diffusion world model on RocketLeague gameplay with multiple player action streams, studying shared dynamics and targeted physical-behavior evaluations.
Initialized a multistream speech translator on sentence-aligned data, then adapted GRPO with intermediate translation-quality rewards to reduce latency without word-level alignment heuristics.
Distilled foundation-model representations into image-autoencoder latents using pooled image-level descriptor matching or between-image relational objectives instead of co-located token matches.
Added local text-to-text attention within dedicated visual fusion layers, retaining cross-attention-like scaling while narrowing the tested performance gap to full visual-token insertion.
Trained an encoder to replace text embeddings with fewer continuous pooled representations and small decoder-specific mappings, supporting multiple unchanged decoders and compressed context extension.
Combined synthetic pretraining, aligned real-music finetuning, reinforcement-learning post-training and instrument-presence conditioning in an open-weight multi-instrument transcription model.
Conditions a consistency-model sampler on transformer context to generate continuous audio-VAE frames; the expanded2026account distills a313M teacher into a six-layer Pocket TTS backbone while retaining its sampling head.
Used translation-model perplexity to derive word-level contextual delays in synthetic aligned speech pairs and trained a multistream decoder that jointly produces translation text and speech.
Constructed modular BPE/Unigram tokenizers with extractable language-specific subtokenizers and trained language models using sampled vocabulary subsets to support smaller inference-time output matrices.
Assembled488 competition/course problem statements across formal systems with GPT-f baselines, enabling comparison of formal-to-formal proving systems on shared mathematical tasks.
Built a parallel Lean-repository compilation and tactic-extraction pipeline, released theorem/tactic data and trained InternLM2-StepProver with a proof-search state-deduplication mechanism.
Audited formal/informal statement discrepancies in miniF2F and released corrected pairs with end-to-end autoformalization-plus-proving evaluations.
Sampled multiple candidate formal statements, filtered them using Lean typechecking, and selected translations with consistency-based heuristics to improve measured autoformalization accuracy.
First combined statement formalization/filtering with iterative whole-proof data collection; the V2 stage added scaffolded synthetic tasks, verifier-guided long-reasoning correction and checkpoint averaging.
Generated natural-language informalizations of Lean4 and Isabelle statements to build a large paired corpus, then finetuned and compared multilingual-formal-language autoformalizers.
Used mixed informal/formal cold-start examples, a structured reasoning pattern with Lean snippets, and verifier-reward RL with format/gradient filtering for whole-proof generation.
Built a REST/Python interface over LeanREPL with parallel worker processes, LRU reuse of import environments and infotree-based tactic/state extraction.
Introduced371 undergraduate mathematics examples with natural-language statements/proofs and Lean3 statements, alongside prompt-retrieval and distilled-backtranslation autoformalization baselines.
Mapped human- or model-written informal proofs into formal proof sketches with open subgoals, then used an existing automated prover to discharge those subgoals.
V1 iteratively synthesized formal statements/proofs with filtering and parallel negation checks; V1.5 added proof-assistant-feedback RL and intrinsic-reward MonteCarlo search with truncate-and-resume proof completion.
Generated informal rationales retrospectively from ground-truth tactics, trained a model to interleave thoughts and tactics, and improved it through verified-proof expert iteration.
Released manually constructed Lean4, Isabelle and partial Coq formalizations of640 Putnam competition theorems with original statements and baseline prover evaluations.
Separated lemma/proof generation from a learned control plane estimating future attempt success and cost from failed trajectories, choosing whether to retry or restart the decomposition.
Trained a one-pass pushforward generator toward stopped-gradient targets constructed from attraction/repulsion drift fields between generated and data samples, moving iterative distribution updates into training.
Released sparse Lean4-specialized agent models with language-server tooling and FLTEval repository tasks; the1.5stage describes CISPO reinforcement learning over multiturn proof/disproof and filesystem code-agent environments.
Derived progressively smaller dense models by pruning and continued logit distillation through an intermediate teacher cascade, then post-trained visual instruction and reasoning variants.
Adapted a pretrained multimodal model using curated regional/general replay data, long-context continued training and local multimodal/alignment data, introducing Singapore-focused evaluation and behavior frameworks.
Evolved GP-UPT geometry-preserving encoding into anchored, multi-branch UPT decoders for surface/volume fields, including an explicit divergence-free output formulation; a later report evaluated existing architecture on SHIFT automotive/aerospace data.
Unified heterogeneous moderation taxonomies into instruction/query/document yes-no tasks, training on curated and contrastively generated text/image data and using yes/no logits for policy-conditioned classification.
Generated roughly30thousand wing-geometry/inflow RANS simulations with surface and volume fields and evaluated learned surrogates for held-out geometry/condition lift-drag tradeoffs.
Represented particle dynamics as continuous fields with coupled primary and auxiliary neural-operator branches, modeling granular transport observables and coupled CFD-DEM cases.
Proposed a joint asymptotic cost framework for CFD data generation and surrogate-model training, distinguishing RANS/LES fidelity, input/processor scaling and reuse of transient trajectories.
Extended DelayedStreamsModeling with a causal audio encoder and adaptive RMSNorm delay conditioning, training a multilingual recognizer that supports variable alignment delays.
Encoded grid- or particle-based physical states into a fixed-size latent representation, propagated dynamics there with inverse encoding/decoding objectives and decoded at queried locations.
Trained a monocular vision-language waypoint policy on simulation trajectories using episode-level prefix caching/tree masks, then applied CISPO reinforcement learning; a diffusion policy and motion controller execute waypoints.
Extended hierarchical Swin models to5D distribution functions using cross-dimensional attention/integration and channelwise mode separation, jointly predicting distributions, potentials and heat flux.
Used maximal-update parameterization to tune optimization/initialization settings on smaller neural networks and transfer them to larger models without direct full-scale tuning.
Built a dynamic task-graph runtime combining task and actor abstractions with a sharded fault-tolerant control store and bottom-up distributed scheduling for heterogeneous AI workloads.
Averaged parameters sampled along cyclical- or constant-learning-rate SGD trajectories to form a single model approximating benefits of a geometric ensemble.
Added weight decay and adjusted parameter-update scales for large-model Muon, implementing ZeRO-style distributed orthogonalization and releasing Moonlight checkpoints with scaling experiments.
Combined adaptive moment updates with layerwise trust-ratio scaling, adjusting LARS-style ratio/decay handling to enable large-batch BERT pretraining.
Specified tensor dimensions across logical processor-mesh dimensions and compiled distributed operations into SPMD programs with collective communications.
Maintained fast weights updated by an inner optimizer and periodically interpolated/reset them toward slower weights, studying variance and empirical training stability.
Preconditioned momentum gradients with moving averages of infrequently estimated Hessian diagonals and clipped coordinate updates, comparing two inexpensive curvature estimators.
Inferred operator partitioning from limited tensor annotations and generated SPMD computation, supporting uneven/nested sharding, padding and halo exchange in XLA.
Related a half-power Shampoo variant to Adafactor in its preconditioner eigenbasis and evaluated Adam-style updates in that slowly updated basis.
Scaled per-layer learning rates using weight and gradient norms to train image classifiers at much larger batch sizes while studying accuracy and hardware efficiency.
Encapsulated parallelism and resource requirements within reusable RL components built on Ray, enabling nested rollout, optimization and model-based workloads.
Studied Muon batch-size-dependent compute/time frontiers and combined it with muP using a multiscale telescoping search that narrows expensive large-width sweeps.
Optimized an approximate min-max neighborhood-loss objective by perturbing weights along a first-order direction and computing an update gradient at the perturbed weights.
Used sharded asynchronous operators over futures and gang scheduling to decouple control-plane execution from dependent accelerator work under a single-controller programming model.
Combined several boost-tuned small speculative models or heuristic proposals into token trees and verified shared-prefix candidates in one parallel target-model pass.
Added future-token prediction heads to a language-model backbone, with tree-attention verification, frozen-backbone or joint training and a typical-acceptance option.
EAGLE conditioned feature-level drafts on one-step-advanced tokens; EAGLE2 selected context-dependent draft trees from confidence scores; EAGLE3 removed feature-regression constraints and trained multi-layer-fused token drafts using training-time rollout tests.
Reused parallel Jacobi-decoding iterates to generate cached n-grams and verified them in a separate branch within a combined target-model pass, with a multi-GPU implementation.
Fused blockwise exact-attention computation with feedforward computation on completed query blocks, reducing intermediate activation memory without materializing whole-sequence feedforward intermediates.
Distributed blockwise attention and feedforward computation across sequence shards, overlapping ring exchange of key-value blocks with local attention computation.
Sharded tokens across devices and used all-to-all redistribution to give each device full sequence access for a subset of attention heads, followed by inverse redistribution and ZeRO-compatible training.
Partitioned attention along sequence positions, balanced causal-attention work, overlapped key-value transfers and reused memory-efficient attention rematerialization to avoid a redundant forward pass during checkpointing.
Combined all-to-all head redistribution with ring-based sequence exchange and analyzed compatibility with tensor, data, pipeline and ZeRO parallelism for topology-aware hybrid training.
Combined head and context parallel attention with double-ring exchanges, placement analysis, hybrid ZeRO and Selective Checkpoint++ to improve long-sequence training efficiency.
Processed attention heads in staged chunks under a context-parallel schedule and used GQA-compatible out-of-order scheduling to reduce intermediate activation memory while preserving practical training throughput.
Searched sample, operation, attribute and parameter parallelization strategies with guided randomized search, using measured operator costs and incremental execution simulation to evaluate plans cheaply.
Separated and scheduled RLHF model roles using Ray, vLLM and DeepSpeed, integrating large-model training and multiple alignment algorithms in an accessible framework.
Decoupled continuous generation from training, using interruptible rollouts, bounded data staleness, dynamic batching and a decoupled PPO objective for trajectories generated across policy versions.
Integrated parallel workers, sample-level rollout scheduling, environment/reward workers and automatic device mapping in a configurable RL training library for multi-domain and agentic workloads.
FineWeb documented and ablated filtering/deduplication for a large English web corpus and an educational subset; FineWeb2 adapted curation statistics by language and rebalanced globally deduplicated multilingual data using duplication and quality signals.
Combined text extraction, document/line filtering and exact/fuzzy deduplication at web scale, releasing a600B-token extract and studying web-only language-model pretraining against curated-corpus baselines.
Fixed training recipes and evaluation tasks around a240T-token candidate pool, enabling controlled experiments in filtering, deduplication and mixing, with DCLM-Baseline and released language models.
Provided candidate image-text pools, fixed CLIP training/evaluation recipes and compute-scaled tracks, with DataComp-1B demonstrating the importance of filtering under controlled training conditions.
LAION400M released image-URL/metadata pairs, CLIP embeddings and nearest-neighbor indexes; LAION5B expanded multilingual coverage and provided filtering signals and model-training studies.
Assembled a documented825GiB English text mixture from22sources, released processing code and studied cross-domain language-model training and evaluation.
Documented a best-effort open reproduction of the LLaMA1 data mixture, an unfiltered multilingual web pool with quality metadata and small-model ablations for constructing filtered subsets.
Created a crowd-annotation pipeline and dataset of non-iconic everyday scenes with object categories and per-instance segmentations to study contextual recognition and localization.
Combined image-level labels, object boxes and visual-relationship annotations at scale in one image collection, with annotation-quality studies and baseline model analyses.
Regressed contextual latent representations from an EMA teacher's full input using masked student views, applying one self-distillation objective across separate speech, image and text settings. data2vec2 skipped masked inputs, used a convolutional decoder and amortized teacher computation across several masked student views.
Predicted target-block embeddings from informative context blocks with a joint-embedding predictive architecture and multi-block masking, learning image features without handcrafted view-augmentation invariances.
Extended skip-gram with negative sampling as a simplified noise-discrimination objective, frequent-word subsampling and data-driven phrase-token construction.
Combined averaged n-gram features with low-rank text classification and hierarchical softmax, and extended skip-gram vectors with hashed character n-gram composition for rare and unseen words.
Used internal states from a pretrained bidirectional language model as token-context representations, learning task-specific layer mixtures to augment downstream NLP models.
Developed general-domain LM pretraining, target-domain adaptation and classifier fine-tuning using discriminative layerwise rates, slanted triangular schedules, gradual unfreezing and pooled recurrent states.
Ran parallel actor-learners with asynchronous gradient updates to decorrelate online experience, developing asynchronous variants of value-learning and advantage actor-critic methods without relying on a replay buffer.
Moved policy inference to centralized accelerators with streaming RPC communication while environments ran remotely, integrating existing V-trace and recurrent Q-learning algorithms.
Replaced AdaGrad's unbounded squared-gradient accumulation with a decaying average and used prior-update RMS over gradient RMS to form dimensionally matched coordinate updates.
Reparameterized neuron weight vectors by a scalar norm and normalized direction, deriving gradients and studying optimization without minibatch-dependent weight normalization.
Defined a smooth input-weighted activation through the expected action of an input-dependent stochastic identity/zero map, with Gaussian cumulative probabilities and empirical neural-network evaluations.
Elfwing and colleagues studied sigmoid-weighted linear and derivative activations with eligibility-trace RL; Ramachandran and colleagues later evaluated the same self-gated form as Swish and a scaled-parameter variant in deep vision/language networks.
Combined positive identity responses with a negative saturating exponential branch to study activation centering, bias-shift effects and deep-network optimization.
Learned negative-side rectifier slopes jointly with network weights and analyzed initialization adapted to rectifier nonlinearities, studying deep image classifiers.
Randomly bypassed residual layers with identity connections during training while using the full-depth network at test time, reducing expected training depth and studying regularization.
Fused transformed input/state streams by elementwise products with optional additive and bias terms, embedding the design into recurrent cells to alter gating and gradient flow.
Combined an input-conditioned localization network, parameterized sampling grid and differentiable sampler into a trainable feature-map transformation module.
Jointly trained a wide linear feature-cross model with a deep embedding network and evaluated the integrated ranking system in Google Play recommendations.
Fitted word/context vectors and biases to logarithmic co-occurrence counts with frequency weighting, connecting global count statistics with useful vector-space regularities.
Combined extensible intermediate-representation dialects with shared SSA-based infrastructure and progressive lowering to support heterogeneous domain-specific compilers.
Integrated declarative computation graphs and imperative tensor operations under a dependency engine with memory reuse, automatic differentiation and distributed communication interfaces.
Provided a modular C++/CUDA framework separating network definitions from execution, with language bindings and reference-model workflows for training and deployment.
Offered graph-oriented message/aggregation/mutation abstractions across tensor backends, combining sparse graph handling, fusion and batching for graph neural-network workloads.
Used sparse gather/scatter kernels, a message-passing interface and block-diagonal batching of variable-size graphs to integrate geometric deep-learning methods with PyTorch.
Combined lightweight sharding annotations with XLA compiler support to express distributed computation, scaling multilingual sparse-expert Transformer training with automated partitioning.
Extended ZeRO with hierarchical GPU/CPU/NVMe offloading, memory-centric layer tiling, bandwidth-centric state partitioning and transfer/computation overlap.
Reduced ZeRO communication through block-quantized weight gathering, memory-for-communication hierarchical partitioning and an all-to-all quantized gradient aggregation design.
Integrated fully sharded data parallelism with PyTorch tensor/dispatcher/allocator components, deferred model initialization, topology-aware sharding choices and parameter prefetch/memory scheduling.
Split pretrained model blocks across volunteer server chains, with client-managed embeddings, session caches, routing/failover and parameter-efficient adaptation interfaces.
Separated RL actors, learners, replay and environment interfaces into composable components that support shared agent code in single-process and distributed execution.
Separated shared compressed data chunks from table items, configurable sampling/removal policies and rate limiters, enabling distributed replay/queue workloads and sample-to-insert control.
Compiled typed NumPy-like symbolic graphs through canonicalization, numerical-stability rewrites, specialization and CPU/GPU code generation, with symbolic differentiation; a later community report documents development.
Traced annotated pure-and-statically-composed Python/NumPy subroutines into XLA computations while preserving dynamic Python orchestration and compatibility with Autograd transformations.
Provided a computational-network abstraction and CPU/GPU toolkit for expressing neural model graphs, with forward/gradient computation and reusable model/network descriptions.
Adapted Double Q-learning to deep Q-networks by selecting next actions with the online network and evaluating them with a separate target network, reducing maximization overestimation in tested tasks.
Prioritized replayed transitions using temporal-difference error, with proportional/rank-based sampling and annealed importance-sampling correction to focus updates on informative experience.
Factored a deep action-value architecture into shared features and separate state-value/action-advantage streams, enabling learning across actions with similar values.
Distributed experience generation, replay, gradient computation and parameter storage across actor/learner processes to scale deep Q-network training.
Decoupled many diverse-exploration actors from a learner through shared prioritized replay, emphasizing high-throughput experience selection rather than actor-gradient synchronization.
Analyzed return-distribution Bellman operators and proposed a fixed-support categorical approximation for deep Q-learning, separating contractive policy evaluation from unstable greedy distributional control.
Represented return laws by uniformly weighted learned quantile locations and used quantile regression updates, connecting approximation to a Wasserstein-minimizing projection.
Conditioned a neural value model on sampled quantile fractions to approximate return quantile functions, supporting distributional learning and distorted-quantile risk-sensitive action evaluation.
Combined bounded importance-ratio traces with corrected multi-step Bellman returns, retaining long near-on-policy returns while controlling off-policy trace growth.
Combined actor-critic experience replay with truncated importance weighting and bias correction, Retrace-based value targets and a computationally efficient trust-region update.
Combined deterministic policy gradients with a distributional critic, distributed experience collection, multi-step targets and prioritized replay for continuous-control learning.
Used an expectation-maximization style policy-improvement step with constrained nonparametric targets followed by parametric policy fitting; V-MPO adapts this approach to on-policy, value-based advantage weighting.
Combined episodic nearest-neighbor novelty in learned controllability features with lifelong random-network novelty and conditioned value learning across exploration/exploitation settings.
Combined stabilized value-learning parameterization with a bandit mechanism selecting exploration and discount settings, obtaining source-reported above-human baseline scores across all57 Atari games.
Replayed trajectories with alternative achieved goals and recomputed goal-dependent rewards, allowing off-policy goal-conditioned agents to learn from attempts that missed the requested goal.
Rewrote value and policy-learning estimators using probabilities of earlier actions conditioned on future states or returns, weighting credit by hindsight likelihood ratios instead of temporal distance alone.
Learned action-relevant features through inverse dynamics and used forward prediction error in that feature space as an intrinsic exploration reward.
Measured novelty by a predictor network's error on features from a fixed randomly initialized target network, combining intrinsic and extrinsic reward streams with flexible value estimation.
Demonstrated parallel natural-evolution-strategy style optimization of deep policy parameters using shared random perturbations and scalar fitness communication.
Mixed demonstration and self-generated recurrent replay with distributed off-policy Q-learning, and introduced eight sparse-reward partially observed tasks with varied initial conditions.
Learned deterministic-plus-stochastic recurrent latent dynamics from pixel observations and used online latent-space action planning, with latent overshooting to train multi-step predictions.
Combined slowly learned state embeddings with a large semi-tabular episodic key/value memory whose value estimates can update rapidly and be retrieved using nearest-neighbor lookup.
Connected entropy-regularized inverse learning to occupancy-measure matching and trained policies against a discriminator of expert versus learner state-action samples.
Used a structured adversarial discriminator separating a reward approximation from potential-based shaping, enabling reward reuse under tested changes in environment dynamics.
Pretrained a deep Q-network on demonstration data using temporal-difference, large-margin action-classification and regularization losses, then mixed preserved demonstrations with self-generated replay during learning.
Extended convolution-like neural layers beyond regular grids using graph Laplacian spectral multipliers and local/hierarchical constructions.
Parameterized graph filters as truncated Chebyshev polynomials of the Laplacian, evaluating them by sparse recurrence and combining graph coarsening with efficient pooling.
Extended graph-convolution updates to directed multi-relational graphs with parameter-sharing schemes, using learned entity representations for classification and link prediction.
Unified several existing graph models into learned message-passing/update and invariant readout phases, exploring variants on non-biological quantum-chemistry property prediction.
Defined a composable graph-network block with edge/node/global attributes, learned updates and permutation-invariant aggregations, unifying structured neural reasoning interfaces.
Related neighborhood-aggregation expressivity to the Weisfeiler–Lehman test and developed sum/MLP graph-isomorphism networks with injectivity-based representation conditions.
Used tunable second-order random walks to sample diverse node neighborhoods and optimized a skip-gram style objective for continuous network embeddings.
Removed intermediate nonlinearities and collapsed feature transformations in GCN-style models, precomputing repeated graph propagation before fitting a linear classifier.
Identified query-independent key-ranking restrictions of the original GAT score and changed the order of linear transformations/nonlinearity to enable dynamic attention.
Combined sparse categorical embeddings, dense-feature MLP processing, explicit feature interactions and a top predictor, with model-parallel embeddings and data-parallel dense layers for systems study.
Jointly trained a factorization-machine branch and deep neural branch sharing raw-feature embeddings, combining low-order interactions and learned nonlinear features.
Introduced explicit bounded-degree cross layers alongside deep networks, later extending vector cross parameters to richer matrix, low-rank and mixture-of-expert cross structures.
Combined a compressed interaction network computing explicit vector-wise feature crosses with a deep implicit-interaction branch and a linear component.
Used candidate-conditioned attention to select historical user interests; DIEN added auxiliary-supervised sequential interest extraction and attention-modulated recurrent evolution.
Generalized latent-factor collaborative filtering by learning user–item interaction functions with neural networks, including matrix-factorization and MLP-based components.
Simplified graph collaborative filtering to normalized linear neighborhood embedding propagation and weighted combination across depths, omitting intermediate feature transforms and nonlinear activations.
Addressed training/test prediction shift by ordering examples so supporting predictions and target statistics exclude the current label, combining practical ordered boosting and categorical-feature processing.
Designed scaled exponential-linear activations and compatible initialization to attract layerwise activation mean/variance toward a stable region under an analyzed moment map.
Combined deterministic actor-critic policy gradients with replay, slowly updated targets and normalization to train deep policies over continuous actions.
Combined gradient-based one-side sampling with reweighting of small-gradient samples and greedy bundling of sparse, nearly exclusive features to reduce histogram-based tree-training cost.
Integrated neural candidate generation using user-history embeddings and approximate retrieval with a separate richer-feature ranking network trained toward expected watch time.
Used learned transform/carry gates to interpolate between nonlinear updates and identity paths in feed-forward layers, enabling directly trained very deep networks.
Systematically evaluated convolutional depth using repeated small3×3filters and a common architecture, demonstrating effective16–19weight-layer visual classifiers.
Combined parallel convolution/pooling branches and1×1channel-reduction projections in repeated Inception modules, balancing network width/depth and computation in GoogLeNet.
Combined Inception modules with residual connections and studied activation scaling to stabilize wide residual hybrids, comparing against streamlined non-residual Inception-v4.
Learned piecewise-linear maxout units by taking maxima over affine responses, studying their optimization and approximate dropout-ensemble behavior.
Demonstrated recurrent text/continuous handwriting generation and conditioned handwriting synthesis on text through a learned, forward-moving Gaussian-mixture soft window.
Replaced local linear filters by shared nonlinear micro-MLPs and used global averaging of final feature maps for classification.
Treated truncated graph random walks as token sequences and trained skip-gram style embeddings to capture neighborhood structure for downstream network tasks.
Partitioned neural computation across machines and replicas, combining asynchronous Downpour SGD and coordinated distributed batch optimization through sharded parameter storage.
Designed a structured shared-vector/matrix parameter-server system with batched asynchronous communication, selectable consistency, elasticity and fault recovery for large learning workloads.
Co-designed commodity-server model partitioning, memory/computation layout and asynchronous updates to improve large visual-network training efficiency.
Developed data-dependent diagonal/full-matrix proximal or conditioning schemes from accumulated gradients, with complementary Adagrad and adaptive-bound formulations improving instance-dependent online regret.
Related mirror-descent and FTRL updates, retaining cumulative nonsmooth penalties with proximal centering; later industrial work implemented sparse per-coordinate online logistic prediction and calibration/feature-management lessons.
Mapped query and document-title letter-n-gram features through deep nonlinear projections and trained cosine-similarity ranking from clicked-versus-sampled document pairs.
Provided a lightweight C-language interface and optimized GPU convolution, pooling and activation primitives with forward/backward variants, reducing framework-specific kernel maintenance.
Used magnitude pruning followed by resetting surviving weights to their original initialization to identify sparse subnetworks that trained effectively in the tested dense networks.
Combined per-example gradient-norm clipping, calibrated Gaussian noise and privacy-loss moment accounting to train neural networks while tracking example-level differential privacy.
Extended straight-through low-bit network training to separately configurable weight/activation/gradient precision, enabling bit-convolution computations in forward and backward passes.
Approximated convolution weights and inputs using signs and real scaling factors, combining XNOR/bitcount operations with binary-network training for ImageNet-scale classifiers.
Developed domain-specific machine-learning systems: TPU v1 integer systolic inference;TPU v2/v3 training co-design with fast inter-chip communication;TPU v4 optically reconfigurable topology and embedding-oriented SparseCores.
Formalized communication-constrained learning over distributed client data and evaluated repeated local SGD steps followed by weighted model averaging, including non-IID and unbalanced partitions.
Pruned small-magnitude trained connections and retrained survivors, then combined pruning with quantized weight sharing/codebook retraining and Huffman coding to reduce stored model size.
Used binary weights during propagation while accumulating real-valued updates, then extended to binary activations with straight-through gradient approximations and bit-operation inference kernels.
Allowed concurrent sparse shared-memory stochastic updates without global locks, with convergence analysis for a specified asynchronous sampling model and empirical parallel implementations.
Co-designed affine scale/zero-point quantization, 8-bit weight/activation and 32-bit accumulation/bias arithmetic with floating-point fake-quantization training for efficient mobile inference.
Evaluated low-rank/random-mask structured updates and post-update subsampling/probabilistic quantization, using structured random rotations to improve compressed update quality.
Applied user-adjacent DP to language-model training using independently sampled users, clipped user updates, bounded-sensitivity averaging estimators, Gaussian noise and moments accounting.
Combined sparse gradient transmission and local accumulation with momentum correction, local clipping, momentum masking and warmup to reduce distributed-training communication.
Combined pairwise pseudorandom masks, threshold secret sharing and double masking to recover sums of high-dimensional client updates despite dropouts while limiting disclosure of individual updates.
Connected encrypted client uploads to predeclared access policies, attested TEE workloads and a stateful key-management ledger; later training deployment added distributed Python execution and controlled recovery while optimizing device participation.
Recast continual-release private sums and momentum schedules as matrix mechanisms, analyzing Gaussian privacy under adaptive inputs and computing error-efficient factorizations with a fixed-point method.
Defined privacy via bounds on Rényi divergence between neighboring-input output distributions, preserving post-processing and additive same-order composition while supporting conversion to approximate DP.
Represented privacy curves using privacy-loss random variables and composed them by FFT convolution, with mean-preserving discretization and truncation/error control for accurate privacy accounting.
Quantized stochastic gradients with controllable unbiased rounding and bounded second moments, then encoded the sparse/low-precision updates to trade communication against optimization iterations.
Used scaled stochastic ternary gradients with shared scaling/parameter localization, plus layerwise quantization and clipping to reduce synchronization traffic in distributed training.
Analyzed sign-only stochastic updates and sign-of-momentum variants, with majority-vote worker aggregation for bidirectional low-bit communication.
Exhibited convex failure cases for naive sign compression and used stored compression residuals in future updates, analyzing error-feedback SGD and scaled sign variants.
Used warm-started subspace iteration to build low-rank gradient approximations compatible with all-reduce, combining them with residual feedback and momentum for practical distributed training.
Corrected local stochastic updates using client and global control variates, updating both models and correction state to reduce drift from heterogeneous client objectives.
Analyzed how unequal local update counts/solvers change implicit aggregation weights, and normalized accumulated local gradients before averaging to target the intended global objective.
Added a quadratic penalty around the broadcast model to local client objectives, allowing inexact local solutions while analyzing progress under a device-dissimilarity condition.
Separated client and server optimizers and treated average local model deltas as server pseudo-gradients, instantiating per-coordinate Adagrad, Adam and Yogi-style federated updates.
Used server-computed optimizer statistics during each client update, with an SVRG-style correction in Mime, to approximate centralized optimization while reducing client drift.
Applied tree aggregation to clipped cumulative gradients in FTRL, using correlated noise across updates to obtain private online/deep learning without requiring privacy amplification by sampling or shuffling.
Combined FP16 storage/computation, FP32 master updates and loss scaling to train tested neural networks with reduced activation bandwidth and memory while recovering higher-precision baselines.
Specified complementary FP8 encodings and tensor-scale conventions, testing clipped FP8 inputs to matrix/convolution operations across training and inference models.
Characterized the early IPU's tile-local SRAM, communication and arithmetic organization, publishing reproducible microbenchmark techniques and memory-bandwidth behavior under different load widths and block sizes.
Estimated connection sensitivity through derivatives of multiplicative masks, retaining high-sensitivity weights before training the resulting sparse network.
Used Hessian-gradient products at initialization to score weight removals by their first-order effect on gradient norm, then trained the selected sparse subnetwork.
Derived saliency conservation relations for homogeneous feedforward networks and used positive flow scores with iterative pruning to reduce premature whole-layer collapse without training data.
Applied sparsity penalties to channel scaling factors, notably batch-normalization gamma, then removed low-scale channels and fine-tuned the narrower dense network.
Ranked trained convolutional filters by absolute weight sums and removed corresponding feature maps and downstream kernels, producing smaller dense operations rather than isolated sparse weights.
Selected channels using sampled next-layer responses and a greedy reconstruction objective, then pruned corresponding filters and fine-tuned the narrowed network.
Integrated matrix multiply-accumulate units with GPU programming: Volta mixed-precision Tensor Cores evolved through Hopper FP8 Transformer Engine and Blackwell Ultra's tensor memory and paired-block matrix operations.
Combined wafer-scale sparse compute, distributed on-wafer SRAM and a programmable mesh with custom power delivery, cooling and graph compilation in the WSE/CS system family.
Built a tensor-streaming processor around functional slices, producer-consumer streams and compiler-controlled cycle-level scheduling, explicitly managing computation and SRAM data movement.
Combined asynchronous spike routing, local synaptic state and programmable learning engines; the Loihi2 extension added microcoded state dynamics, graded spikes and richer connectivity for streaming computation.
Integrated programmable digital spiking cores, colocated memory/computation and event-routed intercore/interchip links in a million-unit silicon system.
Specified scalar/vector/matrix, logical, control and transfer instructions with programmer-visible scratchpads, allowing multiple neural-network techniques to share a compact accelerator ISA.
Developed RISC-V-controlled processing-element arrays and memory-aware recommendation inference systems; later MTIA300 added network chiplets and near-memory collective engines for communication-heavy training.
Exposed control/dataflow engines, specialized local memories and synchronization to the software stack, connecting Maia100's hardware/software design to Maia200's inference-focused memory/network hierarchy.
Integrated inherited parallel-training methods with Trainium-aware mixed tensor-parallel degrees, automatic pipeline graph partitioning, delayed device materialization and asynchronous graph execution in Neuron/NxDT.
Co-designed a Unified-Bus supernode with independently scalable prefill, decode and caching pools, exploiting direct remote-memory access and expert-parallel serving for large MoE models.
Developed Quantlib-based BFLOAT16 emulation and mixed-precision dataflow, testing broad training workloads with round-to-nearest-even conversion, FP32 accumulation and master updates.
Explored block data representations and fine-scale shared exponents, then evaluated an open microscaling-format family with compact elements and shared scaling across training/inference benchmarks.
Designed fine-grained processors with distributed on-chip SRAM and compiler-mapped static graph programs, coordinating local computation and exchange through bulk-synchronous execution.
Combined scalar control, vector processing and cube matrix engines with explicit memory transfers, configurable core sizes and hierarchy-aware resource balancing.
Co-designed pipelined neural arithmetic with separate input/output/weight buffers and locality-aware tiling, reporting a compact65nm post-layout inference accelerator including external-memory cost analysis.
Coalesced session samples across logging, ETL and training, introducing inverse-keyed jagged tensors that share repeated feature values while retaining inverse mappings to their training examples.
Profiled hashed embedding access distributions, pooling and coverage to formulate a mixed-integer placement problem balancing GPU work while allocating embedding rows between high-bandwidth and host memory.
Used row access probabilities and marginal memory/communication costs to combine replicated and row-sharded embeddings; a third strategy shards within a node while replicating across nodes to exploit network tiers.
Combined table/row/column/data-parallel embedding placement, fused sparse operators, hierarchical memory and a dedicated scale-out network in a PyTorch-based training stack for very large recommendation models.
Stacked ensembles of complementary feature-interaction modules with shared feature processing and residual information flow, paired with hybrid sharded training to support deeper click-prediction models.
Combined factorization-machine interaction blocks, learned low-rank projections and linear compression blocks in a residual stack, with coordinated depth/width scaling for large recommendation datasets.
Reformulated recommendation around sequentially unified user actions and introduced HSTU blocks with pointwise aggregated attention, multiplicative gating, ragged fused kernels and stochastic sequence-length training.
Fused quantization-related packing, row-offset computation and output processing with CPU matrix multiplication, using shape-specific runtime code generation and cached kernels to accelerate inference.
Combined GPU vector-aware LZ/entropy compression with table-wise and iteration-wise error-bound adjustment for embedding lookups and gradients communicated during distributed recommendation training.
Balanced packed-document training using profiled compute/communication costs, variable-length micro-batches and delayed outlier documents, alongside per-document context sharding to address pipeline and context imbalance.
Decoupled slow regional data-placement planning from fast job scheduling, combining GPU/data colocation, resource-aware placement and local scheduling across Meta's geo-distributed datacenters.
Represented computation and communication in parallel computation graphs, generated small algebraic/parallel substitutions from operator specifications, checked them with an automated prover and searched their compositions hierarchically.
Tracked changed embedding rows, chose intermittent full versus differential checkpoints, and quantized snapshots in background CPU processes while coordinating trainer and data-reader recovery state.
Estimated embedding-row importance using runtime access frequency and gradient magnitude, coordinating distributed admission and pruning to retain useful rows under an embedding memory budget.
Introduced communication chunks that connect a local Triton kernel with a communication plan, transforming tile order and selecting transfer backends while tuning chunk size to overlap fine-grained computation and transfers.
Introduced a loop-based communication IR treating remote GPU memory as schedulable storage, with parallelize, shift, shard and replicate transformations and autotuned multi-GPU operator schedules.
Assigned a separate input-dependent gating network to each task while sharing expert subnetworks, letting different prediction towers use different mixtures of learned representations.
Separated shared and task-specific expert groups and stacked gated extraction networks, progressively routing lower-level shared knowledge into higher-level task-specific representations.
Trained click and joint click–conversion objectives over all impressions using a multiplicative probability decomposition and shared embeddings, avoiding direct unstable division of separately learned small probabilities.
Combined visit-count-weighted neighborhood sampling, shared local graph convolutions, CPU–GPU minibatch production and distributed embedding inference to train and serve recommendation embeddings on a large pin–board graph.
Clustered user actions in a fixed pin-embedding space with hierarchical Ward clustering, represented each cluster by a medoid and sampled important medoids for retrieval using daily and online updates.
Decomposed heterogeneous entity interactions into bipartite views, aggregated each view's sampled visual/textual neighborhood with a Transformer and fused the resulting view embeddings through another attention layer.
Adapted self-attention with causal masking, learned item/position embeddings and residual feed-forward blocks to predict next items from user action histories.
Transferred bidirectional Transformer encoding and masked-item prediction to recommendation, then appended a mask at the history's end for next-item inference to address the training–prediction mismatch.
Added Transformer encoding of historical clicked items plus the candidate item and relative-time position features to an embedding/MLP ranker, combining the encoded sequence with user, item and context features.
Adapted dynamic routing to aggregate variable-length behavior embeddings into several interest vectors, using label-aware attention in training and independent nearest-neighbor queries for candidate retrieval.
Used dynamic routing or self-attention to build multiple user-interest vectors, retrieved candidates per interest and greedily aggregated them with a tunable relevance–diversity objective.
Integrated a dynamic key-preserving embedding table with admission/expiry filtering, streaming feature–label joins and incremental synchronization between training and serving parameter servers.
Combined recurrent fading memory with a local attention window and innovation-selected stored tokens, expressing a family of hybrid state-space modules that can retrieve selected information beyond the recent context.
Maintained weighted key/value covariance statistics and solved regularized test-time regressions using Chebyshev iteration, adding adaptive regularization, input-dependent decay and chunk-wise kernels.
Stored precomputed context states and transition factors, composed them algebraically and averaged compositions over permutations or cyclic rotations to reduce online context-processing costs.
Selected attention layers using substitution-based importance, transferred compatible projections and expanded state capacity, then aligned hidden representations and adapted the full hybrid model with next-token training.
Optimized a Rolling Forcing streaming pipeline with NKI kernels for3D rotary embeddings and cache copies, fused attention transposes, hybrid head/sequence sharding and batching of common denoise/cache-update work.
Augmented Bellman regression with a conservative Q-value penalty, contrasting policy/proposal actions with data actions to reduce value overestimation during offline learning.
Fitted an upper expectile of action values conditional on state, backed it into a Q-function while averaging transition noise, and extracted a policy by advantage-weighted regression.
Approximated batch-supported actions with a conditional variational autoencoder, sampled candidates and bounded learned perturbations, then selected actions using a learned critic.
Added squared behavior-cloning regularization to TD3 policy updates, normalized state features and scaled the Q contribution using a stopped-gradient estimate of its magnitude.
Combined temporal-difference value learning with advantage-weighted maximum-likelihood policy updates, using offline experience to initialize policies that can continue learning from online interaction.
Alternated return-target value regression with maximum-likelihood policy regression weighted exponentially by estimated advantage, enabling replay-buffer and static-dataset learning through supervised losses.
Trained a causal Transformer on interleaved return-to-go, state and action histories to predict actions by supervised learning, conditioning generation on desired returns at inference.
Discretized trajectory dimensions, modeled joint state/action/reward sequences autoregressively and used beam search with reward-based scoring for receding-horizon control.
Designed datasets spanning narrow support, non-RL controllers, heterogeneous behavior quality and multitask trajectories, with diagnostic navigation and robotic-control tasks for evaluating offline learners.
Combined bootstrapped probabilistic dynamics models with particle trajectory sampling and model-predictive control, distinguishing transition noise from model disagreement during planning.
Trained a probabilistic dynamics ensemble, branched short synthetic rollouts from real replay-buffer states and used model samples for soft actor-critic updates.
Modified rewards in a learned dynamics model by an uncertainty penalty and optimized policies in the penalized MDP, connecting conservative model use to conditional return bounds.
Partitioned state-action space using an unknown-state-action detector, redirected unknown transitions to an absorbing penalty state and planned in the resulting pessimistic MDP.
Learned a diffusion prior over state/action trajectories, guided reverse denoising with reward gradients or clamped constraints and executed sampled plans in a receding-horizon loop.
Combined conditional action-denoising behavior regularization with Q-value maximization, backpropagating the Q objective through the reverse diffusion chain and learning twin critics from offline transitions.
Trained a scalar neural ranking function from document pairs using logistic score differences and cross-entropy loss, extending backpropagation to pairwise preferences while retaining individual-item scoring at inference.
Specified document-score update signals using ranked positions and target retrieval measures, trained differentiable ranking models from these implicit-gradient rules and factored pairwise training contributions.
Fitted boosted regression trees to LambdaRank update signals, supported warm-start adaptation from an existing ranker and enumerated rank-order crossing points for exact line search between two fixed rankers.
Integrated question decomposition, high-recall candidate generation, soft filtering, heterogeneous evidence scorers, answer merging and learned confidence estimation in a parallel UIMA-based question-answering architecture.
Integrated evidence and claim retrieval, stance and argument-quality assessment, narrative construction and opponent-rebuttal processing into a system evaluated in competitive spoken debates with expert humans.
Used independently sampled dropout masks to create positive views of the same sentence, and used entailment positives and contradiction negatives in a supervised contrastive variant.
Curated web-derived text pairs with consistency filtering, trained a shared mean-pooled encoder using contrastive learning and query/passage prefixes, and optionally fine-tuned with labeled data and teacher distillation.
Combined large-scale naturally paired text pretraining with diverse supervised fine-tuning, using mean-pooled dual encoders and bidirectional contrastive negatives drawn from queries and documents.
Packaged Chinese evaluation/training resources and a staged embedding recipe, then extended the family with shared dense, lexical and multi-vector retrieval heads whose integrated scores teach each head through self-distillation.
Adapted bidirectional ALiBi and staged embedding training for longer documents in v2; v3 used an XLM-RoBERTa backbone with rotary positions, task-selected LoRA adapters and dimension-flexible representation training.
Learned vocabulary-space query/document expansion with log-saturated weights and explicit sparsity regularization; v2 changed aggregation to max pooling, evaluated document-only expansion and added teacher-distilled hard-negative training.
Clustered training queries once, sampled topically related batches and balanced positive/negative passage pairs by teacher-score margins, combining pairwise cross-encoder and in-batch ColBERT teacher signals.
Mined hard negatives from an approximate nearest-neighbor index of the corpus while a parallel inferencer periodically re-encoded documents and refreshed the index from newer training checkpoints.
Studied larger T5-derived dual encoders with a fixed768-dimensional output, combining web-pair pretraining and labeled retrieval fine-tuning to test out-of-domain retrieval generalization.
Removed the causal attention mask during contrastive embedding training, used token queries attending a trainable latent key/value dictionary before mean pooling, and staged retrieval then mixed-task instruction tuning.
Standardized cross-domain retrieval evaluation over diverse query/document forms, relevance labels and tasks, comparing lexical, dense and reranking approaches beyond their training domains.
Unified evaluation across embedding task types and extended it through community-reviewed multilingual tasks, caching and document/task downsampling to reduce repeated evaluation work.
Added identifier tagging/recovery and text–code dual generation to T5-style pretraining, then extended the family with modular encoder/decoder use, mixed denoising/contrastive/matching/causal objectives and compute-efficient initialization from pretrained code LLMs.
Built extensible stateful application environments with tool calls, user tasks and attacker-controlled data locations, checking utility and attack success through explicit environment-state predicates.
Embedded categorical and continuous columns, combined within-row self-attention with attention across rows in a batch, and studied contrastive plus denoising pretraining with mixed data views.
Compared tabular deep architectures under controlled splits/tuning and introduced feature tokenization of numerical and categorical inputs followed by Transformer layers over one object's features.
Integrated distributed implementations of standard learning methods, optimized communication/linear algebra and a pipeline API with Spark's data-processing ecosystem.
Used input-dependent sparse attention masks to select features at successive decision steps, transformed selected features and aggregated their contributions for prediction and mask-based interpretation.
Adapted masked language modeling and replaced-token detection to paired documentation/code, using separate language/code generators trained with unimodal data to learn a bimodal encoder.
Combined negatives across GPU batches, filtered likely false negatives with a cross-encoder and used high-confidence pseudo-labeled question/passage pairs in a staged dual-encoder training pipeline.
Generated task descriptions and queries from web passages, retrieved alternative passages and used an LLM to relabel positives/hard negatives before contrastive embedding fine-tuning.
Encoded moderately masked text into a sentence vector and reconstructed from a more heavily masked input with a lightweight decoder, adding position-specific decoding for denser training signals.
Fine-tuned one pretrained model with bidirectional contrastive representation loss and causal next-token generation loss, switching behavior by task formatting and instructions.
Trained multiple nested prefixes of a shared embedding with size-specific objectives, enabling downstream classification/retrieval to use different dimensionalities without separate encoder forward passes.
Paired text with task/domain instructions, assembled the MEDI multitask instruction dataset and trained a shared encoder with contrastive objectives to alter embeddings according to use case.
Added extracted variable data-flow nodes to source/comment inputs, used graph-guided attention masks and trained code-edge and variable/token alignment tasks alongside masked language modeling.
Adapted BART-style sequence denoising to code and natural-language corpora with language tags, then fine-tuned the model across program understanding, translation and generation tasks.
Enabled bidirectional attention, adapted with masked next-token prediction using the previous position's representation, then applied unsupervised SimCSE-style sequence contrastive learning.
Used shared Transformer weights with encoder/decoder/encoder–decoder attention masks and prefixes, serialized AST structure with matched boundary markers and trained cross-modal code/comment objectives.
Applied Transformer layers to categorical-column embeddings, combined contextual outputs with continuous features in an MLP and studied masked/replaced-feature pretraining when labeled data are scarce.
Compared first-token/mean encoder outputs and first decoder output as sentence representations, with projection/normalization and staged community-QA then labeled-NLI contrastive tuning.
Combined similarity-ordering and supervised contrastive objectives with complex-space angle optimization, using known duplicate sentences as positives rather than false in-batch negatives.
Routed late-layer information through a dense CLS vector into an early-token reconstruction head, then added same-document span contrastive pretraining and memory-efficient gradient caching for corpus-aware embeddings.
Integrated TorchDynamo bytecode rewriting and guarded graph caching with graph-break continuations, AOTAutograd forward/backward capture and TorchInductor code generation for PyTorch programs.
Integrated supervised/unsupervised learning implementations with NumPy/SciPy data structures, consistent estimator/transformer interfaces, compiled numerical components, tests and documentation for reusable Python workflows.
Combined heterogeneous language tasks, evaluation protocols, diagnostic sets and reference systems into shared benchmarks; SuperGLUE expanded the task formats and difficulty after progress on GLUE.
Created crowdsourced questions over Wikipedia paragraphs with text-span answers, then added deliberately plausible unanswerable questions to require systems to abstain when the passage lacks an answer.
Collected entailment, contradiction and neutral hypotheses around text premises; extended caption-based SNLI with multi-genre written and spoken English and matched versus mismatched genre evaluation.
Released real anonymized Bing queries, retrieved web passages and human-written answers, including some questions with multiple answers or no answer, for reading-comprehension research.
Paired independently collected trivia question-answer pairs with automatically retrieved Wikipedia and web evidence, enabling multi-document reading-comprehension training under distant supervision.
Collected Wikipedia paragraph-pair questions through bridge entities and entity comparisons, with sentence-level supporting-fact annotations to evaluate both answers and evidence selection.
Collected real search queries with Wikipedia evidence and human yes/no labels, building a dedicated paragraph-based task and studying transfer from textual entailment.
Built crowdsourced questions over passages selected for structured information, using an adversarial baseline filter to encourage counting, sorting, comparison and arithmetic over text.
Collected English passages and multiple-choice questions from Chinese middle- and high-school examinations written by instructors, introducing a large reading-comprehension evaluation beyond automatically generated cloze questions.
Combined constrained crowdsourcing and validation of Winograd-style twin sentences with a lightweight filtering algorithm using fixed neural embeddings and ensembles of linear classifiers.
Collected physical goals with a valid solution and a plausible incorrect alternative, validated the examples and applied filtering to reduce readily detectable annotation artifacts.
Released grade-school science multiple-choice questions, a supporting sentence corpus and reference systems, separating a Challenge set by joint failure of retrieval and word-association solvers.
Created multiple-choice science questions around a small supplied book of core facts, requiring systems to combine a retrieved principle with additional common knowledge.
Collected five-sentence everyday narratives and introduced a test in which a system selects a coherent ending for a four-sentence story, supporting research on temporal and causal event structure.
Used video-caption contexts and language-model-generated alternatives, iteratively filtering easy negatives with stylistic classifiers and validating choices to build grounded next-event questions.
Introduced basic Python programming tasks with input-output tests and a Python adaptation of mathematical word problems, studying synthesis across model scales, fine-tuning and human feedback.
Collected programming problems at introductory, interview and competition levels, standardized call-based and standard-input formats, and evaluated generated Python using problem-specific test cases.
Constructed repository-separated Python and Java tasks for cross-file snippet retrieval, next-line completion and an integrated retrieval-completion pipeline, distinguishing first-use and repeated-use contexts.
Curated and perturbed Stack Overflow problems across seven Python libraries, supplied executable contexts and combined functional tests with task-specific surface-form constraints.
Used human-LLM collaboration to construct programming tasks requiring multiple library calls, with docstring-completion and natural-language-instruction variants and execution-based tests.
Standardized English and Chinese datasets across question answering, summarization, few-shot learning, synthetic tasks and code completion to compare long-context language models.
Built synthetic tasks with controllable sequence length and complexity, extending needle retrieval to multiple items, multi-hop tracing, aggregation and question answering.
Combined synthetic and realistic English/Chinese tasks in retrieval, code, mathematics, novels and dialogue to test models beyond the usual short long-context benchmarks.
Embedded generated bAbI reasoning facts among ordered background book sentences, allowing controlled extension of context length while testing retrieval, fact chaining and other reasoning operations.
Paired anonymized Google search queries with Wikipedia pages, annotating long evidence regions and short answers or null answers, with repeated annotations and evaluation designed to account for human variability.
Replaced encoder self-attention with real-valued outputs of Fourier transforms over sequence and hidden dimensions, retaining feed-forward blocks and studying speed–accuracy tradeoffs.
Combined channel projections with multiplicative gates driven by learned spatial projections, testing attention-free blocks on image classification and masked language modeling.
Studied content-scored global attention, differentiable local-window alignment and feeding past attentional vectors into later decoder steps to improve recurrent translation models.
Mixed vocabulary generation with attention-based source copying and added accumulated-attention coverage with an overlap penalty to reduce repetition in abstractive summaries.
Used residual gated convolutions for source and target sequence representations, with separate attention at decoder layers and parallel computation across training positions.
Provided model/task/criterion interfaces, distributed and mixed-precision training, incremental decoding caches and reference sequence-model implementations in a reusable PyTorch toolkit.
Built an open translation toolkit with modular attention/feature components, buffer-sharing optimizations, multi-GPU training and decoders for different runtime environments.
Integrated a dynamic-graph reverse-mode differentiation engine with encoder–decoder abstractions, optimized operators, batched search and multi-GPU translation training in C++.
Developed probabilistic unigram segmentation and sampled subword views for training; packaged raw-sentence subword training, vocabulary-ID management, normalization and detokenization in SentencePiece.
Adapted byte-pair compression ideas to learn character-sequence merges within words, representing rare and unseen words as reusable subword sequences in neural translation.
Kept a learned BPE merge table while randomly suppressing candidate merges during training segmentation, exposing the translation model to multiple segmentations before deterministic inference.
Studied shared multilingual causal/masked language objectives and parallel-sentence translation language modeling; XLM-R extended masked pretraining with larger filtered web corpora, vocabulary and capacity tradeoff analysis.
Trained a shared BiLSTM encoder with max pooling, joint subword vocabulary and an auxiliary translation decoder to obtain fixed-dimensional sentence vectors for cross-lingual transfer and parallel-sentence retrieval.
Combined mined parallel data across non-English language directions with shared and language-specific capacity studies, releasing a many-to-many translation model and reproducible data/evaluation workflows.
Pretrained a complete shared encoder–decoder on corrupted multilingual text using span masking and sentence permutation, then adapted the initialization to supervised and unsupervised translation.
Constructed a multilingual Common Crawl corpus and adapted the T5.1.1 text-to-text recipe through language sampling, a large shared vocabulary and byte fallback, releasing pretrained models for cross-lingual tasks.
Collected new English premise–hypothesis evaluation examples using the MultiNLI protocol and professionally translated them into aligned multilingual sets for comparing cross-lingual sentence representations.
Combined multiple classification, structured-prediction, question-answering and retrieval tasks across languages; the revision added harder multilingual-pool retrieval, broader language coverage and behavioral diagnostics.
Unified pretrained NLP models, configuration serialization, model-specific tokenization and downstream workflows across PyTorch and TensorFlow in a reusable open-source library.
Documented a reusable training-and-prediction library for support-vector classification, regression and one-class learning, with interfaces and practical tools for applying the methods.
Integrated coordinate-descent and trust-region solvers for linear support-vector and logistic models with modular C/C++ training/prediction interfaces, targeting large sparse classification data.
Built an open phrase-based translation toolkit with configurable linguistic factors, confusion-network decoding and memory-conscious phrase-table access, alongside training, tuning and evaluation workflows.
Adapted dense convolutional features with atrous sampling and CRF boundary refinement; later added multi-rate spatial context pooling, image-level context and an encoder–decoder with atrous separable convolutions.
Aggregated pooled features from several spatial grid scales, projected and upsampled them, and concatenated the context with dense backbone features for pixel prediction.
Maintained a high-resolution branch while adding lower-resolution branches in parallel and repeatedly exchanging multi-scale features to produce spatially precise keypoint heatmaps.
Used set prediction of mask–class pairs for semantic and panoptic segmentation; added predicted-region masked cross-attention and multi-scale decoding to improve a shared architecture across semantic, instance and panoptic settings.
Passed encoder max-pooling locations to the decoder for sparse unpooling, then used trainable convolutions to densify features before pixel classification, studying memory–accuracy tradeoffs.
Extended the original YOLO detector with clustered dimension priors, bounded location prediction and joint detection/classification training; later combined residual features, multi-scale predictions and independent class scores.
Studied component/augmentation combinations for efficient detection, then developed aggregation-aware scaling and reparameterization, lead-guided auxiliary labels, and programmable-gradient auxiliary branches with generalized layer aggregation.
Combined a decoupled classification/regression head, anchor-free prediction, strong augmentation and SimOTA dynamic positive assignment in a practical detector.
Jointly trained one-to-many and one-to-one detection heads with consistent matching, discarding the former at inference, alongside component-level efficiency design.
Predicted class scores and shared box offsets for predefined priors at several feature-map resolutions, integrating multi-category detection without a separate proposal-generation stage.
Built semantically enriched feature maps at several backbone resolutions through a top-down pathway and same-resolution lateral additions, reusing one image's convolutional hierarchy.
Trained a sequence of detector heads at increasing IoU quality thresholds, using progressively refined proposals to address sample scarcity and train–inference quality mismatch.
Predicted a small set of sampling offsets and attention weights around reference points, using interpolated multi-scale image features to reduce dense-attention cost and improve detector training.
Represented decoder positional queries as boxes updated across layers; the DINO extension combined contrastive box denoising, mixed query initialization and gradients spanning adjacent refinement steps.
Separated intra-scale attention from cross-scale fusion in a hybrid encoder and initialized decoder queries using IoU-aware selection, enabling a practical NMS-free detector with adjustable decoder depth.
Used a Lipschitz-constrained critic motivated by Wasserstein-1 duality, then replaced restrictive weight clipping with a sampled input-gradient penalty to improve practical adversarial training.
Combined strided/fractionally strided convolutions, restricted dense layers, normalization and activation choices to train convolutional adversarial generators and test reusable discriminator features.
Adapted non-local self-attention to generator and discriminator representations, paired with spectral normalization on both networks and distinct update rates for long-range image synthesis.
Learned mappings in both directions between unpaired image collections, combining domain discriminators with reconstruction after the forward-and-back translation cycle.
Combined image-conditioned adversarial training with reconstruction and patch-based discrimination; the high-resolution extension added coarse-to-fine generation, multi-scale discriminators and discriminator-feature matching.
Conditioned normalized feature activations with spatially varying scale and bias predicted from semantic layouts, retaining layout information throughout a generator and supporting optional style conditioning.
Redesigned denoiser operations and weight updates to reduce expected-magnitude drift and imbalances, and reconstructed alternative averaging profiles from saved averaged parameter snapshots after training.
Separated numerical updates into estimated-gradient and transfer parts, combining multistep noise estimates with a DDIM-related nonlinear transfer to accelerate sampling from pretrained diffusion models.
Integrated the linear part of diffusion dynamics analytically and approximated the noise-prediction contribution with extrapolation, reducing discretization cost for pretrained score-based models.
Matched score differences along random directions and used integration by parts to obtain objectives computable with Hessian-vector products, including a variance-reduced form for scalable score estimation.
Specified paths between endpoint samples and learned probability-current velocities through quadratic regression objectives; extended the construction with latent noise to relate deterministic flows, scores and tunable diffusions.
Composed invertible transformations to enrich amortized variational posteriors and retain tractable change-of-variables density terms, including linear-cost planar and radial flow constructions.
Developed tractable invertible generative models through additive coupling, affine coupling with learned scale, and Glow's invertible1x1 channel mixing and ActNorm within multiscale architectures.
Used triangular autoregressive transforms to enrich variational posteriors and construct flexible density estimators, exploiting complementary fast directions in IAF and MAF.
Parameterized monotonic rational-quadratic spline transforms inside coupling or autoregressive flows, increasing scalar-transform flexibility while retaining tractable derivatives and analytic inversion.
Replaced conditionally affine scalar transforms by monotonic neural networks, including deep sigmoidal flow modules for richer density estimation and variational posterior approximation.
Combined continuous-time invertible dynamics with Hutchinson trace estimation and adjoint-based training to scale log-density evaluation without triangular neural Jacobian restrictions.
Combined bottom-up region proposals with pretrained and detection-finetuned convolutional features and class-specific SVMs, demonstrating strong object detection and transferable region representations.
Used shared convolutional feature extraction across multiscale sliding-window classification and bounding-box regression to integrate recognition, localization and detection.
Placed fixed-bin spatial pyramid pooling above convolutional maps to produce fixed-length features from varying image/region sizes and reuse whole-image convolutions across detection proposals.
Introduced a homogeneous multi-branch residual block and cardinality as a model-design axis, with an equivalent grouped-convolution implementation for the selected bottleneck structure.
Added global spatial pooling and a bottleneck gating network to adaptively rescale convolutional feature channels, enabling SE-enhanced recognition architectures.
Combined shared-MLP channel attention using average/max pooling with a subsequent spatial-attention map, providing a plug-in convolutional feature-refinement module.
Learned input-dependent offsets for convolution and region pooling, then expanded deformable layers with modulation scalars and R-CNN feature-mimicking supervision to improve spatial adaptation.
Designed a large-vocabulary instance-segmentation dataset and per-category positive/negative evaluation subsets, enabling long-tail object recognition without exhaustive labeling of every image-category pair.
Collected region descriptions, object/attribute/relationship annotations and question-answer pairs grounded to natural images, canonicalizing language concepts with WordNet to support structured vision-language research.
Created densely segmented natural-scene annotations with object instances, attributes and hierarchical object parts, supporting scene parsing beyond a small predefined object vocabulary.
Scaled recurrent PPO self-play with distributed rollout/inference/optimization and continual-training infrastructure, producing a team agent that defeated Team OG in the documented2019 Dota2 setting.
Combined continual re-solving, learned counterfactual value functions and depth/action-limited search for heads-up no-limit poker, demonstrating professional-player performance in the reported study.
Integrated an abstracted blueprint strategy, real-time nested safe subgame solving and targeted blueprint repair to defeat specialist professionals in heads-up no-limit Texas hold'em.
Combined improved Monte Carlo CFR blueprint learning with depth-limited online search that permits multiple continuation strategies, defeating professional players in six-player no-limit poker experiments.
Combined retrograde endgame databases with proof-tree management and forward search to give a source-reported computational proof that perfect play from the standard8x8checkers starting position is a draw.
Decomposed overall strategic regret into information-set counterfactual regrets, enabling locally maintained regret-matching updates and approximate-equilibrium computation in large imperfect-information games.
Introduced clipped cumulative regret-matching updates and weighted averaging, then combined distributed compressed computation with CFR+ to essentially weakly solve heads-up limit Texas hold'em.
Combined off-policy deep reinforcement learning of approximate best responses with supervised reservoir-memory learning of average behavior, supporting end-to-end imperfect-information self-play.
Used sampled game-tree traversals and neural counterfactual-advantage estimation to approximate linear CFR without a manually specified state abstraction, with a separately learned average strategy.
Reframed imperfect-information learning/search around public belief states, training value/policy functions using self-play subgame solving rather than treating hidden-world states as ordinary perfect-information leaves.
Grew empirical meta-games of policies by learning approximate best responses to policy mixtures, then applied meta-strategy solvers; a decoupled hierarchy reduced the full payoff-tensor bottleneck.
Provided a C++/Python framework spanning sequential/simultaneous and perfect/imperfect-information games, shared interfaces and algorithm implementations for reinforcement-learning and game-theoretic research.
Combined concurrent populations, two-tier optimization of internal reward schemes and multiscale recurrent representations to learn pixel-based QuakeIII capture-the-flag policies that cooperated and competed with unfamiliar teammates/opponents.
Combined regularized payoff-learning dynamics with model-free deep self-play, fine-tuning and test-time policy filtering to reach expert-level Stratego Classic performance without game-tree search or human demonstrations.
Integrated human-data-trained intent-conditioned dialogue, human-regularized strategic planning and message filtering, achieving strong human-level performance in the reported online Diplomacy blitz league.
Learns a team action-value as a sum of agent-local utilities from one shared reward, enabling centralized training and decentralized greedy execution.
Uses a centralized action-value critic and decentralized actors, marginalizing each agent's action while holding teammates' actions fixed to construct a counterfactual credit-assignment baseline.
Combines local action-value utilities through a state-conditioned monotonic mixing network so local greedy choices agree with the represented joint greedy choice.
Transforms joint values through individual-global-max consistency constraints to permit decentralized maximization beyond additive or monotonic value decompositions.
Uses duplex dueling and advantage-based mixing to represent the individual-global-max consistent value-function class while supporting decentralized greedy execution.
Conditions coordinated agent utilities on an episode-level latent variable and trains a hierarchical exploration policy with a variational mutual-information objective to distinguish joint behaviors.
Demonstrates strong cooperative-game performance using PPO with centralized agent-specific value inputs, value normalization, controlled data reuse, action masking and appropriate death masking.
Learns a factored centralized critic and differentiates a joint current-policy action to coordinate actor updates; examines monotonic and nonmonotonic critic factorization in cooperative control.
Defines a partially observable decentralized StarCraft II micromanagement testbed with centralized-training information and standardized cooperative battle scenarios.
Organizes self-play and ad-hoc teamwork challenges for cooperative imperfect-information Hanabi, specifying an environment interface and sample-limited versus unlimited learning protocols.
Chooses deterministic partial policies using public information and shared randomness, then updates public beliefs from observed actions to support implicit communication.
Exposes an actor's unperturbed greedy action to teammates during centralized training so recurrent agents can decode action information without epsilon-greedy exploration blur; greedy execution removes that side channel at test time.
Trains against symmetry-transformed partners to reduce arbitrary convention dependence and improve zero-shot cross-play without pre-agreed symmetry-breaking labels.
Ranks finite strategy profiles through the stationary distribution of a mutation-selection Markov chain, retaining intransitive cycles rather than forcing a scalar transitive dominance interpretation.
Combines neural Nash-style value iteration, policy-proposal restrictions and double-oracle action discovery for self-play in large simultaneous-action no-press Diplomacy.
piKL anchors search to imitation-learned policies through KL-regularized utilities; DiL-piKL distributes regularization strengths and RL-DiL-piKL trains Diplodocus for human-compatible no-press Diplomacy.
Introduces a simplified cooperative game testbed and compares self-play/population-based agents with agents trained or planned using behavior-cloned human models, including real-human collaboration tests.
Searches reusable normal/reduction convolutional cells on a small image dataset and scales the discovered motifs to larger image-recognition tasks.
Modifies tournament-based architecture evolution by deleting the oldest population member, and compares aging evolution with non-aging evolution and reinforcement-learning search under controlled settings.
Relaxes discrete operation choices into softmax mixtures and approximates a train/validation bilevel objective with alternating weight and architecture-gradient updates before discretization.
Uses a reinforcement-learned controller to sample subgraphs of a shared computation graph, alternating controller validation rewards with shared-weight training to reduce repeated child-model training.
AutoAugment searches operation/probability/magnitude subpolicies using validation rewards; RandAugment replaces the separate proxy search with uniform sampled operations and a small count/magnitude parameter space.
Uses trained split-data classifiers and Bayesian policy exploration to find augmentation policies whose transformed examples match a learned data distribution, then retrains on the augmented full training set.
Applies population-based training to augmentation probabilities and magnitudes, yielding nonstationary schedules learned alongside child networks and transferred to larger training runs.
Runs successive-halving brackets with different breadth/depth allocations, adapting resource spending among configurations instead of requiring a fixed number of candidates.
Combines Hyperband's multi-fidelity allocation with multidimensional density-estimation guidance, using the largest sufficiently populated budget model and retaining random exploration.
Asynchronously trains a population, copies promising members' weights/hyperparameters and perturbs hyperparameters to discover schedules within continuing training runs.
Searches a factorized hierarchical mobile CNN space with a reward balancing measured target-phone latency and classification accuracy.
Trains a stochastic supernetwork using a Gumbel-softmax relaxation and latency-aware objective to select layer-wise blocks for mobile inference.
Uses binarized path gates and pairwise architecture updates to reduce supernetwork memory, with latency-model gradients or REINFORCE for hardware-aware search directly on target tasks.
Trains a shared-weight network progressively over kernel size, depth, width and resolution, then selects subnetworks for multiple deployment constraints without separately training each from scratch.
Precomputes repeated CIFAR-10 training metrics for roughly 423,000 graph-isomorphism-deduplicated cells under a fixed pipeline, enabling reproducible lookup-based NAS comparisons.
Defines a fixed-operation cell benchmark across three image datasets and extends it with separately enumerated topology and channel-size spaces and diagnostic learning curves.
Fits predictive surrogate benchmarks using evaluated DARTS-space architectures to simulate searches over a much larger space than exhaustive tabulation can cover.
Evolves Setup/Predict/Learn programs built from scalar/vector/matrix operations, rediscovering and extending small learning mechanisms on image-classification proxy tasks.
Evolves sparse network topologies while evaluating each with multiple values of one globally shared weight, reducing dependence on learned individual weight parameters.
Combines architecture/training configuration search, BOHB multi-fidelity budgets, portfolio warmstarts and post-hoc ensembling for tabular automated learning.
Represents general-purpose preprocessing, feature selection and classifier combinations as trees, and uses genetic programming with a complexity-aware Pareto variant to optimize pipelines.
Allows dynamic conditional search spaces in ordinary program control flow and combines sampler interfaces, early trial pruning and distributed-friendly optimization.
Warmstarts structured Bayesian configuration search using related-dataset meta-features and constructs an ensemble from previously evaluated models in a scikit-learn pipeline search space.
Embeds dynamic probabilistic models in Python/PyTorch with sample/parameter primitives and composable Poutine effect handlers, supporting scalable approximate inference.
Combines probabilistic model abstractions, interchangeable inference and model-criticism workflows over TensorFlow, including batched data and backend-model wrappers.
Provides C++ reverse-mode automatic differentiation with extensible typed mathematical/probability functions and functor-based gradient interfaces for inference and optimization.
Combines Pyro-style effect handlers with JAX transformations and replaces NUTS's recursive tree-building implementation by an iterative form suitable for end-to-end JIT compilation.
Presents a Python model-context interface using symbolic computation for Bayesian model specification and gradient-based HMC/NUTS sampling.
Separates probability-distribution objects from deterministic volume-tracking transformations, with tensor batch/event semantics, differentiable operations and composable transformed distributions.
Builds heterogeneous multilayer stack ensembles using original features and out-of-fold model predictions, repeated bagging and weighted ensemble selection for tabular learning.
Separates trainable-model and trial-scheduler interfaces so intermediate reporting, checkpointing and runtime configuration changes support varied distributed search algorithms over Ray.
Standardizes datasets/problems, models and training/evaluation/decoding workflows on TensorFlow, including the reference Transformer implementation and heterogeneous hardware support.
Provides compact self-contained value-based RL agents, replay components, experiment runners and reproducibility-oriented infrastructure for algorithmic research and instruction.
Decouples trajectory-generating actors from batched learners and uses truncated-importance V-trace targets to compensate actor-policy lag in high-throughput multi-task RL.
Provides a configurable first-person 3D game-engine platform with pixel/depth/motion observations and navigation/action tasks for partially observable agent research.
Implements vectorized rigid-body transformations and JAX-compiled environment/learning loops on accelerators, allowing many parallel simulated-control trials on the same device.
Combines diverse versioned environments under a common reset/step interface and promotes learning curves, sample-complexity reporting and reproducible writeups.
Provides agent-iteration and parallel interfaces, common spaces/seeding and reusable tests/documentation for diverse multi-agent simulation environments.
Provides accelerator-native routing/packing/logic environments with customizable initial-state generators, reset/reward/viewer components and actor-critic baselines for scalable experiments.
Encodes algorithm choice as a root conditional hyperparameter and jointly searches learner-specific settings using sequential model-based optimization in WEKA.
Compiles imperative model specifications into log-density computations and supplies adaptive HMC/NUTS sampling, optimization and diagnostics through language interfaces.
Provides persistent study/trial state, distributed evaluation workers, algorithm switching and a custom-algorithm playground through a managed RPC service.
Documents define-by-run model construction, memory-aware reverse/double backpropagation and NumPy-like CuPy GPU integration in the Chainer framework.
Adapts Hamiltonian trajectory lengths using a recursively doubled candidate tree and no-U-turn stopping construction, with dual-averaging step-size adaptation.
Uses subsampled local-variable analysis and stochastic natural-gradient updates of global variational parameters to scale inference over large datasets.
Estimates variational-objective gradients using samples and score functions, with model-structure-based Rao-Blackwellization and control variates to reduce model-specific derivations.
Transforms constrained continuous latent variables to unconstrained coordinates, selects Gaussian variational families and uses reparameterized automatic-differentiation gradients for generic optimization.
Reuses batched conjugate-gradient work to estimate solves, trace derivatives and log determinants using kernel matrix-matrix multiplication, paired with preconditioning and a PyTorch framework.
Combines Python object-oriented GP model interfaces with TensorFlow automatic differentiation, variational/sparse and sampling methods, contributing differentiable Cholesky and GPU triangular-solve support.
Studies covariance choices and integration over GP hyperparameters, expected-improvement-per-time acquisition and Monte Carlo fantasies for pending parallel evaluations.
Relates Gaussian-process upper-confidence bandit cumulative regret to maximal sampling information gain, using kernel spectral structure to derive sublinear-regret results under the source's assumptions.
Trains recurrent update rules across optimization tasks, sharing a coordinatewise LSTM's parameters while retaining separate hidden states to propose gradient-history-dependent parameter steps.
Learns history-dependent recurrent policies across task distributions so fixed network weights support fast within-task adaptation through changing recurrent state.
Aggregates permutation-invariant context representations for conditional predictions; latent Neural Processes add a shared global latent to generate coherent function samples.
Models promising versus remaining conditional configurations with density estimators and expected-improvement selection; Hyperopt packages structured stochastic search spaces, interchangeable optimizers and persistent asynchronous trials.
Analyzes and tests independent random configurations as a baseline against grids, showing why low effective-dimensional objectives can waste many grid coordinates.
Extends sequential model-based configuration to categorical parameters and instance sets using random-forest performance models and aggressive incumbent/challenger intensification.
Learns parameterized maps between input and solution functions through shared integral-operator layers; GKN approximates kernels by graph message passing and Nyström sampling, while FNO parameterizes truncated Fourier modes for efficient grid evaluation.
Combines a branch network encoding sampled input functions with a trunk network encoding output locations, taking their learned feature inner product to approximate nonlinear operators.
Uses automatic differentiation of neural surrogate solutions to combine observed-data errors with differential-equation residual losses, supporting forward solution and inverse parameter fitting in related continuous/discrete-time formulations.
Learns particle dynamics by graph encode–process–decode message passing, then extends this learned-simulation approach to irregular meshes using mesh-space/world-space edges and a predicted sizing field with a generic remesher.
Builds rotation-equivariant point convolutions using spherical-harmonic filters and Clebsch–Gordan tensor products, propagating scalar, vector and higher-order geometric features.
Provides reusable parity-aware irreducible representations, spherical harmonics and trainable tensor-product primitives for assembling E(3)-equivariant networks.
Uses invariant distance-conditioned scalar messages and radial coordinate updates to preserve Euclidean rotation, reflection and translation equivariance without computing higher-order spherical-harmonic features.
Combines invariant attention weights with equivariant tensor-field value messages to process 3D point clouds while respecting rigid rotations and translations.
Lifts continuous coordinates into a Lie group and parameterizes convolution kernels through its Lie algebra, enabling local learned convolutions on irregularly sampled data.
Combines positional/structural encodings, local edge-aware message passing and global attention in a modular graph-learning architecture and implementation.
Adds degree centrality, shortest-path distance attention biases and path-based edge encodings to a Transformer graph representation model.
Replaces contraction-constrained graph recurrence with GRU-style finite unrolling and backpropagation, and carries node annotations across graph-based output steps.
Uses a graph-convolutional variational encoder and inner-product decoder to learn latent node variables and reconstruct graph links, with a deterministic graph-autoencoder variant.
Learns soft node-to-cluster assignments and coarsens features and adjacency through S-transpose Z and S-transpose A S, enabling hierarchical graph neural networks.
Defines pseudo-coordinate patch operators with learned Gaussian-mixture kernels, unifying several spatial graph/manifold convolution constructions.
Learns direct-edge and neighborhood-context embeddings using negative sampling and weight-proportional edge sampling, then combines separately trained proximity representations.
Relates random-walk/negative-sampling embedding objectives to graph matrix factorizations and computes clipped log co-occurrence embeddings directly or with spectral approximation.
Adds resolution-scaled differential stencil layers and compact-support integral kernels using discrete–continuous convolution bases to neural operators, capturing local detail alongside global spectral layers.
Jointly parameterizes spectral operator weights through low-rank tensor factorizations and predicts local domains with hierarchical coarse-to-fine global context, reducing parameter and memory costs in reported PDE tasks.
Packages neural-operator architectures, spectral/integral layers, data processing, training, losses and memory-efficient tensorized/distributed workflows in a PyTorch-compatible library.
Uses spherical-harmonic convolutions rather than planar FFTs for operator learning on spherical geometry, with a differentiable spherical-harmonic implementation and reported stable atmospheric rollouts.
Adapts Fourier neural operators into a vision token mixer using block-diagonal channel mixing, shared Fourier-domain MLPs and soft-thresholded frequency features.
Applies AFNO to autoregressive high-resolution global weather fields and develops feature/data-parallel GPU training with optimized spectral operations, I/O and launch overhead.
Pretrains a 3D Swin/Perceiver weather model on diverse forecast, analysis, reanalysis and climate data, then fine-tunes for weather, ocean waves and cyclone-track tasks in the expanded source version.
Maps heterogeneous weather observations through learned state estimation, autoregressive forecasting and local prediction modules, permitting end-to-end adaptation without numerical-model initial states at inference.
Uses variable-specific encoders/decoders and cross-variable fusion, learns uncertainty-weighted weather losses, and reuses predicted intermediate states from a replay buffer to train long-lead autoregressive forecasts.
Cascades separately fine-tuned forecast models for0–5,5–10 and10–15-day windows, using joint space-time embedding and a U-Transformer to reduce long-range autoregressive errors.
Learns a scalar Hamiltonian-like function and obtains state dynamics through its symplectic gradient, fitting observed derivatives while preserving the learned quantity in the ideal continuous flow.
Parameterizes a Lagrangian with a neural network and uses automatic derivatives and a velocity-Hessian inverse to predict accelerations from generalized coordinates.
Regresses measured state derivatives onto a candidate nonlinear-function library using sparsity, including sequential thresholded least squares, to identify compact dynamical models.
Implements PINN problem specification, geometry/boundary handling and training workflows, with residual-based adaptive refinement that adds training points at high sampled residuals.
Combines symbolic PDE specification, parameterized geometry, differentiated residual training and GPU-ready network architectures in a multiphysics neural-solver framework.
Predicts particle mobility and rearrangement in simulated glassy systems from graph-encoded initial structure, and probes spatial correlations learned by the network.
Combines linear and indexed sparse attention in a new multimodal base, pooling four indexer keys into one with IndexPool to reduce long-context indexing cost.
Combines recurrent Q-learning and prioritized distributed sequence replay, storing recurrent states and using burn-in to reduce training-state mismatch and representational staleness.
Uses pooled class gradients to weight convolutional feature maps and produces a rectified localization map without changing or retraining the target CNN; Guided Grad-CAM combines it with a high-resolution backward visualization.
Averages sensitivity maps over Gaussian perturbations of an input to reduce visually noisy saliency, and studies visualization choices and training-time noise.
Learns concept directions from positive and counterexample activations, measures output directional derivatives along these directions and aggregates their signs into class-level concept sensitivity.
Thresholds and upsamples convolutional unit activations and compares them with densely annotated concepts through intersection-over-union, enabling representation comparisons and rotation tests.
Trains prediction through an explicitly supervised concept bottleneck using independent, sequential or joint losses, allowing predicted concepts to be corrected before the final output.
Uses corruption and restoration of internal activations to locate factual-recall pathways, then applies a constrained rank-one MLP update; CounterFact tests edited facts, paraphrases and nearby associations.
Extends weight editing to many associations by solving covariance-regularized batch updates and distributing desired hidden-state residuals across mediating transformer MLP layers.
Learns small shared editor networks on factorized per-example gradients, producing targeted weight changes while training against edit-neighborhood and locality losses without modifying the base model before an edit.
Adapts integrated gradients to intermediate FFN neurons, filters candidate neurons across diverse factual prompts, and investigates activation changes and targeted factual edits in a pretrained transformer.
Introduces model-parameter and data-label randomization tests for explanation methods, revealing that some visually persuasive saliency procedures can ignore learned model or label structure.
Tests correlations with gradient/erasure importance and searches permuted or adversarial attention distributions that preserve predictions in selected text classification, QA and inference models.
Adds uniform-attention baselines, random-seed calibration, guided non-contextual diagnostics and coherently trained adversarial attention models to assess the explanatory utility of attention.
Adds annotation-weighted input-gradient penalties to prediction loss so models avoid selected irrelevant features, and uses gradient constraints to search for alternative decision boundaries.
Uses implicit Hessian-vector products and inverse-Hessian approximations to estimate how training-point reweighting or perturbations affect model predictions, with selected data-debugging experiments.
Derives a representer decomposition of pre-activation outputs into signed training-feature similarities at stationary points with positively weighted L2 regularization of the final linear layer.
Accumulates gradient agreement to approximate a training point’s effect on test loss along optimization, with practical checkpoint and selected-layer variants for scalable inspection.
Applies cooperative-game marginal contribution valuation to training data for a fixed learner and utility, with Monte Carlo, truncation and gradient-based approximation strategies.
Fits example-specific surrogate functions to outcomes of models retrained on sampled training subsets, supporting prediction-counterfactual analysis, data relationships and leakage inspection.
Combines model-output linearization, random-projected gradient features, approximate logistic influence and model ensembling to estimate data attribution, evaluating subset counterfactual predictions with a rank-correlation score.
Combines diverse activation-maximizing examples with decorrelated image parameterization and regularization, making neuron and feature interactions easier to inspect.
Projects sampled feature activations into a two-dimensional layout, averages them in cells and visualizes those averages to explore recurring representation patterns.
Amplifies features selected from a trained visual network, feeding transformed outputs back with zooming to generate and inspect recurring learned patterns.
Interprets dropout networks through an approximate variational Bayesian model and estimates predictive moments by retaining random dropout masks during repeated inference passes.
Combines independent neural predictors trained with probabilistic losses, optional adversarial smoothing and learned regression variance into a uniform predictive mixture for uncertainty estimation.
Studies mismatch between neural confidence and correctness, and fits a held-out scalar logit temperature as a practical multiclass calibration procedure without changing class argmax.
Uses maximum softmax probability to rank prediction errors and anomalous inputs, establishing cross-domain detection baselines with explicit ROC and precision-recall evaluation.
Combines high-temperature softmax scores with small input-gradient perturbations to separate known and anomalous images while leaving the underlying classifier weights unchanged.
Fits class means and a tied feature covariance, then combines layer-wise Mahalanobis scores with input preprocessing to detect anomalous or adversarial examples from pretrained representations.
Uses negative log-sum-exp of classifier logits as a non-probabilistic anomaly score and proposes margin-based fine-tuning to separate in-distribution and auxiliary-outlier energies.
Trains a representation or detector with a complementary outlier loss on a diverse auxiliary dataset disjoint from the test anomalies, improving selected image and text anomaly detection.
Computes a ratio of distances to the predicted and nearest alternative class high-density sets, providing a model-agnostic confidence ranking with conditional density-estimation analysis.
Searches a confidence threshold using labeled calibration data and binomial risk upper bounds to trade accepted-example coverage against selective error.
Trains shared features with prediction, selection and auxiliary-prediction heads, minimizing selective loss plus a coverage penalty to specialize to a chosen accepted region.
Penalizes cumulative ranked class probabilities beyond a chosen rank and calibrates the resulting nested randomized sets on held-out data to control marginal label coverage.
Constructs randomized cumulative-probability conformity scores and calibrates them with split, cross-validation+ or jackknife+ techniques to adapt categorical prediction sets to model uncertainty.
Fits lower and upper conditional quantiles on proper training data, then uses held-out signed interval errors to conformalize variable-width regression intervals.
Forms prediction-interval endpoints from leave-one-out predictions at the new input paired with their held-out residuals, obtaining a distribution-free coverage guarantee for symmetric learning algorithms.
Weights conformity-score quantiles by test-to-training covariate likelihood ratios, extending prediction coverage to a covariate-shift and weighted-exchangeability setting.
Updates a single miscoverage parameter from observed errors to adapt prediction sets online, with long-run realized coverage-frequency analysis and finite-horizon discrepancy bounds.
Adds a finite-sample worst-case correction to held-out empirical loss and selects conservativeness to control expected loss on a future exchangeable example.
Calibrates nested set-valued predictors using pointwise risk upper bounds and a monotonic selection rule to obtain high-probability control of population loss.
Develops support-vector transductive predictions with confidence/possibility measures, followed by rank-based p-values and separate confidence/credibility in an improved transductive classifier.
Studies answer-conditioned P(True) and trains a separate P(IK) value head from sampled correctness labels to estimate answerability before selecting a particular answer.
Groups sampled answers by context-dependent mutual entailment and estimates uncertainty over meanings; the later journal treatment includes discrete frequency and normalized cluster-probability estimators.
Trains linear hidden-state classifiers against binarized semantic-entropy targets, estimating uncertainty from one generation instead of repeated test-time sampling.
Uses consistency across stochastic samples to flag potentially hallucinated sentences, with original BERTScore and MQAG variants for black-box language models.
Plans verification questions from an initial answer, answers them in separate contexts and revises the response; factored variants reduce direct copying of initial errors.
Scores retrieved documents with a learned relevance evaluator and routes among refined retrieval, web search and their combination before generation.
Trains a generator with retrieval, relevance, support and utility reflection tokens to retrieve on demand and rank passage-conditioned response segments.
Post-hoc research-and-revision system generates verification queries, retrieves evidence, edits disagreements while limiting text changes and returns an attribution report.
Defines source-relative factual precision by decomposing long-form responses into atomic facts and estimates supported fractions with retrieval and language-model checking.
Constructs claim-to-document and document-to-claim synthetic training pairs to train compact grounding checkers and assembles LLM-AggreFact evaluation data.
Provides reproducible retrieve-and-cite generation evaluation across fluency, answer correctness and citation quality using fixed corpora and NLI-based citation support checks.
Combines LongFact long-form prompts, search-augmented atomic-fact evaluation and F1-at-K using a preferred supported-fact count as a recall surrogate.
Short-form factuality benchmark with independently checked answers and explicit correct/incorrect/not-attempted judgments; later SimpleQA Verified filters redundancy, balances topics and reconciles sources.
Document-grounding benchmark filters unhelpful responses before multi-judge support assessment; the later FACTS suite adds multimodal, parametric and standardized-search dimensions plus revised grounding judges.
Trained a language-model classifier to label user prompts and assistant responses against a configurable safety taxonomy, providing an input/output safeguard with text explanations and task-specific adaptation.
Developed a multi-task moderation model and associated training/evaluation resources that distinguish prompt harmfulness, response harmfulness and whether a response refuses the request, including adversarially phrased inputs.
Identified a direction in residual-stream activations whose controlled intervention substantially changes refusal behavior in the tested instruction-tuned language models, linking an activation measurement to a causal behavioral effect.
Learned probes from internal model representations using consistency constraints between contrasting statements rather than truth labels, investigating whether latent answer information can be recovered when prompted outputs are unreliable.
Organized population-level representation reading and control into a top-down transparency framework, testing contrast-based activation directions, intervention and representation-adaptation methods on selected model behaviors.
Used activation differences elicited by contrasting prompts as inference-time steering vectors, showing selected changes to generated text without gradient-based fitting of the steering direction.
Constructed steering directions by averaging activation differences from contrasting response pairs and applied them during inference to shift selected behaviors of Llama 2 models without updating the base model's weights.
Identified attention-head activation directions using truth-labeled examples and intervened during generation to improve measured truthfulness on TruthfulQA without retraining the base model.
Mixed characteristic polynomials and interlacing families yield a finite-dimensional random-vector norm bound. A two-part vector partition consequence establishes Weaver's KS2 conjecture and hence the Kadison–Singer problem through the previously known equivalences.
Extending the Croot–Lev–Pach polynomial method, the paper gives an exponentially smaller-than-q^n bound for three-term-progression-free subsets of finite-field vector spaces in the applicable odd-characteristic setting. In F_3^n it obtains a cap-set bound with exponential base below 2.756.
A signed adjacency-matrix construction and eigenvalue interlacing give the sharp square-root maximum-degree lower bound for induced hypercube subgraphs with more than half the vertices. Via the known Gotsman–Linial equivalence, this proves polynomial relations between Boolean sensitivity, polynomial degree and block sensitivity.
A canonical five-parameter family and Almgren–Pitts min–max methods prove the 2π² Willmore-energy lower bound for embedded closed positive-genus surfaces in the round three-sphere, with conformal Clifford-torus equality. The source explains how the Euclidean immersed-torus conjecture follows using existing nonembedded-surface bounds.
A finite simple graph is perfect exactly when it has neither an induced odd cycle of length at least five nor the complement of such a cycle. A structural decomposition of Berge graphs, together with exclusions for a minimal imperfect graph, yields the characterization.
An equivariant-bordism construction, detection theorem, 256-fold periodicity and a homotopy gap exclude Kervaire-invariant-one elements in the higher indexed dimensions. Combined with Browder's earlier restriction, the associated framed-manifold dimensions are limited to 2, 6, 14, 30, 62 and possibly 126 in this work.
New analytic structural and density-increment methods give a stretched-exponential-in-logN upper bound on the density of three-term-progression-free subsets of {1,…,N}. The paper develops related finite-field structural results as a route to the integer theorem.
For a unital C*-algebra and a linear map into bounded operators on a Hilbert space, complete positivity is equivalent to representation as the compression V* pi(A) V of a *-representation on a larger Hilbert space. For a unital map the construction can make V an isometry.
For translation-invariant finite-range interactions on a quantum spin lattice with finite-dimensional site spaces, the norm of a commutator between separated local observables becomes exponentially small outside a sufficiently fast space-time cone. The proof bounds dynamical influence independently of the chosen quantum state.
For a finite-dimensional tripartite quantum state, the von Neumann entropies satisfy S(ABC)+S(B) <= S(AB)+S(BC). The proof uses operator trace inequalities and is accompanied by convexity of negative conditional entropy; the original text develops extensions through controlled finite-dimensional approximation.
Lifted products over nonabelian groups yield quantum LDPC code families with positive constant rate and minimum distance linear in block length. A related construction also yields classical locally testable LDPC codes with constant rate, relative distance, query complexity and soundness.
The paper proves unconditionally that the liminf of consecutive-prime gaps is less than seventy million. A refinement of the GPY sieve uses stronger averaged distribution estimates for primes in arithmetic progressions with moduli having only small prime factors.
For each fixed dimension, a subset of a finite vector space containing a full affine line in every direction has size at least a positive dimension-dependent fraction of the entire space. A low-degree polynomial vanishing on a too-small candidate set would force incompatible vanishing of its homogeneous components.
Every set of N distinct points in the Euclidean plane, for N at least two, determines at least cN/logN distinct nonzero distances for a universal positive constant c. The proof combines the Elekes-Sharir rigid-motion framework with three-dimensional line-incidence bounds, polynomial partitioning and ruled-surface geometry.
Every odd integer greater than five is a sum of three primes. Explicit major- and minor-arc estimates and an optimized large sieve cover all sufficiently large integers; a rigorously verified finite range overlaps that analytic threshold and completes the result.
Cayley developed matrix addition, associative noncommutative composition, identity, inverses for nonzero determinant and transpose rules, and extended compatible composition to rectangular matrices. He stated the characteristic equation for arbitrary square order, explicitly demonstrated the two-by-two identity and reported verification in order three, using it to organize matrix powers and low-order examples.
Hermite constructed simultaneous rational approximations to exponentials and used their arithmetic structure to show that e satisfies no nonzero polynomial equation with integer, equivalently rational, coefficients. His treatment converts a putative integer-coefficient relation among distinct integral powers of e into integer linear forms that tend to zero. A nonvanishing determinant prevents all such forms from vanishing, yielding a contradiction.
Kovalevskaya proved convergence of the recursively determined formal power series for analytic PDE Cauchy problems in the paper's normal, noncharacteristic forms. A coefficientwise majorant argument establishes the first-order system result; higher-order algebraic equations and specified coupled systems are reduced to this setting after selecting a simple root for the leading normal derivatives. Analytic initial data then determine a unique local analytic solution on that branch. She also exhibited heat-equation data whose formal time series has zero convergence radius, showing why solving for a lower-order time derivative alone is insufficient.
Picard proves that a nonconstant entire holomorphic function can omit at most one finite complex value. The October 1879 note strengthens this: a transcendental entire function assumes every finite value infinitely often, with at most one exception. The 1880 memoir supplies the detailed modular-function/monodromy proof and local extension: near an isolated essential singularity, a holomorphic function assumes every finite value infinitely often except possibly one; the corresponding meromorphic version permits at most two exceptional values on the sphere. These linked results are staged as one contribution family.
Lindemann adapted Hermite's exponential-integral arithmetic to prove that π is not a root of any nonzero polynomial with rational coefficients. The proof uses symmetry among algebraic conjugates, integer or algebraic-integer relations that become too small, and a nonzero determinant; the application combines the exponential relation e^(iπ)=−1 with the algebraic hypothesis. Transcendence excludes exact squaring of a circle by a finite construction using only a compass and unmarked straightedge.
Mittag-Leffler's1884 memoir constructs a single-valued analytic function with prescribed singular parts at a countable isolated setQ, regular away fromQand its accumulation setQprime. Subtracting suitable finite Taylor/rational correction terms from each prescribed part makes their series locally uniformly convergent. Finite polynomial principal parts give the familiar meromorphic-function construction; entire functions of1/(z−a)allow isolated essential singular parts as well. Section 1also treats the stated connected-domain boundary formulation and describes the remaining freedom by addition of a regular function.
Runge constructs rational approximations to a single-valued analytic function on a plane domain, converging uniformly on compact subsets away from its poles. Cauchy integrals on a nested square-grid exhaustion are replaced by finite rational sums; a pole-moving argument then relocates unwanted poles outside the approximation region. In particular, a holomorphic function on a domain can be locally uniformly approximated by rational functions without poles in that domain.
Hölder proved that any two composition series of a finite group yield the same simple quotient groups up to isomorphism, order and multiplicity. He replaced the earlier invariance of numerical factor orders by invariance of the factor groups themselves, using quotient groups and an induction through intersections of distinct maximal normal subgroups. Applied to algebraic-equation chains, these simple factor groups give unavoidable constituents of the auxiliary equation groups, even when auxiliary irrationalities beyond the original roots are admitted under the paper's rationality-field conventions.
Hilbert proved that a system of homogeneous polynomial forms in finitely many variables admits a finite subfamily generating every member by polynomial linear combinations. He supplied a separate integer-coefficient version, proved termination of successive minimal systems of relations in the stated polynomial setting, and applied the finite-basis mechanism together with invariant-producing differential operators to establish finite generation for the classical invariant systems treated in the paper. The argument turned finiteness questions about infinitely many forms into finite algebraic data.
Hurwitz proves that every real irrational alpha has infinitely many rational approximations p/q with |alpha−p/q|<1/(sqrt(5)q²). The constant sqrt(5) in the denominator cannot be uniformly increased: irrationals whose continued fractions are eventually all 1, including the golden ratio and its integral fractional-linear equivalents, obstruct every larger constant.
Hilbert proved a homogeneous polynomial zero-set criterion: if a family of forms vanishes at every common zero of specified forms, then products of sufficiently many members of the vanishing family belong to the ideal generated by the specified forms. In particular, a sufficiently high power of any such form is a polynomial combination of the defining forms. This provides the central bridge from common zeros to ideal powers that became the Nullstellensatz, and supports his analysis of invariant systems.
Independent analytic proofs established the asymptotic density of primes, in the weighted form θ(x)=Σ_{p<x}log p∼x and the familiar equivalent count form π(x)∼x/log x. Hadamard's 1896 paper proves the absence of zeta zeros on Re(s)=1 away from the pole, then obtains the asymptotic by a convergent smoothed contour integral and removes the smoothing. The same paper treats fixed reduced arithmetic progressions, with weighted density1/φ(k); de la Vallée Poussin's own Congress report states the corresponding weighted and counting asymptotics.
Minkowski used translates of a half-scale centrally symmetric convex body to prove M^3 I<=8 for the minimum nonzero integer-lattice gauge M and unit-body volume I in three dimensions. Consequently a centered closed convex body of volume at least8 contains a nonzero integer lattice point. He connected the geometric bound with linear forms and simultaneous rational approximation.
Hensel proposed replacing aspects of ideal-prime factorization by local prime-power expansions analogous to power-series expansions of algebraic functions. His announcement describes algebraic numbers through expansions with finitely many negative terms, distinguishes unramified and ramified local parameters, and relates the resulting places and orders of zeros or poles to prime-ideal divisibility and ramification. It sets out a prime-adic local viewpoint rather than giving a complete proof of the announced foundation.
Maschke removed an earlier restriction from his criterion that a finite linear substitution group whose matrices have a fixed identically vanishing off-diagonal coefficient is intransitive, meaning transformable into separate blocks of variables. The decisive finite-group step starts with an invariant block and uses a positive invariant Hermitian form to eliminate the cross terms; the resulting unitary relations force the opposite off-diagonal block to vanish. Thus an invariant subspace in this complex finite-dimensional setting has an invariant complementary subspace, giving complete reducibility by iteration.
Fejér proves that arithmetic means of the Fourier partial sums of a bounded integrable periodic function converge to its value at continuity points and to the average of its finite one-sided limits at a jump. A nonnegative normalized trigonometric kernel controls the nearby and distant parts of the integral. For a continuous periodic function the convergence is uniform, giving constructive trigonometric approximation; the note also explains how a convergent series of finite Fourier polynomials follows by telescoping the means.
Frechet organized functional calculus on sets of arbitrary objects by first axiomatizing convergence, then adding a symmetric separating distance and the triangle inequality. His framework transfers continuity and compactness arguments beyond Euclidean points. In the distance setting, he characterizes nonempty compact sets through boundedness and attainment of extrema of every real-valued continuous functional, and develops finite-small-cover criteria under his stronger normal-class assumptions.
Haar constructs a complete orthonormal system of localized dyadic step functions on [0,1]. In its specified natural order, Fourier-Haar expansions converge uniformly for continuous functions and almost everywhere for Lebesgue-integrable functions. The proof uses localized positive averaging kernels; dense recursive partitions yield related systems.
Schur proves that the coefficientwise product of two finite nonnegative Hermitian forms is again nonnegative. The proof factors one coefficient matrix into Gram terms and expresses the product form as a sum of nonnegative forms. He also bounds the product's characteristic roots using the extremal eigenvalues of one form and diagonal entries of the other, and derives a product-closure result for continuous nonnegative Hermitian kernels.
Weyl linked high Dirichlet eigenvalues of a planar domain to its area: for eigenvalues λ_n of −Δ ordered with multiplicity, n/λ_n tends to area/(4π). His1911note combines comparison inequalities for symmetric integral kernels with the Green-function singularity, reduction to squares and explicit square eigenvalues. It also states the analogous planar variable-coefficient leading term with effective area ∫k/p for the specified self-adjoint elliptic problem.
Frobenius extends positive-matrix spectral theory to finite irreducible nonnegative matrices. The positive spectral radius is a simple eigenvalue with strictly positive left and right eigenvectors, while all eigenvalues on its spectral circle are simple and are the radius times a full cycle of roots of unity. The primitive case is characterized by a positive matrix power; sufficiently high powers are then positive. The same paper develops cyclic block structure and reduction into irreducible parts.
In his French note, Lusin characterizes measurable real functions on [0,1] by continuity on a perfect nowhere-dense subset whose measure can be chosen greater than1−epsilon for every positive epsilon. Continuity is relative to that retained set. Using Egoroff's almost-uniform convergence result, the note shows that this C-property is preserved by pointwise or almost-everywhere limiting constructions and states the measurable-function characterization and converse.
Tietze proves that a bounded real-valued continuous function on a closed subset of a Frechet classE—a metric space in the paper's explicit distance axioms—extends continuously to the whole space. The construction uses distance to the closed set and a distance-weighted upper envelope. Related majorization and decreasing continuous approximation results supply the same proof framework.
Rademacher proves that a finite-dimensional Lipschitz function is totally differentiable outside a Lebesgue-null set. His original stronger sufficient condition uses a finite integrable upper local slope, and the paper connects almost-everywhere linearization to Jacobians and a change-of-variables formula for one-to-one transformations under its stated hypotheses.
Mordell proved that rational solutions of the nonsingular genus-one cubic/quartic equations treated in his 1922 paper can all be generated from finitely many rational points by the classical chord/tangent and corresponding quartic constructions. For an elliptic curve over the rationals this gives finite generation of its rational-point group; infinite rational points can therefore have a finite generating set.
For a fixed finite bilinear form, Riesz proves log-convexity of its norm in reciprocal-exponent coordinates α=1/p and β=1/r on0≤α,β≤1 with α+β≥1, including positive-weight versions. Via duality and Stieltjes–Lebesgue approximation this yields operator-norm log-convexity and endpoint interpolation for a compatible linear operator L^p→L^q in the region1≤p≤q≤∞: intermediate norms are bounded by the geometric interpolation of endpoint bounds.
For finite-dimensional Euclidean R^k, Bochner proves that a bounded continuous complex function is positive definite exactly when it has a Fourier–Stieltjes representation f(x)=∫exp(i x·α)dV(α) with a nonnegative bounded distribution function. Positive definiteness is the nonnegativity of every finite quadratic form, not strict positivity. His uniqueness theorem identifies the distribution up to the original continuity-interval equivalence, corresponding to a unique finite positive Borel measure; its total mass is f(0).
For a C^q map from a region of R^m to R^n, Sard proves measure-zero results for the images of points where the derivative has less than maximal rank. If m>n, q≥m−n+1 gives zero n-dimensional Lebesgue measure; if m≤n, C^1 suffices for the rank-deficient image to have zero m-dimensional Hausdorff measure.
Goodstein connected natural-number descent processes to ordinal notation below epsilon zero. Writing numbers hereditarily in a base, replacing that base throughout the nested exponents by the next prescribed nondecreasing base, and subtracting one produces a process that eventually reaches zero. Replacing the finite base by omega assigns a strictly descending ordinal whenever the current number is positive. The paper relates these arithmetical processes to a restricted ordinal well-foundedness principle and develops finitary termination arguments for restricted ordinal heights.
For a finite permutation group acting on s positions and an inventory series f with finite nonnegative integer coefficients, the generating series of inequivalent configurations is obtained by replacing each cycle-index variable z_j with f(x^j,y^j,...). Fixed colour multiplicities are extracted coefficientwise; the proof counts cycle-constant fixed configurations and averages over the group.
The number of cyclic binary sequences of length 2^n containing each binary word of length n exactly once is 2^(2^(n-1)-n). The proof relates these cycles to complete directed walks and shows that doubling a two-in/two-out network with m vertices multiplies its cyclic complete-walk count by 2^(m-1).
Tarski gave an effective procedure converting first-order real-algebra formulas built from polynomial equations, inequalities and logical quantifiers into equivalent quantifier-free formulas. For closed sentences this yields a terminating truth-decision method; coordinate translation gives a corresponding decision method for elementary Euclidean geometry.
For a closed proper convex function on finite-dimensional Euclidean space, Fenchel's supremum construction gives a convex conjugate satisfying <x,xi> <= f(x)+f*(xi), with symmetric recovery of the original function by conjugation. Supporting hyperplanes connect equality to conjugate points without requiring differentiability.
Loomis and Whitney prove that the volume m of an open subset of R^n satisfies m^(n−1)≤m_1⋯m_n, where m_i is its (n−1)-dimensional coordinate projection measure. Their elementary induction and Hölder argument first establishes the corresponding cube-counting inequality N^(n−1)≤N_1⋯N_n. Axis-parallel boxes attain equality in the volume bound.
A partially ordered set of finite width k—no antichain of size k+1 and an antichain of size k—can be partitioned into k disjoint chains, and fewer chains cannot suffice. Dilworth proves the finite case and extends it to arbitrary finite-width ordered sets using a maximal principle. The paper applies the decomposition to set representatives and finite distributive-lattice embeddings.
For commutative rings R⊂T⊂S with unit and R Noetherian, if S is a finitely generated R-algebra and a finite T-module, then T is a finitely generated R-algebra. Artin and Tate prove this by extracting a finite coefficient subalgebra and using Noetherian module finiteness, and give a short proof of Zariski's field lemma as an application.
Chernoff used the optimized exponential moment of a real random variable to bound tails of sums of independent identically distributed observations and identify their exponential decay rate. He then defined an asymptotic efficiency index for threshold tests between two simple hypotheses: the smallest fixed-positive-weight sum of the two error probabilities has a rate independent of that weight. Ratios of the logarithms of these indices compare asymptotic sample requirements.
For finite real vectors x and y, majorization of y by x, including equality of total sums, admits an orthostochastic realization y_i=sum_j U_ij^2 x_j with a real orthogonal matrix U. Consequently these conditions exactly characterize diagonals of Hermitian matrices with prescribed real eigenvalues, with real symmetric realization available. Horn also proves that diagonals of real determinant+1 orthogonal matrices form the convex hull of sign vectors with an even number of negative coordinates, deriving orthogonal and unitary diagonal characterizations.
Penrose characterized a unique generalized inverse X for every finite complex rectangular matrix A by AXA=A, XAX=X, (AX)*=AX and (XA)*=XA, with * the conjugate transpose. He gave an existence and uniqueness proof and used generalized inverses to express solvability and all solutions of AXB=C, as well as matrix projectors and a partial-isometry spectral decomposition.
Multics was an attempt to make a computer a dependable shared utility. This paper explains how its designers connected goals such as continuous operation, controlled sharing and expandable capacity to implementation choices and years of experience. It also discusses revisions and incomplete goals. The contribution is an account of a working system and the lessons extracted from building it, rather than a claim that every feature of the original vision had been delivered.
A trained neural network may contain weights that contribute little to its predictions. LeCun, Denker and Solla estimate the cost of removing a weight from how sharply the training error bends near the learned solution. They remove low-cost weights and retrain. Their experiments show why curvature can be more useful than simply keeping large weights, while also showing that a local approximation becomes less accurate when too many weights are removed at once.
Could one search strategy be best for every optimization problem? Wolpert and Macready show why the answer changes when problems are averaged in a particular way. On finite search spaces, averaging uniformly over all objective functions removes the advantage of any strategy when performance depends on the values found after distinct queries. Practical success therefore depends on the structure of the problems encountered. This does not say that a useful optimizer, or a well-chosen benchmark, is impossible.
Particle filters approximate hidden states using a finite collection of simulated possibilities. MCMC methods instead build a chain designed to preserve a target distribution. Particle MCMC connects the two by treating the random choices inside a particle filter as part of a larger mathematical state. This allows particle-based proposals to preserve the intended posterior exactly under stated assumptions, even with finitely many particles. Exactness of the stationary target still leaves a practical question: how quickly does the chain explore it?
A growing library becomes hard to use if a book is identified mainly by the shelf where it happens to sit. Dewey links books to subjects using numbers that can be extended with extra digits. A subject index helps readers find the right number, while relative location lets a collection grow without renumbering every shelf. The first edition explains both the practical benefits and compromises of its hierarchy. The achievement is a reusable organization and retrieval method, not a neutral map of all knowledge.
The gravitational pull between ordinary laboratory objects is tiny. Cavendish made it measurable by suspending a light arm from a thin wire and observing how nearby heavy masses changed its position. Timing the arm’s oscillations helped connect the deflection to force. The experiment led to an estimate of Earth’s mean density, about 5.48 times that of water. The paper also examines air currents, temperature changes and other errors that could disturb such a delicate measurement.
Security is not only about whether a user can read a file. A program that a user trusts can alter another program, which can then spread the change further. Cohen develops this computer-virus model, relates spreading to information sharing and integrity policies, and reports controlled experiments on contemporary systems. The work helps explain why ordinary access controls can leave a different problem unsolved: deciding which information and programs should be allowed to change what.
Independent errors are easier to average than errors that depend on the past. Azuma studies sequences whose next increment has zero conditional mean, together with boundedness or conditional exponential-moment assumptions. These conditions control weighted sums and how their fluctuations grow. The paper gives convergence and iterated-logarithm upper bounds under explicit restrictions on the weights. This adds a route for studying dependent data without pretending that every dependent sequence behaves like independent noise.
Heating a magnetic material can change far more than the strength of its attraction. Curie compares magnetic behaviour across materials and temperatures, looking for relations between weak magnetism, diamagnetism and ferromagnetism. For several weakly magnetic substances the magnetic coefficient varies approximately as the inverse of absolute temperature. Some ferromagnets approach this behaviour sufficiently far above their transformation temperature. The experiment gives later theories concrete patterns to explain, including exceptions and changes that a single simple formula misses.
Introduced an automated red-teaming workflow in which an attacker language model revises candidate requests using feedback from a target model and an evaluation model, enabling query-based stress testing without target-weight access.
Combined a jailbreak-response judgment benchmark with multi-agent explanation and aggregation, and distilled judgment behavior into an open evaluation model for comparing model safeguards.
Studied discrete optimization of adversarial input suffixes across prompts and models, reporting that inputs optimized against accessible models can transfer to some other aligned language models and expose safeguard weaknesses.
Collected human adversarial conversations with language models and compared model size and training approaches, documenting how red-teaming outcomes, participant behavior and observed harms depend on the evaluation process.
Built a standardized framework combining curated harmful-behavior test cases, automated red-team method comparisons and response classifiers to evaluate robust refusal across language models under a common evaluation procedure.
Generated and filtered language-model evaluation datasets with language models and human relevance checks, using them to identify scaling and training trends in behaviors such as sycophancy and stated preferences.
Trained representation-level adapters to redirect activations associated with unwanted behavior while retaining representations for benign behavior, testing a safeguard designed to interrupt problematic generation pathways.
Used language models to generate adversarial test inputs and compared generation and learning strategies for finding undesirable target-model outputs, offering automated discovery as a complement to manual red-teaming.
Constructed a question-answering benchmark contrasting ambiguous and disambiguated contexts to measure when model answers rely on social stereotypes rather than supplied information, using controlled templates and balancing.
Built a stratified collection of web-text prompts and evaluated how language-model continuations receive toxicity scores, testing how prompting context and existing mitigation approaches affect toxic generation.
Extended iterative model-generated red-teaming with branching candidate exploration and pruning, using evaluation feedback to concentrate black-box target queries on promising test cases.
Designed a benchmark and automated rubric that distinguish nominal non-refusal from a response that actually provides specific and convincing information, exposing overestimation in some automated red-team success measures.
Colour every word of a fixed length using a fixed finite alphabet. Hales and Jewett prove that, once the length is large enough, some family of words has one colour while the same nonempty positions vary together through the alphabet. This shared pattern is a combinatorial line. The theorem connects Ramsey-type regularity, arithmetic progressions and high-dimensional positional games.
A long enough ordered list of distinct numbers must contain a long increasing or decreasing subsequence, even if that pattern is hidden among other entries. Erdős and Szekeres establish the sharp threshold (r−1)(s−1)+1 for an increasing subsequence of length r or a decreasing one of length s. Their related geometric argument shows that sufficiently many planar points in general position contain a convex n-gon, with the historical upper bound binomial(2n−4,n−2)+1.
A bell curve may approximate a sum of independent random errors, but an approximation is more useful when its error is bounded. Berry gives a uniform bound on the difference between the cumulative distribution of a sum and its matching Gaussian distribution. His original estimate uses finite third absolute central moments and a maximum moment ratio; in the identically distributed case it gives an inverse-square-root rate in the number of terms. The work turns a limiting statement into a quantitative comparison.
A large collection of small sets cannot remain completely unstructured. Erdős and Rado find a subcollection whose pairwise intersections are all the same common core: a Δ-system, also called a sunflower. Their paper gives finite bounds while distinguishing distinct sets from indexed repetitions, and treats an infinite-cardinal regime separately. The finite argument supplies a reusable tool for extracting regular structure from a complicated family of sets.
Can a table of distances come from points in a Hilbert space, where lengths and angles behave as in Euclidean geometry? In a separable setting, Schoenberg connects that question to the kernels exp(−s d²), for every positive s. These kernels must be positive semidefinite on every finite selection of points. The result links geometry to algebraic tests on distance tables and explains why suitable fractional powers of distances admit Hilbert-space embeddings.
Suppose probabilities are attached to subspaces of a Hilbert space, with probabilities adding across mutually perpendicular alternatives. Gleason proves that, for the stated real or complex separable spaces of dimension at least three, every finite nonnegative assignment of this kind comes from a positive trace-class operator. For total probability one, that operator is a density operator. The result characterizes a quantum probability rule from precise consistency assumptions; it does not establish the rule without those assumptions.
Add edges at random to a graph with n labelled vertices, giving every graph with the same number N of edges equal probability. Erdős and Rényi identify a change as N/n approaches a fixed density c. For fixed 0<c<1/2 the largest connected component has logarithmic order. For fixed c>1/2, one giant component contains a positive fraction of all vertices with probability tending to one. This is an asymptotic transition in a specified random model, rather than a rule for every finite network.
Some irrational numbers can be approximated extraordinarily well by fractions. Roth proves a sharp limit for real algebraic irrationals: for any fixed positive epsilon, only finitely many reduced fractions p/q satisfy |alpha−p/q|<q^(−2−epsilon). At exponent two, every irrational still has infinitely many good approximations. His proof closes the rational-approximation exponent gap left by earlier work without supplying a general computable list of all exceptional fractions.
Multiplication need not commute in every algebra: quaternion multiplication is a familiar counterexample. Wedderburn’s 1905 theorem says that a finite associative division ring cannot have that behaviour. If each nonzero element has a multiplicative inverse and the set is finite, multiplication must commute, making the structure a finite field. The paper presents several arguments and acknowledges Dickson’s alternative proof; it is separate from the later structure theorem for semisimple algebras.
Can a whole interval be assembled from countably many sets that leave a gap inside every smaller interval? Baire proves that it cannot. His 1899 thesis gives a nested-interval argument and introduces first and second category, a way to distinguish topologically small sets from a whole real interval. The framework also describes where suitable discontinuous functions remain continuous. It is a foundational principle about countable exceptional sets, rather than a statement about their total length.
A sequence of continuous functions can settle point by point into a discontinuous limit. Baire classified functions by repeated pointwise limits and characterized the first class on a real interval through continuity of the restricted function on every perfect subset. His thesis distinguishes successive classes and gives a rational/irrational class-two example. A 1900 paper supplies a shorter sufficiency proof on a finite-dimensional closed cube, while explicitly acknowledging Lebesgue’s reduction of several variables to one.
An unruly list of complex differentiable functions can contain a well-behaved subsequence. Montel’s 1907 compactness criterion extracts a locally uniformly convergent subsequence from a locally uniformly bounded holomorphic family. His 1912 work adds a different route: a holomorphic family that omits two shared distinct finite values is normal, allowing a subsequence to diverge uniformly to infinity. These criteria turn questions about many functions into questions about one limiting function.
Adding the rows of a table or its columns gives the same total. Infinite integrals need conditions before the analogous swap is valid. Fubini’s 1907 paper establishes equality between a Lebesgue double integral and either iterated integral for an integrable function, with exceptional sections handled almost everywhere. Tonelli’s 1909 nonnegative criterion can establish integrability from a finite iterated integral. The two papers form one evolving theorem family, not a joint publication.
Every positive integer is a sum of a bounded number of squares, but what happens for cubes, fourth powers or any other fixed exponent? Hilbert proves that each positive integer exponent has its own finite bound on the number of positive-power summands needed for every positive integer. His 1909 proof turns an integral identity into finite rational identities and then integer representations. It establishes existence for all exponents, without finding the least possible bound.
A well-order gives every nonempty subset a first element. Zermelo showed how a simultaneous choice of one element from each nonempty subset can yield such an order on an arbitrary set. His 1904 letter compares compatible partial well-orders and combines them until the whole set is covered. The choice principle is an explicit assumption. Erhard Schmidt is acknowledged for the choice-assignment idea, while Zermelo is the printed author of the proof.
A deterministic sequence can spread around a circle as evenly as interval lengths predict. Weyl’s exponential-sum criterion tests this by asking whether each nonzero integer frequency cancels out on average. His 1916 paper applies the method to polynomial sequences with an irrational nonconstant coefficient and to multidimensional settings under the stated independence conditions. Even distribution is a long-run frequency statement; it does not make the sequence independent, random or perfectly balanced after a fixed number of terms.
Weakly interacting atoms can move collectively in a way that individual free particles cannot describe. Bogoliubov’s 1947 approximation replaces the difficult interacting Bose gas near a condensate by elementary quasiparticle excitations. The resulting spectrum is sound-like at small momentum and approaches free-particle behaviour at large momentum under the stated interaction assumptions. The transformation supplies a reusable microscopic framework, while the original explicitly builds on earlier Bose-gas and Landau superfluidity ideas.
Lee, Huang and Yang used a pseudopotential calculation to connect the wave functions, excitations, condensate depletion and pair correlations of a dilute hard-sphere Bose gas. The 1957 paper recovers the beyond-mean-field energy correction, explicitly crediting its earlier Lee–Yang derivation, and calculates low-lying collective excitations at the stated order. Its value is the linked microscopic calculation, not a claim that every density regime of liquid helium has been solved.
A two-dimensional system can have slowly decaying correlations without settling into conventional long-range order. Berezinskii’s 1970 and 1971 theoretical work, published in English translation in 1971 and 1972, develops this low-temperature picture for planar systems. The follow-up connects vortices to a logarithmically interacting gas and describes stiffness and superfluid response. It also corrects an earlier phase criterion. Later Kosterlitz–Thouless theory, universal-jump results and experiments remain separate contributions.
Electromagnetic influences take time to travel between atoms. Casimir and Polder calculated how that delay changes dispersion interactions: at large separation the two-atom energy falls as the inverse seventh power of distance, rather than the nonretarded inverse sixth power. Their 1948 paper also treats a neutral atom near an ideal conducting plane, with a different distance law. These are quantum-electrodynamic predictions under stated approximations, separate from Casimir’s two-plate calculation and from later measurements.
Instead of slowly scanning one resonance frequency at a time, Ernst and Anderson applied short radio-frequency pulses, recorded the combined time response and used a Fourier transform to recover the spectrum. Their 1966 magnetic-resonance paper combines a pulse-response model, coherent accumulation, filtering, numerical processing and an experimental comparison. It demonstrates a practical sensitivity and recording-time advantage under the stated conditions, rather than claiming that a Fourier transform alone improves every noisy measurement.
Light ordinarily disappears into a cavity’s walls as the system cools, rather than piling into its lowest-energy mode. Klaers and colleagues used repeated absorption and re-emission in a dye-filled microcavity to thermalize an effectively two-dimensional photon gas. They observed a strongly occupied ground mode, thermal spectral wings, a threshold with the expected geometry dependence and condensation away from the pump spot. Together these observations support photon Bose–Einstein condensation in the reported pumped, lossy regime.
Two independent 2008 teams used cold atoms to observe spatial localization of matter waves under controlled conditions. Billy and colleagues released a dilute cloud into a one-dimensional laser-speckle potential and measured stationary exponential density wings. Roati and colleagues used an almost non-interacting potassium condensate in a quasiperiodic optical lattice, testing transport and spatial and momentum profiles. Their different experimental routes probe disorder-related localization; they are one result family here, with two separate source bylines.
Mazurenko and colleagues arranged cold fermionic atoms in a square optical lattice and measured antiferromagnetic spin correlations across a finite region of roughly eighty sites. A quantum gas microscope resolved individual sites, while comparisons with numerical models helped estimate temperature and interpret the correlations. The experiment created a useful low-temperature Hubbard-model simulator. It did not establish finite-temperature long-range order in an infinite two-dimensional system or solve the full doped-Hubbard phase diagram.
Two interacting quantum energy levels can avoid crossing even when their uncoupled energies would meet. Zener solved an ideal two-state crossing model to show how the rate of change affects the chance of a non-adiabatic transition. With constant coupling V and a linear uncoupled energy difference of slope s, the asymptotic probability is exp(-2*pi*V^2/(hbar*abs(s))). Slow and fast passages can therefore have very different outcomes.
Particles can keep moving while obeying a simple long-run energy balance. Clausius related the time-averaged kinetic energy of bounded stationary motion to a force-position quantity he called the virial. His mechanical derivation keeps a time-boundary term before taking a periodic or long-time average. For central pair forces and uniform external pressure, it connects microscopic motion with the pressure-volume term.
Measurements of heat do not by themselves determine the maximum work a process can deliver: an integration constant remains. Nernst proposed a low-temperature hypothesis to supply the missing constraint for processes involving pure condensed substances. The work and energy curves approach a common tangent near absolute zero. Combined with thermal measurements and specified approximations, this made equilibrium calculations more constrained and became a foundation of later low-temperature thermodynamics.
Quantum uncertainty can be expressed as a relation for many pairs of observables. Robertson connected their standard deviations, which measure the spread of repeated outcomes, to the magnitude of the expected commutator: Delta A times Delta B is at least one-half of abs(<AB-BA>). The familiar position-momentum case becomes one example of this general relation, alongside angular-momentum components.
Four measured lines in the hydrogen spectrum fit a surprisingly compact number pattern. Balmer expressed their wavelengths using a common scale b times m^2/(m^2-4), with integer m=3,4,5,6. He then compared the extension of that pattern with additional violet and ultraviolet observations. This was a useful empirical rule before an atomic theory explained why those numbers appeared.
Magnetizing an iron mirror changes the polarization of light reflected from it. Kerr compared light extinction and the effects of reversing magnetization, changing incidence and rotating the polarizing apparatus. His 1877 and 1878 papers established a family of reflection effects, including changes that cannot be described simply as rotation of a still-linear polarization.
The angle at which reflected light is most strongly polarized is connected to refractive index. Brewster compared transparent materials and related the tangent of the polarizing angle to their index. He also connected this angle with a right angle between reflected and refracted rays. The work turned a qualitative optical effect into a quantitative relation that can be checked with geometry and material properties.
An electrical conductor can produce measurable random voltage even when no signal is being sent through it. Johnson measured this thermal noise and investigated how it depends on resistance, temperature and the measuring circuit. Nyquist gave an equilibrium explanation: in the classical regime, a resistor has voltage mean-square contribution 4kTR per unit ordinary-frequency bandwidth. The two separate papers connect an observed limit of sensitive electronics with thermal statistical physics.
For real coefficients |x_i|≥1, at most binomial(n,floor(n/2)) of the2^n signed sums fall inside any open interval of length2. Erdős obtains the sharp bound through Sperner's antichain theorem, removes a logarithmic loss for complex-coefficient disk concentration up to an absolute constant, and proves the associated bound by the r largest binomial coefficients for longer intervals and families without an(r+1)-element inclusion chain.
Mandelstam and Tamm related the energy spread of an isolated quantum system to the rate at which an observable changes: ΔH ΔR ≥ (ℏ/2)|d⟨R⟩/dt|. Applying this to the projector onto the initial pure state gives a survival probability of at least cos²(ΔH t/ℏ) up to πℏ/(2ΔH), hence a lower bound on the time to reach an orthogonal state. They also extended the observable inequality to statistical mixtures.
Hahn observed nuclear induction echoes after separated radiofrequency pulses and explained how pulse-induced rephasing restores a macroscopic signal from an inhomogeneously dephased ensemble. Echo amplitudes provided measurements of spin relaxation, while a third pulse produced stimulated and secondary echoes. Bloch-equation analysis related the observed decay to relaxation and, in liquids, molecular diffusion through field gradients.
Schur proves that every finite square complex matrix is unitarily similar to a triangular matrix whose diagonal lists its eigenvalues with algebraic multiplicity. He derives sum |lambda_j|^2 <= sum |a_ij|^2, with equality exactly when a unitary change of basis diagonalizes the matrix, and related bounds on the real and imaginary parts of the eigenvalues.
For a strictly increasing positive-integer sequence whose counting function eventually exceeds N^theta for every theta<1, concatenating its base-b representations gives a b-normal real. This proves the prime-concatenation example and the sums-of-two-squares example using the stated counting estimates.
For every continuous F on[0,1], the explicit polynomials B_nF(x)=sum_{k=0}^n F(k/n) binom(n,k)x^k(1-x)^(n-k) converge uniformly to F. The original derives this construction as the expected payout from n Bernoulli trials, using continuity and a small tail probability.
For every prescribed triangular array of distinct interpolation nodes in a real compact interval, some continuous function fails to be uniformly approximated by its Lagrange interpolation polynomials. Faber proves the corresponding periodic trigonometric obstruction and derives unbounded interpolation-operator norms, using a constructive continuous-function argument.
For a real polynomial p of degree at most n, bounded by k on a measurable subset E of an interval S of length l with measure at least lambda=theta*l, 0<theta<1, the interval supremum is at most k*T_n(2/theta-1). Shifted Chebyshev polynomials on an endpoint interval of length lambda attain the bound.
Kakutani gave a direct averaging proof of Markov's common-fixed-point theorem for a commuting family of continuous affine self-maps of a nonempty compact convex subset of a locally convex topological vector space. He also formulated a common-fixed-point theorem for an affine congruent group preserving such a set, with applications to almost-periodic means and an alternative route to Banach's extension theorem.
An image can show a closed refrigerator, but it cannot reveal what changes when a robot opens it. AI2-THOR connects a simulated indoor world to a Python controller: an agent requests an action, the world applies its rules, and the agent receives a new image and structured information. The 2017 account describes 120 rooms across four household settings, with objects that can be opened, picked up or otherwise manipulated. This makes sequences of perception and action repeatable without requiring a physical robot for every experiment. Its contribution here is the documented simulation resource and interface, separate from the earlier image-target navigation algorithm developed with the platform.
Instead of naming a destination, a robot can be shown a photograph of the place it should reach. Zhu and colleagues combine that target image with the current camera view in a shared Siamese network, which processes both inputs using related parameters. An actor–critic policy then chooses movement commands. Sharing representations across destinations allows experience from one route to help another. The paper tests target changes, adaptation to new simulated rooms and a small real-room robot experiment. The distinctive contribution is the goal-conditioned navigation method; the simulator resource and inherited actor–critic and visual-recognition components retain their own credit.
“Is there an apple in the refrigerator?” cannot always be answered from the first camera image. The agent may need to move, open the door and remember what it saw. Gordon and colleagues introduce an interactive question-answering task and a hierarchical system that divides planning, navigation, detection, manipulation and answering. A spatial memory stores observations at locations rather than forcing a single recurrent state to remember everything. Their IQADATA resource supplies automatically generated existence, counting and spatial-relation questions in simulated kitchens. The contribution combines this task design with the specific memory and controller architecture, without separately counting the underlying AI2-THOR engine.
A new neural-network operation may be easy to write as a formula yet slow to implement efficiently. Tensor Comprehensions provides a compact language for array calculations and a compiler that rearranges their loops, combines operations and specializes code for tensor shapes. An autotuner tries implementation choices and caches useful results. The work connects a high-level mathematical description to CUDA kernels and integrates with PyTorch and Caffe2 through ATen. Its contribution is this language, compiler and tuning pipeline, building on earlier polyhedral compilation, Halide and numerical libraries rather than replacing their authorship.
A prediction problem often begins with several connected tables: customers, purchases and individual items, for example. Useful inputs may include a customer’s purchase count or the average price of their items, rather than just one table column. Kanter and Veeramachaneni describe Deep Feature Synthesis, which composes transformations and aggregations along table relationships. Their Data Science Machine combines these generated features with selection, preprocessing, model fitting and tuning. The result is a reusable way to automate part of feature construction; “deep” refers to composed features, not necessarily a deep neural network.
A standard Transformer applies a sequence of distinct layers. A Universal Transformer instead reuses a transformation across processing steps, allowing its representation to be refined repeatedly. Self-attention lets positions exchange information during that refinement. An adaptive-computation variant can allocate different numbers of steps to different positions. Dehghani and colleagues investigate this combination on language, reasoning and algorithmic tasks. The contribution is the recurrent-depth architecture and its tested variants, rather than the invention of attention, Transformers or adaptive computation themselves.
A simulated character can reach a target while moving in an implausible way. DeepMimic combines a task reward with a reward for matching a reference motion, so the policy learns both what to accomplish and how to move. Random starting points within a motion and early termination of unsuccessful attempts help training reach difficult parts of a skill. The work demonstrates dynamic movements and several ways to combine skills. Its contribution is this practical imitation-and-task learning approach, using existing reinforcement-learning machinery rather than introducing PPO itself.
The same simulated hand can behave differently when friction, object weight or motor delay changes. OpenAI’s Dactyl work trains across deliberately varied simulations so a recurrent control policy can handle more than one idealized set of conditions. A separately trained vision system estimates an object’s pose from three cameras. The researchers deploy the resulting system on a Shadow Dexterous Hand for block and prism reorientation, while documenting drops, mechanical failures and a remaining simulation-to-reality gap. Credit belongs to the original human research and engineering team, its scoped system and the inherited components it uses.
Designing a controller can require evaluating millions of possible movements. MuJoCo makes those repeated physical calculations a central design concern. Todorov, Erez and Tassa combine generalized-coordinate multijoint dynamics, contact-response methods, model compilation and parallel evaluation in an engine aimed at model-based control. The 2012 paper explains both its computational structure and alternative contact formulations. Its contribution is the specific engine and control-oriented approach; prior rigid-body algorithms and later tools built on MuJoCo retain separate credit.
A person can demonstrate a robot-arm movement by moving a smartphone while watching a video stream. RoboTurk connects that familiar input to cloud-hosted robot simulations through low-latency communication. The 2018 platform collects a pilot set of more than 2,200 successful demonstrations and studies whether those examples help reinforcement learning explore sparse-reward tasks. Its contribution is the teleoperation and collection pipeline with its documented learning use, separate from the earlier ideas of imitation learning, WebRTC and PPO.
A reinforcement-learning result is easier to interpret when the task, observations and reward have a consistent definition. The 2018 DeepMind Control Suite supplies a collection of continuous-control tasks, Python interfaces and baseline evaluations built on MuJoCo. It separates physical domains from task objectives and uses a common reward scale for most benchmark tasks. This makes it easier to compare learning curves and inspect failure cases. The contribution here is the original benchmark resource and interface design, not the invention of MuJoCo or the algorithms evaluated with it.
A game-playing agent learns more than a final score when it also practices useful auxiliary tasks. UNREAL adds pixel-change control, reward prediction and replayed value learning to an A3C agent, sharing parts of the visual and recurrent representation. These extra learning signals help the agent use its experience more effectively in the reported Labyrinth and Atari experiments. The contribution is the combined auxiliary-learning architecture and its finite evaluation, building on existing actor–critic, replay and off-policy methods.
A model need not paint every future image to estimate whether a situation is promising. The Predictron learns an internal sequence of abstract states, rewards and discounts, combines predictions at several depths and trains them against return targets. Its internal states need to support useful value predictions rather than reproduce the visible environment exactly. Silver and colleagues test the approach on maze-related predictions and simulated pool. The contribution is this learned value-prediction architecture and its training design.
An observation-based planner tries to predict what it will see after an action. A Value Prediction Network instead learns action-option-dependent changes in an abstract state and predicts rewards, discounts and future values. It can expand several possible options and back up their estimated returns without generating future images. Oh, Singh and Lee combine this lookahead with multistep learning and evaluate it in a collection task and selected Atari games. This adds controlled planning to the abstract-value approach, rather than re-awarding the earlier uncontrolled Predictron.
An agent may master its training game levels yet struggle with a new layout. CoinRun makes this gap measurable by generating many levels and comparing performance on training sets of different sizes with zero-shot test performance. Cobbe and colleagues use the benchmark to study network size, regularization and visual augmentation, and show that substantial overfitting can persist even with many training levels. The contribution is the 2018 evaluation resource and its controlled comparisons; earlier generalization studies and the algorithms being tested retain separate credit.
Imagine that each point of an interval settles toward its own final value, but different points settle at different speeds. Egoroff shows that, for measurable functions converging almost everywhere on a finite interval, one can remove a set with arbitrarily small positive measure and obtain uniform convergence on what remains. Uniform means that one sufficiently late stage works for every retained point. Severini had developed the small-exceptional-set mechanism in a 1910 study of convergent orthogonal-function expansions. Egoroff's 1911 note gives the general measurable-sequence statement. The two original papers form one historical contribution family, with separate author roles.
Fractions approximate irrational numbers, but how often can they meet a chosen accuracy target? Khintchine's 1924 theorem gives a threshold for almost every real number. In the original statement, a positive continuous function f specifies the error bound f(q)/q for denominator q, and x f(x) must decrease. If the improper integral of f diverges, almost every number has infinitely many fractions meeting that bound. If it converges, almost every number has only finitely many. Continued fractions connect the divergent case to earlier estimates of Bernstein. The contribution is this original metric threshold, rather than a claim about every particular irrational.
A continued fraction represents a number through successive positive integer partial quotients. Individual quotients can fluctuate greatly, yet Khintchine proves that their geometric mean approaches the same absolute constant for almost every number. A more general theorem handles nonnegative functions of the quotients with a specified growth bound; applying it to their logarithms gives the geometric-mean result. The proof uses quantitative estimates of how widely separated quotients approach independence. This makes a precise long-run regularity visible inside irregular-looking expansions. The result strengthens the author's earlier boundedness estimate rather than repeating it.
Successive convergents of a continued fraction have denominators q_n. These control both the size of the fractions and their approximation accuracy. Khintchine proves that the nth root of q_n approaches a common absolute constant for almost every number. His argument compares the full denominator ratio with a finite block and controls the truncation error. In a separate paper, Lévy identifies the constant as exp(pi squared divided by 12 log 2). Lévy explicitly credits Khintchine's existence result in a later-added note. This record preserves the existence and evaluation contributions as one result family, rather than inventing a joint paper.
Ordinary polynomials use all whole-number powers. What happens if most powers are unavailable? For increasing positive real exponents p_n, Müntz shows that finite combinations of 1 and x raised to those powers approximate every continuous function on [0,1] exactly when the sum of 1/p_n diverges. Szász later simplifies the proof and extends its scope to complex exponents. When their real parts stay above a fixed positive constant, he obtains an exact corresponding criterion. The contribution identifies a boundary between complete and incomplete approximation systems, building on Weierstrass and Bernstein's question.
A normal number has the expected long-run frequencies of digit blocks; absolute normality requires this in every integer base. Borel had already shown that almost every number has this property. Sierpiński supplies an elementary exceptional-interval argument and specifies one such number using the infimum of a carefully defined complement. Lebesgue's companion article explains a complementary selection method using nested decimal intervals and a controllable bound on the lengths excluded. Their papers bridge a bare existence statement and the specification of an individual example. They are separate works in one historical contribution family.
Weierstrass guarantees that a continuous curve can be approximated by polynomials, but does not give one useful speed for all continuous curves. Jackson adds a regularity condition: the change in the function must be bounded by a constant times the change in its input. For such a Lipschitz function on a compact interval, he constructs polynomials of degree at most n whose largest error is bounded by a constant divided by n. His route first smooths the curve with a fourth-power sinc kernel, then replaces that kernel by a polynomial while tracking error and degree. This supplies a quantitative approximation capability.
A power series may converge inside a circle while its function can still be continued beyond part of that circle. Fabry develops coefficient and sign-change criteria that can rule this out at every boundary point. His 1896 paper includes explicit quantitative sparsity conditions on the nonzero powers, with the finite positive convergence radius normalized to one. One such condition requires successive exponent gaps, divided by the logarithm of the exponent, to grow without bound. These results enlarge the known families of functions whose convergence circle is a natural boundary, building on Hadamard's earlier work.
An average can hide a short burst. What if one looks around every point and chooses the interval with the largest average? Hardy and Littlewood show how to control these maximal averages in one dimension. Their rearrangement comparisons lead to an Lp norm bound p/(p−1) for the one-sided average, when p is greater than one. For their two-direction endpoint-interval maximal function, the corresponding integral bound is twice that factor raised to p. A finite-interval endpoint result also explains why an extra logarithmic integrability condition can control the maximal average when ordinary integrability alone cannot.
A fluctuating signal may look irregular while its average and its pairwise correlation remain stable over time. Khintchine builds a theory for this second-order stationary setting. For a real normalized process with the required mean-square continuity, the correlation is a cosine average over a probability distribution of frequencies. He also constructs a process for any such correlation. The distribution can contain individual frequency atoms as well as continuous parts. Using this representation, he studies long-run averages and the separation of persistent oscillations from a continuous-spectrum remainder. Bochner's earlier Fourier representation is an explicit mathematical input.
A sequence of curves can settle down in average squared error without settling at every point. Fischer proves that, on a finite interval, a sequence that is Cauchy in this mean-square sense has a square-integrable mean-square limit. Riesz shows that every square-summable list of coefficients can be realized against an arbitrary normalized orthogonal sequence; Fischer independently obtains this using completeness. Together these results connect functions with infinite lists of coordinates. If the orthogonal system is complete, the correspondence describes the whole function space, with functions differing only on a set of measure zero treated as the same.
A kernel assigns a number to each pair of positions. For a real continuous symmetric kernel on a finite closed interval, Mercer connects positivity of its integral quadratic form to nonnegative determinants of all finite sampled kernel matrices. He then proves that a positive-type kernel can be expanded into products of normalized eigenfunctions, with absolute and uniform convergence across the entire closed square. In modern notation each product is weighted by an integral-operator eigenvalue. Integrating along the diagonal gives the associated trace sum. This turns positivity into a strong, controlled expansion rather than simply assuming that an expansion converges uniformly.
A derivative measures slope. It is tempting to assume that slopes must change continuously, but this is false. Darboux proves a different constraint: if a finite derivative exists at every point of an interval, it takes every value between any two of its values. The proof subtracts a line with an intermediate slope. The resulting function has an interior extremum, where its derivative vanishes, so the original derivative takes the desired slope. The same paper gives examples showing why this intermediate-value property can survive even when the derivative is discontinuous.
Approximating a complex analytic function is useful only if its important features remain controlled. Hurwitz proves that when holomorphic functions converge uniformly near every interior point to a limit that is not identically zero, their zeros track the zeros of the limit locally. Around an isolated zero of multiplicity r, choose a small boundary containing no limit zero. All sufficiently late approximants then have exactly r zeros inside, counted with multiplicity. The original paper develops this general tool before using it for Bessel functions and explicitly includes polynomial partial sums of a power series.
An infinite matrix can turn one sequence of numbers into another. Schur asks when it turns every bounded input into a convergent output. The answer requires the rows to settle coordinate by coordinate and their absolute tails to become uniformly small. Equivalently, the absolute row sums must approach the absolute sum of the limiting row. If the tails remain uncontrolled, his proof builds a bounded test sequence that makes the outputs oscillate. In modern sequence-space language, this gives the Schur property: a weakly convergent sequence of absolutely summable sequences also converges in its norm.
A bounded sequence of functions need not approach one function, even if none of its terms grows without limit. Banach and Saks show that in Lp(0,1), for a finite exponent p greater than one, one can select a subsequence whose ordinary arithmetic averages do converge in norm. Their argument first uses an earlier compactness result of F. Riesz to obtain a weakly convergent subsequence, then carefully selects later terms to control partial-sum growth after the weak limit is subtracted. A step-function construction transfers the result to the corresponding space of summable numerical sequences.
A language model can keep a long conversation in its prompt, but attending to that growing text becomes costly. Titans explores another route: a small neural memory learns key–value associations while the sequence arrives. Larger prediction errors produce stronger memory updates, while momentum and adaptive decay help balance recent information with older content. Behrouz, Zhong and Mirrokni combine this changing memory with attention in three different architectures. The contribution is the specified test-time memory design and its reported language and long-context experiments, building on fast weights and earlier test-time training.
Two memory systems can read the same text yet preserve different details. MIRAS makes four design choices explicit: the memory architecture, the objective used to learn associations, the rule for retaining old information and the learning algorithm. The researchers use this perspective to construct Moneta, Yaad and Memora, including variants based on robust losses and different regularizers. Their experiments compare language modeling, recall and other tasks. The contribution is this organizing framework and its demonstrated new variants, rather than invention of associative memory or the optimization tools it combines.
Some information should change quickly, while other knowledge should persist. Nested Learning organizes a model and its learning procedures as interacting optimization processes with different contexts and update rates. Its Continuum Memory System uses several memory components on different schedules. Hope combines that system with a self-referential extension of Titans, allowing parts of its memory processing to adapt while data arrive. The contribution here is the specified multi-timescale memory and Hope design with its reported computational demonstrations, beyond the earlier Titans and MIRAS families.
An agent that rereads every past action can waste its attention on details that no longer matter. PlugMem extracts two kinds of reusable knowledge: propositions describing facts and prescriptions describing how to accomplish a goal. These connect back to the experience from which they were derived. A retrieval stage selects relevant knowledge, and a reasoning stage condenses it for the agent’s current task. Yang and colleagues test the same basic module on conversational memory, multi-hop questions and web tasks. The contribution is this knowledge-centered memory pipeline and its scoped evaluation.
A short project summary is easy to search, but may omit the number or exception needed to answer a later question. Xia and colleagues pair a primary abstraction with concrete memory content, then add cue anchors that offer several ways to find the same entry. Their retrieval policy can refine a query, explore connected entries or stop. The work tests whether this combination improves answer quality on conversational-memory benchmarks. Its contribution is the external abstraction-and-cue representation and the specified retrieval methods, distinct from the neural Memora model introduced within MIRAS.
Solving a problem can produce a useful procedure or reveal a mistake worth avoiding. EvoLib stores these as modular skills and reflective insights in an evolving library. A new problem retrieves candidate abstractions, the model attempts a solution, and the system updates which abstractions are sampled. Its weighting mechanism considers both immediate usefulness and whether an item helped produce a useful successor. The researchers test this no-weight-update approach on mathematics, coding and interactive tasks. The contribution is the evolving-library algorithm, with its reported comparisons and ablations.
An agent may repeatedly make the same mistake even when a previous attempt exposed it. ReasoningBank turns self-judged successful and failed trajectories into short strategy records with a title, description and content. Later tasks retrieve relevant records, and new experiences add further lessons. Memory-aware test-time scaling, or MaTTS, compares parallel attempts or uses sequential refinement to obtain richer experience. Ouyang and colleagues test the combined approach on web navigation and software issues. The contribution is the particular strategy-memory and scaling method, not the general idea that failures can teach useful lessons.
A language model has limited room for the text it reads at once. MemGPT treats that room as an actively managed workspace rather than the whole memory. The agent can move information between its working context and external stores, search earlier material, handle capacity warnings and continue through tool calls. Packer and colleagues demonstrate this design on conversations and document tasks. The contribution is the explicit virtual-context management architecture and its tested interactions, inspired by operating-system memory management without claiming to invent external storage or retrieval.
Finding one relevant paragraph is different from asking what themes run through thousands of documents. GraphRAG extracts entities and relationships, groups them into communities and prepares summaries at several levels. A question can then draw on these summaries through a map-and-reduce process that combines partial answers. Edge, Trinh and colleagues demonstrate the approach on large text collections. The contribution is this graph-and-community summarization pipeline for collection-wide questions, separate from earlier retrieval, community-detection and language-model methods.
A long-running assistant may need a few relevant facts rather than an entire conversation history. The 2025 Mem0 paper describes extracting candidate memories, finding related stored items and deciding whether to add, update, delete or ignore each candidate. A graph variant also stores relationships. The researchers report conversational-memory results and query-time costs. The contribution is the specified incremental memory pipeline and its source-bound evaluation, rather than a certification of the current commercial product or ownership of the models it uses.
Useful information is not always found by searching for the exact words used when it was stored. A-Mem turns incoming experiences into notes with keywords, tags, contextual descriptions and embeddings. The system finds related notes, creates links and can revise earlier descriptions as new information arrives. Xu and colleagues test this linked-note design across several language models on conversational-memory tasks. The contribution is the specific agent memory construction and evolution method, inspired by human linked-note practices rather than inventing those practices.
A question may need a precise paragraph or an overview spread across several sections. RAPTOR groups document chunks, summarizes the groups and repeats this process to build a hierarchy. Retrieval can consider text from different levels, rather than relying only on the original chunks. Sarthi and colleagues evaluate the design on several question-answering datasets. The contribution is this recursive clustering-and-summary retrieval method, building on existing embeddings, clustering and language models rather than counting each inherited component as a new discovery.
An assistant might remember one fact yet miss a later correction, confuse dates or answer a question whose premise is false. LongMemEval creates a structured evaluation of these abilities. Its questions require extracting information, reasoning across sessions and time, handling updates and abstaining when evidence is absent. Wu and colleagues combine curated questions with long interaction histories and study memory indexing, retrieval and reading choices. The contribution is the evaluation resource and its scoped design analysis, rather than an achievement by any model tested on it.
A multi-hop question can require facts that are far apart in a collection. HippoRAG extracts a graph from passages, links related entities and uses a personalized PageRank procedure to spread relevance from the query’s entities. It then maps that signal back to passages for the answering model. Gutiérrez and colleagues test the combination on multi-hop question answering. The contribution is the specified graph-based retrieval system and its evaluation; the memory analogy is inspiration for a computing method, not a new biological discovery.
Searching for one entity and asking about a collection-wide relationship require different clues. LightRAG uses a graph of extracted entities and relationships alongside vector retrieval, with lower-level entity keys and higher-level relation keywords. It combines relevant graph information with original text chunks to help generate an answer. Guo and colleagues also describe merging new material into the index. The contribution is this dual-level retrieval and incremental indexing design, separate from GraphRAG and earlier graph and vector methods.
Generating an image in one network pass is attractive, but simply making a GAN wider can destabilize training. GigaGAN combines a bank of filters selected for each example, attention between image regions and words, and training signals at several image scales. A base generator makes a small image, and a separate text-conditioned upsampler adds resolution. Kang and colleagues demonstrate billion-parameter-scale adversarial generation and editable latent representations. The contribution is this specified architecture and its reported experiments, building on GANs, StyleGAN, CLIP and earlier attention and dynamic-filter methods.
A GAN can turn a random seed into an image quickly, but open-ended text adds a much harder conditioning problem. StyleGAN-T revises the synthesis network and discriminator, incorporates pretrained visual and text features, and alternates generator training with adaptation of the text encoder. Per-prompt truncation moves a latent sample toward a typical sample for that prompt, trading variety for alignment. Sauer and colleagues demonstrate the combined design at large scale. The contribution is the specific adversarial image system, rather than invention of its inherited GAN or pretrained representation components.
A large pretrained model can supply useful visual features without being retrained from scratch. GALIP places frozen CLIP representations inside both sides of a text-conditioned GAN. Small trainable components translate text and noise into suitable visual features, while a companion discriminator combines information from several layers. Tao and colleagues test this bridge design on image-generation tasks. The contribution is this integration and its reported experiments; the pretrained model, adversarial learning and earlier conditioning techniques retain their separate credit.
Matching photographs usually starts by finding image correspondences and estimating cameras. DUSt3R instead predicts a three-dimensional point for each pixel in two images, expressing both maps in the first camera’s coordinate frame. A learned confidence signal weights the predictions, and a later alignment procedure combines overlapping pairs. Wang and colleagues show how this representation supports depth, matching and camera estimation. The contribution is the learned pointmap formulation and its multi-view alignment method, building on existing transformer pretraining and supervised geometry data.
Two pixels may look similar yet refer to different objects. MASt3R extends DUSt3R by learning local image descriptors together with three-dimensional geometry. A sampled reciprocal-neighbor search and coarse-to-fine matching procedure then find correspondences efficiently. Leroy, Cabon and Revaud use these matches in localization and reconstruction pipelines. The contribution is the geometry-aware descriptor and matching design with its reported evaluation, distinct from DUSt3R’s earlier pointmap contribution and from inherited contrastive learning and camera solvers.
A moving object violates the assumption that every image shows the same fixed world. MonST3R adapts DUSt3R to predict a pointmap for each time step, using posed videos and depth labels to train its decoder and prediction heads. A later procedure combines these maps with camera smoothness and optical-flow checks over regions estimated to be static. Zhang and colleagues demonstrate dynamic-scene geometry and camera estimation. The contribution is this time-dependent pointmap adaptation and video alignment system, rather than a new award for the inherited DUSt3R model.
A single picture hides most of an object’s back and sides. Splatter Image uses a two-dimensional image network to predict a small colored three-dimensional Gaussian for each input pixel. Their positions, shapes and opacity together form a renderable object representation. A multi-view extension combines predictions using relative camera poses. Szymanowicz, Rupprecht and Vedaldi demonstrate fast object reconstruction and rendering. The contribution is this image-shaped Gaussian prediction design, building on earlier Gaussian rendering rather than inventing that representation.
A model can learn likely three-dimensional structure from many examples, then propose a new object quickly. LRM combines a pretrained image encoder with a camera-conditioned transformer that predicts three feature planes. A small neural renderer reads these planes to produce views or support mesh extraction. Hong and colleagues train this image-to-3D system on a large synthetic-and-real multi-view corpus. The contribution is the scaled reconstruction architecture and its demonstrated object generalization, with separate credit for inherited image features, transformers and neural rendering.
A neural radiance field describes how a scene looks along viewing rays, but fitting one from scratch for every object can be slow. pixelNeRF conditions this description on features extracted from input images. Each three-dimensional query is projected into the input camera, where the network samples nearby image features; features from several posed images can be pooled. Yu, Ye, Tancik and Kanazawa train across scenes to learn useful object priors. The contribution is this image-conditioned radiance-field method, separate from the original NeRF formulation.
Compatible nested binary linear codes produce a quantum code whose bit- and phase-error syndromes can be corrected without measuring the encoded information. The construction corrects arbitrary errors on a bounded number of physical qubits and gives asymptotically positive-rate families for a small fixed correctable error fraction.
Local operations coordinated by classical messages can distill fewer high-quality entangled pairs from many imperfect two-qubit pairs whose singlet fidelity exceeds one half. The work introduces two-way recurrence purification and seeded asymptotic breeding, providing entanglement that can support faithful teleportation across a noisy link.
The work relates one-way entanglement purification to quantum channel coding and shows that free forward classical messages do not increase unassisted quantum capacity. For Bell-diagonal states and their associated generalized depolarizing channels, the reversible state-channel construction identifies one-way distillable entanglement with quantum capacity.
A sufficiently large prepared cluster state supports universal quantum computation through adaptive single-qubit measurements. The construction realizes wires, arbitrary one-qubit rotations and controlled gates, while tracking measurement-dependent Pauli byproducts with classical processing.
Commuting Pauli operators with a consistent joint eigenspace define quantum coding spaces. Their commutation and coset structure supplies error syndromes and an algebraic correction criterion, unifying earlier CSS constructions and enabling additional quantum codes. Gottesman and the separate Calderbank-Rains-Shor-Sloane paper develop complementary formulations.
Every finite-dimensional bipartite separable state has positive partial transpose. The Horodecki positive-map characterization proves that this necessary test is also sufficient for 2x2 and 2x3 systems; in general separability is equivalent to positivity after applying every positive map to one subsystem.
Paweł Horodecki constructed explicit entangled states with positive partial transpose in 3x3 and 2x4 dimensions using a range criterion. The 1998 Horodecki paper proves that distillability requires a negative partial transpose: PPT states remain PPT under tensor powers and local operations with classical communication, hence these entangled states cannot be distilled into singlets.
A probabilistic construction gives finite-dimensional quantum channels E and a complex-conjugate partner with minimum output von Neumann entropy strictly below the sum of the individual minima on their tensor product. Combined with the inherited equivalence of additivity questions, this disproves general Holevo single-letter additivity and shows that entangled block inputs can matter for classical communication.
For every two-qubit density matrix rho, its convex-roof entanglement of formation equals h2((1+sqrt(1-C^2))/2), where C=max(0,lambda1-lambda2-lambda3-lambda4) and the ordered lambda values are the square roots of the eigenvalues of rho times its spin flip. An optimal decomposition exists with at most four pure states.
Two analyses of NICER X-ray pulse profiles for the millisecond pulsar PSR J0030+0451 inferred its mass, radius and emitting-region geometry. Under their selected models, Riley and colleagues reported an equatorial radius of 12.71 +1.14/−1.19 km and mass of 1.34 +0.15/−0.16 solar masses; Miller and colleagues reported 13.02 +1.24/−1.06 km and 1.44 +0.15/−0.14 solar masses. These quoted marginal uncertainties are 68% credible intervals.
Shuman, Barry and DeMille used laser light to cool the sideways motion of a beam of strontium monofluoride molecules. Changing the light detuning and magnetic field produced different Doppler and Sisyphus cooling patterns in the observed fluorescence. Their simulations estimated a transverse temperature of about 5 millikelvin in the Doppler regime and about 300 microkelvin in the Sisyphus regime.
Barry and colleagues confined strontium monofluoride molecules in a three-dimensional magneto-optical trap. Reversing the trapping conditions and observing the response of displaced clouds helped test whether the trap supplied a restoring force. The authors estimated about 400 molecules and reported a 56 ± 4 millisecond lifetime in the stated conditions.
Kozyryev and colleagues used Sisyphus laser cooling to reduce the sideways motion of a beam of strontium monohydroxide, a molecule containing three atoms. They used vibrational repumping and changed the laser detuning to distinguish cooling from heating. The 2016 author preprint gives an estimated final transverse temperature of about 700 microkelvin; the 2017 published article gives about 750 microkelvin.
Vilas and colleagues confined calcium monohydroxide molecules in a radiofrequency magneto-optical trap and measured the response of the cloud after a push. They estimated 20,000 ± 5,000 trapped molecules. After switching off the trapping field, a separate optical-molasses stage cooled the sample to 110 ± 4 microkelvin.
Truppe and colleagues trapped calcium monofluoride molecules, then switched the trap field off and applied three-dimensional optical molasses. Expansion images gave a temperature of 52 ± 2 microkelvin for the stated measurement, below the relevant Doppler limit. The work improved access to colder molecular samples.
Anderegg and colleagues loaded individual calcium monofluoride molecules into five optical tweezers and used fluorescence to identify occupied sites. In the reported setup, the average loading probability was about 34% per trap; the authors obtained 92% detection fidelity under optimized imaging conditions. The team also studied loss associated with collisions.
Anderegg and colleagues showed that laser cooling could remain effective while calcium monofluoride molecules were held by light in an optical dipole trap. Simultaneous cooling increased the number loaded by up to a factor of five, and a heating-and-recooling test brought the trapped sample back to about 60 microkelvin.
Vilas and colleagues trapped and imaged individual calcium monohydroxide molecules in an array of six optical tweezers. They also prepared and coherently controlled internal states associated with a vibrational bending mode, extending single-molecule control to a polyatomic species.
Bertotti, Iess and Tortora analyzed multifrequency radio signals sent to and from the Cassini spacecraft near the Sun. Their 2003 fit reported the post-Newtonian parameter γ = 1 + (2.1 ± 2.3) × 10⁻⁵, consistent with the general-relativistic value within the reported uncertainty.
Frauchiger and Renner proposed a thought experiment in which four agents reason about one another using quantum theory. The authors argue that three stated rules about certainty, consistency and individual outcomes cannot all hold in their protocol. The example has prompted continuing debate about how quantum descriptions apply to observers.
Sheng, Sheng and Ting proposed a spin–lattice model for the phonon Hall effect in a paramagnetic dielectric. They used a model of acoustic phonons and magnetic ions to calculate a sideways thermal response and compared aspects of that response with earlier measurements.
Zhang and colleagues described a model phonon Hall response using the geometry of phonon bands. In their two-dimensional lattice model, band touchings and changes of topological band numbers can occur as an effective field varies.
Qin, Niu and Shi developed formulas for energy magnetization and explained how circulating equilibrium currents affect thermal transport coefficients. In a noninteracting anomalous Hall example, the corrected calculation avoids a low-temperature divergence and recovers the expected relation between electrical and thermal response.
Maarten Schmidt identified broad spectral lines of the radio source 3C 273 as redshifted emission lines, with a common shift of about 0.158. The result made a distant, exceptionally luminous object a compelling interpretation and helped establish quasars as a new class of astronomical object.
The KATRIN collaboration fitted an effective description of additional neutrino interactions to about four million electrons recorded in its second tritium measurement campaign. The analysis found no significant spectral distortion beyond its reference model and reported confidence regions for selected light- and heavier-neutrino interaction parameters. It extended endpoint spectroscopy to interaction searches using an existing experimental dataset.
Angulo and colleagues measured the small phase shift of an off-resonant probe caused by resonant light passing through a cold rubidium cloud. Comparing probe traces with and without a later photon detection isolated the inferred contribution of an extra transmitted photon. For longer, narrower-band pulses, its integrated response had the opposite sign to the average-photon response. The authors interpreted this result as evidence for a negative conditional atomic-excitation time related to anomalous group delay.
Nagata and colleagues used optical-lattice diffraction to probe coherence during association of cesium atoms into molecules. They reconstructed a molecular spatial phase close to twice the imprinted atomic phase, with a small correction from unequal reaction couplings. Molecular momentum populations also yielded a negative parity and a positive entanglement witness within their coherent symmetric-pair model. This extends earlier population-oscillation evidence to phase transfer and reactive pair correlations.
Zhang, Chen and colleagues associated Bose-condensed cesium atoms into weakly bound, rotationally excited Cs2 molecules in a finite two-dimensional trap. Molecular density responses to calibrated potentials agreed with thermal and high-density Bose-gas equations of state. The inferred temperature and phase-space density supported a molecular condensate in the predicted superfluid regime. Suppressed collisional loss allowed local equilibration studies and measurements of dissociation near the resonance. The 2020 preprint preceded the 2021 publication.
Ehlers and Geroch proved a geodesic-limit theorem that permits a small body to carry its own gravitational field. Around a prescribed timelike curve, their hypotheses require arbitrarily localized nonzero bodies satisfying the dominant energy condition, with metrics and connections arbitrarily close to a smooth background. Under those conditions the limiting curve must be a geodesic of that background. The proof also applies to a conserved symmetric matter tensor satisfying the same support and energy conditions.
Two independent experiments reported low-temperature second-order electrical responses in even-layer antiferromagnetic MnBi2Te4 whose signs reverse with prepared antiferromagnetic order. Gao and colleagues engineered black-phosphorus interfaces and supported a predominantly nonlinear Hall response through symmetry, conductivity scaling and frequency-mixing controls. Wang and colleagues measured transverse and longitudinal nonlinear responses in four- and six-layer devices, including current-direction-dependent DC resistance. Their models attribute major contributions to energy-weighted quantum-metric geometry.
Independent teams measured a sizable, hysteretic transverse thermoelectric response in the noncollinear antiferromagnet Mn3Sn near room temperature despite its small net magnetization. Ikhlas and colleagues reported a remanent Nernst signal of about 0.35 microvolt per kelvin at 300 K in one crystal. Li and colleagues additionally measured anomalous thermal Hall transport and found its ratio to electrical Hall transport approximately consistent with the Wiedemann–Franz value over their measured high-temperature magnetic phase. Berry-curvature calculations and transport comparisons supplied an interpretation of the response.
The Mu-MASS collaboration used a low-energy muon beam, carbon-foil muonium production and microwave-induced depletion of metastable atoms to measure the muonium n=2 Lamb shift. Ohayon and colleagues reported 1047.2±2.3(stat)±1.1(syst) MHz. Janka and colleagues then measured the isolated 2S1/2,F=0 to 2P1/2,F=1 transition at 580.6±6.8 MHz, deriving a Lamb shift of 1045.5±6.8 MHz and, together with the earlier transition measurement, a 2S hyperfine splitting of 559.6±7.2 MHz. The later line-shape analysis also identified a contribution from muonium in the n=3 excited state.
The MuSEUM collaboration demonstrated near-zero-field muonium ground-state hyperfine spectroscopy at J-PARC using a pulsed muon beam and detectors designed for high event rates. Kanda and colleagues reported a frequency-scan result of 4463.302±0.004 MHz. Nishimura and colleagues developed an analysis of the time-dependent Rabi signal that jointly fits frequency detuning and microwave-field strength, and applied it to later data to obtain a zero-density hyperfine interval of 4,463,301.61±0.71 kHz, with the quoted uncertainty statistical. Their simulations identified conditions in which concentrating measurements at a suitable detuning could improve statistical precision.
Adkins, Gomprecht, Li and Shinn obtained analytic pure-recoil energy corrections at order (Zα)^6 for Coulombic S states of two spin-1/2 particles, retaining the full dependence on their mass ratio. Their calculation combines nonrelativistic-QED contributions with relativistic matching integrals expressed through harmonic polylogarithms, and gives both spin-averaged and hyperfine corrections. The result connects unequal-mass systems such as muonium to the equal-mass positronium limit and identifies corrections to earlier mass-ratio expansions.
Gurung and colleagues used laser-prepared metastable positronium, microwave transitions and annihilation-time detection to study the n=2 fine structure. Their 2021 analysis reported 18,501.02±0.57(stat)±0.323(syst) MHz for the 2³S₁ → 2³P₀ interval, approximately 4.2 standard deviations above its cited QED prediction under that error budget. The J=1 and J=2 spectra revealed asymmetric lines. A subsequent model by Akopyan and colleagues showed that frequency-dependent microwave reflections could produce shifts of several MHz, including shifts of apparently symmetric lines, exposing a systematic uncertainty beyond the earlier budget.
Sheldon and colleagues observed that the apparent positronium 2³S₁ → 2³P₂ transition frequency changed when a free-space microwave horn was rotated, even when the spectral lines showed little measurable asymmetry. They then measured the interval in a redesigned waveguide apparatus with reduced chamber reflections, reversed microwave directions and a retroreflected excitation laser. Averaging the two directions gave 8627.94±0.30(stat)±0.91(syst) MHz, within 1.3 standard deviations of the cited QED value. These experiments established practical diagnostics for microwave-field distortions while retaining a substantial unresolved direction-dependent systematic error.
Newson, Babij and Cassidy produced a continuous beam containing metastable 2³S₁ positronium through charge-exchange collisions between positrons and xenon. Two position-sensitive detectors measured the beam profiles, and microwave-induced 2³S₁ → 2³P₂ transitions reduced the surviving count rate, identifying the metastable component. With flight-decay and saturation corrections, the authors estimated a metastable fraction of up to about 10% of the positronium beam under their chosen conditions. The measured beam properties and a preliminary single-waveguide spectrum supported its proposed use in separated-field spectroscopy.
Blumer and colleagues measured the muonium 2S₁/₂–2P₃/₂ interval using microwave-induced depletion of a metastable beam and coincidence detection of Lyman-alpha photons. Five muonium scans with different powers, moderator gases and propagation directions gave 9871.0±7.0 MHz. Hydrogen reference measurements and simulated microwave fields supported the line-shape analysis. Combining the result with an earlier Lamb-shift measurement yielded an inferred 2P fine-structure interval of 10918.2±7.4 MHz.
Heiss and colleagues combined pulsed two-photon positronium 1³S₁ → 2³S₁ spectroscopy with excitation of surviving 2S atoms to the 20P Rydberg state and subsequent field ionization. Time-of-flight detection supplied velocity-distribution information for joint fits of spectral profiles and Doppler shifts. Two experimental runs gave a combined interval of 1,233,607,210.5±49.6 MHz, about 40 parts per billion. The second run added an optical frequency comb and a pulse-by-pulse laser-chirp measurement.
The BESIII Collaboration measured proton–antiproton angular correlations in J/psi radiative decays producing Lambda–anti-Lambda pairs. An amplitude analysis separated spin-singlet contributions from backgrounds, and the corrected angular distribution agreed with the singlet-state model. Selected decay geometries supported a Bell-like comparison for massive particles; the authors reported a 5.2-sigma Clauser–Horne-type comparison under their reconstruction and statistical assumptions.
Redekop and colleagues used a nanoscale SQUID sensor to image magnetic fringe fields in twisted MoTe2 devices at 1.6 kelvin. Density-dependent magnetic features appeared near several fractional fillings, while spatial reconstruction mapped magnetization and disorder across the devices. Assuming the Chern number inferred from earlier transport, the reconstructed magnetization change near filling −2/3 implied a local thermodynamic gap of about 7 meV. The work supplied local magnetic evidence complementary to transport and optical studies of fractional Chern insulators.
Ji and colleagues used exciton-resonant microwave impedance microscopy to image a dual-gated twisted MoTe2 device at zero magnetic field. Near fillings −2/3 and −3/5, spatial maps showed a suppressed bulk response surrounded by enhanced edge response, supporting the expected bulk–edge structure of fractional Chern insulators. A light-activated monolayer WS2 top gate enabled microwave access while retaining electrostatic control. Density and displacement-field scans followed the evolution between bulk-insulating, edge-enhanced and metallic regimes.
Two independent experiments probed the predicted topological Anderson regime, where adding disorder can produce topology. Stützer and colleagues observed directional edge propagation emerging in a previously trivial, detuned array of helical optical waveguides. Meier and colleagues engineered disordered hopping between atomic momentum states and measured a mean chiral displacement whose finite-time evolution supported disorder-driven topology. Their complementary platforms showed how controlled disorder can create, as well as destroy, topological responses.
Li, Chu, Jain and Shen predicted a disorder-induced topological regime in numerical models of HgTe quantum wells, including wells whose clean band structure was not inverted. Calculated conductance plateaus and spin-resolved transmission supported conducting helical edges. Groth and colleagues explained how disorder, together with quadratic momentum terms in the effective Hamiltonian, can reverse the topological mass. Their effective-medium calculation accounted for the weak-disorder onset in finite samples and distinguished it from the strong-disorder localization transition.
Hastings extended the Lieb–Schultz–Mattis argument to higher-dimensional local quantum spin systems by combining separated twists with locality estimates. For the specified lattice families with a half-odd-integer spin per transverse column, a unique ground state has an excitation gap bounded by a constant times log(L)/L. Nachtergaele and Sims later gave a detailed rigorous proof with explicit geometric, interaction and symmetry hypotheses. The result restricts the possible low-energy structure of these many-body systems.
Yamanaka, Oshikawa and Affleck used a nonperturbative twist argument to connect filling and translation symmetry to low-energy excitations in one-dimensional interacting electron systems. The construction fixes the momentum of a low-energy state, including a Kondo-chain counting relation that includes localized spins. Tasaki later supplied a self-contained local-twist extension: under the stated density-fluctuation and correlation conditions, local operations construct orthogonal low-energy states, and arbitrarily many such states occur below any fixed positive energy threshold in sufficiently large systems.
Parameswaran, Turner, Arovas and Vishwanath extended filling constraints on insulating states to non-symmorphic crystals, whose symmetries combine point operations with fractional translations. A flux-threading argument shows how a conserved charge can change screw or glide quantum numbers even when the filling per cell is an integer. This rules out a unique symmetry-preserving trivial insulator at selected integer fillings, sharpening the usual fractional-filling obstruction. The paper connects the constraint to band connectivity and gives spin and boson applications.
Watanabe, Po, Vishwanath and Zaletel derived electron-filling constraints for symmetry-preserving, gapped, short-range-entangled insulators while allowing spin-orbit coupling and charge fluctuations. A Schmidt-state argument uses charge conservation and time reversal rather than conserved spin. A second approach places the system on suitable compact flat geometries to strengthen the constraints. Together these methods give necessary filling conditions for all230three-dimensional space groups, with stronger restrictions for non-symmorphic groups.
Koma and Tasaki related long-range order in symmetric finite-volume quantum states to families of low-energy states and symmetry-breaking infinite-volume ground states. They constructed charge-ladder trial states for local lattice Hamiltonians with a continuous symmetry. Under additional algebraic and discrete-symmetry assumptions, their excitation-energy bound scales as M squared divided by the number of sites, where M labels the charge displacement. Suitable linear combinations yield infinite-volume ground states with nonzero order parameters. A separate result establishes ergodic broken-symmetry limits for a discrete-symmetry setting with an isolated low-energy doublet.
Watanabe connected a gap within a fixed conserved-charge sector to the static response of that charge at zero temperature. For local quantum systems with a U(1) symmetry, a subregion charge fluctuation creates a neutral variational excitation. The boundary cost of this excitation forces charge fluctuations per volume to vanish when the neutral gap stays positive. Combining this with a susceptibility bound gives zero charge susceptibility, without translation symmetry or a quasiparticle description. The result clarifies part of the connection between magnetization plateaus and neutral-excitation constraints.
Yamamoto extended the Bloch argument against spontaneous ground-state particle currents using the conserved U(1) vector current and a spatial phase variation. This formulation covers relativistic as well as nonrelativistic settings and clarifies why a homogeneous chiral magnetic transport current cannot be an equilibrium ground-state current in the thermodynamic limit. The paper contrasts this with a maintained chiral imbalance that supports a nonequilibrium current, and with an axial current that can represent spin polarization rather than forbidden vector transport.
Pollmann, Turner, Berg and Oshikawa characterized the Haldane phase through an even degeneracy of its entire entanglement spectrum. Their matrix-product-state analysis relates this degeneracy to how symmetry acts on the Schmidt states. Bond-centered inversion, time reversal or the dihedral group of spin rotations can each protect the nontrivial structure. This identifies the phase even when conventional string order or zero-energy physical edge states are absent. Numerical spin-chain examples and a symmetry-preserving bond-weakening process illustrate the distinction from a trivial phase.
Bravyi, Hastings and Michalakis established a conditional stability result for certain topologically ordered quantum spin systems under sufficiently weak local perturbations. For their class of commuting-projector Hamiltonians, the low-energy spectral band remains separated from higher excitations under the stated conditions.
Maldacena calculated leading three-point correlations of primordial scalar and tensor fluctuations in a single-field inflation model. He related a limit in which one wavelength is much longer than the others to the scale dependence of the two-point spectrum.
Huang, Zhao and colleagues measured angle-sensitive negative longitudinal magnetoresistance in TaAs single crystals, alongside quantum oscillations and Hall transport. They interpreted the narrow aligned-field signal as evidence consistent with a chiral anomaly in a Weyl semimetal.
Drozdov, Eremets and colleagues reported sharp resistance transitions, field dependence, isotope shifts and a magnetic response in compressed sulfur hydride, with a reported magnetic onset near 203 K at about 155 GPa. They interpreted the findings as high-temperature superconductivity and proposed a hydrogen-rich phase as the likely source.
Xiong and colleagues simulated pressure-driven channel flow in wide periodic domains and followed localized disturbances into oblique turbulent bands. Their calculations showed band growth, break-up and splitting; near the lower end of their tested range an isolated seed could grow while interactions could still cause turbulence to decay. At higher Reynolds numbers splitting supported spreading in the finite simulations.
At Jodrell Bank Hanbury Brown and Twiss tested optical intensity interferometry on Sirius, observing a decrease in correlated intensity with projected baseline. A later participant account reproduces four observational signal-to-noise values and reports a best-fit angular diameter of 7.1 ± 0.55 milliarcseconds after a theoretical limb-darkening correction.
The LIGO Scientific Collaboration and Virgo Collaboration reported GW170817, a long gravitational-wave inspiral signal detected by the two LIGO instruments and localized using Virgo data. Its masses and coincident electromagnetic observations support a binary-neutron-star interpretation, opening gravitational and electromagnetic study of the same compact merger.
The LZ collaboration combined 2022 and 2023–24 exposure in a conventional low-energy WIMP search, reporting no excess over expected backgrounds and setting model-dependent interaction limits. A later analysis of the overlapping 2023–24 data extended the recoil window and found one event compatible with a high-energy nuclear recoil; its model scan reported 2.6 sigma global and at most 3.4 sigma local tension with background.
Donev, Hough and Zieve used a vibrating wire to follow a single partially attached vortex in superfluid helium. In their rougher cell, pinning became more frequent as temperature rose; a smoother cell showed much less pinning. Varying the wire motion changed the observed decay, and the authors proposed excitation of Kelvin waves as a mechanism that helps a vortex unpin.
Albers and colleagues compared the free-fall acceleration of simultaneously operated rubidium-87 and potassium-39 matter-wave interferometers. After correcting estimated systematic shifts, they reported an Eötvös ratio of −1.9 × 10⁻⁷ with combined standard uncertainty 3.2 × 10⁻⁷, consistent with equal acceleration within that uncertainty.
In 1983, two collaborations at CERN’s proton–antiproton collider reported evidence for the charged W and neutral Z bosons. UA1 and UA2 separately observed high-energy electrons with missing energy consistent with W decay. Later that year, UA1 reported electron and muon pairs near the expected Z mass and UA2 reported electron-pair events consistent with Z decay. The measurements supplied direct evidence for particles predicted by electroweak theory.
In 1977 Herb and colleagues observed a strong 9.5 GeV enhancement in opposite-sign dimuons from 400 GeV proton–nucleus collisions. In a subsequent analysis with approximately 26,000 dimuon events, Innes and colleagues reported two narrow peaks around 9.4 and 10.0 GeV, while treating a possible third near 10.4 GeV as unestablished.
The Wendelstein 7-X team used pellet-fuelled 2018 stellarator discharges to test whether magnetic-field optimization reduced neoclassical energy transport. A team report describes one high-performance discharge with 4.5 MW heating and about 0.23 s energy confinement. From measured density and temperature profiles and modeled transport, the authors infer that similarly scaled less-optimized configurations would have required more heating to sustain the profiles. In a separate longer discharge, stable detached divertor operation with particle exhaust was maintained for over 26 seconds at 5 MW.
Giauque and MacDougall demonstrated cooling by adiabatically demagnetizing gadolinium sulfate. In their 1933 report, a sample beginning near 1.5 kelvin reached an indicated 0.25 kelvin. The method first magnetizes a material while heat escapes, then reduces the field after thermal isolation; its magnetic susceptibility provides temperature information.
B. N. Brockhouse and A. T. Stewart used neutron spectroscopy on a single crystal of aluminium to probe lattice vibrations. In Brockhouse’s later account, energy-resolved neutron groups measured at different crystal orientations yielded phonon frequency and wave vector through conservation relations. Subsequent measurements and comparison with other laboratories produced dispersion curves along selected symmetry directions and exposed limitations in simple interatomic-force models.
An X-ray observation identified coherent pulsations with a period near 237 milliseconds from the source associated with Geminga. A subsequent EGRET analysis found gamma-ray pulses at the same period, linking the earlier high-energy gamma-ray source to a pulsar. A later NASA account reproduces a pulse-phase profile from the gamma-ray observations and attributes the X-ray and gamma-ray measurements to different teams.
Gaia’s preliminary astrometric binary solution identified a metal-poor giant in an approximately 11.6-year orbit around an unseen massive companion. Gaia radial velocities and ground-based spectroscopy supported the orbital solution. Assuming the visible star’s modeled mass and a single dark companion, the team inferred a companion mass of 32.70±0.82 solar masses and identified a dormant black hole as the simplest explanation.
Gaia DR3 astrometric selection and follow-up radial-velocity spectroscopy identified a Sun-like star with a massive, optically dark companion. The version-1 joint orbital fit estimated a companion mass of 9.78 ± 0.18 solar masses and a period of 185.63 ± 0.05 days, supporting a dormant black-hole interpretation.
Using spectra of 48,640 quasars from BOSS DR9, the analysis measured the three-dimensional correlation of Lyman-alpha forest transmission at mean absorber redshift about 2.3 and identified a peak near the expected baryon acoustic scale. This extended the acoustic-distance method to an intergalactic absorption tracer at high redshift.
Ewen and Purcell observed radio emission from neutral hydrogen in the Milky Way near the 21-centimetre wavelength. Their 1951 report describes a signal concentrated near the Galactic plane, with a measurable frequency shift consistent with relative motion. The result gave radio astronomers a way to study hydrogen beyond regions visible in ordinary light.
Arecibo timing of pulses from the millisecond pulsar PSR B1257+12 revealed periodic deviations consistent with two planetary companions, reported by Wolszczan and Frail in 1992. A later participant report describes an additional lower-amplitude periodicity and a fit to the predicted mutual perturbations of the two larger planets, strengthening the planetary interpretation. A 2003 timing analysis by Konacki and Wolszczan used a longer data span and an interaction model to infer the masses and inclinations of the two larger planets.
The BATSE instrument on the Compton Gamma Ray Observatory detected brief, hard gamma-ray flashes from directions below the local horizon. The participant report describes at least a dozen events, time profiles and locations, with confirmation by another instrument on the same observatory.
A Bayesian reanalysis of the GW170817 gravitational-wave signal constrained the binary tidal deformability and inferred an approximately common neutron-star radius. Under a shared equation-of-state approximation, electromagnetic location and distance, and three mass priors, the authors reported radius posteriors centered near 10.8 km; their appended erratum corrected the comparison of models with and without the common-equation-of-state constraint.
Smith, Zahn and Doré reconstructed a noisy gravitational-lensing potential from WMAP temperature maps and cross-correlated it with radio-source counts from the NVSS survey. They reported a 3.4σ lensing signal including their modeled systematic errors, an early observational detection of CMB lensing.
The Planck Collaboration reconstructed a noisy sky map of the cosmic microwave background lensing potential from the first 15 months of temperature data and estimated its power spectrum. Combining the relevant angular scales, the authors reported a lensing signal above 25σ and an approximately 4% constraint on the fiducial spectrum amplitude; cross-correlations with other tracers were also measured.
Polar magneto-optical Kerr microscopy of exfoliated chromium triiodide revealed hysteresis and remanent out-of-plane magnetization down to a single atomic layer. The authors reported an approximately 45 K monolayer ordering temperature and a distinct suppressed low-field signal in bilayer samples, consistent with antiferromagnetic interlayer alignment.
Kerr microscopy of thin Cr₂Ge₂Te₆ flakes revealed a strong thickness and magnetic-field dependence of the magnetic response. Measurements reached bilayer thickness; six-layer samples showed a small remanent Kerr signal, and the characteristic temperature inferred from bilayer response increased from about 28 K to 44 K as the applied field increased from 0.065 T to 0.3 T.
Following the 1995 discovery of the cool companion Gliese 229B, Matthews and colleagues measured and reassessed its broadband emission from 0.8 to 10.5 micrometres, revising earlier near-infrared photometry affected by scattered light from the primary star. The observed bands imply a luminosity of (4.9 ± 0.6) × 10⁻⁶ solar luminosities.
Schmitt and colleagues studied transport in six encapsulated graphene devices and reported conductance consistent with a one-dimensional Klein–Schwinger electron–hole pair-creation model near current saturation. Across the device series, a fitted linear extrapolation was approximately 0.18 mS, close to the model’s 0.186 mS value.
Eyal, Mi, Talanov and Reppy measured bulk solid helium with double- and triple-mode torsional oscillators, separating a dominant frequency-dependent period shift from a smaller extrapolated frequency-independent contribution in some samples. They considered the latter a possible supersolid signature and proposed further discriminating tests.
CAST used a solar-tracking magnet to search for axion-to-photon conversion. A 2012 helium-buffer run improved limits in selected mass regions near 0.2 and 0.4 eV. Its 2013–2015 vacuum run found no significant excess and reported a 95% upper coupling limit of 0.66 × 10⁻¹⁰ GeV⁻¹ for masses below about 0.02 eV.
Borexino analyzed 3262.74 days of data and obtained a fitted geoneutrino signal of 47.0 terrestrial neutrino units, with approximately 18% total uncertainty under its assumed thorium-to-uranium ratio. Incorporating a model for the local and broader lithosphere, the authors reported a nonzero mantle contribution at 99% confidence.
A 2015 joint analysis of BICEP2/Keck and Planck polarization maps found substantial Galactic dust contribution to the observed B-mode power and set a model-dependent limit r at pivot 0.05 per Mpc below 0.12 at 95% confidence. A later BICEP/Keck analysis adding 2016–2018 data and using WMAP and Planck maps reported r below 0.036 at 95% under its stated foreground and cosmological model.
The SARAS 3 radiometer measured a sky-averaged radio spectrum and compared it with the absorption profile previously reported by EDGES. With the paper’s foreground and calibration model, its fit disfavoured the earlier best-fitting profile at 95.3% confidence; the authors also tested the wider set of profiles allowed by EDGES.
Bowman and colleagues reported a fitted absorption-like feature in EDGES low-band radio observations centred near 78 MHz, with a best-fitting width near 19 MHz and amplitude around 0.5 K. The authors interpreted it as a possible redshifted hydrogen signal from cosmic dawn.
HERA analyzed 94 selected nights of Phase I observations and reported 95% upper limits on the dimensionless 21 cm brightness-temperature fluctuation power of 457 mK² at redshift 7.9 and wave number 0.34 h/Mpc, and 3,496 mK² at redshift 10.4 and 0.36 h/Mpc. The analysis also explored implications for astrophysical heating under specified models.
Jimenez, Verde, Treu and Stern used the upper age envelope of selected SDSS galaxies to estimate the low-redshift expansion rate, finding H₀ = 69 ± 12 km s⁻¹ Mpc⁻¹ in their 2003 analysis. Simon, Verde and Jimenez subsequently combined selected galaxy spectra, including previously analyzed objects and new survey data, to estimate H(z) at nine redshifts and fit a parameterized dark-energy potential; the resulting potential was consistent with a constant within the stated uncertainties.
After four images of supernova Refsdal were observed in 2014 behind galaxy cluster MACS J1149.5+2223, five modeling teams used existing imaging and spectroscopy to construct seven lens models and predicted an additional image. Hubble observations on 11 December 2015 revealed a new source at the predicted location, interpreted as that fifth image. Its early brightness and timing allowed a blind comparison with prior lens-model predictions. A later blinded analysis of the extended light curves reported an SX–S1 delay of 376.0 days with a 16th–84th percentile interval of approximately −5.5 to +5.6 days, using a weighted combination of four fitting methods.
In 2012 Chang and colleagues used nonresonant hard X-ray diffraction on an underdoped YBa₂Cu₃O₆.₆₇ crystal to identify incommensurate lattice-modulation peaks associated with charge order; the peak weakened below the superconducting transition and increased under an applied magnetic field. Separately, Ghiringhelli and colleagues used resonant soft X-ray scattering near the Cu L₃ edge on underdoped Y- and Nd-based 123 cuprates, identifying a quasi-elastic charge-associated peak near 0.31 reciprocal lattice units. Its intensity and correlation length rose on cooling toward the superconducting transition and fell below it, supporting competition between the measured charge correlations and superconductivity.
Herr and colleagues reported pulse formation in a continuously driven magnesium-fluoride optical microresonator. Discrete transmission steps and a low-noise radio-frequency beat accompanied different optical spectra. Frequency-resolved optical gating reconstructed a single pulse of about 200 femtoseconds and resolved multiple pulses in other states. Coupled-mode simulations and an approximate driven nonlinear Schrödinger solution associated these states with temporal cavity solitons. The 2013 revised author version added an independent single-shot pulse-spacing check and described tuning and stability of the soliton states.
Ebbesen and colleagues measured unexpectedly strong, wavelength-dependent transmission through periodic arrays of tiny holes in metal films. Sharp peaks appeared even when the wavelength was far larger than a hole; the patterns changed with the spacing, metal and illumination angle.
Isi and colleagues fit damped black-hole oscillation models to GW150914 data beginning near the waveform peak and reported evidence for a short-lived overtone together with a fundamental mode. A 2022 reanalysis by Cotesta and colleagues found much weaker overtone support and sensitivity to start time and noise. In 2023 Isi and Farr identified timing and analysis-duration problems in that reanalysis; Carullo and colleagues repeated their analysis with changes, reporting improved agreement for some estimates while maintaining that Bayesian evidence remained weak.
Shapiro and colleagues tested the extra round-trip delay of radar signals passing near the Sun using planetary echoes. Their 1968 preliminary analysis combined orbital modeling with Mercury and Venus observations and reported agreement with the general-relativistic delay within the estimated experimental uncertainty. A later 1971 analysis combined further Haystack and Arecibo measurements and fitted a delay scale of about 1.02 relative to the general-relativistic prediction of 1, with an estimated 0.05 uncertainty including systematics.
Yu and colleagues used Lorentz transmission electron microscopy to image magnetic textures in a thin Fe₀.₅Co₀.₅Si film. Under a perpendicular magnetic field, they observed a hexagonal arrangement of swirling in-plane magnetization with roughly 90-nanometre spacing, and tracked its change with field and temperature. A two-dimensional spin-model Monte Carlo calculation supplied a comparison for the observed phase diagram.
Kamihara and colleagues reported superconducting behavior in the layered iron oxypnictide LaOFeP. At low temperatures the electrical resistance fell to the measurement limit and the material became diamagnetic; a fluorine-doped sample had a higher transition temperature.
Ren and colleagues reported superconducting signatures in fluorine-doped samarium iron oxypnictide. Electrical resistivity began its transition at 55.0 kelvin and reached the reported zero-resistance level at 52.6 kelvin; magnetic susceptibility showed an onset of diamagnetic response at 54.6 kelvin. These observations extended the experimentally explored transition-temperature range of the layered iron-arsenide family.
Marois and colleagues used high-contrast near-infrared imaging at Gemini and Keck to resolve three faint companions of HR 8799. Multi-epoch positions supported common motion with the star and apparent orbital motion, while their colors and luminosities, together with a young system age and evolutionary models, supported planetary-mass interpretations. A later five-author report added images and measured motion of a fourth, closer companion, HR 8799 e.
Bond and colleagues analyzed an event independently observed by the OGLE and MOA surveys. Both light curves showed a roughly seven-day deviation from a single-lens profile, including a caustic feature. Their binary-lens fit favored an extreme mass ratio of about 0.0039, supporting a planetary companion to the foreground lens. A later Hubble analysis reported excess blended light and a color-dependent centroid shift consistent with a main-sequence lens star, and combined those data with the microlensing fit to estimate the system properties.
Rayfield and Schoepe introduced a tunneling interpretation of their earlier measured electron escape from liquid helium in 1971, fitting temperature-dependent trapping data to infer bubble-state properties. In a detailed 1973 study they measured temperature and electric-field dependences in helium-3, helium-4 and mixtures. Their semiclassical model described the reported pure-liquid trends while the mixture results remained anomalous.
Clasie and collaborators measured pion electroproduction on deuterium, carbon, aluminium, copper and gold targets over momentum transfers squared of approximately 1.1–4.7 (GeV/c)². Their extracted nuclear transparency and its target-mass dependence varied with momentum transfer, in better agreement with the specific calculations incorporating color transparency than with the displayed conventional calculations.
During its first 2018 solar encounter, Parker Solar Probe measured slow solar wind with rapid, large magnetic-field reversals, velocity enhancements and plasma waves. Bale and colleagues compared the in-situ measurements with coronal field models and extreme-ultraviolet maps, associating the sampled stream with a small equatorial coronal hole. Their measurements reveal a highly structured near-Sun wind and motivate further study of its acceleration and heating.
Knutson and colleagues used the Spitzer Space Telescope to measure an 8-micrometre phase curve of the transiting hot Jupiter HD 189733b over slightly more than half an orbit. They inferred a modest day–night brightness contrast and an eastward offset of the brightest hemisphere, consistent with atmospheric transport of heat. A regularized longitudinal-slice fit gave a coarse brightness map rather than a spatially resolved picture.
Hauser and colleagues analyzed ten COBE DIRBE infrared bands after modeling local foregrounds, reporting isotropic residuals consistent with a cosmic infrared background at 140 and 240 micrometres and upper limits at shorter wavelengths. Fixsen and colleagues used COBE FIRAS spectra and three foreground-separation approaches to estimate the far-infrared background spectrum from 125 to 2000 micrometres, finding consistency with the DIRBE measurements within their stated calibration uncertainties.
The MACHO collaboration monitored approximately 1.8 million Large Magellanic Cloud stars and reported a brightening event whose two-color light curve was broadly consistent with gravitational microlensing. Its fitted amplification and approximately month-long characteristic time illustrated the observational search for compact lensing objects suggested by Paczyński.
The OGLE team reported a candidate microlensing event toward the Galactic bulge after surveying approximately 650,000 stars. The selected star brightened and returned to its previous level; a single-lens model fit its light curve with an estimated Einstein-radius crossing time of 23.8 ± 0.9 days. This was a separate direction and event from contemporaneous Large Magellanic Cloud searches.
Sandilands and colleagues measured a broad Raman continuum and anomalous phonon line shapes in α-RuCl3. In a separate neutron study, Banerjee and colleagues reported magnetic ordering and an excitation spectrum whose broad component persisted above the ordering temperature. Both teams compared their observations with predictions for proximity to a Kitaev spin-liquid regime.
Jones and colleagues used an octave-spanning mode-locked laser spectrum and self-referencing to stabilize the pulse-to-pulse carrier-envelope phase and the optical frequency comb. They checked relative phase control with a time-domain cross-correlator and measured a rubidium optical reference against a microwave clock.
Kalas and colleagues reported a new compact source in 2023 Hubble images of the Fomalhaut debris system and compared it with an earlier source first reported in 2008. They interpreted the new source and the earlier object as light scattered by dust from separate planetesimal collisions. In 2020 Gáspár and Rieke had reanalysed the earlier Fomalhaut b observations, interpreting the source as an expanding collision-generated dust cloud. The original 2008 report measured the earlier compact source in 2004 and 2006 Hubble images and presented it as an exoplanet candidate. In a 2013 analysis of 2010 and 2012 Hubble images, Kalas and colleagues recovered the earlier source and revised the orbital interpretation using four observing epochs.
Biedermann and colleagues built a horizontal, dual-cesium-atom interferometer and reduced differential noise caused by beam steering through air by enclosing the optical path at low pressure. Moving nearby source masses modulated the measured gravity signal; the authors reported a proof-of-concept sensitivity corresponding to a relative statistical precision of 3 × 10⁻⁴ for a gravitational-constant measurement.
Veissier and colleagues used electromagnetically induced transparency in cold cesium atoms to store and retrieve weak light pulses in two opposite orbital-angular-momentum modes. Mode-selective detection showed that the retrieved light retained the input mode labels; the authors also tested an equal-weight spatial-mode input. In a later related experiment, Nicolas and colleagues measured coherence and performed tomography on stored orbital-mode qubits, reporting fidelities above a benchmark that accounts for weak coherent inputs and the measured retrieval efficiency.
Carniani and collaborators used JWST/NIRSpec spectroscopy and NIRCam imaging to examine two early galaxy candidates. Both spectra show strong continuum breaks interpreted as Lyman-alpha breaks, yielding model-fitted redshifts near 14.32 and 13.90 in the first author preprint; the brighter object is spatially extended in the imaging. In a later ALMA follow-up, Schouws and colleagues detected a far-infrared oxygen line from the brighter source and obtained a more precise, consistent redshift.
Qian, Liu, Fu and Li used first-principles electronic-structure and edge-state calculations to predict nontrivial band topology in six distorted 1T′ transition-metal dichalcogenide monolayers. They calculated a field-driven topological phase transition for monolayer MoS₂ and proposed a layered field-effect device exploiting the predicted edge channels.
The Planck Collaboration combined final full-mission cosmic microwave background temperature and polarization power spectra with its lensing reconstruction to constrain parameters of the spatially flat six-parameter base Lambda-CDM model. For the combined Planck TT,TE,EE+lowE+lensing likelihood, the paper gives H0 = 67.36 ± 0.54 km/s/Mpc and matter fraction 0.3153 ± 0.0073, at 68% confidence.
Wahl and colleagues compared numerical interior structure models against Jupiter’s even gravitational moments from Juno’s first two close orbits. In their model families an extended heavy-element-enriched core, mixed with hydrogen and helium, can improve agreement with the measurements; the authors explored how equations of state and envelope composition change the inferred core and gravitational moments.
Sahu and colleagues used Hubble observations of the apparent positional shift of a background star as the nearby white dwarf Stein 2051 B passed in front of it. Fitting the astrometric microlensing model and parallax gave a lens mass of 0.675 ± 0.051 solar masses, providing a comparison point for white-dwarf mass–radius models.
DAMA/LIBRA phase 2 reported an annual modulation of low-energy single-hit events in six annual cycles, with an exposure of 1.13 tonne-years. A phase-fixed 1–6 keV fit gave 0.0105 ± 0.0011 counts per day per kilogram per keV. A later COSINE-100 analysis with an independent sodium-iodide detector reported a phase-fixed 1–6 keV electron-equivalent amplitude of 0.0017 ± 0.0029 over 6.4 years of operation and compared its results with DAMA/LIBRA. Two additional annual cycles extended the phase-2 dataset to eight cycles and 1.53 tonne-years; the independent COSINE comparison used this later DAMA analysis.
Transport measurements in aligned graphene–hexagonal-boron-nitride superlattices revealed oscillations periodic in inverse magnetic field that remained visible at 373 K in fields of a few tesla. Their principal maxima followed one flux quantum per integer number of superlattice cells, with a period largely independent of carrier density. Comparison with misaligned devices, capacitance measurements and magnetic-miniband modelling supported an interpretation through recurring Bloch states rather than thermally resolved Landau gaps.
Lafarge and colleagues used a capacitively coupled single-electron-transistor electrometer to measure charge changes in a small metallic electron box. Varying the gate voltage produced the sawtooth response expected when the island exchanges electrons in discrete units, with thermal rounding that agreed with a charging-energy model above about 100 mK. The experiment resolved charge quantization in an equilibrium solid-state circuit, including an electron-periodic response when its aluminium electrodes were superconducting.
Lafarge, Joyez and colleagues used Coulomb-blockade electrometry to measure how electron-number parity changes the free energy of a small superconducting island. In one device, unequal widths of successive charge steps gave the temperature-dependent cost of an unpaired electron. A later device with a larger superconducting gap relative to its charging energy showed charge steps of two electrons at low temperature and field; increasing either restored intermediate or single-electron steps.
Lafarge and colleagues monitored a metallic island connected to a reservoir through four tunnel junctions. A coupled single-electron-transistor electrometer resolved discrete potential jumps as individual electrons entered or left the island, with charge remaining fixed between resolved events. Gate sweeps produced a hysteretic charge staircase. The measured switching rate greatly exceeded the simple cotunnelling prediction, exposing a limitation relevant to proposed precision charge-transfer devices.
Zhang, Nagata and colleagues observed collective atom–molecule reaction dynamics in an ultracold cesium gas near a narrow Feshbach resonance. After rapid molecule formation and heating, the atomic and molecular populations oscillated for several milliseconds. Higher condensate densities produced faster oscillations. The density scaling and an approximately 20 percent molecular fraction supported a model dominated by coherent three-body recombination. The family was first reported in 2022 and published in 2023.
Geroch and Weatherall introduced a stress-energy tracking condition that connects smooth extended bodies to point-particle limits. A conserved collection satisfying the dominant energy condition and tracking a timelike curve contains a rescaled sequence converging to a point-mass distribution; the curve is therefore geodesic. A charged extension with uniformly bounded charge-to-mass ratio yields a Lorentz-force limit. Applications characterize optical limits of source-free Maxwell fields and distinguish fixed-parameter Klein–Gordon packets from classical limits allowing their mass parameter to vary.
Fitzpatrick and colleagues drove a fabricated72-cavity superconducting microwave chain and observed an abrupt transmission change, hysteresis and stochastic switching between long-lived metastable states. Dwell-time statistics gave switching times up to about 60 ms. In a two-state rate model, the inferred slow decay rate reached roughly 10 Hz, far below intrinsic photon and qubit decay rates. Broadband emission and photon bunching further distinguished the regimes. These finite-device observations provided evidence for an approach to a dissipative phase transition.
Aritome and colleagues combined thermal-muonium production, laser ionization and electrostatic extraction with a radiofrequency quadrupole to accelerate positive muons to 100 keV. Time-of-flight signals appeared with both resonant laser excitation and radiofrequency power, and quadrupole scans measured the transverse beam emittance. The reported horizontal and vertical normalized emittances were about 0.85 and 0.32 pi millimetre milliradian, respectively, more than two orders of magnitude below simulated incoming-beam values.
Latacz and the BASE team implemented a double-Penning-trap procedure that repeatedly thermalizes an antiproton’s modified cyclotron motion and measures its energy, stopping when a cold state is found. They reported preparation below an energy-equivalent temperature of 200 millikelvin in about 500 seconds, with a measured thermalization time constant of 4.7±0.4 seconds. A colder prepared antiproton showed clearly separated spin-transition signals, improving nondestructive spin-state identification.
Bohman and the BASE team sympathetically cooled a single proton by coupling it through a superconducting resonant circuit to laser-cooled beryllium ions in a separate Penning trap about nine centimetres away. Frequency spectra and controlled remote heating demonstrated energy exchange. Measurements of energy-dependent proton frequency shifts then showed a temperature reduction reaching 14.4±0.7 kelvin, relative to an effective circuit-noise temperature near 17 kelvin. The experiment extended sympathetic cooling beyond direct short-range Coulomb coupling.
Meyer and colleagues measured the muonium 1s–2s interval using counterpropagating two-photon laser excitation, photoionization and muon detection. Pulse-by-pulse laser diagnostics, an iodine frequency reference and deuterium control measurements supported the analysis of 99 muonium events. After correcting to the hyperfine centroid, they reported a transition frequency of 2,455,528,941.0±9.8 MHz. Comparisons with bound-state quantum electrodynamics provided conditional determinations of the positive-muon mass and constraints on the muon–electron charge ratio.
De Sousa Borges and colleagues measured the positronium 1³S₁ → 2³S₁ interval with continuous-wave two-photon excitation and photoionization by the same laser. Coincidence detection of the released positron and two annihilation photons suppressed background; 1124 selected events from about 12 days supported a transition frequency of 1,233,607,224.1±6.0 MHz, or 4.9 parts per billion. They also developed an approximate semi-analytical line-shape model and compared its fitted centres with their Monte Carlo model and the measured spectrum.
Kang and colleagues measured local and nonlocal transport in small-angle twisted MoTe₂, finding connection-dependent conductance plateaus consistent with integer and fractional spin-Hall edge transport. At filling 3, the inferred edge contribution was near 3e²/(2h). Follow-up measurements on the same transport device resolved a finite hysteretic Hall response below about 20 mT, despite an almost zero response at larger fields. Magnetic circular dichroism in a nearby region supplied complementary evidence of spontaneous time-reversal symmetry breaking, narrowing interpretations of the fractional state.
The CMS Collaboration extracted a top-quark spin-entanglement witness from opposite-charge dilepton events in 13 TeV proton collisions, using 36.3 inverse femtobarns of 2016 data. In the selected threshold region, a profile-likelihood analysis corrected for detector effects gave D = −0.480 with total uncertainties of +0.026 and −0.029. This crossed the D = −1/3 separability-witness boundary with an author-reported significance of 5.1 sigma under a signal model including a predicted toponium contribution. The measurement supplies a separate detector and parton-level determination alongside the earlier ATLAS result.
The CMS Collaboration measured all 15 top-quark polarization and spin-correlation coefficients in lepton-plus-jets events from 13 TeV proton collisions, using 138 inverse femtobarns of 2016–2018 data. In events with top-pair mass above 800 GeV and absolute scattering-angle cosine below 0.4, the fitted correlation matrix gave an entanglement witness of 2.03 ± 0.15, above the separability boundary of 1 with an author-reported significance of 6.7 sigma. A complementary angular estimator supported the same high-mass result. The measurement extended collider spin-entanglement evidence beyond the production-threshold regime.
Kang and colleagues combined local and nonlocal transport with penetration-capacitance measurements in twisted bilayer WSe2. Near hole fillings 2 and 4, local resistances approached h/(2e²) and h/(4e²), while nonlocal responses and bulk incompressibility supported one and two pairs of helical edge channels. The transport changed much more strongly under in-plane than out-of-plane magnetic fields, consistent with approximate spin-conservation protection of a double quantum spin-Hall phase at filling 4.
Separate experiments by Xia and Han and colleagues and by Guo and colleagues observed superconducting transport in twisted bilayer WSe2. In a 3.65-degree device, Xia and Han and colleagues found zero resistance near half-band filling, a BKT transition near 180 mK and an electric-field-tuned boundary toward a correlated insulator. In a distinct 5.0-degree device, Guo and colleagues found zero resistance, nonlinear current response, a BKT scale near 395 mK and a 50-percent normal-resistance transition near 426 mK. The latter superconducting pocket lay adjacent to anomalous metallic transport interpreted as magnetic reconstruction.
Separate experiments by Park and colleagues and by Fan Xu and colleagues used magnetotransport and magnetic circular dichroism to study the second moiré band of twisted bilayer MoTe2. Both found ferromagnetic responses near three holes per moiré cell and magnetic-field-induced Chern states. Park and colleagues compared twist angles and observed a high-field Chern-number −2 state near filling −2. Fan Xu and colleagues mapped intermediate-angle devices and found an additional resistance upturn near filling −5/2 that was strongly suppressed by perpendicular field.
Ghiotto, Wei, Song and colleagues mapped longitudinal and Hall transport in a 4.2-degree twisted bilayer WSe2 device. They found an enhanced low-field Hall response away from exact half filling, consistent with reconstructed small Fermi pockets. Near one hole per moiré cell, a low-field correlated insulator gave way to metallic transport around 5 T and a second insulating region above about 24 T. Temperature dependence, Hall sign changes and Landau-level trajectories motivated interpretations in terms of antiferromagnetic reconstruction and a high-field Ising excitonic insulator.
Foutty, Kometter and colleagues used a scanning single-electron transistor to map electronic compressibility in small-angle twisted bilayer WSe2. Near a local twist angle of 1.23 degrees, insulating gaps at one and three holes per moiré cell followed magnetic-field trajectories corresponding to Chern number +1, while the even-filling gaps had total Chern number zero. Measurements across regions with different twist angles revealed a narrow topological window, and the probe-induced displacement field switched the one-hole state between topological and trivial responses. The work linked local thermodynamic measurements to tunable multiband topology in a semiconductor moiré system.
Two teams developed complementary experimental routes to quantum work statistics. Batalhão and colleagues mapped a driven carbon nuclear spin’s work characteristic function onto a hydrogen-spin interferometer and reconstructed forward and backward work distributions. An and colleagues measured initial phonon statistics, prepared corresponding number states and inferred driven transitions of a trapped ytterbium ion from sideband signals. The experiments compared reconstructed work statistics with quantum fluctuation relations; the ion study reported Jarzynski estimates consistent with zero dissipated-work bias over three temperatures and three drive durations.
Liao, Rittner and colleagues measured spin-resolved density profiles of an attractively interacting lithium-6 gas confined to an array of narrow tubes. Unlike the paired central region familiar from three-dimensional experiments, their partially polarized core was surrounded by paired or fully polarized wings as the spin imbalance changed. The measured radii mapped a phase-separation diagram and were compared with finite-temperature thermodynamic Bethe-ansatz calculations. The experiment supplied a controlled setting in which theories predict one-dimensional FFLO-like pairing correlations.
Nascimbène, Navon and colleagues used images of trapped lithium atoms to reconstruct local pressure and the equation of state of a strongly interacting Fermi gas. At unitarity, their measurements mapped temperature dependence and the change between normal and superfluid behavior. They then varied the interaction strength across the BEC–BCS crossover, measuring balanced-superfluid thermodynamics and phase boundaries in spin-imbalanced gases. The data quantitatively tested beyond-mean-field corrections and many-body calculations, while identifying where a simple gas of polarons ceased to describe the normal phase.
Ospelkaus, Ni and colleagues showed that quantum statistics and electric dipoles strongly affect collisions in an ultracold gas of potassium–rubidium molecules. Molecules in one internal state had slow, temperature-dependent loss consistent with a p-wave collision barrier; mixing internal states produced much faster loss when s-wave scattering became allowed. In a follow-up study, increasing the induced dipole moment strongly increased molecular loss and produced anisotropic heating, revealing how the long-range interaction controls access to short-range reactive processes.
Two teams demonstrated Raman sideband cooling of individual calcium monofluoride molecules in optical tweezers. Lu and colleagues used low magnetic fields and alternating trap depths to reduce motion along all three axes, with a radial ground-state fraction reaching about 79%. Bao and colleagues used a high-field scheme and resolved sidebands along each axis, inferring a three-dimensional motional ground-state probability of 54±18% for molecules retained in the selected internal-state manifold. Both experiments extended molecular cooling beyond optical molasses.
Gao, Jafferis and Wall described a theoretical model in which an interaction coupling two boundaries of an eternal BTZ black hole changes the quantum stress tensor and makes the corresponding bridge traversable in that model.
Sorce and Wald analyzed thought experiments in which matter carrying charge or angular momentum enters a Kerr–Newman black hole. Their perturbative analysis incorporates second-order effects that can be missed by a first-order test-body treatment.
Aretakis established conserved horizon quantities for linear massless scalar waves on a class of smooth extremal axisymmetric black hole backgrounds and derived horizon non-decay; under additional geometric and decay conditions, higher transverse derivatives become unbounded. The extremal Kerr specialization gives explicit generic growth bounds.
Liu and Suh analyzed entanglement entropy after a homogeneous global quench in a strongly coupled holographic system, identifying early quadratic growth and a later linear growth regime for large regions, followed by shape-dependent saturation. They described the linear regime using a geometrical entanglement-tsunami picture.
Lu and colleagues measured magnetotransport in rhombohedral five-layer graphene aligned with hexagonal boron nitride. In two devices they reported integer and fractional anomalous Hall signatures; selected zero-field Hall-resistance plateaus at fractional fillings on both sides of one half accompanied dips in longitudinal resistance. Field sweeps showed hysteresis, and the density–field slopes were compared with fractional Hall-state expectations. Near half filling, a continuously varying Hall response resembled a composite Fermi liquid.
Chantry, Tuckerman and Barkley simulated large domains of stress-free, sinusoidally forced Waleffe shear flow using four wall-normal modes. Near a fitted transition they found a growing turbulent fraction and gap statistics broadly consistent with directed-percolation scaling. A smaller simulated domain instead displayed long-lived transients and an apparent jump, illustrating how finite size can change the observed transition.
The 1M2H team used the Swope telescope to find a new optical transient in NGC 4993, SSS17a, in an exposure beginning 10.9 hours after the GW170817 trigger. Subsequent photometry showed rapid fading, and its location and timing supported association with the gravitational-wave event. Other teams independently observed the same transient.
Fermi’s Gamma-ray Burst Monitor triggered on GRB 170817A, a weak gamma-ray transient following the GW170817 inspiral by roughly 1.7 seconds. Its time and sky position supported a joint gravitational-wave and electromagnetic association; the GBM team measured the burst duration and spectrum, finding properties more consistent with a short gamma-ray burst in their population model.
W. F. Vinen used a vibrating wire in helium II to investigate quantized circulation. His 1958 original report already described direct evidence for single circulation quanta; the 1961 paper described the apparatus and measurement in more detail. A later experimental account explains how circulation changes the wire’s coupled vibrational modes and discusses selected stable readings near zero and one circulation quantum.
Abel and colleagues searched for a permanent neutron electric dipole moment using ultracold neutrons and magnetic-field monitoring at the Paul Scherrer Institute. Two blinded analysis teams reported a result consistent with zero, dₙ = (0.0 ± 1.1 statistical ± 0.2 systematic) × 10⁻²⁶ e cm, corresponding to an upper limit of 1.8 × 10⁻²⁶ e cm at 90% confidence.
The Super-Kamiokande Collaboration searched its 1996–2018 data for proton decays into a positron or antimuon and a neutral pion. Using 450 kiloton-years of exposure, the collaboration found no significant excess over atmospheric-neutrino backgrounds and reported 90% confidence lower limits on the partial lifetimes of 2.4 × 10³⁴ and 1.6 × 10³⁴ years for the respective channels. A later search of overlapping pure-water data in 2026 targeted different three-body channels containing two neutral pions and likewise found no significant excess; its reported 90% lower limits were 7.2 × 10³³ and 4.5 × 10³³ years for the positron and antimuon channels.
The Borexino Collaboration reported evidence for solar neutrinos associated with the carbon–nitrogen–oxygen fusion cycle, extracting a small signal from electron-recoil spectra and radioactive backgrounds. In its multivariate fit the inferred interaction rate was 7.2⁺³·⁰₋₁·₇ counts per day per 100 tonnes, with a reported profile-likelihood significance of 5.1σ against the no-CNO hypothesis.
Borexino extracted a low-energy solar proton–proton neutrino signal from electron recoils. A later collaboration account reports 144 ± 13 statistical ± 10 systematic interactions per day per 100 tonnes, and a derived pp neutrino flux of (6.6 ± 0.7) × 10¹⁰ cm⁻² s⁻¹.
Using heavy water, the SNO Collaboration separated charged-current, neutral-current and elastic-scattering contributions from solar boron-8 neutrinos. Assuming the standard boron-8 spectrum, it inferred a non-electron active-neutrino flux of 3.41 × 10⁶ cm⁻² s⁻¹, reported as 5.3σ above zero, providing strong evidence for flavor transformation.
Mourik and colleagues measured zero-bias conductance peaks in InSb nanowires coupled to a superconductor. The reported peaks persisted across ranges of magnetic field and gate settings, with dependence on field orientation; the authors interpreted these features as consistent with Majorana bound states.
Shalm and colleagues reported a Bell-inequality violation using polarization-entangled photon pairs, rapid setting choices, spacelike separation and efficient superconducting detectors. For a five-pulse aggregation the source table reports a local-realism p-value of 5.9 × 10⁻⁹, or 2.3 × 10⁻⁷ under its stated excess-predictability model.
Giustina and colleagues reported a violation of a Bell inequality using entangled photons, rapid setting choices and high-efficiency transition-edge detectors in a Vienna experiment. The analysis reported a local-realism p-value no greater than 3.74 × 10⁻³¹ under its stated statistical and predictability assumptions.
B. N. Brockhouse and P. K. Iyengar used neutron spectroscopy to study lattice vibrations in single-crystal germanium. A later participant lecture depicts acoustic and optical phonon branches in two crystal symmetry directions and explains that simple force-constant models did not fully reproduce the measured dispersion.
The JADE collaboration analysed 287 hadronic electron–positron events recorded at centre-of-mass energies of 27.7 and 30 GeV. The data contained an excess of planar events relative to its two-jet fragmentation model. A rest-frame analysis of the broad side of each selected event supported a three-jet structure; comparisons with simulated quark–antiquark–gluon events supported gluon bremsstrahlung as an interpretation.
The LIGO Scientific, Virgo and KAGRA collaborations analysed the post-merger signal of GW250114, detected by the two LIGO instruments in January 2025. Fits to the post-peak waveform favored a second rapidly damped component alongside the dominant ringdown, consistent within uncertainty with a Kerr black hole’s first overtone. A separate analysis of the full inspiral–merger–ringdown waveform constrained additional mode-frequency deviations and found consistency with the modeled general-relativity prediction.
PHENIX measured high-transverse-momentum charged hadrons in gold–gold collisions at 200 GeV per nucleon pair and compared them with neutral-pion and nucleon-collision references. Central gold–gold collisions showed strong suppression, whereas the deuteron–gold control showed no comparable suppression and a modest charged-hadron enhancement. Together the measurements support a dense-medium final-state interpretation.
Chiao and Wu applied the geometric phase of adiabatically transported helicity to photons guided along a curved path. For a closed momentum-space circuit they related the helicity-dependent phase to the enclosed solid angle, and proposed optical-fiber interferometry and polarization rotation as observable manifestations.
Fermi-LAT combined 46 months of gamma-ray observations of 150 selected BL Lac objects at redshifts 0.03–1.6. Their spectra showed an energy- and redshift-dependent suppression consistent with absorption on diffuse extragalactic background light, enabling model-based constraints on the optical–ultraviolet background.
An aluminium-ion optical clock combined quantum-logic readout, a one-second interrogation enabled by a remote cavity-stabilized laser, and an improved trap and vacuum system. The authors report fractional systematic uncertainty of 5.5 × 10⁻¹⁹ and fractional instability of 3.5 × 10⁻¹⁶/√(τ/s), estimated by comparison with a strontium lattice clock.
VLT GRAVITY interferometry and CRIRES+ spectroscopy independently indicated that Gliese 229B is a close binary. A joint orbital fit gave a period of 12.134 ± 0.003 days and component masses of 38.1 ± 1.0 and 34.4 ± 1.5 Jupiter masses in the authors’ frequentist analysis.
Duk Y. Kim and Moses H. W. Chan redesigned a porous-glass torsional oscillator and reported no detectable low-temperature response attributable to nonclassical rotational inertia at a sensitivity of 2 × 10⁻⁵. In a separate bulk-helium study using rigid oscillators they reported a sample- and apparatus-dependent upper limit of 4 × 10⁻⁶ and a comparable period shift in solid helium-3 and helium-4.
KamLAND analyzed low-energy antineutrino candidates to investigate uranium- and thorium-chain radioactivity inside Earth. With an assumed thorium-to-uranium mass ratio of 3.9, its spectral fit gave a 90% confidence interval of 4.5–54.2 geoneutrino events and an Earth-model-dependent upper limit on uranium- and thorium-decay heat.
ADMX searched microwave spectra for conversion of hypothetical Galactic axions and found no statistically significant axion signal. The 2018 report reached benchmark DFSZ sensitivity near 2.66–2.81 microelectronvolts, and the later 2019 preprint reported an extended 2.81–3.31 microelectronvolt search using a Josephson parametric amplifier and alternative cavity configurations.
Hubble monitoring of the field containing supernova Refsdal revealed a brightening point source, LS1, in a background galaxy at redshift 1.49. Its color and light curve were interpreted as a strongly magnified individual star, with the authors estimating a peak magnification of at least about 2,000 under their lens model. The observation illustrates how cluster lensing combined with microlensing can reveal individual stars at cosmological distances.
Hubble imaging revealed an unresolved persistent source named Earendel in the strongly lensed Sunrise Arc. The discovery team interpreted its size and brightness using several lens models as a highly magnified individual star or stellar system. A later JWST NIRSpec study measured the Sunrise Arc emission-line redshift at about 5.926 and found that Earendel’s continuum can also be fit by stellar-population models for a compact star cluster.
Pan-STARRS and GALEX observed the rise and decay of PS1-10jh, a luminous ultraviolet and optical transient near the nucleus of a galaxy at redshift 0.1696. Follow-up spectroscopy showed broad ionized-helium emission without detected Balmer lines. The discovery team interpreted the light curve and line spectrum as a stellar tidal disruption; a later simulation-based analysis showed how a near-solar-composition star could also be consistent with the same observed data under a different emission model.
Segev, Crosignani, Yariv and Fischer described a spatial optical soliton in a photorefractive medium, where diffraction is balanced by a refractive-index pattern induced by interference among the beam’s spatial-frequency components. In their model a suitable beam profile can propagate without changing transverse shape, and the predicted shape is independent of absolute intensity under the stated idealized response.
Feldmann and colleagues studied a biased GaAs/AlGaAs superlattice with time-resolved degenerate four-wave mixing at about 5 K. They observed oscillations in the emitted optical signal whose period changed with the electric field and agreed with the Bloch period inferred from the Wannier–Stark ladder spacing. A two-band calculation with a fitted dephasing time reproduced the signal, supporting their interpretation as coherent Bloch oscillations.
Ben Dahan and colleagues prepared ultracold cesium atoms in the lowest band of a standing-wave optical potential and applied an inertial force by accelerating the lattice. After different evolution times they switched off the potential and measured atomic momentum distributions. The distributions recurred with the predicted Bloch period, while their inferred mean velocities yielded positive and negative band effective masses at different quasimomenta.
In 2007 Lignier and colleagues periodically shook a one-dimensional optical lattice containing a rubidium condensate and inferred suppressed interwell tunneling from its expansion, finding agreement with a Bessel-function dependence over the tested range. In a subsequent 2008 preprint Zenesini and colleagues ramped the drive in a three-dimensional lattice: interference visibility decreased and returned when the drive was removed. Their excitation spectra and comparison with changes in static lattice depth supported a reversible drive-induced superfluid–Mott transition.
Israel and colleagues analysed Rossi X-ray Timing Explorer measurements of the tail of the 27 December 2004 SGR 1806–20 giant flare and reported a quasi-periodic signal near 92.5 Hz, together with lower-frequency candidate peaks. Watts and Strohmayer subsequently analysed RHESSI observations of the same flare and found a corresponding phase-dependent feature near 92.5 Hz, a further feature near 626.5 Hz, and broad lower-frequency features. Both groups discussed neutron-star vibration interpretations.
Lee and colleagues described a curved layered optical hyperlens and imaged closely spaced test features with a conventional far-field microscope. In the reported 365-nanometre illumination experiment, the reconstructed image resolved a line-pair separation down to approximately 125 nanometres. An anisotropic effective-medium model and electromagnetic simulation explained how the structure magnifies fine spatial information before ordinary optical detection.
Cao and colleagues reported narrow spectral peaks emerging above a pump threshold in disordered zinc-oxide polycrystalline films and, in a related report, strongly scattering zinc-oxide powder films. Peak frequencies varied with position and observation angle, and the number of peaks changed with excitation area. The film study included above-threshold spatial emission images; similar behavior was reported for gallium-nitride powder. The authors interpreted the results as laser modes with coherent feedback from recurrent scattering.
Bloch, Hänsch and Esslinger used a weak radio-frequency field to transfer atoms from a magnetically trapped rubidium condensate into an untrapped state, forming a collimated falling atomic beam. They directly imaged continuous output over up to 40 milliseconds and monitored condensate depletion over up to 100 milliseconds. Varying radio frequency also provided spatially selective spectroscopy of the trapped condensate.
Rebolo and colleagues reported a lithium absorption feature in spectra of the Pleiades objects Teide 1 and Calar 3. They combined the spectral feature with luminosity and evolutionary models to support the interpretation that these objects are brown dwarfs.
Halpern and colleagues identified a compact 1.4 GHz radio source coincident with the transient anomalous X-ray pulsar XTE J1810−197 in 2004 VLA observations. In 2006 Camilo and colleagues detected narrow radio pulses at its approximately 5.54-second rotation period with Parkes and Green Bank, showing that a magnetar could also behave as a radio pulsar. The two measurements are distinct stages of the same object’s radio-observation history.
Chen and colleagues used a modified atomic-force microscope to measure an oscillating lateral force between aligned, corrugated gold-coated surfaces. Its phase dependence followed the corrugation period, and the authors compared its magnitude and distance dependence with a finite-conductivity Casimir calculation for their sphere–plate geometry. Their later detailed account reports the calibration, additional electrostatic-force data and a more comprehensive uncertainty analysis.
In 2008 Rousseaux and colleagues reported negative comoving-frequency waves in a driven water channel with varying flow, interpreting mode conversion as a classical analogue of a Hawking process. In a separate water-channel experiment reported in 2010, Weinfurtner and colleagues measured positive- and negative-norm converted components across nine driving frequencies and compared their ratio with a thermal-like exponential law. These related but distinct experiments have different teams and conditions.
In 2000 Madison and colleagues used a rotating laser perturbation of a trapped rubidium Bose-Einstein condensate to observe one to four vortices and study their frequency-dependent appearance and lifetime. In 2001 Abo-Shaeer and colleagues stirred a sodium condensate and imaged ordered triangular arrays with up to about 130 vortices, as well as defects and their evolution. These related observations used different teams, atoms and conditions.
Matthews and colleagues created vortices in either component of a two-state rubidium Bose-Einstein condensate through spatially controlled coherent transitions, following a proposal by Williams and Holland. They used an intercomponent interference measurement to map the relative phase around the vortex and observed different evolution for the two choices of component.
The BABAR and Belle collaborations independently measured time-dependent differences in selected flavor-tagged neutral B and anti-B decays. BABAR reported sin(2β) = 0.59 ± 0.14 statistically ± 0.05 systematically; Belle reported sin(2φ1) = 0.99 ± 0.14 statistically ± 0.06 systematically. The angles β and φ1 use different names for the same standard-model parameter.
Malnou and colleagues demonstrated a squeezed microwave receiver on a synthetic weak signal, reporting a 2.12 ± 0.08 scan-rate enhancement in a setup designed to mimic an axion search. The subsequent HAYSTAC experiment used related methods in a dark-matter search, reporting about a 1.9-fold gain over an optimal unsqueezed comparator and no axion signal in two selected mass windows.
Liodakis and colleagues combined IXPE X-ray polarimetry with optical and radio observations of Markarian 501. Two March 2022 observations yielded X-ray polarization near 10–11%, larger than the host-corrected optical value, and polarization angles approximately aligned with the radio jet. The authors found this pattern consistent with an energy-stratified shock-acceleration scenario.
Taverna and colleagues used IXPE to measure phase-averaged X-ray polarization from magnetar 4U 0142+61. They found about 12 ± 1% across 2–8 keV, with different polarization behavior at lower and higher energies and an approximately 90-degree angle change across the intervening band.
Lunar laser-ranging analyses by Williams, Newhall and Dickey in 1996 and by Williams, Turyshev and Boggs in 2004 constrained differential Earth–Moon acceleration toward the Sun, geodetic precession and other relativistic parameters. The later work used a longer data span and updated model and reported results consistent with the stated relativistic framework within estimated uncertainties.
The OSO-8 team reported X-ray polarization of the Crab in two bands from 1976 quick-look satellite data. A later phase-selected analysis by a partly different author team combined 1976 and 1977 observations and measured approximately 19% polarization at 2.6 and 5.2 keV, supporting a synchrotron interpretation.
Fried and colleagues reported Bose–Einstein condensation in magnetically trapped atomic hydrogen. Two-photon spectroscopy showed a shifted, high-density component as the gas cooled; the team used the spectral shift and a trap model to estimate condensate density and population.
Pereira Dos Santos and colleagues observed a condensate of metastable helium-4 atoms in a magnetic trap using absorption imaging after release. Its bimodal distribution and changing expansion anisotropy supported condensation. They estimated the scattering length and reported roughly two-second condensate decay.
G. I. Taylor photographed diffraction around a needle using increasingly attenuated light. He reported no reduction in the sharpness of the pattern, including for a photograph exposed for about 2,000 hours.
Higbie and colleagues used polarization-sensitive phase-contrast imaging to repeatedly measure a component of the magnetization of trapped spin-1 rubidium-87 gas. They observed spatially resolved Larmor precession and compared the coherence of a condensate with that of a thermal cloud.
Lamporesi and colleagues used two freely falling rubidium samples as a differential atom interferometer while moving tungsten source masses between two configurations. Comparing the observed phase shift with a numerical gravitational-field model yielded an estimate of the Newtonian constant G of 6.667 × 10⁻¹¹ m³ kg⁻¹ s⁻², with separate reported statistical and systematic uncertainties. In a later experiment using the same apparatus lineage, Rosi and colleagues reported G = 6.67191(99) × 10⁻¹¹ m³ kg⁻¹ s⁻² with a combined uncertainty of about 150 parts per million.
McGuirk and colleagues operated two light-pulse atom accelerometers as a gravity gradiometer. They characterized common-mode vibration rejection and measured a tidal acceleration signal, and presented interference fringes and tests of sensitivity to platform motion. A source archive supplies the eleven original figures missing from the generated preprint PDF.
Mair, Vaziri, Weihs and Zeilinger measured coincidences between pairs of photons whose spatial modes carry orbital angular momentum. Measurements in selected modes and superpositions supported entanglement in this spatial degree of freedom, extending the set of optical states available for quantum-information experiments.
Haller and colleagues used confined cesium atoms to move a one-dimensional gas from strong repulsion into an attractive regime. Collective oscillations and loss measurements supported a metastable, highly excited gas state rather than immediate collapse into the clustered ground state.
Astrakharchik and colleagues modeled a strongly correlated, gas-like excited state of one-dimensional bosons with attractive interactions. A variational wavefunction and numerical estimates suggested a hard-rod-like equation of state at low density and predicted changes in collective behavior.
Anglada-Escudé and colleagues combined new HARPS radial-velocity observations with earlier HARPS and UVES measurements and reported a coherent approximately 11.2-day Doppler signal around Proxima Centauri. They interpreted the combined signal as a planetary companion and tested stellar-activity indicators alongside the velocity data. In 2020 a separate ESPRESSO campaign recovered the 11.2-day signal in its own radial velocities and combined it with earlier datasets to refine the model parameters.
Suyu and colleagues combined earlier measured time delays in the four-image lens B1608+656 with Hubble imaging, a new lens-galaxy velocity-dispersion measurement and an environment model. Their Bayesian analysis quantified how the density profile and matter along the line of sight affect a time-delay distance and cosmological inferences.
The JWST Transiting Exoplanet Community Early Release Science Team observed a transit of the hot gas giant WASP-39b and measured a strong approximately 4.3-micrometre absorption feature, attributed to carbon dioxide from its spectral shape. Four reductions of the same observing dataset yielded similar spectra. A separate G395H transit spectrum showed additional absorption near 4.1 micrometres, interpreted as sulfur dioxide by model comparison.
Wu, Fatemi and colleagues measured gated monolayer WTe₂ devices and found an edge-dominated resistance approaching h/(2e²) in short channels, consistent with approximately e²/h conductance per edge. They observed magnetic-field suppression and a Zeeman-like conductance gap and reported edge-dominated behavior up to about 100 K.
Fei, Palomaki and colleagues measured monolayer WTe₂ devices and found edge-dominated conduction as the interior became insulating below roughly 100 K. Nonlocal measurements and grounded pincer contacts separated edge and bulk conduction, while an in-plane magnetic field suppressed the edge response. Bilayer devices offered a comparison. A later microwave impedance microscopy study mapped enhanced conductivity along physical edges and additional internal lines in separate monolayer samples.
On 27 May 2021 Telescope Array recorded an extensive air shower across 23 surface detectors. Its reconstructed primary energy was 244 ± 29 statistical and +51/−76 systematic exaelectronvolts on the fluorescence-calibrated energy scale. The arrival direction and backtracking under selected Galactic magnetic-field models were compared with nearby source distributions.
The LZ Collaboration searched 5.7 tonne-years of liquid-xenon data for low-energy nuclear recoils and found evidence consistent with coherent elastic scattering of solar boron-8 neutrinos. In its no-dark-matter fit the zero-neutrino-signal hypothesis was rejected at a reported 4.5 sigma, with a best-fit 12.3 +7.0/−5.4 neutrino events. The same analysis found no significant excess attributable to light dark matter.
Watson and colleagues reanalyzed VLT X-shooter spectra of the GW170817 kilonova AT2017gfo and interpreted broad evolving features as signatures of singly ionized strontium. They compared thermal line calculations, a simplified expanding-atmosphere profile and radiative-transfer models, supporting neutron-capture element production in this merger event.
The Borexino Collaboration extracted a real-time spectral signal attributed to 0.862 MeV beryllium-7 solar neutrinos from electron recoils in a low-background liquid scintillator. For the first 47.4 live days in 2007 the reported interaction rate was 47 ± 7 statistical ± 12 systematic counts per day per 100 tonnes.
The muCool team demonstrated separate longitudinal and transverse compression stages for positive muons stopped in helium gas. Bao and colleagues used electric fields to concentrate the stopping distribution along a magnetic field. Antognini and colleagues later used a cryogenic density gradient and crossed fields to obtain transverse convergence. Decay-positron time spectra, control conditions and collision simulations supported both demonstrations. The inferred final sizes and compression times were obtained through those models rather than direct complete beam tomography.
Ho and Zhou proposed a way to recover bulk thermodynamic information from the density profiles of trapped atomic gases. Within a local-density description, spatially varying confinement scans the local chemical potential. Their scheme combines pressure reconstruction with comparisons between nearby equilibrated states at matched local chemical potentials to infer entropy and other thermodynamic responses. They also proposed extensions for superfluid density and staggered magnetization, connecting experimentally accessible images to quantities needed to map many-body phase diagrams.
Borde, Guth and Vilenkin derived a kinematic bound on the past length of null and noncomoving timelike geodesics in an expanding spacetime. They express a directional expansion rate as the derivative of a function of the observer’s relative motion through a congruence of freely falling test particles. If the expansion averaged along the relevant past geodesic stays positive, the available affine length or proper time is finite. The argument does not require an energy condition, spatial homogeneity or isotropy, and constrains attempts to make inflation alone a past-complete description.
Arkani-Hamed, Motl, Nicolis and Vafa proposed that gravity is the weakest force in a consistent quantum-gravity theory with a U(1) gauge field. Their weaker electric conjecture requires a suitable charged state whose mass-to-charge ratio is no greater than that of an extremal black hole, with equality in supersymmetric examples. They examined black-hole stability, heterotic compactifications and other string-theory examples, and discussed a magnetic argument for a gauge-dependent effective-theory cutoff. These are conjectural consistency conditions and supporting theoretical evidence, not an observed particle or a general proof.
Shenker and Stanford used a two-sided holographic black hole model to connect a small early perturbation to a blueshifted gravitational shock wave and the loss of leading-order local correlations. In their BTZ calculation the onset time scales logarithmically with black hole entropy for a thermal-sized perturbation.