{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:NTKT7RFPLULOWOQMTYFKWEDHHC","short_pith_number":"pith:NTKT7RFP","schema_version":"1.0","canonical_sha256":"6cd53fc4af5d16eb3a0c9e0aab106738825e8411717734eb6cbac073cf13baa4","source":{"kind":"arxiv","id":"math/0011019","version":4},"attestation_state":"computed","paper":{"title":"Recurrence of Distributional Limits of Finite Planar Graphs","license":"","headline":"","cross_cats":["math-ph","math.CO","math.MG","math.MP"],"primary_cat":"math.PR","authors_text":"Itai Benjamini, Oded Schramm","submitted_at":"2000-11-02T20:48:47Z","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"},"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":"math/0011019","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2000-11-02T20:48:47Z","cross_cats_sorted":["math-ph","math.CO","math.MG","math.MP"],"title_canon_sha256":"f26c0ed930eba6d54b070b23817ef3d288648f8328384496ecff2e4b7f69cbb0","abstract_canon_sha256":"d29f1c14ccba49ee3878eeb3046cae2bcd3ad1a811cb31d6ca0c6daa5885448b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:28:55.279131Z","signature_b64":"YsKCIiP30uI6pm4BgLZ7p0kwSjLFmyPbls8S5DuYhYTP87u4OCKyVa7xGdecnU1wQsa4f6qxVfyeunlXI9cLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cd53fc4af5d16eb3a0c9e0aab106738825e8411717734eb6cbac073cf13baa4","last_reissued_at":"2026-07-04T15:28:55.278702Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:28:55.278702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recurrence of Distributional Limits of Finite Planar Graphs","license":"","headline":"","cross_cats":["math-ph","math.CO","math.MG","math.MP"],"primary_cat":"math.PR","authors_text":"Itai Benjamini, Oded Schramm","submitted_at":"2000-11-02T20:48:47Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0011019","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0011019/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"math/0011019","created_at":"2026-07-04T15:28:55.278773+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0011019v4","created_at":"2026-07-04T15:28:55.278773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0011019","created_at":"2026-07-04T15:28:55.278773+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTKT7RFPLULO","created_at":"2026-07-04T15:28:55.278773+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTKT7RFPLULOWOQM","created_at":"2026-07-04T15:28:55.278773+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTKT7RFP","created_at":"2026-07-04T15:28:55.278773+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/NTKT7RFPLULOWOQMTYFKWEDHHC","json":"https://pith.science/pith/NTKT7RFPLULOWOQMTYFKWEDHHC.json","graph_json":"https://pith.science/api/pith-number/NTKT7RFPLULOWOQMTYFKWEDHHC/graph.json","events_json":"https://pith.science/api/pith-number/NTKT7RFPLULOWOQMTYFKWEDHHC/events.json","paper":"https://pith.science/paper/NTKT7RFP"},"agent_actions":{"view_html":"https://pith.science/pith/NTKT7RFPLULOWOQMTYFKWEDHHC","download_json":"https://pith.science/pith/NTKT7RFPLULOWOQMTYFKWEDHHC.json","view_paper":"https://pith.science/paper/NTKT7RFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0011019&json=true","fetch_graph":"https://pith.science/api/pith-number/NTKT7RFPLULOWOQMTYFKWEDHHC/graph.json","fetch_events":"https://pith.science/api/pith-number/NTKT7RFPLULOWOQMTYFKWEDHHC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTKT7RFPLULOWOQMTYFKWEDHHC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTKT7RFPLULOWOQMTYFKWEDHHC/action/storage_attestation","attest_author":"https://pith.science/pith/NTKT7RFPLULOWOQMTYFKWEDHHC/action/author_attestation","sign_citation":"https://pith.science/pith/NTKT7RFPLULOWOQMTYFKWEDHHC/action/citation_signature","submit_replication":"https://pith.science/pith/NTKT7RFPLULOWOQMTYFKWEDHHC/action/replication_record"}},"created_at":"2026-07-04T15:28:55.278773+00:00","updated_at":"2026-07-04T15:28:55.278773+00:00"}