{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2001:TIWSBAF2S7HTYIXUFYWXERNCPQ","short_pith_number":"pith:TIWSBAF2","schema_version":"1.0","canonical_sha256":"9a2d2080ba97cf3c22f42e2d7245a27c02846e9eeaaf2b69c1222051975e853e","source":{"kind":"arxiv","id":"math/0107055","version":2},"attestation_state":"computed","paper":{"title":"Markov Chain Intersections and the Loop-Erased Walk","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Oded Schramm, Russell Lyons, Yuval Peres","submitted_at":"2001-07-06T20:32:49Z","abstract_excerpt":"Let X and Y be independent transient Markov chains on the same state space that have the same transition probabilities. Let L denote the ``loop-erased path'' obtained from the path of X by erasing cycles when they are created. We prove that if the paths of X and Y have infinitely many intersections a.s., then L and Y also have infinitely many intersections a.s."},"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/0107055","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2001-07-06T20:32:49Z","cross_cats_sorted":[],"title_canon_sha256":"40ee56ac5e688376393e0d13473650b6ecc52651b02328a10fc441005d48ae15","abstract_canon_sha256":"cd452a4f0dc4cfdc9257c4d85a6403942d91b45baf71640d02a32f4f479a7c17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:38:29.896004Z","signature_b64":"7+mBWAfLOfF8NOOmS57f5rWpyUIejPVtwDfeybFdzUXt2fL/6pAGBtDBNXqJaiP+cbdXp25osXAneuNVWS9zBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a2d2080ba97cf3c22f42e2d7245a27c02846e9eeaaf2b69c1222051975e853e","last_reissued_at":"2026-05-18T01:38:29.895492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:38:29.895492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Markov Chain Intersections and the Loop-Erased Walk","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Oded Schramm, Russell Lyons, Yuval Peres","submitted_at":"2001-07-06T20:32:49Z","abstract_excerpt":"Let X and Y be independent transient Markov chains on the same state space that have the same transition probabilities. Let L denote the ``loop-erased path'' obtained from the path of X by erasing cycles when they are created. We prove that if the paths of X and Y have infinitely many intersections a.s., then L and Y also have infinitely many intersections a.s."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0107055","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":"math/0107055","created_at":"2026-05-18T01:38:29.895565+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0107055v2","created_at":"2026-05-18T01:38:29.895565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0107055","created_at":"2026-05-18T01:38:29.895565+00:00"},{"alias_kind":"pith_short_12","alias_value":"TIWSBAF2S7HT","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_16","alias_value":"TIWSBAF2S7HTYIXU","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_8","alias_value":"TIWSBAF2","created_at":"2026-05-18T12:25:50.845339+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/TIWSBAF2S7HTYIXUFYWXERNCPQ","json":"https://pith.science/pith/TIWSBAF2S7HTYIXUFYWXERNCPQ.json","graph_json":"https://pith.science/api/pith-number/TIWSBAF2S7HTYIXUFYWXERNCPQ/graph.json","events_json":"https://pith.science/api/pith-number/TIWSBAF2S7HTYIXUFYWXERNCPQ/events.json","paper":"https://pith.science/paper/TIWSBAF2"},"agent_actions":{"view_html":"https://pith.science/pith/TIWSBAF2S7HTYIXUFYWXERNCPQ","download_json":"https://pith.science/pith/TIWSBAF2S7HTYIXUFYWXERNCPQ.json","view_paper":"https://pith.science/paper/TIWSBAF2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0107055&json=true","fetch_graph":"https://pith.science/api/pith-number/TIWSBAF2S7HTYIXUFYWXERNCPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/TIWSBAF2S7HTYIXUFYWXERNCPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TIWSBAF2S7HTYIXUFYWXERNCPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TIWSBAF2S7HTYIXUFYWXERNCPQ/action/storage_attestation","attest_author":"https://pith.science/pith/TIWSBAF2S7HTYIXUFYWXERNCPQ/action/author_attestation","sign_citation":"https://pith.science/pith/TIWSBAF2S7HTYIXUFYWXERNCPQ/action/citation_signature","submit_replication":"https://pith.science/pith/TIWSBAF2S7HTYIXUFYWXERNCPQ/action/replication_record"}},"created_at":"2026-05-18T01:38:29.895565+00:00","updated_at":"2026-05-18T01:38:29.895565+00:00"}