{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GNHATX5WCPYNTAA5I6HAMJOEX3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"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}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13009","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13009v1","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13009","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"GNHATX5WCPYN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GNHATX5WCPYNTAA5","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GNHATX5W","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:18292caf85107d093ce5d4acc8a6247bbbbd31f47f514d493c096311b044702a","target":"graph","created_at":"2026-05-18T03:09:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That incomplete replication attempts are discarded after a fixed threshold time and that disorder reliably incurs a measurable time penalty sufficient to drive selection."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Discarding unfinished replication attempts after a fixed time threshold automatically imposes ordered sequences on the fastest-growing populations."}],"snapshot_sha256":"a28bea26f294601cf7ddb180efd393f29a276516e41faaa16b3fbd82242de6c4"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"56f0a0bee5953670a6d77cf70d50a8a568998d8c4e3f8dedcbe79c4f42784f22"},"paper":{"abstract_excerpt":"Biological systems perform complex multi-step processes in a reproducible way despite underlying stochasticity. The standard explanation is micromanagement by molecular machinery that recognizes and corrects specific errors. Here we study conditioning, a qualitatively different strategy in which attempts failing a coarse criterion are destroyed and do not leave a physical record. The surviving, i.e., conditioned, ensemble is narrower and therefore more ordered. We model conditioning through stochastic resets in a ''socks-before-shoes'' model of a growing population, where $n$ actions must be c","authors_text":"Arvind Murugan, Constantine G. Evans, Jack W. Szostak, Kabir Husain, Marco Ribezzi-Crivellari, Riccardo Ravasio, Rob Phillips","cross_cats":["physics.bio-ph"],"headline":"Discarding unfinished replication attempts after a fixed time threshold automatically imposes ordered sequences on the fastest-growing populations.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-bio.PE","submitted_at":"2026-05-13T05:02:18Z","title":"Conditioning as a route to stereotyped behavior in growing populations"},"references":{"count":63,"internal_anchors":0,"resolved_work":63,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"S11) forf growth(Tr) on a grid ofT r values","work_id":"626d7479-f75f-4332-aa46-2092b2dcbaa4","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Optimize overT r to obtainT ∗ r (s), ∆S ∗(s), andf ∗ growth(s)","work_id":"8546611c-4848-4c74-8429-32bf38476e69","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"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","work_id":"04e1fd02-2e7d-436f-b065-a20d17fcb814","year":null},{"cited_arxiv_id":"","doi":"10.1016/j.cels.2017.08.015","is_internal_anchor":false,"ref_index":4,"title":"J. Lin and A. Amir, Cell Systems5, 10.1016/j.cels.2017.08.015 (2017)","work_id":"ef5cc1a0-bf21-4fa3-9b48-442379bb4f50","year":2017},{"cited_arxiv_id":"","doi":"10.1103/physrevlett.118.085501","is_internal_anchor":false,"ref_index":5,"title":"Y. Lahini, O. Gottesman, A. Amir, and S. M. Rubinstein, Physical Review Letters118, 10.1103/PhysRevLett.118.085501 (2017)","work_id":"c7bce164-f6fc-407b-aceb-ba773af3b49f","year":2017}],"snapshot_sha256":"a45a92f260f0bcfb7de3ae731066bd4ead40a482bd4a8f1fbfbe2e96221b0aff"},"source":{"id":"2605.13009","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T02:08:42.226594Z","id":"44d483c6-769a-4b3f-b7e8-3257ac24911e","model_set":{"reader":"grok-4.3"},"one_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.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Discarding unfinished replication attempts after a fixed time threshold automatically imposes ordered sequences on the fastest-growing populations.","strongest_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.","weakest_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."}},"verdict_id":"44d483c6-769a-4b3f-b7e8-3257ac24911e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0f8b72b3abd17ab082265cde97560b592384a1f82f3367ba72cbad6ba9c03358","target":"record","created_at":"2026-05-18T03:09:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"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}},"canonical_sha256":"334e09dfb613f0d9801d478e0625c4befeda29266b70b88d30636fa9107fe59d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"334e09dfb613f0d9801d478e0625c4befeda29266b70b88d30636fa9107fe59d","first_computed_at":"2026-05-18T03:09:00.275530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:00.275530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"je06rk8Hb//4h8QZBHY3hoNzjzBpop+wZIO4FZ1qaIH3yLPz0WG7bE7NOeqjLxx3I/A9/yXxPbDum0ZTS4zeBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:00.276197Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13009","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f8b72b3abd17ab082265cde97560b592384a1f82f3367ba72cbad6ba9c03358","sha256:18292caf85107d093ce5d4acc8a6247bbbbd31f47f514d493c096311b044702a"],"state_sha256":"ec7a9766808ef4ba2971ad8c3a77660c0e2b0a4c7d196438ff37ba963ab7a99a"}