Pith. Sign in

REVIEW

Search templates for gravitational waves from inspiraling binaries: Choice of template spacing

General Relativity and Quantum Cosmology · Submitted 10 Nov 1995 · 27 references

Pith's verdict: A clean geometric reformulation of template placement that still holds up; the weak link is the match-to-event-rate conversion, which the author flags and hands to an unpublished companion paper.

T0 · AI review

How this review was made: An AI referee (selfhosted/deepseek-v4.1-flash) read the paper on October 29, 2026 and answered a fixed list of questions about it. T0 is the starting level every paper gets. The levels describe how deeply Pith has checked the paper, never the authors.

  1. T0 AI review An AI read the paper and answered a fixed list of questions.
  2. T1 Audit Automatic checks that the references and files the paper relies on exist and match.
  3. T2 Compute The paper's code or calculations re-run with the same results.
  4. T3 Formal statement The claims written out in a formal math language a computer can read.
  5. T4 Proof Those claims proved, and the proof checked by computer.

How Pith checks papers →

· 2 major objections · 5 minor · Ask about this paper · The compiled record · Read the full review →
Challenge this review Comment (0) Read on arXiv ↗
Cite ▾
arXiv IDgr-qc/9511032 (version 1)
Pith ID4RCBARZY, Pith's permanent record of this paper and its review
CitationBenjamin J. Owen (Caltech). "Search templates for gravitational waves from inspiraling binaries: Choice of template spacing." arXiv:gr-qc/9511032 (1995). https://pith.science/paper/4RCBARZY
Cite this reviewBibTeX for Pith's review of this paper
Claim paper

Why Pith says this

Highlight any text to comment on it.

Referee report
The paper

The paper claims

A metric on the space of binary inspiral waveforms yields the number of search templates and the computing power needed for LIGO's matched-filter search, as a function of acceptable event-rate loss.

The reading

LIGO looks for the chirp of two compact stars spiraling together by cross-correlating its noisy data with theoretical waveform templates. The templates form a continuous two-parameter family (the two masses), but only a finite discrete grid can be computed. Too coarse a grid misses signals; too fine a grid costs too much computing. This paper turns that trade-off into geometry. It defines a distance between two nearby templates from how much their overlap (the match) drops when their parameters differ, giving a metric on the mass parameter space. The worst case is a signal sitting exactly between grid points, and the minimal match is the overlap retained there. From the metric one reads off the grid spacing, the number of templates, and the computing power, all as functions of the fractional event-rate loss L. For a post-1-Newtonian two-parameter template family, the author finds roughly 2.4e5 templates and about 20 Gflops for the first LIGO interferometers, and roughly 7.6e6 templates and about 270 Gflops for advanced LIGO, at 10 percent event loss and a minimum mass of 0.2 solar masses. The numbers scale steeply with the minimum mass, as Mmin to the minus 2.7, so the choice of 0.2 rather than 1.0 solar masses is what drives the count up relative to earlier estimates. The author argues the cost is feasible for LIGO-era computers but that a hierarchical search, coarse pass then fine pass, may still be worth pursuing.
Extended reading notes

Core claim

The number of templates and the computing power for a single-pass matched-filter search follow from a metric on template parameter space: N ~ 2.4e5 (L/0.1)^-1 (Mmin/0.2 Msun)^-2.7 and P ~ 20 Gflops for the first LIGO interferometers, and N ~ 7.6e6 and P ~ 270 Gflops for advanced LIGO (Eqs. 3.12, 3.13, 3.23, 3.24). If correct, the most demanding reasonable search is within reach of LIGO-era computers, and the template spacing is fixed by the acceptable fractional event loss L.

Load-bearing premise

The bridge from minimal match to fractional event loss is Eq. (2.21), event rate proportional to (MM/rho0)^3, which treats a reduced match as equivalent to raising the threshold by 1/MM. This ignores that the detection statistic is the maximum over N templates, so the false-alarm threshold itself shifts with N and with the covariance of the templates. The author acknowledges this in Sec. II.B ('In real life, rho0 is affected by the total number of discrete templates...') but justifies it only qualitatively ('these effects are fairly small at high signal-to-noise ratios') without a quantitative bound. Since the whole point of the paper is to choose spacing as a function of L, this unquantified step is load-bearing.

Original abstract

It has long been known that the search for gravitational waves from inspiraling binaries must be aided by signal processing methods, and that the technique of matched filtering is the most likely to be used for the detection of inspiral ``chirps''. This means that the output of an interferometer must be cross- correlated with many waveform templates to dig out faint signals buried in the noise. The templates are characterized by several parameters which vary continuously over some finite range; but because the amount of computing power available to perform the cross-correlations of the search templates with the output is finite, the actual templates used must be picked with certain discrete values of these parameters, which will have some finite spacing. If the spacing is too small, the number of templates (and therefore the computing power) needed to perform an on-line search becomes prohibitive; if the spacing is too large, many chirps will not be detected because the values of their parameters lie too far from those of the nearest template. In this paper I use differential geometry to extend the earlier formalism of Sathyaprakash and Dhurandhar to estimate the template spacing, number of templates, and computing power required for a single-pass, on-line search of the output of a single interferometer in terms of the fraction of events lost to parameter discretization. My formalism obtains these results with little numerical computation, and is valid for arbitrary noise spectra and template parameterizations. I find that the computing power needed for the most computationally intensive, reasonable search is of order several hundred Gigaflops. This will be feasible by the time LIGO is operational, but it is worth pursuing methods of reducing this number.

The compiled record

The paper's own sentences, arranged, kept beside the review and separate from it. 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.

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 6,532 input tokens, $0.0003 reported.

What the abstract itself states, as probabilities: claims first 0.05 · states limitation 0.67 · human participants 0.02 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.96 · compares with prior results 0.37 · mentions code or data availability 0.02.

The abstract, sentence by sentence

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

It has long been known that the search for gravitational waves from inspiraling binaries must be aided by signal processing methods, and that the technique of matched filtering is the most likely to be used for the detection of inspiral ``chirps''. This means that the output of an interferometer must be cross- correlated with many waveform templates to dig out faint signals buried in the noise. The templates are characterized by several parameters which vary continuously over some finite range; but because the amount of computing power available to perform the cross-correlations of the search templates with the output is finite, the actual templates used must be picked with certain discrete values of these parameters, which will have some finite spacing. If the spacing is too small, the number of templates (and therefore the computing power) needed to perform an on-line search becomes prohibitive; if the spacing is too large, many chirps will not be detected because the values of their parameters lie too far from those of the nearest template. In this paper I use differential geometry to extend the earlier formalism of Sathyaprakash and Dhurandhar to estimate the template spacing, number of templates, and computing power required for a single-pass, on-line search of the output of a single interferometer in terms of the fraction of events lost to parameter discretization. My formalism obtains these results with little numerical computation, and is valid for arbitrary noise spectra and template parameterizations. I find that the computing power needed for the most computationally intensive, reasonable search is of order several hundred Gigaflops. This will be feasible by the time LIGO is operational, but it is worth pursuing methods of reducing this number.

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 It has long been known that the search for gravitational waves from inspiraling binaries must be aided by signal processing methods, and that the technique of matched filtering is the most likely to be used for the detection of inspiral ``chirps''. background 1.00 0.03 0.02 hedged possibility 0.54
s1 This means that the output of an interferometer must be cross- correlated with many waveform templates to dig out faint signals buried in the noise. background 0.94 0.05 0.02 asserted 0.99
s2 The templates are characterized by several parameters which vary continuously over some finite range; but because the amount of computing power available to perform the cross-correlations of the search templates with the output is finite, the actual templates used must be picked with certain discrete values of these parameters, which will have some finite spacing. background 0.99 0.06 0.03 asserted 1.00
s3 If the spacing is too small, the number of templates (and therefore the computing power) needed to perform an on-line search becomes prohibitive; if the spacing is too large, many chirps will not be detected because the values of their parameters lie too far from those of the nearest template. background 0.99 0.06 0.04 asserted 0.95
s4 In this paper I use differential geometry to extend the earlier formalism of Sathyaprakash and Dhurandhar to estimate the template spacing, number of templates, and computing power required for a single-pass, on-line search of the output of a single interferometer in terms of the fraction of events lost to parameter discretization. contribution 0.79 0.95 0.11 asserted 1.00
s5 My formalism obtains these results with little numerical computation, and is valid for arbitrary noise spectra and template parameterizations. method 0.69 0.90 0.07 asserted 1.00
s6 I find that the computing power needed for the most computationally intensive, reasonable search is of order several hundred Gigaflops. result 1.00 0.96 0.40 asserted 1.00
s7 This will be feasible by the time LIGO is operational, but it is worth pursuing methods of reducing this number. future work 0.69 0.34 0.16 asserted 0.51

What kind of paper the classifier reports this is: theoretical result 0.80 · evidence from proof or derivation 0.99.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
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

Figures
Figure 1. FIG. 1. A schematic depiction of the manifold formed by the co
Figure 2. FIG. 2. The two-dimensional region of parameter space inhab
Figure 3. FIG. 3. Locations of various discrete templates for the first

Figures reproduced from arXiv:gr-qc/9511032 by the authors.

References
How later papers used it

140 later papers cite it

Evidence: substantial. 133 of the citing papers share no author with it, and 41 of those carry a confident label from Pith's citation classifier.

Pith read 18 of the 236 citing sentences, choosing only those whose citation markers point at this paper alone, and wrote the paraphrases from them. The summary, the counts, the evidence level, the links and the quotes come from code; the summary counts the papers listed below. A later paper is listed under a label when Pith's citation classifier gives one of its sentences that label at probability 0.8 or more (0.95 for support), Pith's reading finds that the citing paper itself did it, and a second check confirms the paraphrase against the sentence. This section lists uses only. It does not list criticism or disagreement, so their absence here says nothing about how the paper has been received. Papers that share an author with this one are listed apart, under "By the same authors". A quote is the citing authors' own sentence, shown when their paper's licence is CC BY, CC BY-SA or CC0. JSON

Builds on it 1 of 2 papers with this label · 1 by the same authors

By the same authors

Uses its method or tool 8 of 39 papers with this label · 1 by the same authors

By the same authors

How the literature uses it

98 arXiv papers cite this in 169 sentences

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

Papers citing it · 88 sentences without a confident label

Contests it 1 paper
Builds on it 2 papers
Uses its method or tool 30 papers
Uses its data or values 1 paper
Compares with it 2 papers
Cites it as support 1 paper
Cites it as background 29 papers

Discussion

Disagree with the review, or know something it missed? Leave a comment, highlight any passage above to comment on it, or challenge this review formally.