On Two Properties of the Minimum Broadcast Time Function
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
Broadcasting is the problem of dissemination of information in which one piece of information needs to be transmitted to a group of individuals connected by an interconnection network. A widely accepted communication model for this problem is the 1-port, constant model, in which a node of the network can transmit the message only to one neighbor at a time, and the transmission time is constant, regardless the length of the message. Finding an optimum strategy for broadcasting under this model, such that this process is accomplished in minimum time, has been proved to be NP-complete for an arbitrary network. If we model the interconnection network as an undirected graph, the minimum broadcast time function associates to each vertex an integer which represents the minimum time necessary to broadcast the information stored in that vertex to all other vertices. The values of the minimum broadcast time function are known for a very restricted class of graphs, mainly regular ones, and very little is known about this function in general. In this paper we explore two new properties of this function. The first property establishes a connection between this function and the behavior of the optimal broadcast schemes. We prove an exact result for trees and we conjecture it for arbitrary graphs. The second property establishes a connection between this function and the density of the graph.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.002 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it