{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LSNUEBGGTGTX4OA2HGP36IOEV3","short_pith_number":"pith:LSNUEBGG","schema_version":"1.0","canonical_sha256":"5c9b4204c699a77e381a399fbf21c4aed2de392dd2dba6925210c72ed1ed4f4c","source":{"kind":"arxiv","id":"1401.6894","version":1},"attestation_state":"computed","paper":{"title":"Accessibility percolation with backsteps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"math.PR","authors_text":"\\'Eric Brunet, Julien Berestycki, Zhan Shi","submitted_at":"2014-01-27T15:36:32Z","abstract_excerpt":"Consider a graph in which each site is endowed with a value called \\emph{fitness}. A path in the graph is said to be \"open\" or \"accessible\" if the fitness values along that path is strictly increasing. We say that there is accessibility percolation between two sites when such a path between them exists. Motivated by the so called House-of-Cards model from evolutionary biology, we consider this question on the $L$-hypercube $\\{0,1\\}^L$ where the fitness values are independent random variables. We show that, in the large $L$ limit, the probability that an accessible path exists from an arbitrary"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1401.6894","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-01-27T15:36:32Z","cross_cats_sorted":["q-bio.PE"],"title_canon_sha256":"2d3f5bc7d62a6e514329f1ea804421eb5d1b5902ecdb23a03a0dd7310661018c","abstract_canon_sha256":"e1ffc9d95d18bca27d4cf924998338ecb7f2172b627128e22ecb438d89dfe0b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:00.325703Z","signature_b64":"6YNRWBlYWwWnFBKQ6sHgDqpHHl0rQm0uBehAR+CT2vbjy7RqbVKjepsxajhnuIbFIRHkWqXa9dj/V3o7GAFxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c9b4204c699a77e381a399fbf21c4aed2de392dd2dba6925210c72ed1ed4f4c","last_reissued_at":"2026-05-18T03:01:00.325040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:00.325040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accessibility percolation with backsteps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"math.PR","authors_text":"\\'Eric Brunet, Julien Berestycki, Zhan Shi","submitted_at":"2014-01-27T15:36:32Z","abstract_excerpt":"Consider a graph in which each site is endowed with a value called \\emph{fitness}. A path in the graph is said to be \"open\" or \"accessible\" if the fitness values along that path is strictly increasing. We say that there is accessibility percolation between two sites when such a path between them exists. Motivated by the so called House-of-Cards model from evolutionary biology, we consider this question on the $L$-hypercube $\\{0,1\\}^L$ where the fitness values are independent random variables. We show that, in the large $L$ limit, the probability that an accessible path exists from an arbitrary"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6894","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.6894","created_at":"2026-05-18T03:01:00.325160+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6894v1","created_at":"2026-05-18T03:01:00.325160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6894","created_at":"2026-05-18T03:01:00.325160+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSNUEBGGTGTX","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSNUEBGGTGTX4OA2","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSNUEBGG","created_at":"2026-05-18T12:28:38.356838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LSNUEBGGTGTX4OA2HGP36IOEV3","json":"https://pith.science/pith/LSNUEBGGTGTX4OA2HGP36IOEV3.json","graph_json":"https://pith.science/api/pith-number/LSNUEBGGTGTX4OA2HGP36IOEV3/graph.json","events_json":"https://pith.science/api/pith-number/LSNUEBGGTGTX4OA2HGP36IOEV3/events.json","paper":"https://pith.science/paper/LSNUEBGG"},"agent_actions":{"view_html":"https://pith.science/pith/LSNUEBGGTGTX4OA2HGP36IOEV3","download_json":"https://pith.science/pith/LSNUEBGGTGTX4OA2HGP36IOEV3.json","view_paper":"https://pith.science/paper/LSNUEBGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6894&json=true","fetch_graph":"https://pith.science/api/pith-number/LSNUEBGGTGTX4OA2HGP36IOEV3/graph.json","fetch_events":"https://pith.science/api/pith-number/LSNUEBGGTGTX4OA2HGP36IOEV3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSNUEBGGTGTX4OA2HGP36IOEV3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSNUEBGGTGTX4OA2HGP36IOEV3/action/storage_attestation","attest_author":"https://pith.science/pith/LSNUEBGGTGTX4OA2HGP36IOEV3/action/author_attestation","sign_citation":"https://pith.science/pith/LSNUEBGGTGTX4OA2HGP36IOEV3/action/citation_signature","submit_replication":"https://pith.science/pith/LSNUEBGGTGTX4OA2HGP36IOEV3/action/replication_record"}},"created_at":"2026-05-18T03:01:00.325160+00:00","updated_at":"2026-05-18T03:01:00.325160+00:00"}