{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QG55BVCQGYUKTRNLFJLA355W3T","short_pith_number":"pith:QG55BVCQ","schema_version":"1.0","canonical_sha256":"81bbd0d4503628a9c5ab2a560df7b6dcca8f48aff89b2b18dabc3620f46a5fbe","source":{"kind":"arxiv","id":"1410.3320","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.3320","created_at":"2026-05-18T00:20:07.793086+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.3320v3","created_at":"2026-05-18T00:20:07.793086+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3320","created_at":"2026-05-18T00:20:07.793086+00:00"},{"alias_kind":"pith_short_12","alias_value":"QG55BVCQGYUK","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QG55BVCQGYUKTRNL","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QG55BVCQ","created_at":"2026-05-18T12:28:46.137349+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/QG55BVCQGYUKTRNLFJLA355W3T","json":"https://pith.science/pith/QG55BVCQGYUKTRNLFJLA355W3T.json","graph_json":"https://pith.science/api/pith-number/QG55BVCQGYUKTRNLFJLA355W3T/graph.json","events_json":"https://pith.science/api/pith-number/QG55BVCQGYUKTRNLFJLA355W3T/events.json","paper":"https://pith.science/paper/QG55BVCQ"},"agent_actions":{"view_html":"https://pith.science/pith/QG55BVCQGYUKTRNLFJLA355W3T","download_json":"https://pith.science/pith/QG55BVCQGYUKTRNLFJLA355W3T.json","view_paper":"https://pith.science/paper/QG55BVCQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.3320&json=true","fetch_graph":"https://pith.science/api/pith-number/QG55BVCQGYUKTRNLFJLA355W3T/graph.json","fetch_events":"https://pith.science/api/pith-number/QG55BVCQGYUKTRNLFJLA355W3T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QG55BVCQGYUKTRNLFJLA355W3T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QG55BVCQGYUKTRNLFJLA355W3T/action/storage_attestation","attest_author":"https://pith.science/pith/QG55BVCQGYUKTRNLFJLA355W3T/action/author_attestation","sign_citation":"https://pith.science/pith/QG55BVCQGYUKTRNLFJLA355W3T/action/citation_signature","submit_replication":"https://pith.science/pith/QG55BVCQGYUKTRNLFJLA355W3T/action/replication_record"}},"created_at":"2026-05-18T00:20:07.793086+00:00","updated_at":"2026-05-18T00:20:07.793086+00:00"}