Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2109.02665

The TESS Mission Target Selection Procedure

Michael Fausnaugh·Ed Morgan·Roland Vanderspek·Joshua Pepper·Christopher J. Burke·Alan M. Levine·Alexander Rudat·Jesus Noel S. Villaseñor·Michael Vezie·Robert F. Goeke·George R. Ricker·David W. Latham·S. Seager·Joshua N. Winn·Jon M. Jenkins·G. A. Bakos·Thomas Barclay·Zachory K. Berta-thompson·Luke G. Bouma·Patricia T. Boyd·C. E. Brasseur·Jennifer Burt·Douglas A. Caldwell·David Charbonneau·J. Christensen-dalsgaard·Mark Clampin·Karen A. Collins·Knicole D. Colón·Nathan De Lee·Edward Dunham·Scott W. Fleming·William Fong·Aylin Garcia Soto·B. Scott Gaudi·Natalia M. Guerrero·Katharine Hesse·Matthew J. Holman·Chelsea X. Huang·Lisa Kaltenegger·Jack J. Lissauer·Scott Mcdermott·Brian Mclean·Ismael Mireles·Susan E. Mullally·Ryan J. Oelkers·Martin Paegert·Andras Pal·Elisa V. Quintana·S. A. Rinehart·David R. Rodriguez·Mark Rose·Dimitar D. Sasselov·Joshua E. Schlieder·Lizhou Sha·Avi Shporer·Jeffrey C. Smith·Keivan G. Stassun·Peter Tenenbaum·Eric B. Ting·Guillermo Torres·Joseph D. Twicken·Andrew Vanderburg·Bill Wohler·Liang Yu
View original source ↗Read source document ↗Export metadata ↓

Abstract

We describe the target selection procedure by which stars are selected for 2-minute and 20-second observations by TESS. We first list the technical requirements of the TESS instrument and ground systems processing that limit the total number of target slots. We then describe algorithms used by the TESS Payload Operation Center (POC) to merge candidate targets requested by the various TESS mission elements (the Target Selection Working Group, TESS Asteroseismic Science Consortium, and Guest Investigator office). Lastly, we summarize the properties of the observed TESS targets over the two-year primary TESS mission. We find that the POC target selection algorithm results in 2.1 to 3.4 times as many observed targets as target slots allocated for each mission element. We also find that the sky distribution of observed targets is different from the sky distributions of candidate targets due to technical constraints that require a relatively even distribution of targets across the TESS fields of view. We caution researchers exploring statistical analyses of TESS planet-host stars that the population of observed targets cannot be characterized by any simple set of criteria applied to the properties of the input Candidate Target Lists.

Explore related subjects

astro-ph.IM

Keep this discovery

BibTeXRIS

Michael Fausnaugh, Ed Morgan, Roland Vanderspek, Joshua Pepper, Christopher J. Burke, Alan M. Levine, Alexander Rudat, Jesus Noel S. Villaseñor, Michael Vezie, Robert F. Goeke, George R. Ricker, David W. Latham, S. Seager, Joshua N. Winn, Jon M. Jenkins, G. A. Bakos, Thomas Barclay, Zachory K. Berta-thompson, Luke G. Bouma, Patricia T. Boyd, C. E. Brasseur, Jennifer Burt, Douglas A. Caldwell, David Charbonneau, J. Christensen-dalsgaard, Mark Clampin, Karen A. Collins, Knicole D. Colón, Nathan De Lee, Edward Dunham, Scott W. Fleming, William Fong, Aylin Garcia Soto, B. Scott Gaudi, Natalia M. Guerrero, Katharine Hesse, Matthew J. Holman, Chelsea X. Huang, Lisa Kaltenegger, Jack J. Lissauer, Scott Mcdermott, Brian Mclean, Ismael Mireles, Susan E. Mullally, Ryan J. Oelkers, Martin Paegert, Andras Pal, Elisa V. Quintana, S. A. Rinehart, David R. Rodriguez, Mark Rose, Dimitar D. Sasselov, Joshua E. Schlieder, Lizhou Sha, Avi Shporer, Jeffrey C. Smith, Keivan G. Stassun, Peter Tenenbaum, Eric B. Ting, Guillermo Torres, Joseph D. Twicken, Andrew Vanderburg, Bill Wohler, Liang Yu. 2021-09-06. The TESS Mission Target Selection Procedure. https://doi.org/10.1088/1538-3873/ac1d3f

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The EDD Radio Astronomy Backend Framework

Modern digital radio astronomy receivers produce increasingly wide-bandwidth, high bit-rate data streams that necessitate the development of flexible, scalable, and maintainable backend processing and recording systems. Historically, such backend instrumentation has been tightly coupled to telescope observing modes, limiting reuse between observatories and science cases. We present the Effelsberg Direct Digitisation (EDD) backend framework, a software-defined architecture for constructing real-time radio astronomy backends on commodity off-the-shelf computing infrastructure. We describe its design, implementation, supported observing modes, and operational deployments. EDD separates a common core framework from plugin-provided observing capabilities. The core provides orchestration, telescope interfaces, pipeline lifecycle management, monitoring, and deployment tooling, while plugins implement processing pipelines for specific observing modes. The framework is designed to support both single-dish and interferometric instruments through site-specific configuration and plugin selection. EDD currently supports spectroscopy and spectropolarimetry, pulsar timing and searching, baseband recording, very long baseline interferometry, correlation, and beamforming. Operational deployments include the Effelsberg 100-m telescope, the SKA-MPI prototype dish, the Thai National Radio Telescope, and the ARGOS interferometric prototype array. By separating common services, observing-mode plugins, and site-specific configuration, it allows backend capabilities to be deployed across heterogeneous telescope environments and provides a community resource for broadband radio astronomy instrumentation.

astro-ph.IM↗
arXiv2026

Bayesian Superiority in On/Off analysis

We present a detailed comparison of Bayesian criteria with three non-informative priors - flat, Jeffreys, and scale-invariant - for testing a signal against an unknown background and compare them with the classical frequentist Li-Ma approach in the On/Off problem. We perform Monte Carlo simulations for various background levels and evaluate the Li-Ma and Bayesian criteria by their Type I error rates. We then simulate a nonzero signal and compare the criteria in terms of Type II error rates. We find that the Bayesian criterion with the Jeffreys prior yields lower Type I and Type II error rates than the Li-Ma criterion. In addition, we show that the Bayesian criteria are more robust than the Li-Ma criterion when the background distribution is overdispersed relative to the Poisson distribution.

astro-ph.IM↗
arXiv2026

An RFSoC-based Backend and Timing System for the Balloon-borne Very Long Baseline Interferometry Experiment

We present the design and performance characterization of the digital backend and precision-timing system for the Balloon-borne Very Long Baseline Interferometry Experiment (BVEX), a pathfinder for high-frequency stratospheric VLBI at 22 GHz. The backend uses one of the four 14-bit analog-to-digital converter inputs on an AMD-Xilinx RFSoC 4x2. Although the converters support sampling rates up to 5 GSPS, the flight configuration digitizes the 2-4 GHz intermediate frequency at 4.096 GSPS. CASPER firmware provides both a high-resolution spectrometer for pointing and receiver verification, and a VLBI acquisition chain with two-bit requantization that records at a rate of about 8.2 Gbps. The timestamped data packets are sent over 100 Gigabit Ethernet (GbE) to a 16 TB NVMe array in a storage computer that draws approximately 70-80 W. The timing chain uses a Rakon oven-controlled crystal oscillator as a timing reference while a time-interval counter measures its drift relative to a GPS reference with approximately 60 ps resolution. This is the first deployment of an RFSoC-based VLBI backend and precision-timing system on a stratospheric balloon. Ground tests validated the backend, spectrometer, and timing chain. The August 2025 CSA STRATOS flight ended before reaching the target float altitude because of a balloon failure, and as a result no science observations were obtained. For the planned 2027 reflight, we are developing a conduction-cooled data storage computer with 24 TB of NVMe capacity and a direct data path from the 100 GbE interface to the NVMe array.

astro-ph.IM↗