{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QQSHPGAZLLULKLTIMZNKENXIXL","short_pith_number":"pith:QQSHPGAZ","canonical_record":{"source":{"id":"1302.1423","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-02-06T16:27:42Z","cross_cats_sorted":["math.PR","q-bio.PE"],"title_canon_sha256":"6a1597539158dbcd24051a8e9a3c718b8a179a6ea5e782944f58f2010634e1fb","abstract_canon_sha256":"c243b64f8df1632d5e46d042c483bd23837aad4196875297519141e1a923c15a"},"schema_version":"1.0"},"canonical_sha256":"84247798195ae8b52e68665aa236e8bad7cead0b0caa3133417757bcb1e9d68e","source":{"kind":"arxiv","id":"1302.1423","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1423","created_at":"2026-05-18T03:29:06Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1423v2","created_at":"2026-05-18T03:29:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1423","created_at":"2026-05-18T03:29:06Z"},{"alias_kind":"pith_short_12","alias_value":"QQSHPGAZLLUL","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QQSHPGAZLLULKLTI","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QQSHPGAZ","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QQSHPGAZLLULKLTIMZNKENXIXL","target":"record","payload":{"canonical_record":{"source":{"id":"1302.1423","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-02-06T16:27:42Z","cross_cats_sorted":["math.PR","q-bio.PE"],"title_canon_sha256":"6a1597539158dbcd24051a8e9a3c718b8a179a6ea5e782944f58f2010634e1fb","abstract_canon_sha256":"c243b64f8df1632d5e46d042c483bd23837aad4196875297519141e1a923c15a"},"schema_version":"1.0"},"canonical_sha256":"84247798195ae8b52e68665aa236e8bad7cead0b0caa3133417757bcb1e9d68e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:06.316375Z","signature_b64":"5id6ljJEYmduZSm8Yk3kifLczsRee4HVjY/LJkZ6kjr2Gb2DCw33w+KraPgwSgUv5JOM4NcjgzNu/mz2nS73DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84247798195ae8b52e68665aa236e8bad7cead0b0caa3133417757bcb1e9d68e","last_reissued_at":"2026-05-18T03:29:06.315868Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:06.315868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.1423","source_version":2,"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-18T03:29:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rDm2GMGC7xPQFO9AcK6Q+otUMoZ73O4etEQuMYcAPStkuFzKLOrwfoZHvWULUS7vt7KfkVxoWHUJ4ilUwsW0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:33:29.073892Z"},"content_sha256":"f58f69fa372bb6c315c1172d9da6157bcd2904e4ad6883b8b6fb1e6f3855e47b","schema_version":"1.0","event_id":"sha256:f58f69fa372bb6c315c1172d9da6157bcd2904e4ad6883b8b6fb1e6f3855e47b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QQSHPGAZLLULKLTIMZNKENXIXL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accessibility percolation on n-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","q-bio.PE"],"primary_cat":"cond-mat.stat-mech","authors_text":"Joachim Krug, Stefan Nowak","submitted_at":"2013-02-06T16:27:42Z","abstract_excerpt":"Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in ascending order. For the case when the random variables are independent and identically distributed, we derive an asymptotically exact expression for the probability that there is at least one accessible path from the root to the leaves in an $n$-tree. This probability tends to 1 (0) if the branching number is increased with the height of the tree faster (slow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1423","kind":"arxiv","version":2},"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-18T03:29:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qbIInaR8XMGkbG6uKs2fyFlKCFYzFZghqox0BeVMhnx4TkoKNIaJ5AKuyNK3Cu/572Y3IsJJo6xAlsE/tvTHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:33:29.074599Z"},"content_sha256":"d3b079680cb0e42b93920217f4833582bc6615d5c8418e91960bf2dd32f40ae4","schema_version":"1.0","event_id":"sha256:d3b079680cb0e42b93920217f4833582bc6615d5c8418e91960bf2dd32f40ae4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QQSHPGAZLLULKLTIMZNKENXIXL/bundle.json","state_url":"https://pith.science/pith/QQSHPGAZLLULKLTIMZNKENXIXL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QQSHPGAZLLULKLTIMZNKENXIXL/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-05-26T10:33:29Z","links":{"resolver":"https://pith.science/pith/QQSHPGAZLLULKLTIMZNKENXIXL","bundle":"https://pith.science/pith/QQSHPGAZLLULKLTIMZNKENXIXL/bundle.json","state":"https://pith.science/pith/QQSHPGAZLLULKLTIMZNKENXIXL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QQSHPGAZLLULKLTIMZNKENXIXL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QQSHPGAZLLULKLTIMZNKENXIXL","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":"c243b64f8df1632d5e46d042c483bd23837aad4196875297519141e1a923c15a","cross_cats_sorted":["math.PR","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-02-06T16:27:42Z","title_canon_sha256":"6a1597539158dbcd24051a8e9a3c718b8a179a6ea5e782944f58f2010634e1fb"},"schema_version":"1.0","source":{"id":"1302.1423","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1423","created_at":"2026-05-18T03:29:06Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1423v2","created_at":"2026-05-18T03:29:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1423","created_at":"2026-05-18T03:29:06Z"},{"alias_kind":"pith_short_12","alias_value":"QQSHPGAZLLUL","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QQSHPGAZLLULKLTI","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QQSHPGAZ","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:d3b079680cb0e42b93920217f4833582bc6615d5c8418e91960bf2dd32f40ae4","target":"graph","created_at":"2026-05-18T03:29:06Z","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":"Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in ascending order. For the case when the random variables are independent and identically distributed, we derive an asymptotically exact expression for the probability that there is at least one accessible path from the root to the leaves in an $n$-tree. This probability tends to 1 (0) if the branching number is increased with the height of the tree faster (slow","authors_text":"Joachim Krug, Stefan Nowak","cross_cats":["math.PR","q-bio.PE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-02-06T16:27:42Z","title":"Accessibility percolation on n-trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1423","kind":"arxiv","version":2},"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:f58f69fa372bb6c315c1172d9da6157bcd2904e4ad6883b8b6fb1e6f3855e47b","target":"record","created_at":"2026-05-18T03:29:06Z","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":"c243b64f8df1632d5e46d042c483bd23837aad4196875297519141e1a923c15a","cross_cats_sorted":["math.PR","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-02-06T16:27:42Z","title_canon_sha256":"6a1597539158dbcd24051a8e9a3c718b8a179a6ea5e782944f58f2010634e1fb"},"schema_version":"1.0","source":{"id":"1302.1423","kind":"arxiv","version":2}},"canonical_sha256":"84247798195ae8b52e68665aa236e8bad7cead0b0caa3133417757bcb1e9d68e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84247798195ae8b52e68665aa236e8bad7cead0b0caa3133417757bcb1e9d68e","first_computed_at":"2026-05-18T03:29:06.315868Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:06.315868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5id6ljJEYmduZSm8Yk3kifLczsRee4HVjY/LJkZ6kjr2Gb2DCw33w+KraPgwSgUv5JOM4NcjgzNu/mz2nS73DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:06.316375Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1423","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f58f69fa372bb6c315c1172d9da6157bcd2904e4ad6883b8b6fb1e6f3855e47b","sha256:d3b079680cb0e42b93920217f4833582bc6615d5c8418e91960bf2dd32f40ae4"],"state_sha256":"eb1f6d041ca4abb7b143de211dc14cc8e93464976310a86a1956096c882c0ad9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jjs+zLpfSIuso5cvqPP38FmL8CaxrjJc3VtsnykwkK99I0P7EiDzuiSSDp7NRPAFAwCDfbMJf9Q889EN4M+EBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:33:29.078203Z","bundle_sha256":"714e0f60c9a5d0f1622b58597feb8a0234f0b35a4d0843ee9e7a65b7fb9e81be"}}