{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BESAPJCPOHAHSRAYTEW2CEPSKX","short_pith_number":"pith:BESAPJCP","schema_version":"1.0","canonical_sha256":"092407a44f71c0794418992da111f255e6403d10544dd54ada42a4c4cd9c98ee","source":{"kind":"arxiv","id":"1501.02206","version":1},"attestation_state":"computed","paper":{"title":"Accessibility percolation and first-passage site percolation on the unoriented binary hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"math.PR","authors_text":"Anders Martinsson","submitted_at":"2015-01-09T17:34:59Z","abstract_excerpt":"Inspired by biological evolution, we consider the following so-called accessibility percolation problem: The vertices of the unoriented $n$-dimensional binary hypercube are assigned independent $U(0, 1)$ weights, referred to as fitnesses. A path is considered accessible if fitnesses are strictly increasing along it. We prove that the probability that the global fitness maximum is accessible from the all zeroes vertex converges to $1-\\frac{1}{2}\\ln\\left(2+\\sqrt{5}\\right)$ as $n\\rightarrow\\infty$. Moreover, we prove that if one conditions on the location of the fitness maximum being $v$, then pr"},"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":"1501.02206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-01-09T17:34:59Z","cross_cats_sorted":["q-bio.PE"],"title_canon_sha256":"ac67cf08fa736415eabe288bfeefd446503b52120d5b65291a4db2e8ff87a20f","abstract_canon_sha256":"3c11ae0dac377999776819fb69de27cc98efa9e00a5ed3a08a4770545d4bd623"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:44.653302Z","signature_b64":"bEgk2OauNEHesQd1UvMtdaAl05rBpE7rPCUfXdtYoKO48SluSs2kgIv1C9PQ5hPernEkK5ixkP8XhXxGiTp8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"092407a44f71c0794418992da111f255e6403d10544dd54ada42a4c4cd9c98ee","last_reissued_at":"2026-05-18T02:29:44.652884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:44.652884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accessibility percolation and first-passage site percolation on the unoriented binary hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"math.PR","authors_text":"Anders Martinsson","submitted_at":"2015-01-09T17:34:59Z","abstract_excerpt":"Inspired by biological evolution, we consider the following so-called accessibility percolation problem: The vertices of the unoriented $n$-dimensional binary hypercube are assigned independent $U(0, 1)$ weights, referred to as fitnesses. A path is considered accessible if fitnesses are strictly increasing along it. We prove that the probability that the global fitness maximum is accessible from the all zeroes vertex converges to $1-\\frac{1}{2}\\ln\\left(2+\\sqrt{5}\\right)$ as $n\\rightarrow\\infty$. Moreover, we prove that if one conditions on the location of the fitness maximum being $v$, then pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02206","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":"1501.02206","created_at":"2026-05-18T02:29:44.652953+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.02206v1","created_at":"2026-05-18T02:29:44.652953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02206","created_at":"2026-05-18T02:29:44.652953+00:00"},{"alias_kind":"pith_short_12","alias_value":"BESAPJCPOHAH","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BESAPJCPOHAHSRAY","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BESAPJCP","created_at":"2026-05-18T12:29:14.074870+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/BESAPJCPOHAHSRAYTEW2CEPSKX","json":"https://pith.science/pith/BESAPJCPOHAHSRAYTEW2CEPSKX.json","graph_json":"https://pith.science/api/pith-number/BESAPJCPOHAHSRAYTEW2CEPSKX/graph.json","events_json":"https://pith.science/api/pith-number/BESAPJCPOHAHSRAYTEW2CEPSKX/events.json","paper":"https://pith.science/paper/BESAPJCP"},"agent_actions":{"view_html":"https://pith.science/pith/BESAPJCPOHAHSRAYTEW2CEPSKX","download_json":"https://pith.science/pith/BESAPJCPOHAHSRAYTEW2CEPSKX.json","view_paper":"https://pith.science/paper/BESAPJCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.02206&json=true","fetch_graph":"https://pith.science/api/pith-number/BESAPJCPOHAHSRAYTEW2CEPSKX/graph.json","fetch_events":"https://pith.science/api/pith-number/BESAPJCPOHAHSRAYTEW2CEPSKX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BESAPJCPOHAHSRAYTEW2CEPSKX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BESAPJCPOHAHSRAYTEW2CEPSKX/action/storage_attestation","attest_author":"https://pith.science/pith/BESAPJCPOHAHSRAYTEW2CEPSKX/action/author_attestation","sign_citation":"https://pith.science/pith/BESAPJCPOHAHSRAYTEW2CEPSKX/action/citation_signature","submit_replication":"https://pith.science/pith/BESAPJCPOHAHSRAYTEW2CEPSKX/action/replication_record"}},"created_at":"2026-05-18T02:29:44.652953+00:00","updated_at":"2026-05-18T02:29:44.652953+00:00"}