{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XB4AVJCK2U22RI7XJW7XGN6PQL","short_pith_number":"pith:XB4AVJCK","canonical_record":{"source":{"id":"1304.0246","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-03-31T19:27:00Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"03139f74116db0d10cad5b908091b230aca7f80b7142460268c357566a72b276","abstract_canon_sha256":"0fa4f6a66d38ed27a73ed401eeb9dcfde985068c93e07c4bfe0db7cd45c7ef26"},"schema_version":"1.0"},"canonical_sha256":"b8780aa44ad535a8a3f74dbf7337cf82d2f84370e188fef13ca57f860f8ab76e","source":{"kind":"arxiv","id":"1304.0246","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0246","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0246v3","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0246","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"XB4AVJCK2U22","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XB4AVJCK2U22RI7X","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XB4AVJCK","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XB4AVJCK2U22RI7XJW7XGN6PQL","target":"record","payload":{"canonical_record":{"source":{"id":"1304.0246","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-03-31T19:27:00Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"03139f74116db0d10cad5b908091b230aca7f80b7142460268c357566a72b276","abstract_canon_sha256":"0fa4f6a66d38ed27a73ed401eeb9dcfde985068c93e07c4bfe0db7cd45c7ef26"},"schema_version":"1.0"},"canonical_sha256":"b8780aa44ad535a8a3f74dbf7337cf82d2f84370e188fef13ca57f860f8ab76e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:08.885471Z","signature_b64":"UIl3GYqqWitnFFmeTLJWFMlWnTue4HKqNPyw8VEQyijHqAvDbDki+hYxpPP7o1SBxsa2fn8uXFBERhTYfSxECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8780aa44ad535a8a3f74dbf7337cf82d2f84370e188fef13ca57f860f8ab76e","last_reissued_at":"2026-05-18T01:21:08.884863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:08.884863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.0246","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fcIPEKfx5nxG3/Fo3jDWu7hLVD3UppVs/SZqOMpse6Af2fgingfjMSv2Ym5fAnYsiOLtkgq7wumNYELrdlpBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:13:07.152164Z"},"content_sha256":"4dfcef850e79bffa0f66f95b8fddf199ea083c9416d97989f99318efa9001e3c","schema_version":"1.0","event_id":"sha256:4dfcef850e79bffa0f66f95b8fddf199ea083c9416d97989f99318efa9001e3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XB4AVJCK2U22RI7XJW7XGN6PQL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The number of accessible paths in the hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"math.PR","authors_text":"\\'Eric Brunet, Julien Berestycki, Zhan Shi","submitted_at":"2013-03-31T19:27:00Z","abstract_excerpt":"Motivated by an evolutionary biology question, we study the following problem: we consider the hypercube $\\{0,1\\}^L$ where each node carries an independent random variable uniformly distributed on $[0,1]$, except $(1,1,\\ldots,1)$ which carries the value $1$ and $(0,0,\\ldots,0)$ which carries the value $x\\in[0,1]$. We study the number $\\Theta$ of paths from vertex $(0,0,\\ldots,0)$ to the opposite vertex $(1,1,\\ldots,1)$ along which the values on the nodes form an increasing sequence. We show that if the value on $(0,0,\\ldots,0)$ is set to $x=X/L$ then $\\Theta/L$ converges in law as $L\\to\\infty$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0246","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EZfAETEku1TByE3ImeGtkpQZPPvA8uVArGX13tqRpxp97MiF/50YohJCQrYznP2yKfoyVGbS/xrt62V4IRYeCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:13:07.152572Z"},"content_sha256":"f52d5d8f39eda4810e0769942d070abc03df0b662bee8d79dfbd4d7b272fb1e5","schema_version":"1.0","event_id":"sha256:f52d5d8f39eda4810e0769942d070abc03df0b662bee8d79dfbd4d7b272fb1e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XB4AVJCK2U22RI7XJW7XGN6PQL/bundle.json","state_url":"https://pith.science/pith/XB4AVJCK2U22RI7XJW7XGN6PQL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XB4AVJCK2U22RI7XJW7XGN6PQL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T23:13:07Z","links":{"resolver":"https://pith.science/pith/XB4AVJCK2U22RI7XJW7XGN6PQL","bundle":"https://pith.science/pith/XB4AVJCK2U22RI7XJW7XGN6PQL/bundle.json","state":"https://pith.science/pith/XB4AVJCK2U22RI7XJW7XGN6PQL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XB4AVJCK2U22RI7XJW7XGN6PQL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XB4AVJCK2U22RI7XJW7XGN6PQL","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":"0fa4f6a66d38ed27a73ed401eeb9dcfde985068c93e07c4bfe0db7cd45c7ef26","cross_cats_sorted":["q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-03-31T19:27:00Z","title_canon_sha256":"03139f74116db0d10cad5b908091b230aca7f80b7142460268c357566a72b276"},"schema_version":"1.0","source":{"id":"1304.0246","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0246","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0246v3","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0246","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"XB4AVJCK2U22","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XB4AVJCK2U22RI7X","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XB4AVJCK","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:f52d5d8f39eda4810e0769942d070abc03df0b662bee8d79dfbd4d7b272fb1e5","target":"graph","created_at":"2026-05-18T01:21:08Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Motivated by an evolutionary biology question, we study the following problem: we consider the hypercube $\\{0,1\\}^L$ where each node carries an independent random variable uniformly distributed on $[0,1]$, except $(1,1,\\ldots,1)$ which carries the value $1$ and $(0,0,\\ldots,0)$ which carries the value $x\\in[0,1]$. We study the number $\\Theta$ of paths from vertex $(0,0,\\ldots,0)$ to the opposite vertex $(1,1,\\ldots,1)$ along which the values on the nodes form an increasing sequence. We show that if the value on $(0,0,\\ldots,0)$ is set to $x=X/L$ then $\\Theta/L$ converges in law as $L\\to\\infty$","authors_text":"\\'Eric Brunet, Julien Berestycki, Zhan Shi","cross_cats":["q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-03-31T19:27:00Z","title":"The number of accessible paths in the hypercube"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0246","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4dfcef850e79bffa0f66f95b8fddf199ea083c9416d97989f99318efa9001e3c","target":"record","created_at":"2026-05-18T01:21:08Z","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":"0fa4f6a66d38ed27a73ed401eeb9dcfde985068c93e07c4bfe0db7cd45c7ef26","cross_cats_sorted":["q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-03-31T19:27:00Z","title_canon_sha256":"03139f74116db0d10cad5b908091b230aca7f80b7142460268c357566a72b276"},"schema_version":"1.0","source":{"id":"1304.0246","kind":"arxiv","version":3}},"canonical_sha256":"b8780aa44ad535a8a3f74dbf7337cf82d2f84370e188fef13ca57f860f8ab76e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8780aa44ad535a8a3f74dbf7337cf82d2f84370e188fef13ca57f860f8ab76e","first_computed_at":"2026-05-18T01:21:08.884863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:08.884863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UIl3GYqqWitnFFmeTLJWFMlWnTue4HKqNPyw8VEQyijHqAvDbDki+hYxpPP7o1SBxsa2fn8uXFBERhTYfSxECQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:08.885471Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.0246","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4dfcef850e79bffa0f66f95b8fddf199ea083c9416d97989f99318efa9001e3c","sha256:f52d5d8f39eda4810e0769942d070abc03df0b662bee8d79dfbd4d7b272fb1e5"],"state_sha256":"44cba2ba44750a2837d0f7f4a03082efbde3c1583ec2261d04aa8c0839f5930b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fnBQHskDRWIyofjxXkO2MExv0OayfWvcMBK8hykqjPKQ6mCIkEio/VPaUDOETr1TewXIW80ldwX9riv7NBEtAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:13:07.155041Z","bundle_sha256":"af858844759bbd7844cfa5cd34541428737366becfeb6bd0368c4ca265aa018b"}}