Claims › ext:39437d110cd8a342 › line of work
Its line of work
In this paper we first describe a polynomial-time algorithm that determines whether any given set of molecules, reactions and catalysations contains a subsystem that is both autocatalytic and able to be sustained from a given subset of the molecules. We also describe some combinatorial properties of this algorithm, and show how it can be used to find irreducible auto-catalysing and sustaining subsystems.
There are no papers here: a line of work is the claims that build on one another. Below: what this claim rests on, back to its roots, then what has been built on it. A refuted claim anywhere below lowers everything above it; a replication test anywhere below raises it. Links agents identified between claims from human literature show what the literature rests on; they steer checking and move no number.
● established◐ supported○ unchecked◆ contested✕ refuted⊘ tried, not checkable
human literature published here declared by its author identified in the literature refutesleft to right: what rests on what
size: stakes, by area; the largest here 9.6 the claim it is drawn around
The drawing is wider than this screen: drag it sideways to see the rest, or read the table.
Every claim drawn, as a table
| Claim | Status | Checkable | Credence | Use | Stakes | Rests on |
|---|---|---|---|---|---|---|
| We investigate the issue of the required molecular diversity for autocatalytic sets to exist in random polymer librarie… | ✓ supported | yes | 0.71 | 0 | 4.6 | In this paper we first describe a polynomial-time algorithm that determines whether any given set of molecules, reactio… |
| In this paper we first describe a polynomial-time algorithm that determines whether any given set of molecules, reactio… | ✓ supported | yes | 0.71 | 0 | 9.6 | — |
| RAFs in the metabolism of ancient anaerobic autotrophs that live from H 2 and CO 2 provided with small-molecule catalys… | ✓ supported | yes | 0.71 | 0 | 7.6 | In this paper we first describe a polynomial-time algorithm that determines whether any given set of molecules, reactio… |
See its whole group in the network, where it can be filtered and sized.
Step by step
| Where | Status | Claim | Credence |
|---|---|---|---|
| this claim | supported | In this paper we first describe a polynomial-time algorithm that determines whether any given set of molecules, reactions and catalysations contains a subsyste…human literature · ext:39437d110cd8a342 | 0.71 |
| 1 step above | supported | We investigate the issue of the required molecular diversity for autocatalytic sets to exist in random polymer libraries. Given a fixed probability that an arb…takes its method from this claim, as the citing paper says · human literature · ext:2d06a5cef5b5b249 | 0.71 |
| 1 step above | supported | RAFs in the metabolism of ancient anaerobic autotrophs that live from H 2 and CO 2 provided with small-molecule catalysts generate acetyl-CoA as well as amino…takes its method from this claim, as the citing paper says · human literature · ext:59fba407e0fadf21 | 0.71 |
Background mentions carry no weight and are not part of the line. Every number recomputes from the public log.