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
Genetic information is encoded over the four nucleotide alphabet {A, C, G, T} in the form of DNA helix (double-stranded structure). This structure consists of DNA strands with opposite orientation (called Watson and Crick strands), bonded via the Watson-Crick complementarity A-T, C-G. During DNA replication, each of these strands serves as a template for the reproduction of the complementary strand so as to produce two identical copies of the original DNA helix. Thus, we can say that the Watson and Crick strands are equivalent with respect to the information they encode. The Watson-Crick complementarity is mathematically modeled as an antimorphic involution t. Hence, we can formalize the above-mentioned equivalence by the equivalence between a word and its image under t. This generalization enables us to extend the notions of periodicity and power (repetition) to those of pseudo-periodicity and pseudo-power. We call any word in u{u,t(u)}* a pseudo-power of u. With the notion of pseudo-power, we extend two problems of significance which involve power of words, that is, the Fine and Wilf's theorem and the Lyndon-Schutzenberger equation. The first theorem answers the question of how long prefix a pseudo-power of u and that of v should share to imply that u and v are pseudo-powers of some common word. Onto the length of this prefix, we provide an upper bound 2 max(|u|, |v|) + min(|u|, |v|) – gcd(|u|, |v|), and later improve it slightly. We also investigate its lower bound by constructing words u, v which cannot be written as pseudo-powers of a common word, but some of whose pseudo-powers can share a prefix of length quite close to the upper bound. The extended Lyndon-Schutzenberger equation is of the form au,qu =bv,q vg w,qw , where α(u, t(u)) ∈ {u, t(u)}e, β( v, t(v)) ∈ {v, t( v)}n, and γ(w, t( w)) ∈ {w, t(w)} m for some e, n, m ≥ 1. We ask the question of under what conditions on e, n, m, this equation implies that u, v, w ∈ {t, t(t)} + for some word t. The strongest condition we obtained so far is e ≥ 4, m, n ≥ 3. Keywords: Watson-Crick complementarity, antimorphic involution, Fine and Wilf's theorem, Lyndon-Schutzenberger equation
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.000 | 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.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