OrbitSI: An Orbit-based Algorithm for the Subgraph Isomorphism Search Problem
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The Subgraph Isomorphism (SI) search problem searches for embeddings of a pattern graph within a data graph. Efficient heuristic algorithms for the SI search problem are often structured around a Depth-First Search (DFS) tree-based search to find matching subgraphs. These algorithms comprise three segments: filtering, ordering and enumeration. Filtering and ordering are critical in reducing the runtime of the enumeration segment. As such, various properties of vertices are used to filter out impossible matches and determine the most efficient enumeration order. In this paper, we propose using the graphs’ local topological information to strengthen the filtering and ordering segments of a heuristic algorithm, going beyond the properties of vertices and their immediate neighbours, which make up the state-of-the-art strategies. We use orbit counts of 4-vertex graphlets to characterise the local topology near a vertex, which provides valuable structural information while keeping the computational effort for analysing the topology affordable. Our new algorithm, OrbitSI, improves the overall runtime across eight datasets, each containing one data graph and 1800 pattern graphs, by factors of 2.69 to 11.49 compared to four state-of-the-art algorithms.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it