Pith Number

pith:GNHATX5W

pith:2026:GNHATX5WCPYNTAA5I6HAMJOEX3

not attested not anchored not stored refs resolved

Conditioning as a route to stereotyped behavior in growing populations

Arvind Murugan, Constantine G. Evans, Jack W. Szostak, Kabir Husain, Marco Ribezzi-Crivellari, Riccardo Ravasio, Rob Phillips

Discarding unfinished replication attempts after a fixed time threshold automatically imposes ordered sequences on the fastest-growing populations.

arxiv:2605.13009 v1 · 2026-05-13 · q-bio.PE · physics.bio-ph

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{GNHATX5WCPYNTAA5I6HAMJOEX3}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

When disorder carries a sufficient time penalty, this ordering is free: the fastest-growing population is automatically the most ordered, with no direct selection for order required.

C2weakest assumption

That incomplete replication attempts are discarded after a fixed threshold time and that disorder reliably incurs a measurable time penalty sufficient to drive selection.

C3one line summary

Conditioning via resets in a socks-before-shoes population model imposes hierarchical temporal ordering on multi-step processes, making fastest-growing populations automatically the most ordered when disorder incurs a time penalty.

References

63 extracted · 63 resolved · 0 Pith anchors

[1] S11) forf growth(Tr) on a grid ofT r values

[2] Optimize overT r to obtainT ∗ r (s), ∆S ∗(s), andf ∗ growth(s)

[3] In the numerical implementation,f 0,f growth(Tr), and the completion-time entropy reduction are evaluated on deterministic quadrature grids and solved by Brent root-finding

[4] J. Lin and A. Amir, Cell Systems5, 10.1016/j.cels.2017.08.015 (2017) 2017 · doi:10.1016/j.cels.2017.08.015

[5] Y. Lahini, O. Gottesman, A. Amir, and S. M. Rubinstein, Physical Review Letters118, 10.1103/PhysRevLett.118.085501 (2017) 2017 · doi:10.1103/physrevlett.118.085501

Formal links

2 machine-checked theorem links

Receipt and verification

First computed	2026-05-18T03:09:00.275530Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

334e09dfb613f0d9801d478e0625c4befeda29266b70b88d30636fa9107fe59d

Aliases

arxiv: 2605.13009 · arxiv_version: 2605.13009v1 · doi: 10.48550/arxiv.2605.13009 · pith_short_12: GNHATX5WCPYN · pith_short_16: GNHATX5WCPYNTAA5 · pith_short_8: GNHATX5W

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/GNHATX5WCPYNTAA5I6HAMJOEX3 \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 334e09dfb613f0d9801d478e0625c4befeda29266b70b88d30636fa9107fe59d

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "ad659c51f4f1462d1e5c9b35d83d9a972a7ac17528aa0b835e01c79e349eead4",
    "cross_cats_sorted": [
      "physics.bio-ph"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "q-bio.PE",
    "submitted_at": "2026-05-13T05:02:18Z",
    "title_canon_sha256": "7192a7f9df251ac595778ec2a6f22e83099bc7f1d9ccb18c24bbc9d6bb5fdb16"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.13009",
    "kind": "arxiv",
    "version": 1
  }
}