{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2CYMEYCERBQA4JUQM25777A434","short_pith_number":"pith:2CYMEYCE","canonical_record":{"source":{"id":"1107.3377","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-07-18T08:18:50Z","cross_cats_sorted":[],"title_canon_sha256":"d06c27c2dc939cc00f1caa478de519b443cdebf97f045c3173bdfc38ed415f1d","abstract_canon_sha256":"dbdb8d725ff02c63e22062a65596110956194a9f630037b80097d64dd63ce697"},"schema_version":"1.0"},"canonical_sha256":"d0b0c2604488600e269066bbfffc1cdf0f7a2192343b8be88d6d3a26d65b2b2e","source":{"kind":"arxiv","id":"1107.3377","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3377","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3377v2","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3377","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"pith_short_12","alias_value":"2CYMEYCERBQA","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2CYMEYCERBQA4JUQ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2CYMEYCE","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2CYMEYCERBQA4JUQM25777A434","target":"record","payload":{"canonical_record":{"source":{"id":"1107.3377","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-07-18T08:18:50Z","cross_cats_sorted":[],"title_canon_sha256":"d06c27c2dc939cc00f1caa478de519b443cdebf97f045c3173bdfc38ed415f1d","abstract_canon_sha256":"dbdb8d725ff02c63e22062a65596110956194a9f630037b80097d64dd63ce697"},"schema_version":"1.0"},"canonical_sha256":"d0b0c2604488600e269066bbfffc1cdf0f7a2192343b8be88d6d3a26d65b2b2e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:04.726175Z","signature_b64":"86jWSx38Ue1si6wvgcy3BhgWDKoLmCERNDq90N8ARkUuftx+NHN39kYnXvsm0QUtScSGgC5JnnVpYGI5Ct2fCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0b0c2604488600e269066bbfffc1cdf0f7a2192343b8be88d6d3a26d65b2b2e","last_reissued_at":"2026-05-18T01:24:04.725406Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:04.725406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.3377","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-18T01:24:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IIbXTj+7XSSNV6fZSlXYxP2cR/KYVjtRAYUcB6tahibqXpVdpsshWPZrpAsGXt9mC0OHdwvT5IbD63wIn1pwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:29:33.338210Z"},"content_sha256":"ab915797758b52c05e08aaf6ad7bb20012b455c0797fa8163955eab7005cb6b1","schema_version":"1.0","event_id":"sha256:ab915797758b52c05e08aaf6ad7bb20012b455c0797fa8163955eab7005cb6b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2CYMEYCERBQA4JUQM25777A434","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"David B. Wilson, Richard W. Kenyon","submitted_at":"2011-07-18T08:18:50Z","abstract_excerpt":"We show how to compute the probabilities of various connection topologies for uniformly random spanning trees on graphs embedded in surfaces. As an application, we show how to compute the \"intensity\" of the loop-erased random walk in ${\\mathbb Z}^2$, that is, the probability that the walk from (0,0) to infinity passes through a given vertex or edge. For example, the probability that it passes through (1,0) is 5/16; this confirms a conjecture from 1994 about the stationary sandpile density on ${\\mathbb Z}^2$. We do the analogous computation for the triangular lattice, honeycomb lattice and ${\\m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3377","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-18T01:24:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4il30WtjUH3ZjceHIvf7Nt8cQCvU/08u6pUDUTg15I8zA43Dnfpl1/3B7X5zXm8h6y6yt7frWyLkhYEUHgxCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:29:33.338885Z"},"content_sha256":"f4a956e3d94da7bd051c5bb9d258d3a82a72ec4e59b6412b549f836744a3247d","schema_version":"1.0","event_id":"sha256:f4a956e3d94da7bd051c5bb9d258d3a82a72ec4e59b6412b549f836744a3247d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2CYMEYCERBQA4JUQM25777A434/bundle.json","state_url":"https://pith.science/pith/2CYMEYCERBQA4JUQM25777A434/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2CYMEYCERBQA4JUQM25777A434/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-27T15:29:33Z","links":{"resolver":"https://pith.science/pith/2CYMEYCERBQA4JUQM25777A434","bundle":"https://pith.science/pith/2CYMEYCERBQA4JUQM25777A434/bundle.json","state":"https://pith.science/pith/2CYMEYCERBQA4JUQM25777A434/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2CYMEYCERBQA4JUQM25777A434/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2CYMEYCERBQA4JUQM25777A434","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":"dbdb8d725ff02c63e22062a65596110956194a9f630037b80097d64dd63ce697","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-07-18T08:18:50Z","title_canon_sha256":"d06c27c2dc939cc00f1caa478de519b443cdebf97f045c3173bdfc38ed415f1d"},"schema_version":"1.0","source":{"id":"1107.3377","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3377","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3377v2","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3377","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"pith_short_12","alias_value":"2CYMEYCERBQA","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2CYMEYCERBQA4JUQ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2CYMEYCE","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:f4a956e3d94da7bd051c5bb9d258d3a82a72ec4e59b6412b549f836744a3247d","target":"graph","created_at":"2026-05-18T01:24:04Z","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":"We show how to compute the probabilities of various connection topologies for uniformly random spanning trees on graphs embedded in surfaces. As an application, we show how to compute the \"intensity\" of the loop-erased random walk in ${\\mathbb Z}^2$, that is, the probability that the walk from (0,0) to infinity passes through a given vertex or edge. For example, the probability that it passes through (1,0) is 5/16; this confirms a conjecture from 1994 about the stationary sandpile density on ${\\mathbb Z}^2$. We do the analogous computation for the triangular lattice, honeycomb lattice and ${\\m","authors_text":"David B. Wilson, Richard W. Kenyon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-07-18T08:18:50Z","title":"Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3377","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:ab915797758b52c05e08aaf6ad7bb20012b455c0797fa8163955eab7005cb6b1","target":"record","created_at":"2026-05-18T01:24:04Z","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":"dbdb8d725ff02c63e22062a65596110956194a9f630037b80097d64dd63ce697","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-07-18T08:18:50Z","title_canon_sha256":"d06c27c2dc939cc00f1caa478de519b443cdebf97f045c3173bdfc38ed415f1d"},"schema_version":"1.0","source":{"id":"1107.3377","kind":"arxiv","version":2}},"canonical_sha256":"d0b0c2604488600e269066bbfffc1cdf0f7a2192343b8be88d6d3a26d65b2b2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0b0c2604488600e269066bbfffc1cdf0f7a2192343b8be88d6d3a26d65b2b2e","first_computed_at":"2026-05-18T01:24:04.725406Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:04.725406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"86jWSx38Ue1si6wvgcy3BhgWDKoLmCERNDq90N8ARkUuftx+NHN39kYnXvsm0QUtScSGgC5JnnVpYGI5Ct2fCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:04.726175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.3377","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab915797758b52c05e08aaf6ad7bb20012b455c0797fa8163955eab7005cb6b1","sha256:f4a956e3d94da7bd051c5bb9d258d3a82a72ec4e59b6412b549f836744a3247d"],"state_sha256":"287b44847dd5011117a4c4f6c040655e82806221e5e4dc135207bf95ff0a9ec4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hjZMZghHTo9fLr/vhb/wutL7vWMhISWT8XAYMr8rc/Co6AYOtmdfKdp5wp0A9GwopNNM9J2EOj5HAbkNRK4oBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:29:33.341831Z","bundle_sha256":"ef6ccca42b0c2f80cfe2ca04dfa31149eba82d0b8347175a71c1fb8402bdc7d8"}}