Some families of 0-rotatable graceful caterpillars
Bibliographic record
Abstract
A graceful labelling of a tree T is an injective function f: V (T) → {0, 1, . . . , |E(T)|} such that {|f(u)−f(v)|: uv ∈ E(T)} = {1, 2, . . . , |E(T)|}. A tree T is said to be 0-rotatable if, for any v ∈ V (T), there exists a graceful labelling f of T such that f(v) = 0. In this work, it is proved that the follow- ing families of caterpillars are 0-rotatable: caterpillars with perfect matching; caterpillars obtained by identifying a central vertex of a path Pn with a vertex of K2; caterpillars obtained by identifying one leaf of the star K1,s−1 to a leaf of Pn, with n ≥ 4 and s ≥ ⌈n−1/2 ⌉; caterpillars with diameter five or six; and some families of caterpillars with diameter at least seven. This result reinforces the conjecture that all caterpillars with diameter at least five are 0-rotatable.
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.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 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".