Pith. sign in

REVIEW 4 major objections 5 minor 28 references

A Logic-based Temporal Cohort Discovery Engine: Algorithms, Indices, and Experimental Results on the National Sleep Research Resource

T0 review · 4 major / 5 minor · reviewed 2026-08-01 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Formal temporal logic can make sleep cohort discovery explicit, reproducible, and fast enough for large repositories.

desk verdict Solid engineering paper with a real index contribution, but the formal soundness hinge is a theorem deferred to an under-review same-group paper—so the semantic claims are asserted, not established. read the letter →

arxiv 2607.21377 v1 pith:CRMRALBL submitted 2026-07-23 cs.DB cs.LO

Yan Huang , Xiaojin Li , Licong Cui , Guo-Qiang Zhang This is my paper · ORCID
classification cs.DBcs.LO MSC 68P1568P2068Q6003B70
keywords RationalEnsembleLogictemporalcohortdiscoverymodelcheckingintervalensemblesfractionalcascadingsleepphenotypingpolysomnogramannotationsindexing
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tries to establish that temporal cohort discovery over interval-annotated sleep data can be a formal model-checking task, not a collection of custom scripts. It defines a dense-time logic (Rational Ensemble Logic, QEL), a data model (Biomedical Event Structure Temporal Models, BESTs) that maps event labels to non-overlapping rational intervals, and two indexing schemes (2DFC, FCFC) that make the logic practical. If right, a sleep researcher could write inclusion criteria as explicit, reusable formulas and get exact, fast answers — sub-second on a real 515-subject pediatric cohort and under 45 seconds even when the cohort is scaled 1,000-fold. The payoff is reproducibility: two investigators with the same QEL formula necessarily retrieve the same cohort.

What carries the argument

The engine is QEL model checking over BEST models, accelerated by two fractional-cascading indexes. QEL is a dense-time logic whose satisfaction relation is defined over rational intervals; a formula at observation point q asks whether a subject's annotation intervals satisfy the temporal pattern. 2DFC turns interval-overlap existence queries into 2D range queries with linear space and build time; FCFC precomputes, for every global interval boundary and every event label, the first interval that starts at-or-after and the first interval that ends after that boundary, giving constant-time target-event lookup for dual-event pattern matching.

What would settle it

Take a small BEST and a QEL formula with nested quantifier alternation (for example, ∃x ∀y with y bounded by an affine function of x), brute-force all rational assignments in a bounded region, and compare against the endpoint-segment model checker; any satisfying assignment the checker misses would falsify the claimed sound reduction. A simpler check: inspect the companion proof for the missing theorem and test a formula whose window boundary is not an interval endpoint.

Watch

Extended reading notes

Core claim

The central claim is that a polysomnogram can be represented as a BEST — a finite mapping from event labels to sorted, non-overlapping rational interval ensembles — and that cohort inclusion criteria written as QEL formulas (with displacement, bounded existence/universality, Boolean composition, and rational quantification) are decided exactly by model checking at an observation point. The paper's finite-evidence theorem asserts that, because QEL translates into the first-order theory of dense ordered divisible abelian groups, satisfying assignments decompose into finitely many cells; checking one rational representative per cell (in practice, endpoint representatives) is complete. On top of

Load-bearing premise

The load-bearing premise is the finite-evidence theorem — that dense-time QEL satisfaction can be decided by finitely many endpoint-segment checks — whose proof is cited to a companion under-review paper rather than included here.

Editorial extensions

If this is right

  • Cohort definitions expressed as QEL formulas are reusable, human-readable, and machine-executable, so identical clinical criteria produce identical cohorts across sites.
  • The three query templates (single-event retrieval, dual-event pattern matching, event extraction) cover the majority of AASM-style temporal criteria, including duration thresholds, bounded delay, co-occurrence, stage restrictions, and absence windows.
  • 2DFC's linear build time and space make index refresh practical for repositories that continuously ingest or correct annotations.
  • FCFC's anchor-rare-event strategy gives interactive latencies for co-occurrence and before/after phenotype queries even at 1,000× scale for cohort selection.
  • The engine can express signal-level definitions of events directly from physiological signals, not just pre-scored labels, reducing inter-scorer variability.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Beyond the paper: if the finite-evidence theorem extends to nested quantifier alternation (which the paper lists as a limitation), the same QEL/BEST engine would generalize to ECG, EEG, and continuous glucose interval data with no algorithmic change.
  • Beyond the paper: the measured 2DFC-versus-RTFC crossover at ~210 event types suggests an adaptive dispatcher that chooses 2DFC for label-rich datasets and RTFC for pure interval-volume workloads.
  • Beyond the paper: the Before-template with tunable delay windows could be used directly as a screening instrument for apnea-desaturation latency distributions, turning the paper's Example 1 into a population phenotyping tool.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The paper proposes a logic-based temporal cohort discovery engine for sleep-study interval annotations. Each recording is modeled as a Biomedical Event Structure Temporal Model (BEST), a finite map from event labels to non-overlapping rational interval ensembles; cohort criteria are expressed as Rational Ensemble Logic (QEL) formulas and evaluated by model checking over a dense rational timeline. To make model checking scalable, the authors introduce two index structures: 2DFC, which builds two fractional-cascading structures over per-label start/end lists to answer interval-overlap range queries in near-logarithmic time, and FCFC, which uses a global boundary index with per-label successor arrays for dual-event temporal pattern matching. Experiments on synthetic data up to 90 million intervals and on the Cleveland Children's Sleep and Health Study (515 subjects, 202,587 intervals, 23 labels) report, e.g., 2DFC build time 3,655 s versus 11,549 s (RTFC) and 23,902 s (2DRT) at 90M intervals, and sub-second native-scale queries with cohort queries under 45 s at 1,000× scale. The central correctness claim is that dense-time QEL satisfaction reduces, via a finite evidence set, to evaluation over the implementation's finite endpoint/segment arrays.

Significance. If the semantic reduction and the index correctness are fully established, this is a valuable contribution to biomedical informatics: it offers a formal, human-readable, machine-executable language for temporal phenotypes, and it provides concrete indexing techniques that exploit the sorted, non-overlapping structure of normalized sleep annotations. The empirical evaluation is substantial, the complexity analysis is explicit, and the real-world NSRR deployment is a useful benchmark. However, the main correctness hinge — the finite-evidence theorem connecting dense-time QEL to the endpoint-array engine — is cited to an under-review companion paper rather than proved here, and the claimed segment-ID reduction is asserted rather than demonstrated. The indexing algorithms are also incompletely specified. The paper therefore shows promise but does not yet fully substantiate its central formal claims.

major comments (4)
  1. [§3.4, Theorem 1] The finite rational evidence set is the sole formal bridge from dense-time QEL semantics (Definition 4) to the finite arrays used by the engine, but the theorem is stated as 'See Zhang et al. (2026)', an under-review same-group paper. The proof sketch (quantifier elimination in dense ordered divisible abelian groups) is standard for the first-order theory, yet the manuscript contains no theorem statement precise enough to check that the constructive set F_ε,q,φ is actually computable from interval endpoints and formula constants, nor a proof of the claimed equivalence for the QEL fragment used by the templates. Because every cohort answer depends on this theorem, this is load-bearing. The manuscript should either include a self-contained proof, or restrict all correctness claims to the evaluated template fragment and prove the finite-evidence property for that fragment directly.
  2. [§3.4, 'semantic consequence' paragraph] The paper asserts that 'endpoint representatives are encoded as integer segment identifiers' and that the reduction from dense rational time to endpoint arrays is 'a semantic consequence of QEL, not merely an optimization.' No argument is given that the segment-ID enumeration is a complete transversal of the affine cells induced by the relevant constraints. In particular, the Before-variant templates contain quantified variables q, x, y with boundaries such as q+x = endpoint and q+x+y = endpoint, where mixed sums, not individual endpoints, define cells. A per-coordinate segment enumeration is not automatically a complete transversal of these multidimensional cells. Please provide an explicit description of F for each template and a proof that the implementation's integer-segment identifiers cover every cell (including lower-dimensional faces) needed for satisfiability.
  3. [§3.6.2, Algorithm 2 and Proposition 1] Algorithm 2's Query1DFC pseudocode has a concrete out-of-bounds defect: in lines 19–20, when i = |FC|-1, the code accesses FC[i+1] (both for the length and for the fallback comparison), which does not exist. Moreover, Proposition 1, which asserts that Algorithm 2 returns exactly the overlapping intervals, is not proved, and the semantics of the index values returned by Query1DFC (lower bound? upper bound? inclusive?) is not defined precisely. The candidate loop then checks only L[i][j].start ≤ y', so its correctness rests entirely on the unstated meaning of Query1DFC(FC_y, x'). Since 2DFC is a primary contribution, the pseudocode should be corrected and accompanied by a correctness invariant/proof for Algorithm 2, or the proposition should be scoped to a precisely specified, correct algorithm.
  4. [§3.3 and §3.5, templates] The query-answer semantics defines [[φ_q]]_D = {ε | (ε,q) ⊨ φ} with q an external observation point. The dual-event templates, however, write formulas such as ∃q∃x∃y ( ... )_q, internally quantifying q, which changes the meaning: the query then asks for existence of an observation point in the timeline, not satisfaction at a fixed reference point. This conflation of the reference point with a bound variable is not derivable from Definition 4 as stated. Please clarify whether q is a parameter or a bound variable in these templates; if the latter, extend the language/answer-set definition accordingly and re-express the templates in that formal notation.
minor comments (5)
  1. [Abstract/Conclusion] The sentence 'This work is a part of the Symbolic Biomedicine program championed by the corresponding author' is programmatic and should be moved to an acknowledgment or removed from the abstract/conclusion.
  2. [Figure 5] The y-axis labels 'tel_query_time', 'benchmark_query_time', and 'tel_time_saved' are unclear; 'tel' should be expanded or replaced (e.g., 'FCFC query time').
  3. [Section 4.2] The 1,000× scaling is described as 'synthetically scaled datasets containing ... 1,000 times as many subjects.' It would be helpful to state explicitly that this replication preserves each subject's interval distribution, so the scaling isolates volume effects rather than distributional changes.
  4. [Section 3.5, Example 1] The formula in Example 1 has ambiguous subscripts: (□5(CA∨OA) ∧ N3 ∧ ¬SPO2_DESAT)_600 is not clear about which conjuncts are evaluated at offset 600. Use explicit parenthesization or separate displacement notation.
  5. [References] Since Theorem 1 and Definition 2/3/4 are credited to 'Zhang et al. (2026)', which is under review, readers cannot verify these definitions from the cited source. Consider providing the full definitions/proofs in an appendix or citing a stable/available version.

Circularity Check

1 steps flagged · score 5.0 of 10

Formal-semantics correctness of the dense-time to finite-endpoint reduction is deferred to an under-review same-group citation (Theorem 1 / Zhang et al. 2026), making the central model-checking hinge self-citation load-bearing; indexing and experiments are independent.

  1. self citation load bearing [Section 3.4, Theorem 1 and the paragraph following it; references list (Zhang et al., 2026).]
    "Theorem 1 (Finite rational evidence set for QEL Zhang et al. (2026)). Fix a BEST ε, a reference point q∈Q≥0, and a QEL formula φ[x] ... See Zhang et al. (2026). ... In the implementation, endpoint representatives are encoded as integer segment identifiers whenever the query contains only the bounded temporal templates in Section 3.5. Thus the finite-evidence theorem justifies the engineering reduction from dense rational time to endpoint arrays; the reduction is a semantic consequence of QEL, not merely an optimization."

    The only support for this theorem in the manuscript is a citation to Zhang et al. (2026), an under-review paper by the same group, and the proof is not included here. The theorem is the load-bearing step that connects the dense-time QEL satisfaction relation (Definition 4) to the actual endpoint-array/segment-ID evaluation implemented and benchmarked in the paper. Without an independent proof, the paper's central correctness claim ('the reduction is a semantic consequence of QEL') is inherited from the authors' own unpublished work rather than demonstrated. This is a self-citation carrying a formal result, not merely background. The indexing correctness (Propositions 1-2) and experiments are separately developed and would remain valid for the bounded templates, but they do not supply the m

full rationale

The paper's indexing and experimental content is largely independent: 2DFC and FCFC are defined in the paper, Propositions 1 and 2 give in-paper correctness arguments, and the NSRR/synthetic benchmarks are concrete. The circularity concern is concentrated in the formal-semantics layer. QEL/BEST are attributed to Zhang et al. (2026), and more importantly the finite-evidence theorem needed to justify evaluating dense-time QEL over finite endpoint arrays is stated as Theorem 1 but its proof is 'See Zhang et al. (2026)', a same-group manuscript under review. The paper itself concedes in Limitations that fully general nested QEL formulas require recursive application of this theorem beyond the evaluated templates, so the implementation's scope is narrower than the cited theorem's statement. This makes the correctness hinge load-bearing self-citation rather than an independently derived result. It is not a case of a fitted parameter renamed as a prediction, and the algorithms are not defined in terms of the queries they are supposed to explain. But for the central claim that QEL model checking supplies mathematically explicit and machine-computable dense-time semantics, the key reduction is asserted via the authors' own unpublished work. Score 5 reflects partial circularity: the formal-semantics core depends on the self-citation, while the engineering and evaluation contributions stand independently.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The paper introduces no new physical entities. Its formal objects (BEST, QEL, 2DFC, FCFC) are representations, logics, or data structures, not new postulated ontology. The most important unproved input is the QEL finite-evidence theorem from the authors’ under-review QEL paper; the remaining assumptions are standard data-normalization and math background.

assumptions (5)
  • domain assumption QEL finite rational evidence set theorem (Theorem 1) holds as stated in Zhang et al. 2026; proof deferred.
    Invoked in Section 3.4 to justify reducing dense rational time to endpoint arrays. The proof is not included; only “See Zhang et al. (2026)”, an under-review paper by the same group.
  • domain assumption Per-label interval ensembles are finite, pairwise non-overlapping, and sorted by start time (Definition 1).
    2DFC and FCFC both exploit this normalization; the paper acknowledges overlapping annotations need preprocessing.
  • domain assumption Closed-world interpretation: time points not covered by a label’s intervals are treated as absence of that label.
    Definition 1: “points not contained in the union of the intervals are treated under a closed-world assumption as times at which the corresponding label is absent.”
  • standard math Timeline is the non-negative rationals with intervals whose boundary relations can be instantiated by < or ≤.
    Section 3.1 defines intervals over Q>=0 and depends on dense-order/divisible-group quantifier elimination.
  • standard math Standard fractional cascading properties: O(n) space for 1D lists and O(log n + k) query after cascade.
    Used in 2DFC complexity analysis and cited to Chazelle and Guibas (1986).

how reviews work

0 comments
Cite this review

Pith. "Pith review of A Logic-based Temporal Cohort Discovery Engine: Algorithms, Indices, and Experimental Results on the National Sleep Research Resource." pith.science (2026). https://pith.science/paper/CRMRALBL

@misc{pith2026260721377,
  author       = {Pith},
  title        = {Pith review of: A Logic-based Temporal Cohort Discovery Engine: Algorithms, Indices, and Experimental Results on the National Sleep Research Resource},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/CRMRALBL}},
  note         = {Machine review of arXiv:2607.21377}
}
read the original abstract

Large sleep-study repositories contain rich time-stamped physiological annotations, but cohort discovery is still commonly implemented as ad hoc scripts or scalar-index filters. We present a logic-based temporal cohort discovery engine that brings formal semantics, model checking, specialized indexing, and empirical evaluation into a unified biomedical informatics framework. We adopt Rational Ensemble Logic (QEL) as a dense-time formal foundation for sleep-data querying and represent each annotated polysomnogram as a Biomedical Event Structure Temporal Model (BEST), a finite mapping from event labels to non-overlapping rational interval ensembles. Cohort discovery is formulated as model checking of QEL formulas over BEST databases. We organize common sleep-research requirements into three reusable temporal query patterns: single-event retrieval, dual-event temporal pattern matching, and event data extraction. The prototype cohort discovery engine was implemented in Python with in-memory and MongoDB-backed execution modes and evaluated on synthetic interval datasets containing up to 90 million intervals and on real-world National Sleep Research Resource annotations from the Cleveland Children's Sleep and Health Study (CCSHS) containing 515 subjects, 202,587 intervals, 23 event labels. 2DFC constructs indexes in linear space and linear build time, reducing build time at 90 million intervals from 11,549 s with RTFC and 23,902 seconds with 2DRT to 3,655 seconds. On CCSHS, cohort-selection queries executed at sub-second latency at native scale and under 45 seconds at 1,000 times scale. This work is a part of the Symbolic Biomedicine program championed by the corresponding author.

Figures

Figures reproduced from arXiv: 2607.21377 by the authors.

Figure 1
Figure 1. Overview of the BEST-DB framework. A “Central Apnea” annotation from NSRR XML is transformed into a labeled interval, inserted into the subject-specific BEST, and evaluated by QEL model checking. Query execution returns matching subjects and, when requested, the witnessing intervals that certify the temporal pattern. intervals in each ensemble are ordered by start time, and points not contained in the union of the i… view at source ↗
Figure 2
Figure 2. An example to illustrate the construction of 2DFC and the existence query with input interval [40, 60]. Extracted target ranges are navigated via pointers (boxes), triggering a localized scan (arrows), and matching intervals are returned (circles). which is 𝑂(log 𝑛1 + 𝑚 + 𝑘) when the lists are balanced and 𝑂(log 𝑛 + 𝑚 + 𝑘) in the worst case. Here 𝑘 is the number of reported intervals. Compared to the 2DRT query time… view at source ↗
Figure 3
Figure 3. An example to illustrate the construction of FCFC and the query to find all “Co-occurrence” patterns between 𝐿[0] and 𝐿[1], and 𝐿[0] and 𝐿[2] the anchor. If this first not-yet-ended target interval starts before 𝑏, then it overlaps [𝑎, 𝑏) and the anchor is returned. If it starts at or after 𝑏, then every later target interval starts no earlier and therefore also cannot overlap [𝑎, 𝑏). Thus the test is both sound and… view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: Query performance of 2DFC, RTFC, and 2DRT. (a)-(c) vary event count and interval count; (d)-(e) vary query interval start point and range. upon computationally inexpensive precomputed distance arrays. In MongoDB scenarios, both methods encountered generally higher late…
Figure 5
Figure 5. Figure 5: Dual-event query performance comparison with 36 testing queries (x axis) on CCSHS dataset. Blue bars represent the “Before variant 2” query time using FCFC, and orange bars represent the benchmark query time. Query time is in seconds (left y axis) The gray line represe…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

28 extracted references · 1 linked inside Pith

  1. [1]

    , author Hornero, R

    author \'A lvarez, D. , author Hornero, R. , author Garc \' a, M. , author del Campo, F. , author Zamarr \'o n, C. , year 2007 . title Improving diagnostic ability of blood oxygen saturation from overnight pulse oximetry in obstructive sleep apnea detection by means of central tendency measure . journal Artificial intelligence in medicine volume 41 , pages 13--24

    2007

  2. [2]

    title EEG arousals: scoring rules and examples: a preliminary report from the sleep disorders atlas task force of the American Sleep Disorders Association

    author American Sleep Disorders Association , year 1992 . title EEG arousals: scoring rules and examples: a preliminary report from the sleep disorders atlas task force of the American Sleep Disorders Association . journal Sleep volume 15 , pages 173--184

    1992

  3. [3]

    , author Sands, S.A

    author Azarbarzin, A. , author Sands, S.A. , author Stone, K.L. , author Taranto-Montemurro, L. , author Messineo, L. , author Terrill, P.I. , author Ancoli-Israel, S. , author Ensrud, K. , author Purcell, S. , author White, D.P. , author Redline, S. , year 2019 . title The hypoxic burden of sleep apnoea predicts cardiovascular disease-related mortality: ...

    2019

  4. [4]

    , author Saxe, J.B

    author Bentley, J.L. , author Saxe, J.B. , year 1980 . title Decomposable searching problems . journal SIAM Journal on Algebraic Discrete Methods volume 1 , pages 301--358

    1980

  5. [5]

    , author Brooks, R

    author Berry, R.B. , author Brooks, R. , author Gamaldo, C.E. , author Harding, S.M. , author Lloyd, R.M. , author Marcus, C.L. , author Vaughn, B.V. , year 2015 . title The AASM Manual for the Scoring of Sleep and Associated Events: Rules, Terminology and Technical Specifications . edition Version 2.2 ed., publisher American Academy of Sleep Medicine , a...

    2015

  6. [6]

    , author Budhiraja, R

    author Berry, R.B. , author Budhiraja, R. , author Gottlieb, D.J. , author Gozal, D. , author Iber, C. , author Kapur, V.K. , author Marcus, C.L. , author Mehra, R. , author Parthasarathy, S. , author Quan, S.F. , et al., year 2012 . title Rules for scoring respiratory events in sleep: update of the 2007 aasm manual for the scoring of sleep and associated...

    2012

  7. [7]

    , author Katsifodimos, A

    author Carbone, P. , author Katsifodimos, A. , author Ewen, S. , author Markl, V. , author Haridi, S. , author Tzoumas, K. , year 2015 . title Apache Flink : Stream and batch processing in a single engine . journal Bulletin of the IEEE Computer Society Technical Committee on Data Engineering volume 36 , pages 28--38

    2015

  8. [8]

    , author Guibas, L.J

    author Chazelle, B. , author Guibas, L.J. , year 1986 . title Fractional cascading: I . A data structuring technique . journal Algorithmica volume 1 , pages 133--162

    1986

Show all 28 references
  1. [9]

    , author Redline, S

    author Chen, S. , author Redline, S. , author Eden, U.T. , author Prerau, M.J. , year 2022 . title Dynamic models of obstructive sleep apnea provide robust prediction of respiratory event timing and a statistical framework for phenotype exploration . journal Sleep volume 45 , ...

    2022

  2. [10]

    , author Liao, P

    author Chung, F. , author Liao, P. , author Elsaid, H. , author Islam, S. , author Shapiro, C.M. , author Sun, Y. , year 2012 . title Oxygen desaturation index from nocturnal oximetry: a sensitive and specific tool to detect sleep-disordered breathing in surgical patients . jo...

    2012

  3. [11]

    , author Kapur, V.K

    author Donovan, L.M. , author Kapur, V.K. , year 2016 . title Prevalence and characteristics of central compared to obstructive sleep apnea: analyses from the sleep heart health study cohort . journal Sleep volume 39 , pages 1353--1359

    2016

  4. [12]

    , year 2024

    author EsperTech Inc. , year 2024 . title Esper -- Complex Event Processing . howpublished https://www.espertech.com/esper/ . note Accessed: May 19, 2025

    2024

  5. [13]

    title Information technology --- database languages --- SQL --- part 2: Foundation ( SQL/Foundation )

    author ISO/IEC 9075-2:2016 , year 2016 . title Information technology --- database languages --- SQL --- part 2: Foundation ( SQL/Foundation ) . howpublished International Organization for Standardization . note Row Pattern Recognition ( MATCH\_RECOGNIZE )

    2016

  6. [14]

    , year 1978

    author Lueker, G.S. , year 1978 . title A data structure for orthogonal range queries , in: booktitle 19th Annual Symposium on Foundations of Computer Science (sfcs 1978) , publisher IEEE . pp. pages 28--34

    1978

  7. [15]

    , author Karuga, F.F

    author Malicki, M. , author Karuga, F.F. , author Szmyd, B. , author Sochal, M. , author Gabryelska, A. , year 2022 . title Obstructive sleep apnea, circadian clock disruption, and metabolic consequences . journal Metabolites volume 13 , pages 60

    2022

  8. [16]

    , author Eran, A

    author Mao, C. , author Eran, A. , author Luo, Y. , year 2019 . title Efficient genomic interval queries using augmented range trees . journal Scientific Reports volume 9 , pages 5059

    2019

  9. [17]

    title Temporal tables: System-versioned temporal tables

    author Microsoft Corporation , year 2016 . title Temporal tables: System-versioned temporal tables . howpublished SQL Server Technical Documentation. https://learn.microsoft.com/en-us/sql/relational-databases/tables/temporal-tables

    2016

  10. [18]

    , year 2012

    author Mokhlesi, B. , year 2012 . title Rem-related obstructive sleep apnea: to treat or not to treat? journal Journal of Clinical Sleep Medicine volume 8 , pages 249--250

    2012

  11. [19]

    , author Shahar, Y

    author Moskovitch, R. , author Shahar, Y. , year 2015 . title Fast time intervals mining using the transitivity of temporal relations . journal Knowledge and Information Systems volume 42 , pages 21--48

    2015

  12. [20]

    O z c ep, \

    author \"O z c ep, \"O .L. , author M \"o ller, R. , author Neuenstadt, C. , year 2014 . title A stream-temporal query language for ontology based data access , in: booktitle Proceedings of the 37th German Conference on Artificial Intelligence , pp. pages 183--194

    2014

  13. [21]

    , author Lenczyk, M

    author Patel, R. , author Lenczyk, M. , author Hannallah, R.S. , author McGill, W.A. , year 1994 . title Age and the onset of desaturation in apnoeic children . journal Canadian journal of anaesthesia volume 41 , pages 771--774

    1994

  14. [22]

    , author Stebbens, V.A

    author Poets, C.F. , author Stebbens, V.A. , author Samuels, M.P. , author Southall, D.P. , year 1993 . title The relationship between bradycardia, apnea, and hypoxemia in preterm infants . journal Pediatric research volume 34 , pages 144--147

    1993

  15. [23]

    , author Larkin, E.K

    author Rosen, C.L. , author Larkin, E.K. , author Kirchner, H.L. , author Emancipator, J.L. , author Bivins, S.F. , author Surovec, S.A. , author Martin, R.J. , author Redline, S. , year 2003 . title Prevalence and risk factors for sleep-disordered breathing in 8- to 11-year-o...

    2003

  16. [24]

    , author Flemons, W.W

    author Tsai, W.H. , author Flemons, W.W. , author Whitelaw, W.A. , author Remmers, J.E. , author Brant, R. , year 1999 . title A comparison of apnea--hypopnea indices derived from different definitions of hypopnea . journal American Journal of Respiratory and Critical Care Med...

    1999

  17. [25]

    , author Fujita, Y

    author Yamauchi, M. , author Fujita, Y. , author Kumamoto, M. , author Yoshikawa, M. , author Ohnishi, Y. , author Nakano, H. , author Inoue, T. , author Tamaki, S. , year 2015 . title Nonrapid eye movement-predominant obstructive sleep apnea: a frequent phenotype in patients ...

    2015

  18. [26]

    , year 2024

    author Zhang, G.Q. , year 2024 . title Temporal ensemble logic . journal arXiv preprint arXiv:2408.14443

    2024 arXiv

  19. [27]

    , author Cui, L

    author Zhang, G.Q. , author Cui, L. , author Mueller, R. , author Tao, S. , author Kim, M. , author Rueschman, M. , author Mariani, S. , author Mobley, D. , author Redline, S. , year 2018 . title The National Sleep Research Resource : towards a sleep data commons . journal Jou...

    2018

  20. [28]

    , author Hao, X

    author Zhang, G.Q. , author Hao, X. , author Huang, Y. , author Li, X. , author Cui, L. , year 2026 . title QEL : Rational ensemble logic for model-checking-based cohort discovery with real-world electrophysiology data . note Under review

    2026

Pith tools

Reviewed August 1, 2026 · model on record in the stance chip above.