GPU-accelerated periodic source identification in large-scale surveys: measuring <i>P</i> and <i>P</i>
Bibliographic record
Abstract
ABSTRACT Many inspiraling and merging stellar remnants emit both gravitational and electromagnetic radiation as they orbit or collide. These gravitational wave events together with their associated electromagnetic counterparts provide insight about the nature of the merger, allowing us to further constrain properties of the binary. With the future launch of the Laser Interferometer Space Antenna (LISA), follow-up observations and models are needed of ultracompact binary (UCB) systems. Current and upcoming long baseline time domain surveys will observe many of these UCBs. We present a new fast periodic object search tool capable of searching for generic periodic signals based on the conditional entropy algorithm. This new implementation allows for a grid search over both the period (P) and the time derivative of the period ($\dot{P}$). To demonstrate the usage of this tool, we use a small, hand-picked subset of a UCB population generated from the population synthesis code cosmic , as well as a custom catalogue for varying periods at fixed intrinsic parameters. We simulate light curves as likely to be observed by future time domain surveys by using an existing eclipsing binary light-curve model accounting for the change in orbital period due to gravitational radiation. We find that a search with $\dot{P}$ values is necessary for detecting binaries at orbital periods less than ∼10 min. We also show it is useful in finding and characterizing binaries with longer periods, but at a higher computational cost. Our code is called gce (GPU-accelerated Conditional Entropy). It is available on Github (https://github.com/mikekatz04/gce).
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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".