Tracking earthquake sequences in real time: application of Seismicity-Scanning based on Navigated Automatic Phase-picking (S-SNAP) to the 2019 Ridgecrest, California sequence
Bibliographic record
Abstract
SUMMARY Recent improvements in seismic data processing techniques have enhanced our ability to detail the evolution of major earthquake sequences in space and time. One such advance is new scanning algorithms that allow large volumes of waveform data to be analysed automatically, removing human biases and inefficiencies that inhibit standardized monitoring. The Seismicity-Scanning based on Navigated Automatic Phase-picking (S-SNAP) workflow has previously been shown to be capable of producing high-quality earthquake catalogues for injection-induced seismicity monitoring. In this study, we modify the original S-SNAP workflow to enable it to delineate the spatiotemporal distribution of major earthquake sequences in real time. We apply it to the 2019 Ridgecrest, southern California earthquake sequence, which culminated in an Mw 6.4 foreshock on July 4 and an Mw 7.1 main shock on July 6 and generated tens of thousands of smaller earthquakes. Our catalogue—which spans the period 2019 June 1 to July 16—details the spatiotemporal evolution of the sequence, including early foreshocks on July 1 and accelerating foreshocks on July 4, a seismicity gap before the main shock around its epicentre, seismicity on discrete structures within a broad fault zone and triggered earthquakes outside the main fault zone. We estimate the accuracy and false detection rate of the S-SNAP catalogue based on the reviewed catalogue reported by Southern California Seismic Network (SCSN) and our own visual inspection. We demonstrate the advantages of S-SNAP over a generalized automatic earthquake monitoring software, Seiscomp3, and a customized real-time earthquake information system for southern California, TriNet. In comparison, the S-SNAP catalogue contains five times more events than the Seiscomp3 catalogue and 1.4–2.2 times as many events per hour as the TriNet catalogue at most times. In addition, S-SNAP is more likely to solve phase association ambiguities correctly and provide a catalogue with consistent quality through time. S-SNAP would be beneficial to both routine network operations and the earthquake review process.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".