System Identification Using Compressed Sensing Reveals Signaling-Decoding System by Gene Expression
Bibliographic record
Abstract
SUMMARY Cells decode information of signaling activation at a scale of tens of minutes by downstream gene expression with a scale of hours to days, leading to cell fate decisions such as cell differentiation. However, no system identification method with such different time scales exists. Here we used compressed sensing technology and developed a system identification method using data of different time scales by recovering signals of missing time points. We measured phosphorylation of ERK and CREB, immediate early gene expression products, and mRNAs of decoder genes for neurite elongation in PC12 cell differentiation and performed system identification, revealing the input–output relationships between signaling and gene expression with sensitivity such as graded or switch-like response and with time delay and gain, representing signal transfer efficiency. We predicted and validated the identified system using pharmacological perturbation. Thus, we provide a versatile method for system identification using data with different time scales. Highlights We developed a system identification method using compressed sensing. This method allowed us to find a pathway using data of different time scales. We identified a selective signaling-decoding system by gene expression. We validated the identified system by pharmacological perturbation. eTOC Blurb We describe a system identification method of molecular networks with different time-scale data using a signal recovery technique in compressed sensing.
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 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.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".