Pith. Sign in

RECORD

Licence to Bin: Accurate and Scalable Inference for Binary Neutron Stars in Next-Generation Gravitational-Wave Detectors

High Energy Astrophysical Phenomena · Submitted 12 Jun 2026

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim These results demonstrate that reduced-order methods can make next-generation binary neutron-star inference computationally feasible.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2606.14197 (version 2)
Pith IDCAG6Q5I4, Pith's permanent record of this paper and its review
CitationA. Makai Baker, Eric Thrane, Nir Guttman, Paul D. Lasky. "Licence to Bin: Accurate and Scalable Inference for Binary Neutron Stars in Next-Generation Gravitational-Wave Detectors." arXiv:2606.14197 (2026). https://pith.science/paper/CAG6Q5I4
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 7,620 input tokens.

What the abstract itself states, as probabilities: claims first 0.89 · states limitation 0.30 · human participants 0.01 · controlled comparison 0.04 · randomized assignment 0.01 · states quantitative result 0.99 · compares with prior results 0.35 · mentions code or data availability 0.03.

The abstract, sentence by sentence

arXiv listing abstract v2. Results and the main claim are underlined; .

Next-generation gravitational-wave observatories will observe binary neutron-star mergers with much higher signal-to-noise ratios, over much longer durations and across broader frequency bands than current detectors. These long-duration signals present a major computational challenge for Bayesian parameter estimation. Reduced-order quadrature is a promising approach for accelerating inference, but in this regime its standard construction encounters severe memory and accuracy limitations. We present a practical reduced-order quadrature construction for long binary neutron-star signals with time-dependent detector response and full effects of the observatories' free-spectral range. Our approach combines improved adaptive frequency sampling, disk-backed streaming, and subbanded reduced-order quadrature construction, enabling efficient and accurate reduced-order models for signals that were previously intractable. We demonstrate for the first time reduced-order Bayesian inference on an approximately 2 h binary neutron-star signal extending down to 5 Hz and with signal-to-noise ratio 2090. We show the resulting reduced-order quadrature remains sufficiently accurate for practical inference. The full analysis is carried out in about 48 h using 128 CPU cores. We also find that, when time-dependent detector-response effects are included, a single Cosmic Explorer detector can localize such a signal to a 90% credible sky area of approximately $41~\mathrm{deg}^2$, with important implications for multimessenger astronomy and cosmology. These results demonstrate that reduced-order methods can make next-generation binary neutron-star inference computationally feasible.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Next-generation gravitational-wave observatories will observe binary neutron-star mergers with much higher signal-to-noise ratios, over much longer durations and across broader frequency bands than current detectors. background 1.00 0.08 0.02 asserted 0.92
s1 These long-duration signals present a major computational challenge for Bayesian parameter estimation. background 0.96 0.07 0.03 asserted 1.00
s2 Reduced-order quadrature is a promising approach for accelerating inference, but in this regime its standard construction encounters severe memory and accuracy limitations. gap 0.55 0.11 0.03 asserted 0.84
s3 We present a practical reduced-order quadrature construction for long binary neutron-star signals with time-dependent detector response and full effects of the observatories' free-spectral range. contribution 0.94 0.94 0.13 asserted 1.00
s4 Our approach combines improved adaptive frequency sampling, disk-backed streaming, and subbanded reduced-order quadrature construction, enabling efficient and accurate reduced-order models for signals that were previously intractable. method 0.87 0.93 0.16 asserted 1.00
s5 We demonstrate for the first time reduced-order Bayesian inference on an approximately 2 h binary neutron-star signal extending down to 5 Hz and with signal-to-noise ratio 2090. contribution 0.56 0.97 0.15 asserted 1.00
s6 We show the resulting reduced-order quadrature remains sufficiently accurate for practical inference. result 1.00 0.94 0.14 asserted 0.97
s7 The full analysis is carried out in about 48 h using 128 CPU cores. result 0.85 0.95 0.05 asserted 1.00
s8 We also find that, when time-dependent detector-response effects are included, a single Cosmic Explorer detector can localize such a signal to a 90% credible sky area of approximately $41~\mathrm{deg}^2$, with important implications for multimessenger astronomy and cosmology. result 0.89 0.94 0.11 asserted 1.00
s9 These results demonstrate that reduced-order methods can make next-generation binary neutron-star inference computationally feasible. interpretation 0.99 0.76 0.86 asserted 1.00

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from simulation or computation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v2
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Next-generation gravitational-wave observatories will observe binary neutron-star mergers with much higher signal-to-noise ratios, over much longer durations and across broader frequency bands than current detectors. These long-duration signals present a major computational challenge for Bayesian parameter estimation. Reduced-order quadrature is a promising approach for accelerating inference, but in this regime its standard construction encounters severe memory and accuracy limitations. We present a practical reduced-order quadrature construction for long binary neutron-star signals with time-dependent detector response and full effects of the observatories' free-spectral range. Our approach combines improved adaptive frequency sampling, disk-backed streaming, and subbanded reduced-order quadrature construction, enabling efficient and accurate reduced-order models for signals that were previously intractable. We demonstrate for the first time reduced-order Bayesian inference on an approximately 2 h binary neutron-star signal extending down to 5 Hz and with signal-to-noise ratio 2090. We show the resulting reduced-order quadrature remains sufficiently accurate for practical inference. The full analysis is carried out in about 48 h using 128 CPU cores. We also find that, when time-dependent detector-response effects are included, a single Cosmic Explorer detector can localize such a signal to a 90% credible sky area of approximately $41~\mathrm{deg}^2$, with important implications for multimessenger astronomy and cosmology. These results demonstrate that reduced-order methods can make next-generation binary neutron-star inference computationally feasible.

Human review
References
How the literature uses it

1 arXiv paper cite this in 1 sentence

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

What it cites

Cites as background 4 papers

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.