{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RAPIOM43LOYJXZ3XCYPT5KTJN5","short_pith_number":"pith:RAPIOM43","schema_version":"1.0","canonical_sha256":"881e87339b5bb09be777161f3eaa696f456c3f29af9af68c097a7a25920bcf10","source":{"kind":"arxiv","id":"1504.03928","version":1},"attestation_state":"computed","paper":{"title":"Wired Cycle-Breaking Dynamics for Uniform Spanning Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Tom Hutchcroft","submitted_at":"2015-04-15T14:35:00Z","abstract_excerpt":"We prove that every component of the wired uniform spanning forest (WUSF) is one-ended almost surely in every transient reversible random graph, removing the bounded degree hypothesis required by earlier results. We deduce that every component of the WUSF is one-ended almost surely in every supercritical Galton-Watson tree, answering a question of Benjamini, Lyons, Peres and Schramm.\n  Our proof introduces and exploits a family of Markov chains under which the oriented WUSF is stationary, which we call the wired cycle-breaking dynamics."},"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":"1504.03928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-15T14:35:00Z","cross_cats_sorted":[],"title_canon_sha256":"029df3234b3052b79144dde42cbad68c42ef4f58a0be08e7aec1c876e5b60f55","abstract_canon_sha256":"103e54997eeb9da205bc79cd45c9363dd8f6c0d29daa553e142884c7475c24ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:20.098741Z","signature_b64":"yi1iB0o9L/gRvQRl6tYJvVacgeLy4SyvjISXXUWHBcchDaNHbXjxnO/NR8NEhPetB1HeG8kTinWoYaKsQR9EAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"881e87339b5bb09be777161f3eaa696f456c3f29af9af68c097a7a25920bcf10","last_reissued_at":"2026-05-18T00:17:20.098233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:20.098233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Wired Cycle-Breaking Dynamics for Uniform Spanning Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Tom Hutchcroft","submitted_at":"2015-04-15T14:35:00Z","abstract_excerpt":"We prove that every component of the wired uniform spanning forest (WUSF) is one-ended almost surely in every transient reversible random graph, removing the bounded degree hypothesis required by earlier results. We deduce that every component of the WUSF is one-ended almost surely in every supercritical Galton-Watson tree, answering a question of Benjamini, Lyons, Peres and Schramm.\n  Our proof introduces and exploits a family of Markov chains under which the oriented WUSF is stationary, which we call the wired cycle-breaking dynamics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03928","kind":"arxiv","version":1},"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":"1504.03928","created_at":"2026-05-18T00:17:20.098325+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.03928v1","created_at":"2026-05-18T00:17:20.098325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03928","created_at":"2026-05-18T00:17:20.098325+00:00"},{"alias_kind":"pith_short_12","alias_value":"RAPIOM43LOYJ","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RAPIOM43LOYJXZ3X","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RAPIOM43","created_at":"2026-05-18T12:29:39.896362+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/RAPIOM43LOYJXZ3XCYPT5KTJN5","json":"https://pith.science/pith/RAPIOM43LOYJXZ3XCYPT5KTJN5.json","graph_json":"https://pith.science/api/pith-number/RAPIOM43LOYJXZ3XCYPT5KTJN5/graph.json","events_json":"https://pith.science/api/pith-number/RAPIOM43LOYJXZ3XCYPT5KTJN5/events.json","paper":"https://pith.science/paper/RAPIOM43"},"agent_actions":{"view_html":"https://pith.science/pith/RAPIOM43LOYJXZ3XCYPT5KTJN5","download_json":"https://pith.science/pith/RAPIOM43LOYJXZ3XCYPT5KTJN5.json","view_paper":"https://pith.science/paper/RAPIOM43","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.03928&json=true","fetch_graph":"https://pith.science/api/pith-number/RAPIOM43LOYJXZ3XCYPT5KTJN5/graph.json","fetch_events":"https://pith.science/api/pith-number/RAPIOM43LOYJXZ3XCYPT5KTJN5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RAPIOM43LOYJXZ3XCYPT5KTJN5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RAPIOM43LOYJXZ3XCYPT5KTJN5/action/storage_attestation","attest_author":"https://pith.science/pith/RAPIOM43LOYJXZ3XCYPT5KTJN5/action/author_attestation","sign_citation":"https://pith.science/pith/RAPIOM43LOYJXZ3XCYPT5KTJN5/action/citation_signature","submit_replication":"https://pith.science/pith/RAPIOM43LOYJXZ3XCYPT5KTJN5/action/replication_record"}},"created_at":"2026-05-18T00:17:20.098325+00:00","updated_at":"2026-05-18T00:17:20.098325+00:00"}