{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YSCF6MUY2GT2ZEV7UUXGHD3UUC","short_pith_number":"pith:YSCF6MUY","schema_version":"1.0","canonical_sha256":"c4845f3298d1a7ac92bfa52e638f74a08487761d221f0a2fc5955606f9a63999","source":{"kind":"arxiv","id":"1107.1226","version":2},"attestation_state":"computed","paper":{"title":"Recurrence of the $ \\mathbb{Z}^d$-valued infinite snake via unimodularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Itai Benjamini, Nicolas Curien","submitted_at":"2011-07-06T19:36:20Z","abstract_excerpt":"We use the concept of unimodular random graph to show that the branching simple random walk on $\\mathbb{Z}^{d}$ indexed by a critical geometric Galton-Watson tree conditioned to survive is recurrent if and only if $d \\leq 4$."},"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":"1107.1226","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-07-06T19:36:20Z","cross_cats_sorted":[],"title_canon_sha256":"9713fed2539d6864370dd0f22913fba1ee2ded8c7acef034817721a9b7190a5a","abstract_canon_sha256":"341a08c3c6419b8e413abca724fdcf692d46cb929af88dabf9a00f68aa4865c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:06.783372Z","signature_b64":"TwnEXKYn5CuYpj0k+iUlECX0vcO1KO9rVAAEwd8G+zZe13Lbebe65Utgn5cARr791f2LpBNYUiq1Ed+OV3IqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4845f3298d1a7ac92bfa52e638f74a08487761d221f0a2fc5955606f9a63999","last_reissued_at":"2026-05-18T02:51:06.782973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:06.782973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recurrence of the $ \\mathbb{Z}^d$-valued infinite snake via unimodularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Itai Benjamini, Nicolas Curien","submitted_at":"2011-07-06T19:36:20Z","abstract_excerpt":"We use the concept of unimodular random graph to show that the branching simple random walk on $\\mathbb{Z}^{d}$ indexed by a critical geometric Galton-Watson tree conditioned to survive is recurrent if and only if $d \\leq 4$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1226","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.1226","created_at":"2026-05-18T02:51:06.783029+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.1226v2","created_at":"2026-05-18T02:51:06.783029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1226","created_at":"2026-05-18T02:51:06.783029+00:00"},{"alias_kind":"pith_short_12","alias_value":"YSCF6MUY2GT2","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YSCF6MUY2GT2ZEV7","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YSCF6MUY","created_at":"2026-05-18T12:26:47.523578+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/YSCF6MUY2GT2ZEV7UUXGHD3UUC","json":"https://pith.science/pith/YSCF6MUY2GT2ZEV7UUXGHD3UUC.json","graph_json":"https://pith.science/api/pith-number/YSCF6MUY2GT2ZEV7UUXGHD3UUC/graph.json","events_json":"https://pith.science/api/pith-number/YSCF6MUY2GT2ZEV7UUXGHD3UUC/events.json","paper":"https://pith.science/paper/YSCF6MUY"},"agent_actions":{"view_html":"https://pith.science/pith/YSCF6MUY2GT2ZEV7UUXGHD3UUC","download_json":"https://pith.science/pith/YSCF6MUY2GT2ZEV7UUXGHD3UUC.json","view_paper":"https://pith.science/paper/YSCF6MUY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.1226&json=true","fetch_graph":"https://pith.science/api/pith-number/YSCF6MUY2GT2ZEV7UUXGHD3UUC/graph.json","fetch_events":"https://pith.science/api/pith-number/YSCF6MUY2GT2ZEV7UUXGHD3UUC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YSCF6MUY2GT2ZEV7UUXGHD3UUC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YSCF6MUY2GT2ZEV7UUXGHD3UUC/action/storage_attestation","attest_author":"https://pith.science/pith/YSCF6MUY2GT2ZEV7UUXGHD3UUC/action/author_attestation","sign_citation":"https://pith.science/pith/YSCF6MUY2GT2ZEV7UUXGHD3UUC/action/citation_signature","submit_replication":"https://pith.science/pith/YSCF6MUY2GT2ZEV7UUXGHD3UUC/action/replication_record"}},"created_at":"2026-05-18T02:51:06.783029+00:00","updated_at":"2026-05-18T02:51:06.783029+00:00"}