{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2000:NTKT7RFPLULOWOQMTYFKWEDHHC","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":"d29f1c14ccba49ee3878eeb3046cae2bcd3ad1a811cb31d6ca0c6daa5885448b","cross_cats_sorted":["math-ph","math.CO","math.MG","math.MP"],"license":"","primary_cat":"math.PR","submitted_at":"2000-11-02T20:48:47Z","title_canon_sha256":"f26c0ed930eba6d54b070b23817ef3d288648f8328384496ecff2e4b7f69cbb0"},"schema_version":"1.0","source":{"id":"math/0011019","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0011019","created_at":"2026-07-04T15:28:55Z"},{"alias_kind":"arxiv_version","alias_value":"math/0011019v4","created_at":"2026-07-04T15:28:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0011019","created_at":"2026-07-04T15:28:55Z"},{"alias_kind":"pith_short_12","alias_value":"NTKT7RFPLULO","created_at":"2026-07-04T15:28:55Z"},{"alias_kind":"pith_short_16","alias_value":"NTKT7RFPLULOWOQM","created_at":"2026-07-04T15:28:55Z"},{"alias_kind":"pith_short_8","alias_value":"NTKT7RFP","created_at":"2026-07-04T15:28:55Z"}],"graph_snapshots":[{"event_id":"sha256:6a0844aaf4dae387adf2cf757ab5025295086ae5d676d28bb5420703998379c1","target":"graph","created_at":"2026-07-04T15:28:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0011019/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Suppose that $G_j$ is a sequence of finite connected planar graphs, and in each $G_j$ a special vertex, called the root, is chosen randomly-uniformly. We introduce the notion of a distributional limit $G$ of such graphs. Assume that the vertex degrees of the vertices in $G_j$ are bounded, and the bound does not depend on $j$. Then after passing to a subsequence, the limit exists, and is a random rooted graph $G$. We prove that with probability one $G$ is recurrent. The proof involves the Circle Packing Theorem. The motivation for this work comes from the theory of random spherical triangulatio","authors_text":"Itai Benjamini, Oded Schramm","cross_cats":["math-ph","math.CO","math.MG","math.MP"],"headline":"","license":"","primary_cat":"math.PR","submitted_at":"2000-11-02T20:48:47Z","title":"Recurrence of Distributional Limits of Finite Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0011019","kind":"arxiv","version":4},"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:fdaf69e2de5fced122dcd78dc54f97ec9e02156ef6791bb466b5a76392c51c99","target":"record","created_at":"2026-07-04T15:28:55Z","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":"d29f1c14ccba49ee3878eeb3046cae2bcd3ad1a811cb31d6ca0c6daa5885448b","cross_cats_sorted":["math-ph","math.CO","math.MG","math.MP"],"license":"","primary_cat":"math.PR","submitted_at":"2000-11-02T20:48:47Z","title_canon_sha256":"f26c0ed930eba6d54b070b23817ef3d288648f8328384496ecff2e4b7f69cbb0"},"schema_version":"1.0","source":{"id":"math/0011019","kind":"arxiv","version":4}},"canonical_sha256":"6cd53fc4af5d16eb3a0c9e0aab106738825e8411717734eb6cbac073cf13baa4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cd53fc4af5d16eb3a0c9e0aab106738825e8411717734eb6cbac073cf13baa4","first_computed_at":"2026-07-04T15:28:55.278702Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:28:55.278702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YsKCIiP30uI6pm4BgLZ7p0kwSjLFmyPbls8S5DuYhYTP87u4OCKyVa7xGdecnU1wQsa4f6qxVfyeunlXI9cLCA==","signature_status":"signed_v1","signed_at":"2026-07-04T15:28:55.279131Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0011019","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdaf69e2de5fced122dcd78dc54f97ec9e02156ef6791bb466b5a76392c51c99","sha256:6a0844aaf4dae387adf2cf757ab5025295086ae5d676d28bb5420703998379c1"],"state_sha256":"5d2e6349211912d58a21c085c7ea920d9386e71c32ea2946c20bb4ed9a632403"}