{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:S64L652PG3SJ43IAKDCZ5MSXFE","short_pith_number":"pith:S64L652P","canonical_record":{"source":{"id":"1808.08940","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-27T17:39:40Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"7fef52222b9ee66f7757f72dfa857c6daf23d9efb387488da5a0b44eaa5d42ef","abstract_canon_sha256":"3b59ce131283b3ddff2fa7604d1e4010100e7c208ec1aa56056c1032a29a19c7"},"schema_version":"1.0"},"canonical_sha256":"97b8bf774f36e49e6d0050c59eb257292bac7e9eabadef54478047117a23a83f","source":{"kind":"arxiv","id":"1808.08940","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08940","created_at":"2026-05-17T23:39:32Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08940v2","created_at":"2026-05-17T23:39:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08940","created_at":"2026-05-17T23:39:32Z"},{"alias_kind":"pith_short_12","alias_value":"S64L652PG3SJ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S64L652PG3SJ43IA","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S64L652P","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:S64L652PG3SJ43IAKDCZ5MSXFE","target":"record","payload":{"canonical_record":{"source":{"id":"1808.08940","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-27T17:39:40Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"7fef52222b9ee66f7757f72dfa857c6daf23d9efb387488da5a0b44eaa5d42ef","abstract_canon_sha256":"3b59ce131283b3ddff2fa7604d1e4010100e7c208ec1aa56056c1032a29a19c7"},"schema_version":"1.0"},"canonical_sha256":"97b8bf774f36e49e6d0050c59eb257292bac7e9eabadef54478047117a23a83f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:32.247820Z","signature_b64":"XCpZ536qCF4VRk5qNCNmM4vrRZJpVBWls1fYha8bJgddnVQIXh8rlFCCi5Zg0oEltt3+IzNTH7K73tLeNe6CCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97b8bf774f36e49e6d0050c59eb257292bac7e9eabadef54478047117a23a83f","last_reissued_at":"2026-05-17T23:39:32.247052Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:32.247052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.08940","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-17T23:39:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ASVxUO8vc+Z9X/9OXi2iipfVBolD1b4z8/BC+77R8oS+RdTbk7eaq4dQxL4G/aScAT+kApB8hD3ppOeQJNblCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:01:15.403012Z"},"content_sha256":"4196fcae0aa3c723d095dcfc8c756f5d627acc1af95c6e49a97ef18ec6918a98","schema_version":"1.0","event_id":"sha256:4196fcae0aa3c723d095dcfc8c756f5d627acc1af95c6e49a97ef18ec6918a98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:S64L652PG3SJ43IAKDCZ5MSXFE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Locality of the critical probability for transitive graphs of exponential growth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Tom Hutchcroft","submitted_at":"2018-08-27T17:39:40Z","abstract_excerpt":"Around 2008, Schramm conjectured that the critical probabilities for Bernoulli bond percolation satisfy the following continuity property: If $(G_n)_{n\\geq 1}$ is a sequence of transitive graphs converging locally to a transitive graph $G$ and $\\limsup_{n\\to\\infty} p_c(G_n) < 1$, then $ p_c(G_n)\\to p_c(G)$ as $n\\to\\infty$. We verify this conjecture under the additional hypothesis that there is a uniform exponential lower bound on the volume growth of the graphs in question. The result is new even in the case that the sequence of graphs is uniformly nonamenable.\n  In the unimodular case, this r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08940","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-17T23:39:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pbKaqxfrq8/XoJOi0K3C230EuACuZBMcNNtqZAdX7+CBE3LiKJnyJsm95UEfSoQ5mYnhyWpOA9yjE+SdPkPAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:01:15.403376Z"},"content_sha256":"e4e34b2ccb65368b918d04568562347b47cbb8ab2ca61398bddba586b3b35964","schema_version":"1.0","event_id":"sha256:e4e34b2ccb65368b918d04568562347b47cbb8ab2ca61398bddba586b3b35964"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S64L652PG3SJ43IAKDCZ5MSXFE/bundle.json","state_url":"https://pith.science/pith/S64L652PG3SJ43IAKDCZ5MSXFE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S64L652PG3SJ43IAKDCZ5MSXFE/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-30T20:01:15Z","links":{"resolver":"https://pith.science/pith/S64L652PG3SJ43IAKDCZ5MSXFE","bundle":"https://pith.science/pith/S64L652PG3SJ43IAKDCZ5MSXFE/bundle.json","state":"https://pith.science/pith/S64L652PG3SJ43IAKDCZ5MSXFE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S64L652PG3SJ43IAKDCZ5MSXFE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:S64L652PG3SJ43IAKDCZ5MSXFE","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":"3b59ce131283b3ddff2fa7604d1e4010100e7c208ec1aa56056c1032a29a19c7","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-27T17:39:40Z","title_canon_sha256":"7fef52222b9ee66f7757f72dfa857c6daf23d9efb387488da5a0b44eaa5d42ef"},"schema_version":"1.0","source":{"id":"1808.08940","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08940","created_at":"2026-05-17T23:39:32Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08940v2","created_at":"2026-05-17T23:39:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08940","created_at":"2026-05-17T23:39:32Z"},{"alias_kind":"pith_short_12","alias_value":"S64L652PG3SJ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S64L652PG3SJ43IA","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S64L652P","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:e4e34b2ccb65368b918d04568562347b47cbb8ab2ca61398bddba586b3b35964","target":"graph","created_at":"2026-05-17T23:39:32Z","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":"Around 2008, Schramm conjectured that the critical probabilities for Bernoulli bond percolation satisfy the following continuity property: If $(G_n)_{n\\geq 1}$ is a sequence of transitive graphs converging locally to a transitive graph $G$ and $\\limsup_{n\\to\\infty} p_c(G_n) < 1$, then $ p_c(G_n)\\to p_c(G)$ as $n\\to\\infty$. We verify this conjecture under the additional hypothesis that there is a uniform exponential lower bound on the volume growth of the graphs in question. The result is new even in the case that the sequence of graphs is uniformly nonamenable.\n  In the unimodular case, this r","authors_text":"Tom Hutchcroft","cross_cats":["math-ph","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-27T17:39:40Z","title":"Locality of the critical probability for transitive graphs of exponential growth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08940","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:4196fcae0aa3c723d095dcfc8c756f5d627acc1af95c6e49a97ef18ec6918a98","target":"record","created_at":"2026-05-17T23:39:32Z","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":"3b59ce131283b3ddff2fa7604d1e4010100e7c208ec1aa56056c1032a29a19c7","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-27T17:39:40Z","title_canon_sha256":"7fef52222b9ee66f7757f72dfa857c6daf23d9efb387488da5a0b44eaa5d42ef"},"schema_version":"1.0","source":{"id":"1808.08940","kind":"arxiv","version":2}},"canonical_sha256":"97b8bf774f36e49e6d0050c59eb257292bac7e9eabadef54478047117a23a83f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97b8bf774f36e49e6d0050c59eb257292bac7e9eabadef54478047117a23a83f","first_computed_at":"2026-05-17T23:39:32.247052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:32.247052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XCpZ536qCF4VRk5qNCNmM4vrRZJpVBWls1fYha8bJgddnVQIXh8rlFCCi5Zg0oEltt3+IzNTH7K73tLeNe6CCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:32.247820Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.08940","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4196fcae0aa3c723d095dcfc8c756f5d627acc1af95c6e49a97ef18ec6918a98","sha256:e4e34b2ccb65368b918d04568562347b47cbb8ab2ca61398bddba586b3b35964"],"state_sha256":"368b455ac7b8d8ce7d72cf2fdcc7e962a8c46a9ff32f36f72c1a0bb68db387a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"af4jku2b9U3QTV9oAXD8HhkXC7omRugrzzIuY2ZSbUF5n/rjMgcp+fQc61se7J8Xn3vRahbzTcuVq3tZhWGGAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:01:15.405402Z","bundle_sha256":"c2a5dc467d5103dce757138326437d043d32a98de159def998cf9a51a946d605"}}