{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QG55BVCQGYUKTRNLFJLA355W3T","short_pith_number":"pith:QG55BVCQ","canonical_record":{"source":{"id":"1410.3320","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-10-13T14:15:10Z","cross_cats_sorted":[],"title_canon_sha256":"6d5b226abd626e94c1525f60cc8db4c8e8e031fad6f09b208b8f531005981cb8","abstract_canon_sha256":"5ae9ec3a32a40370276fea14ebdf000bbc2d1fb0bc98833e6e9ab57e97f22646"},"schema_version":"1.0"},"canonical_sha256":"81bbd0d4503628a9c5ab2a560df7b6dcca8f48aff89b2b18dabc3620f46a5fbe","source":{"kind":"arxiv","id":"1410.3320","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3320","created_at":"2026-05-18T00:20:07Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3320v3","created_at":"2026-05-18T00:20:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3320","created_at":"2026-05-18T00:20:07Z"},{"alias_kind":"pith_short_12","alias_value":"QG55BVCQGYUK","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QG55BVCQGYUKTRNL","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QG55BVCQ","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QG55BVCQGYUKTRNLFJLA355W3T","target":"record","payload":{"canonical_record":{"source":{"id":"1410.3320","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-10-13T14:15:10Z","cross_cats_sorted":[],"title_canon_sha256":"6d5b226abd626e94c1525f60cc8db4c8e8e031fad6f09b208b8f531005981cb8","abstract_canon_sha256":"5ae9ec3a32a40370276fea14ebdf000bbc2d1fb0bc98833e6e9ab57e97f22646"},"schema_version":"1.0"},"canonical_sha256":"81bbd0d4503628a9c5ab2a560df7b6dcca8f48aff89b2b18dabc3620f46a5fbe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:07.793472Z","signature_b64":"h8ESKnv/aoAoHU47uc45lobatlTeCB3pJgVxEwIwD4edOMBUKcsDUaJxaRe0tkn0ufIvbj5476ZLf7m8GZ9lBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81bbd0d4503628a9c5ab2a560df7b6dcca8f48aff89b2b18dabc3620f46a5fbe","last_reissued_at":"2026-05-18T00:20:07.793019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:07.793019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.3320","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-18T00:20:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IVPRly4X9hYaDbgk/vO+z8RbGkwDfWJOONT8VwTV+FNnPN9YkRIkr5ZVN+/NvNyGIx2q133sqFGLTtTYEclfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:09:10.486055Z"},"content_sha256":"cb8934f1ad818ad8a717dba5c83a6466450c623d24352d70982e8d6d70758c82","schema_version":"1.0","event_id":"sha256:cb8934f1ad818ad8a717dba5c83a6466450c623d24352d70982e8d6d70758c82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QG55BVCQGYUKTRNLFJLA355W3T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the existence of accessibility in a tree-indexed percolation model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Cristian F. Coletti, Pablo M. Rodriguez, R. J. Gava","submitted_at":"2014-10-13T14:15:10Z","abstract_excerpt":"We study the accessibility percolation model on infinite trees. The model is defined by associating an absolute continuous random variable $X_v$ to each vertex $v$ of the tree. The main question to be considered is the existence or not of an infinite path of nearest neighbors $v_1,v_2,v_3\\ldots$ such that $X_{v_1}<X_{v_2}<X_{v_3}<\\cdots$ and which spans the entire graph. The event defined by the existence of such path is called {\\it{percolation}}.\n  We consider the case of the accessibility percolation model on a spherically symmetric tree with growth function given by $f(i)=\\lceil (i+1)^ \\alp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3320","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-18T00:20:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kdUgwetAWogtPhDBfm9TNeR1M8800kn5w6kiaaDKCh0y2Ef9fC9K0GOjnsLC00W/fzVfgMjaAGh1tN/Pn1qVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:09:10.486415Z"},"content_sha256":"d8aeb79d058d7292e3f06b0fc4969a3bc28eab3f5768b12ab1e5a816b340a0e7","schema_version":"1.0","event_id":"sha256:d8aeb79d058d7292e3f06b0fc4969a3bc28eab3f5768b12ab1e5a816b340a0e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QG55BVCQGYUKTRNLFJLA355W3T/bundle.json","state_url":"https://pith.science/pith/QG55BVCQGYUKTRNLFJLA355W3T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QG55BVCQGYUKTRNLFJLA355W3T/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-03T22:09:10Z","links":{"resolver":"https://pith.science/pith/QG55BVCQGYUKTRNLFJLA355W3T","bundle":"https://pith.science/pith/QG55BVCQGYUKTRNLFJLA355W3T/bundle.json","state":"https://pith.science/pith/QG55BVCQGYUKTRNLFJLA355W3T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QG55BVCQGYUKTRNLFJLA355W3T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QG55BVCQGYUKTRNLFJLA355W3T","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":"5ae9ec3a32a40370276fea14ebdf000bbc2d1fb0bc98833e6e9ab57e97f22646","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-10-13T14:15:10Z","title_canon_sha256":"6d5b226abd626e94c1525f60cc8db4c8e8e031fad6f09b208b8f531005981cb8"},"schema_version":"1.0","source":{"id":"1410.3320","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3320","created_at":"2026-05-18T00:20:07Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3320v3","created_at":"2026-05-18T00:20:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3320","created_at":"2026-05-18T00:20:07Z"},{"alias_kind":"pith_short_12","alias_value":"QG55BVCQGYUK","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QG55BVCQGYUKTRNL","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QG55BVCQ","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:d8aeb79d058d7292e3f06b0fc4969a3bc28eab3f5768b12ab1e5a816b340a0e7","target":"graph","created_at":"2026-05-18T00:20:07Z","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":"We study the accessibility percolation model on infinite trees. The model is defined by associating an absolute continuous random variable $X_v$ to each vertex $v$ of the tree. The main question to be considered is the existence or not of an infinite path of nearest neighbors $v_1,v_2,v_3\\ldots$ such that $X_{v_1}<X_{v_2}<X_{v_3}<\\cdots$ and which spans the entire graph. The event defined by the existence of such path is called {\\it{percolation}}.\n  We consider the case of the accessibility percolation model on a spherically symmetric tree with growth function given by $f(i)=\\lceil (i+1)^ \\alp","authors_text":"Cristian F. Coletti, Pablo M. Rodriguez, R. J. Gava","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-10-13T14:15:10Z","title":"On the existence of accessibility in a tree-indexed percolation model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3320","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:cb8934f1ad818ad8a717dba5c83a6466450c623d24352d70982e8d6d70758c82","target":"record","created_at":"2026-05-18T00:20:07Z","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":"5ae9ec3a32a40370276fea14ebdf000bbc2d1fb0bc98833e6e9ab57e97f22646","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-10-13T14:15:10Z","title_canon_sha256":"6d5b226abd626e94c1525f60cc8db4c8e8e031fad6f09b208b8f531005981cb8"},"schema_version":"1.0","source":{"id":"1410.3320","kind":"arxiv","version":3}},"canonical_sha256":"81bbd0d4503628a9c5ab2a560df7b6dcca8f48aff89b2b18dabc3620f46a5fbe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81bbd0d4503628a9c5ab2a560df7b6dcca8f48aff89b2b18dabc3620f46a5fbe","first_computed_at":"2026-05-18T00:20:07.793019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:07.793019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h8ESKnv/aoAoHU47uc45lobatlTeCB3pJgVxEwIwD4edOMBUKcsDUaJxaRe0tkn0ufIvbj5476ZLf7m8GZ9lBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:07.793472Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.3320","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb8934f1ad818ad8a717dba5c83a6466450c623d24352d70982e8d6d70758c82","sha256:d8aeb79d058d7292e3f06b0fc4969a3bc28eab3f5768b12ab1e5a816b340a0e7"],"state_sha256":"66c6249fa4285d1b5e1f644fce4e34ab3b1c97708c3fb25572afa189017df7e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8cbyiFUFYcuIhS+cfWTyrBlesE/TcBfjkDNjkRYq7CnHyntF2OyjOwaEmV3fMAwzctPdYgut2xKP1q5R3uz3Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:09:10.488393Z","bundle_sha256":"01e06a28c5947473afc1b1852d3df6451e39a4044ed67ce3230c28b03a1c7349"}}