J/A+A/555/A58       New Kepler planetary candidates          (Ofir+, 2013)

An independent planet search in the Kepler dataset. I. One hundred new candidates and revised Kepler objects of interest. Ofir A., Dreizler S. <Astron. Astrophys., 555, A58 (2013)> =2013A&A...555A..58O 2013A&A...555A..58O
ADC_Keywords: Stars, double and multiple ; Planets Keywords: methods: data analysis - binaries: eclipsing - stars: variables: general - planetary systems - occultations - planets and satellites: detection Abstract: We present first results of our efforts to re-analyze the Kepler photometric dataset, searching for planetary transits using an alternative processing pipeline to the one used by the Kepler mission The SARS pipeline was tried and tested extensively by processing all available CoRoT mission data. For this first paper of the series we used this pipeline to search for (additional) planetary transits only in a small subset of stars - the Kepler objects of interest (KOIs), which are already known to include at least one promising planet candidate. File Summary: -------------------------------------------------------------------------------- FileName Lrecl Records Explanations -------------------------------------------------------------------------------- ReadMe 80 . This file table1.dat 118 175 Results of the global fit for each system for both the previously known and new signals table2.dat 37 84 Physical properties of the newly detected planet candidates -------------------------------------------------------------------------------- See also: V/133 : Kepler Input Catalog (Kepler Mission Team, 2009) J/ApJ/728/117 : Kepler planetary candidates. I. (Borucki+, 2011) J/ApJ/736/19 : Kepler planetary candidates. II. (Borucki+, 2011) J/ApJS/197/2 : Transit timing observations from Kepler. I. (Ford+, 2011) Byte-by-byte Description of file: table1.dat -------------------------------------------------------------------------------- Bytes Format Units Label Explanations -------------------------------------------------------------------------------- 1- 3 A3 --- --- [KOI] 5- 11 A7 --- KOI KOI name, KOI NNNN or KOI NNNN.NN 13 A1 --- New [+] + for new 15- 26 F12.6 d Per ? Period (G1) 28- 34 E7.2 d e_Per ? rms uncertainty on Per 37- 44 F8.4 yr Epoch ? Epoch of transit (BJD-2454900) 46- 52 F7.5 yr e_Epoch ? rms uncertainty on Epoch 54- 58 I5 ppm Depth ? Transit depth; in parts per million 60- 66 F7.5 --- r/R* ? Planet radius 68- 74 F7.5 --- e_r/R* ? rms uncertainty on r/R* 76- 82 F7.3 --- d/R* ? Instantaneous scaled distance during transit (G2) 85- 91 F7.3 --- e_d/R* ? rms uncertainty on d/R* 93- 99 F7.4 deg incl ? Inclination angle 102-108 E7.3 deg e_incl ? rms uncertainty on incl 110 I1 --- esinO [0]? esinω value 112-118 A7 --- n_esinO Note on esinO -------------------------------------------------------------------------------- Byte-by-byte Description of file: table2.dat -------------------------------------------------------------------------------- Bytes Format Units Label Explanations -------------------------------------------------------------------------------- 1- 3 A3 --- --- [KOI] 5- 8 I4 --- KOI [179/2597] KOI host star number 10- 21 F12.6 d Per Period (G1) 23- 26 F4.2 Rgeo Rp [0.6/7.8] Planet radius, in R unit 28- 32 F5.3 AU a Planet semi-major axis (G2) 34- 37 I4 K Teq Equilibrium temperature -------------------------------------------------------------------------------- Global notes: Note (G1): Negative period designate the best-fitting period that reproduces the observed transit duration/shape of a non-periodic mono-transit. Note (G2): The d/R* is computed from the final d1/R* for the first signal, times the Keplerian factor (Pi/P1)2/3 - all directly from the MCMC distributions. -------------------------------------------------------------------------------- History: From electronic version of the journal
(End) Patricia Vannier [CDS] 23-Oct-2013
The document above follows the rules of the Standard Description for Astronomical Catalogues; from this documentation it is possible to generate f77 program to load files into arrays or line by line