Number-Theoretic Sequence Design for Uncoordinated Resource Block Assignments in Relay-Assisted Machine-Type Communication Systems
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
Terminal relaying offers effective means for realizing machine-type communication (MTC) systems. However, coordinating these relaying terminals (RTs) becomes a cumbersome task as the number of RTs increases. In the absence of channel state information, the efficient utilization of RTs requires a mechanism by which RTs can autonomously assign available resource blocks (RBs) to large numbers of uncoordinated MTC devices with minimal conflicts. Unlike random RB assignments, using prescribed assignment sequences provides an opportunity for obtaining performance gains. However, realizing these gains requires optimizing RB assignments over a large set of sequences. One technique for selecting assignment sequences is based on an exhaustive search of exponential complexity over sequences generated by multiplicative cyclic groups. This technique restricts the RB assignment sequence length and does not consider sequences generated using other group operations.
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.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 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