Second Einstein Telescope mock data and science challenge: Low frequency binary neutron star data analysis
Bibliographic record
Abstract
The Einstein Telescope is a conceived third-generation gravitational-wave detector that is envisioned to be an order of magnitude more sensitive than advanced LIGO, Virgo, and Kagra, which would be able to detect gravitational-wave signals from the coalescence of compact objects with waveforms starting as low as 1 Hz. With this level of sensitivity, we expect to detect sources at cosmological distances. In this paper we introduce an improved method for the generation of mock data and analyze it with a new low-latency compact binary search pipeline called gstlal. We present the results from this analysis with a focus on low-frequency analysis of binary neutron stars. Despite compact binary coalescence signals lasting hours in the Einstein Telescope sensitivity band when starting at 5 Hz, we show that we are able to discern various overlapping signals from one another. We also determine the detection efficiency for each of the analysis runs conducted and show a proof of concept method for estimating the number signals as a function of redshift. Finally, we show that our ability to recover the signal parameters has improved by an order of magnitude when compared to the results of the first mock data and science challenge. For binary neutron stars we are able to recover the total mass and chirp mass to within 0.5% and 0.05%, respectively.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.011 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".