Evidence map›Paper›PMID 38758700›Full record

ArticleProceedings of the National Academy of Sciences of the United States of America2024

An encompassed representation of timescale hierarchies in first-order reaction network.

Yutaka Nagahata, Masato Kobayashi, Mikito Toda, Satoshi Maeda, Tetsuya Taketsugu, Tamiki Komatsuzaki

Abstract read
In one paragraph

Article in Proceedings of the National Academy of Sciences of the United States of America, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. An encompassed representation of timescale hierarchies in first-order reaction network.Proceedings of the National Academy of Sciences of the United States of America · 2024
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors.

Yutaka NagahataThe Institute for Chemical Reaction Design and Discovery, Hokkaido University, Sapporo 001-0021, Japan.
Masato KobayashiThe Institute for Chemical Reaction Design and Discovery, Hokkaido University, Sapporo 001-0021, Japan.ORCID 0000-0002-4001-3581
Mikito TodaResearch Center of Mathematics for Social Creativity, Research Institute for Electronic Science, Hokkaido University, Sapporo 001-0020, Japan.ORCID 0000-0002-0913-3438
Satoshi MaedaThe Institute for Chemical Reaction Design and Discovery, Hokkaido University, Sapporo 001-0021, Japan.ORCID 0000-0001-8822-1147
Tetsuya TaketsuguThe Institute for Chemical Reaction Design and Discovery, Hokkaido University, Sapporo 001-0021, Japan.ORCID 0000-0002-1337-6694
Tamiki KomatsuzakiThe Institute for Chemical Reaction Design and Discovery, Hokkaido University, Sapporo 001-0021, Japan.ORCID 0000-0001-7175-8474

Funding

MEXT | Japan Society for the Promotion of Science (JSPS) 16K14703MEXT | Japan Society for the Promotion of Science (JSPS) 17H02940MEXT | Japan Society for the Promotion of Science (JSPS) 18H05413MEXT | Japan Society for the Promotion of Science (JSPS) 19K03653MEXT | Japan Society for the Promotion of Science (JSPS) 23H01915MEXT | Japan Society for the Promotion of Science (JSPS) 23K03265
6 · The paper itself

Abstract

Complex networks are pervasive in various fields such as chemistry, biology, and sociology. In chemistry, first-order reaction networks are represented by a set of first-order differential equations, which can be constructed from the underlying energy landscape. However, as the number of nodes increases, it becomes more challenging to understand complex kinetics across different timescales. Hence, how to construct an interpretable, coarse-graining scheme that preserves the underlying timescales of overall reactions is of crucial importance. Here, we develop a scheme to capture the underlying hierarchical subsets of nodes, and a series of coarse-grained (reduced-dimensional) rate equations between the subsets as a function of time resolution from the original reaction network. Each of the coarse-grained representations guarantees to preserve the underlying slow characteristic timescales in the original network. The crux is the construction of a lumping scheme incorporating a similarity measure in deciphering the underlying timescale hierarchy, which does not rely on the assumption of equilibrium. As an illustrative example, we apply the scheme to four-state Markovian models and Claisen rearrangement of allyl vinyl ether (AVE), and demonstrate that the reduced-dimensional representation accurately reproduces not only the slowest but also the faster timescales of overall reactions although other reduction schemes based on equilibrium assumption well reproduce the slowest timescale but fail to reproduce the second-to-fourth slowest timescales with the same accuracy. Our scheme can be applied not only to the reaction networks but also to networks in other fields, which helps us encompass their hierarchical structures of the complex kinetics over timescales.

Indexed as

energy landscapelumpingrate equationtimescale hierarchies

Identifiers

PMID38758700
PMCPMC11126998

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.