WorksPhysics and Astronomy
Gamma-Ray Pulsar Discovery Using a Lattice-Based Method
Abstract
Pulsars are difficult to discover via -ray pulsations because typically only one photon is observed per rotations. We report the first -ray pulsar discovered with an extension of a recently proposed algorithm, which uses efficient tools for identifying short vectors in high-dimensional lattices instead of exhaustively searching for periodic signals. PSR J16227204, an isolated pulsar spinning at 261 Hz, was found in 15 years of Fermi-LAT data using about ten CPU hours. In contrast, the previous state-of-the-art (a semicoherent search) failed after CPU years. This new approach may enable the discovery of many new -ray pulsars, including in binary systems, a previously intractable problem without detailed prior knowledge of the orbital parameters.
Introduction
The Fermi Large Area Telescope (LAT) [1] records -ray photon arrival times with microsecond precision. Pulsations have been detected from more than 300 pulsars—rapidly rotating, highly magnetized neutron stars [2]—including the fastest Galactic pulsar [3], the most compact Galactic pulsar binary [4], and the heaviest known neutron stars [5], which constrain the nuclear equation of state [6]. Millisecond pulsars can also form a -ray pulsar timing array that probes the gravitational-wave background without radio-specific systematic uncertainties [7].
Yet, among the thousands of sources in the fourth Fermi-LAT source catalog (4FGL) [8], hundreds with pulsar-like spectra and properties remain unidentified after both radio and -ray pulsation searches. Searching these for -ray pulsations is computationally challenging. With an effective collecting area of , the LAT detects fewer than photons from a faint pulsar over its 18-year mission, during which the pulsar rotates to times. If the detector had times the collecting area, or the source were times closer to us, then most rotations would yield at least one photon, making the rotation period easy to measure. Instead, we observe only a tiny, random subset of photons, contaminated by background. This makes the problem very difficult.
There are additional complications. As the pulsar radiates energy and angular momentum, its rotation slows. Furthermore, the pulse arrival times are modified by the LAT’s motion around the Solar System. Accounting for these effects in a brute-force search requires an intractable number () of trials [9].
Existing methods [9, 10] trade sensitivity for a -order-of-magnitude reduction in search points, yet still require substantial computing resources, such as those of the Einstein@Home volunteer distributed computing project. Nevertheless, this approach has enabled the discovery of more than eighty pulsars [2, 11, 12, 13, 14, 15, 16].
Recently, Gazith, Pearlman, and Zackay proposed a new method [17], which in practice reduces the computational cost of a search by a further 5 to 6 orders of magnitude. This is achieved by transforming it into a classic geometry problem: finding the shortest nonzero vector in a lattice. A lattice is a regularly spaced grid of points: all integer linear combinations of a set of linearly independent vectors.
Here, we report an extension of this algorithm and its first success. We hunted for pulsations from the unassociated source 4FGL J1622.2−7202 [8], whose spectral and other properties have long suggested it may host a pulsar. We found a new isolated millisecond pulsar J1622−7204 in of our trial runs, each taking under 5 min on one CPU core. This is by far the least computationally expensive successful blind -ray pulsar search to date. Previous Einstein@Home searches (using the setup of [16]) and TRAPUM radio searches [18, 19] both failed to detect pulsations from PSR J1622−7204.
**Method—**We use an improved version of the lattice-based pulsar search presented in [17]. First, we describe
Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article’s title, journal citation, and DOI. Open access publication funded by the Max Planck Society. how the pulsar search is turned into a lattice problem and discuss our modifications.
*Input data—*The inputs for the lattice algorithm are the photon arrival times (PATs) at the satellite of photons detected by the Fermi-LAT (with in our search) from a small sky region around a target source, in this case 4FGL J1622.2−7202. The ordered PATs are denoted by . We also need the photon weights for , which are the (prior) probability that the th photon was emitted by the source, rather than the background [20]. The are derived from the photon energies and directions, using a spectral-spatial model of the time-averaged -ray sky.
The PATs are affected by factors both related and unrelated to the pulsar’s motion. The largest arise from the LAT’s motion around Earth, and the Earth’s motion around the Sun. Over a year, these perturb the satellite-to-pulsar distance, creating annual PAT variations of up to s (Sun-to-Earth light travel time). To account for these, we compute the times at which photons would arrive at the Solar System barycenter (SSB) if emitted from the pulsar simultaneously with the observed ones. [Barycentric dynamical time (TDB) is defined in the International Celestial Reference System (ICRS) frame, a standard inertial coordinate system with origin at the SSB, and runs at the same average rate as Global Positioning System time at the Earth geoid].
*Pulsar rotation phase model—*The relationship between the PATs and depends upon the (unknown) direction to the pulsar, given by its right ascension and declination in the ICRS frame:
The nominal direction , in Table I is a source localization estimate using 14 years of 4FGL data [21]. The arrival times at the SSB are
where we linearize in the sky offsets , . For each PAT, we compute and its partial derivatives using PINT [22, 23, 24], which uses the location of the LAT within the Solar System [25]. We set at the reference epoch, modified Julian date (MJD) 57662.23910470847.
We assume that the pulsar is isolated, moving at constant velocity with respect to the SSB, and slowly radiating rotational energy and angular momentum. Its rotation phase is described by a quadratic spin-down
increasing by one for every full rotation. At time zero, is the initial phase, is the pulsar spin frequency, and (typically ) is the spin-down rate. Last, we assume that photons are emitted in pulses centered about the integer values of .
*Pulsar search problem—*Our model implies that PATs lie close to times for which is integer. From those PATs, we want to find the 5-vector
containing the correct values of the three phase-model parameters and the two (scaled) sky direction offsets. As explained above, this is difficult because we do not know the number of rotations associated with the th photon. With some caveats described later, the search problem is solved by minimizing the (squared) residual phases . If is the closest integer to , then . Once the integer vector is known, it is easy to find . Note that in practice the PATs are widely separated, so physical solutions must have increasing , meaning increasing rotation counts .
We express the search problem in linear form
where the full-rank matrix
is computed at the start of the search, and the row vector contains the unknowns. (Notation: concatenates the columns of before the 5 columns of .) Here, is the identity matrix, is the matrix
is a zero matrix of appropriate shape [in (6), ], and is the diagonal matrix
The subscripted ’s in Table I are the widths of zero-mean Gaussian priors on the search parameters in (4); rotations is the assumed Gaussian pulse width. The priors define a sky patch slightly larger than the 4FGL 95% confidence radius for at 300 Hz.
| Search parameters. | ||
| PATs used for lattice | 80 | |
| Nominal right ascension (RA) | 16^{\mathrm h}22^{\mathrm m}12\fs72 | |
| Nominal declination (DEC) | -72^\circ03'57\farcs6 | |
| Assumed pulse width (duty cycle) | 0.1 | |
| Initial phase prior width | 1 | |
| Spin frequency prior width | 300 Hz | |
| Spin-down prior width | ||
| Scaled RA prior width | (0^{\mathrm h}0^{\mathrm m}12\fs0)_{{\sigma_f}} | |
| Scaled DEC prior width | (0^\circ03'00\farcs0)_{{\sigma_f}} |
Table 1.
We now show that via (5), the row vector containing the correct pulsar parameters and rotation counts produces a row vector with relatively short length . This transforms the pulsar search problem into a form similar to the classic “shortest vector problem” (SVP) in lattice theory.
Consider the first entry of (5), dropping higher orders in , and assuming is small enough that . Inspection of (6) and (7) gives . For the correct , this gives : the normalized residual phase of the first photon, of order unity. This also holds for the next components (photons).
Next, consider the th entry of (5). Inspection of (6) and (8) gives . This “penalty” for the first search parameter is of order unity if , i.e., if lies within the “prior range” of Table I. This also holds for the final four components (search parameters).
Thus, dividing by ,
This will be for the correct integer rotation counts and pulsar parameters , and much larger for the wrong values, provided that the pulse profile has width . Thus, the solution to the search problem corresponds to parameters that lead to “short” vectors .
If the phase residuals and model parameters are assumed to have been drawn from independent zero-mean Gaussians with the widths in Table I, then is the logarithm of the posterior probability [17]. Short vectors therefore correspond to solutions with high posterior probability.
The algorithm presented in an earlier work [17] discretizes the five continuous real parameters , transforming the search into an -dimensional SVP. We improve this with an additional step.
Lattice formulation
Below, we solve for the five real parameters of , reducing the dimension from to . The remaining unknowns are then found by solving the SVP. From (5) and (6), for fixed one has
where is the last five rows of . As varies, traces out a 5-plane in . The shortest is obtained when is orthogonal to that 5-plane. Thus, the vector that minimizes satisfies the five equations
since the dot product between in (10) and any vectors in the 5-plane (here, the five columns of the transpose ) must vanish. Multiplying (11) on the right by and moving the term to the rhs gives
Define the symmetric matrix
noting that is a projection operator, since . Substituting from (12) into (10) gives
where is obtained from by removing the last five rows.
The set of vectors with integer forms a lattice with generator matrix . Finding a nonzero integer that minimizes the length of is called the SVP. The matrix is rectangular: . Equivalent square generator matrices may be found from (14), which implies . The symmetric positive-definite Gram matrix has a unique positive definite symmetric square-root satisfying . From , it follows that is an generator matrix for the (possibly rotated) lattice generated by . Alternatively, Cholesky decomposition produces a square lower triangular lattice generator matrix , with implying that .
With this formulation, we do not search over the five parameters . Instead, we search for rotation count vectors that yield short vectors in the equivalent lattices generated by , , or . The corresponding follow from (12).
Our approach differs from [17] in that we analytically extremize and eliminate it, thereby reducing the dimension. In contrast, [17] works with the lattice generated by , after rescaling so that its discrete integer values are used. This requires an inverse rescaling of the rows of in order to keep the product in (10) invariant. The rescaled rows of have very small Euclidean norms, leading to a large number of short but unphysical lattice vectors with small integers in (the rescaled) and . This issue is resolved using projections [different than our defined by (13)]. In [17], Sec. 4 and the Appendix, the blocks and of are orthogonalized separately, thereby changing the subspace spanned by the last five rows of , which is then projected out. We are still studying the advantages and disadvantages of the lattice that [17] would produce, which differs from the one presented here.
*Short vectors versus shortest vectors—*In practice, the shortest vectors in the lattice come via (14) from rotation counts that are incorrect “solutions” to the search problem. Many of these have parameters via (12) that are unphysical. Examples are all being zero, except for one or a few being , or nonmonotonic , or mHz. The large trials factor also means that spurious short vectors may arise by chance. Furthermore, our data contain spurious background PATs, and most realistic pulsars have pulse profiles that are more complicated than our assumed Gaussian shape, lengthening for the correct (e.g., the pulse profile of the pulsar we discovered has two peaks). Similar nonsolutions appear in [17] and we address this the same way, i.e., by generating many short vectors and identifying the correct solution among them. We are currently optimizing the method for more complicated pulse profiles, but defer this discussion to future work.
The correct solution is identified by testing the different possible solutions using the statistic [20, 26], normalized as in [13], Eqs. (7)–(11). The statistic is computed for the highest-weighted 1000 PATs, using the residual phases determined by . If , then the parameters are recorded as a potential solution. The corresponding false alarm probability (for many independent random PATs) is , whose inverse is larger than the number of independent points in the parameter space (), making the trials-corrected significance similar to the standard detection threshold [27].
*Implementation—*Several algorithms and libraries have been developed to solve the classic SVP, but we require many short vectors. We use a recent record holder in the SVP challenge, the G6K library [28]. This employs sieving, which repeatedly forms sums and differences of lattice vectors to produce shorter ones.
G6K requires integer generators, so we multiply by and round to the nearest integers, following [17]. While one could sieve this basis directly, it is more efficient to first apply block Korkine-Zolotarev reduction and then invoke G6K’s “pump-up” procedure [28]. This begins by projecting the lattice orthogonally to the first basis vectors and sieving the resulting -dimensional lattice. The projection dimension is then increased by adding one additional basis vector, after which projection and sieving are repeated. This continues until the full -dimensional lattice is reached. Throughout, G6K maintains and enlarges a database of short vectors. At the end, these are transformed back to the original basis, yielding many with short .
| Vectors in database | 318 199 |
| Unphysical vectors (nonincreasing ) | 1434 |
| Equivalent vectors removed | 126 244 |
| Solutions ( statistic ) | 1 () |
| Shortest vector norm | |
| Shortest physical vector norm | |
| Longest vector norm | |
| Solution vector norm | |
| Database vectors shorter than solution | 6827 |
Table 2. Vectors obtained from sieving with G6K.
We postprocess the vectors by flipping the signs of any with decreasing values, removing any unphysical vectors, and also removing any equivalent entries, where and differ by the same integer. Then, we examine the statistic as described above. A notebook reproducing our method is available in [29].
*Dataset—*We selected photons detected before MJD 60284 from the unassociated source 4FGL J1622.7−7202 [8]. We used Pass 8 P8R3 Fermi-LAT data [30, 31] and the P8R3_SOURCE_V2 instrument response functions, selecting SOURCE-class photons with energies above 100 MeV, and used the energy-dependent angular and point spread function event-type cuts described in [8]. We computed probability weights with gtsrcprob [32], using the 4FGL-DR4 model [21] for the spectra and positions of the target and nearby sources, and the corresponding interstellar (gll_iem_v07.fits) and isotropic (iso_P8R3_SOURCE_V2_v1.txt) diffuse emission models [33].
*Multiple trials and random photon subsets—*The computational cost of the sieving process grows exponentially with . While including more photons should increase sensitivity, the algorithm is very sensitive to outlier PATs with large residual phases (background photons). To mitigate these effects, we start with the highest-weighted 120 photons, pick random subsets of size from these, and then carry out the lattice-based analysis described above. This is an extension of the method suggested in [17]. A search using a single random subset of PATs takes about 90 s to run on a single CPU core of an otherwise idle AMD EPYC 7351P 16-Core processor (this extends to min under full load).
*First discovery—*The pulsar PSR J1622−7204 was found the first time that we tried our algorithm on 20 different random subsets. The search parameters are given in Table I. By chance, this trial used PATs containing only a few outliers. For other subsets containing a larger number of outliers, the algorithm failed to find the pulsar.
We got lucky with the 20 trials, of which one was successful. Based on 1000 trials, we estimate that the probability of successfully detecting this pulsar in a single subset of 80 PATs is . With trials, the probability of finding the pulsar at least once is , which is 18% for 20 trials, and 50% for 70 trials. A robust detection with 95% success probability is achieved for 300 trials.
Table II contains information about the shortest G6K vectors of the successful trial. The set of short vectors is illustrated in Figure 1 in the plane of vector norm versus statistic. The two groups of nonsolution vectors, the “physical” and “unphysical” ones, appear in all of our searches, independent of the source properties or its pulse profile. Even after the unphysical vectors are removed, the solution is not the shortest vector. However, its statistic has a -value [20]. This is highly significant, since is much larger than the number of independent trial points in parameter space, .

Figure 1. Density of the 318 199 short vectors found by G6K in the successful search, i.e., for one subset of 80 photons. The (correct) solution is circled. Vectors (blue) with statistic larger than the solution are unphysical: they have frequencies Hz and their are not increasing. The remaining vectors (red) have increasing and frequencies mHz kHz.
Pulsar parameters—The physical properties of PSR J1622−7204 are summarized in Table III. These parameters and their uncertainties were determined from the 15 905 photons with weights , using the -ray pulsar timing method described in [34] to explore the likelihood surface in the neighborhood of the physical lattice vector with the highest statistic. These parameters and derived physical properties are typical for an isolated -ray millisecond pulsar (see, e.g., Fig. 2 of Ref. [2]). The uncertainties are relatively small because of the long data span of years. Figure 2 shows the pulse profile and the 15 905 weighted photon phases over time. The effective number of photons from the pulsar is , and the expected squared pulsation signal-to-noise ratio is .
| Units and conventions | |
| Time coordinate | TDB |
| Reference epoch | MJD 57662.23910470847 |
| Solar System ephemeris model | DE440 |
| Data span | MJD 54 694 to 60 284 |
| Inferred parameters of PSR J1622−7204 | |
| Spin frequency | 260.896 208 070 72(2) Hz |
| Frequency derivative | Hz/s |
| Right ascension (RA) | |
| Declination (DEC) | |
| Proper motion in RA, | mas/yr |
| Proper motion in DEC, | mas/yr |
| Derived parameters of PSR J1622−7204 | |
| Spin period | 3.832 941 871 385 6(3) ms |
| Spin-period derivative | |
| Characteristic age | yr |
| Surface magnetic field | G |
| Light-cylinder magnetic field | G |
| Spin-down power | erg/s |
Table III. Properties of PSR J1622−7204. These parameters are derived from the observed spin-period derivative, which includes contributions from the Shklovskii effect and Galactic acceleration relative to the SSB. We cannot correct for these (unknown) distance-dependent effects, but both are small and approximately cancel, leaving a net correction smaller than .

Figure 2. Bottom: weighted photon phases for the best-fit timing solution, showing two rotations. The left-axis star marks , the reference epoch of Table III. The rotational phase with is offset from (3) so that . The 80 successful trial PATs are circled in red. Top: integrated pulse profile, with dark and light blue showing posteriors. The dashed red line estimates the nonpulsed background. The assumed Gaussian pulse profile (dash-dot) is centered around integer , marked by vertical lines, where the lattice algorithm identified peaks.
Conclusions—We have shown that lattice-based pulsar searches can discover previously undetected pulsars using 5 to 6 orders of magnitude less computing time than prior methods. The new method will be an important tool in future -ray pulsar searches.
PSR J1622−7204 is an isolated millisecond pulsar. An exciting prospect is that the lattice-based algorithm can also be used for blind searches for pulsars in binary systems. These are computationally infeasible with previous methods [9]. The Fermi-LAT source catalog [8] contains hundreds of unassociated sources whose spectral shape and temporal variability suggest that they might be pulsars [35], but searches for isolated pulsars have failed. Many of these could be -ray pulsars in binary systems. Searching for binary pulsars requires modeling the additional PAT delays due to the pulsar’s orbital motion, which produces additional rows in (7) and (8). A blind search for a pulsar in a binary system should have a computation cost larger than the isolated search reported here [17], since it requires linearization around binary parameter sets, each defining a different lattice. This should be feasible with Einstein@Home or similar resources. To compensate for the increased trials factor and search volume, we estimate that the threshold on increases by . We do not expect this to be an issue in practice, since many of the potential sources have enough high-weight photons to result in a much larger statistic.
Acknowledgments—We thank Toby Burnett for identifying 4FGL J1622.2−7202 as a promising pulsar candidate source for our searches, and M. A. Papa for helpful comments on the manuscript. B. Z. and D. G. are supported by the Minerva Foundation with funding from the Federal
German Ministry for Education and Research. The Fermi-LAT Collaboration acknowledges support for LAT development, operation, and data analysis from NASA and the U.S. Department of Energy; CEA/Irfu and IN2P3/CNRS in France; ASI and INFN in Italy; MEXT, KEK, and JAXA in Japan; and the K. A. Wallenberg Foundation, the Swedish Research Council, and the Swedish National Space Board. Science analysis support in the operations phase from INAF (Italy) and CNES (France) is also gratefully acknowledged. That work was performed in part under DOE Contract No. DE-AC02-76SF00515.
Data availability—The code to reproduce our result is available in [29] and includes a notebook implementing the lattice-based search as well as a notebook performing the parameter estimation. The resulting parameter file data/J1622-7204_shoogle_results.par (also included in [29]) can be loaded into PINT together with the PATs to produce a pulse profile compatible with Figure 2 as well as an statistic of .
References
- [1]W. B. Atwood, A. A. Abdo, M. Ackermann, W. Althouse, B. Anderson, M. Axelsson, L. Baldini, J. Ballet, D. L. Band, G. Barbiellini et al., The Large Area Telescope on the Fermi Gamma-ray Space Telescope mission, Astrophys. J. 697, 1071 (2009).
- [2]D. A. Smith, S. Abdollahi, M. Ajello, M. Bailes, L. Baldini, J. Ballet, M. G. Baring, C. Bassa, J. Becerra Gonzalez, R. Bellazzini et al., The third Fermi Large Area Telescope catalog of gamma-ray pulsars, Astrophys. J. 958, 191 (2023).DOI
- [3]C. G. Bassa, Z. Pleunis, J. W. T. Hessels, E. C. Ferrara, R. P. Breton, N. V. Guseinskaia, V. I. Kondratiev, S. Sanidas, L. Nieder, C. J. Clark et al., LOFAR discovery of the fastest-spinning millisecond pulsar in the Galactic field, Astrophys. J. Lett. 846, L20 (2017).DOI
- [4]L. Nieder, C. J. Clark, D. Kandel, R. W. Romani, C. G. Bassa, B. Allen, A. Ashok, I. Cognard, H. Fehrmann, P. Freire et al., Discovery of a gamma-ray black widow pulsar by GPU-accelerated Einstein@Home, Astrophys. J. Lett. 902, L46 (2020).
- [5]R. W. Romani, M. Belznezay, A. V. Filippenko, T. G. Brink, and W. Zheng, PSR J0952-0607: Tightening a record-high neutron star mass, Astrophys. J. 996, 101 (2026).arxiv.org/abs/2512.05099
- [6]F. Özel and P. Freire, Masses, radii, and the equation of state of neutron stars, Annu. Rev. Astron. Astrophys. 54, 401 (2016).DOI
- [7]M. Ajello, W. B. Atwood, L. Baldini, J. Ballet, G. Barbiellini, D. Bastieri, R. Bellazzini, A. Berretta, B. Bhattacharyya et al. (FERMI-LAT Collaboration), A gamma-ray pulsar timing array constrains the nanoHertz gravitational wave background, Science 376, 521 (2022).DOI
- [8]S. Abdollahi, F. Acero, M. Ackermann, M. Ajello, W. B. Atwood, M. Axelsson, L. Baldini, J. Ballet, G. Barbiellini, D. Bastieri et al., Fermi Large Area Telescope fourth source catalog, Astrophys. J. Suppl. Ser. 247, 33 (2020).DOI
- [9]L. Nieder, B. Allen, C. J. Clark, and H. J. Pletsch, Exploiting orbital constraints from optical data to detect binary gamma-ray pulsars, Astrophys. J. 901, 156 (2020).DOI
- [10]W. B. Atwood, M. Ziegler, R. P. Johnson, and B. M. Baughman, A time-differencing technique for detecting radio-quiet gamma-ray pulsars, Astrophys. J. 652, L49 (2006).DOI
- [11]A. A. Abdo, M. Ackermann, M. Ajello, B. Anderson, W. B. Atwood, M. Axelsson, L. Baldini, J. Ballet, G. Barbiellini, M. G. Baring et al., Detection of 16 gamma-ray pulsars through blind frequency searches using the Fermi LAT, Science 325, 840 (2009).DOI
- [12]P. M. Parkinson, M. Dormody, M. Ziegler, P. S. Ray, A. A. Abdo, J. Ballet, M. G. Baring, A. Belfiore, T. H. Burnett, G. A. Caliandro et al., Eight γ-ray pulsars discovered in blind frequency searches of Fermi LAT data, Astrophys. J. 725, 571 (2010).
- [13]H. J. Pletsch, L. Guillemot, B. Allen, M. Kramer, C. Aulbert, H. Fehrmann, P. S. Ray, E. D. Barr, A. Belfiore, F. Camilo et al., Discovery of nine gamma-ray pulsars in Fermi Large Area Telescope data using a new blind search method, Astrophys. J. 744, 105 (2012).DOI
- [14]H. J. Pletsch, L. Guillemot, B. Allen, D. Anderson, C. Aulbert, O. Bock, D. J. Champion, H. B. Eggenstein, H. Fehrmann, D. Hammer et al., Einstein@Home discovery of four young gamma-ray pulsars in Fermi LAT data, Astrophys. J. Lett. 779, L11 (2013).
- [15]C. J. Clark et al., The Einstein@Home gamma-ray pulsar survey. I. Search methods, sensitivity and discovery of new young gamma-ray pulsars, Astrophys. J. 834, 106 (2017).DOI
- [16]C. J. Clark, M. Di Mauro, J. Wu, B. Allen, O. Behnke, H. B. Eggenstein, B. Machenschalk, L. Nieder, P. M. Saz Parkinson, A. Ashok et al., Einstein@Home searches for gamma-ray pulsars in the inner Galaxy, Astrophys. J. 994, 149 (2025).DOI
- [17]D. Gazith, A. B. Pearlman, and B. Zackay, Recovering pulsar periodicity from time-of-arrival data by finding the shortest vector in a lattice, Astrophys. J. 979, 48 (2025).arxiv.org/abs/2402.07228
- [18]C. J. Clark, R. P. Breton, E. D. Barr, M. Burgay, T. Thongmeearkom, L. Nieder, S. Buchner, B. Stappers, M. Kramer, W. Becker et al., The TRAPUM L-band survey for pulsars in Fermi-LAT gamma-ray sources, Mon. Not. R. Astron. Soc. 519, 5590 (2023).
- [19]T. Thongmeearkom, C. J. Clark, R. P. Breton, M. Burgay, L. Nieder, O. G. Dodgson, B. McGloughlin, E. D. Barr, S. Buchner, B. W. Stappers et al., Pulsar discoveries from the TRAPUM UHF survey of Fermi-LAT sources, Mon. Not. R. Astron. Soc. 547, stag406 (2026).DOI
- [20]M. Kerr, Improving sensitivity to weak pulsations with photon probability weighting, Astrophys. J. 732, 38 (2011).DOI
- [21]J. Ballet, P. Bruel, T. H. Burnett, and B. Lott (Fermi-LAT Collaboration), Fermi Large Area Telescope fourth source catalog data release 4 (4FGL-DR4), arXiv:2307.12546.
- [22]J. Luo, S. Ransom, P. Demorest, P. S. Ray, A. Archibald, M. Kerr, R. J. Jennings, M. Bachetti, R. van Haasteren, C. A. Champagne et al., PINT: A modern software package for pulsar timing, Astrophys. J. 911, 45 (2021).
- [23]A. Subhanian, D. L. Kaplan, A. M. Archibald, J. Luo, P. S. Ray, T. T. Pennucci, S. M. Ransom, G. Agazie, W. Fiore, B. Larsen et al., PINT: Maximum-likelihood estimation of pulsar timing noise parameters, Astrophys. J. 971, 150 (2024).
- [24]J. Luo, S. Ransom, P. Demorest, R. van Haasteren, P. Ray, K. Stovall, M. Bachetti, A. Archibald, M. Kerr, J. Colen et al., PINT: High-precision pulsar timing analysis package, Astrophysics Source Code Library, record ascl:1902.007 (2019), https://ascl.net/1902.007.
- [25]Fermi-LAT Collaboration, Fermi data & products, https://fermi.gsfc.nasa.gov/ssc/data/ (2026), accessed: 2026-2-8.
- [26]O. C. de Jager, J. W. H. Swanepoel, and B. C. Raubenheimer, A powerful test for weak periodic signals with unknown light curve shape in sparse data, Astron. Astrophys. 221, 180 (1989), https://ui.adsabs.harvard.edu/abs/1989A%26A...221..180D/abstract.
- [27]D. A. Smith, P. Bruel, I. Cognard, A. D. Cameron, F. Camilo, S. Dai, L. Guillemot, T. J. Johnson, S. Johnston, M. J. Keith et al., Searching a thousand radio pulsars for gamma-ray emission, Astrophys. J. 871, 78 (2019).
- [28]M. R. Albrecht, L. Ducas, G. Herold, E. Kirshanova, E. W. Postlethwaite, and M. Stevens, The General Sieve Kernel and new records in lattice reduction, in Advances in Cryptology—EUROCRYPT 2019, edited by Y. Ishai and V. Rijmen (Springer International Publishing, Cham, 2019), pp. 717–746, 10.1007/978-3-030-17656-3_25.DOI
- [29]See Supplemental Material at http://link.aps.org/supplemental/10.1103/vlt2-xzgk for an example implementation of our method and the data and notebook for reproducing our timing solution.
- [30]W. Atwood, A. Albert, L. Baldini, M. Tinevella, J. Bregeon, M. Pesce-Rollins, C. Sgrò, P. Bruel, E. Charles, A. Drlica-Wagner et al., Pass 8: Toward the full realization of the Fermi-LAT scientific potential, in Proceedings of the 4th Fermi Symposium, Monterey, California, 2012, edited by T. J. Brandt, N. Omodei, and C. Wilson-Hodge, eConf C121028 (2013), pp. 8–13, arXiv:1303.3514.arxiv.org/abs/1303.3514
- [31]P. Bruel, T. H. Burnett, S. W. Digel, G. Jóhannesson, N. Omodei, and M. Wood, Fermi-LAT improved Pass 8 event selection, arXiv:1810.11394.arxiv.org/abs/1810.11394
- [32]Fermi-LAT Collaboration, Fermtools, v2.2.0, https://github.com/fermi-lat/ScienceTools/releases/tag/Fermitools-2.2.0, https://fermi.gsfc.nasa.gov/ssc/data/analysis/documentation/ (2022).
- [33]Fermi-LAT Collaboration, Fermi LAT background models, https://fermi.gsfc.nasa.gov/ssc/data/access/lat/BackgroundModels.html (2024), accessed: 2026-1-12.
- [34]C. J. Clark, S. Valtonina, L. Nieder, and R. van Haasteren, Timing gamma-ray pulsars using Gibbs sampling, Astron. Astrophys. 709, A215 (2026).
- [35]D. V. Malyshev, Towards resolving the Galactic center GeV excess with millisecond-pulsars-like sources using machine learning, Phys. Rev. D 111, 043033 (2025).DOI