Centrality in connected graphs via convexity or concavity
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
In graph theory, several central parts of graphs have been defined. The center, median and the security center are three such concepts defined for any connected graph, while others are specific to trees. These definitions typically involve a function defined on the vertex set of the graph. This paper generalizes the concepts of convex and concave functions, originally defined for trees, to connected graphs. Using this, we provide a unified approach to prove the known results that each of the center, median, and security center of a connected graph is either a cut vertex or lies within a block. Additionally, we introduce three new central parts of a connected graph as generalizations of the subtree core, core vertices, and characteristic set of a tree, and examine their properties in relation to the center, median, and security center. We also show that for any graph G, there exists a supergraph G' such that the subgraph induced by the characteristic center of G' is isomorphic to G. Finally, we propose several open problems related to subgraph core and core center.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 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