{"paper":{"title":"A binary tree approach to template placement for searches for gravitational waves from compact binary mergers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.IM"],"primary_cat":"gr-qc","authors_text":"Aaron Viets, Alex Pace, Becca Ewing, Bryce Cousins, Chad Hanna, Chiwai Chan, Cody Messick, Daichi Tsuna, Debnandini Mukherjee, Divya Singh, Duncan Meacher, Heather Fong, Hiroaki Ohta, James Kennington, Jolien D. E. Creighton, Jonathan Wang, Kipp Cannon, Koh Ueno, Leo Tsukada, Leslie Wade, Madeline Wade, Miguel Fernandez, Patrick Godwin, Prathamesh Joshi, Rachael Huxford, Ron Tapia, Ryan Magee, Sarah Caudill, Shio Sakon, Soichiro Morisaki, Stephen Privitera, Surabhi Sachdev, Takuya Tsutsui","submitted_at":"2022-09-22T20:25:23Z","abstract_excerpt":"We demonstrate a new geometric method for fast template placement for searches for gravitational waves from the inspiral, merger and ringdown of compact binaries. The method is based on a binary tree decomposition of the template bank parameter space into non-overlapping hypercubes. We use a numerical approximation of the signal overlap metric at the center of each hypercube to estimate the number of templates required to cover the hypercube and determine whether to further split the hypercube. As long as the expected number of templates in a given cube is greater than a given threshold, we sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.11298","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.11298/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}