Bibliographic record
Abstract
When working with large collections of event data from a distributed application, efficient mechanisms for locating patterns of interest are of obvious practical importance. Complex patterns can most naturally be built by combining simpler patterns, but searching for such hierarchical patterns in partially ordered event data presents significant challenges. In this paper, we describe the general problem and our approach to solving it, with particular emphasis on an algorithm for constructing an appropriate closure of the events matching a sub-pattern, so that it can be used as a component at the next level of pattern matching. The work described is based on earlier work performed in the context of POET (the Partial-Order Event Tracer) from the University of Waterloo but was implemented as an Eclipse plug-in.
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.014 | 0.042 |
| Meta-epidemiology (narrow) | 0.001 | 0.002 |
| Meta-epidemiology (broad) | 0.002 | 0.003 |
| Bibliometrics | 0.004 | 0.005 |
| Science and technology studies | 0.003 | 0.004 |
| Scholarly communication | 0.006 | 0.013 |
| Open science | 0.003 | 0.009 |
| Research integrity | 0.002 | 0.004 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".