{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:O4AUP5I2TOR27JFVBIYAZHFMU6","short_pith_number":"pith:O4AUP5I2","schema_version":"1.0","canonical_sha256":"770147f51a9ba3afa4b50a300c9caca7b7683b4ad33dffbc6172adf9561cf323","source":{"kind":"arxiv","id":"1711.03479","version":4},"attestation_state":"computed","paper":{"title":"Recurrence of Markov chain traces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Itai Benjamini, Jonathan Hermon","submitted_at":"2017-11-09T17:22:55Z","abstract_excerpt":"It is shown that transient graphs for the simple random walk do not admit a nearest neighbor transient Markov chain (not necessarily a reversible one), that crosses all edges with positive probability, while there is such chain for the square grid $\\mathbb{Z}^2$. In particular, the $d$-dimensional grid $\\mathbb{Z}^d$ admits such a Markov chain only when $d=2$. For $d=2$ we present a relevant example due to Gady Kozma, while the general statement for transient graphs is obtained by proving that for every transient irreducible Markov chain on a countable state space, which admits a stationary me"},"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":"1711.03479","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-11-09T17:22:55Z","cross_cats_sorted":[],"title_canon_sha256":"9faef7aefa452a390d0feca22971d21093b8f713335f8f2a60de097a81d740b9","abstract_canon_sha256":"69f23546a6385d702c3e0b1193bb9836991ddce8a26be8ce036b1537c4dc7678"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:03.176222Z","signature_b64":"1U7jZtR1cebX0/ysp4ryI3u0LLkpCIyq6+xe0KVEjlSmoH8Ej9qvEBvWx9ZzlcrW675SG06AT9Cxnjiy/q6MAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"770147f51a9ba3afa4b50a300c9caca7b7683b4ad33dffbc6172adf9561cf323","last_reissued_at":"2026-05-17T23:54:03.175727Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:03.175727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recurrence of Markov chain traces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Itai Benjamini, Jonathan Hermon","submitted_at":"2017-11-09T17:22:55Z","abstract_excerpt":"It is shown that transient graphs for the simple random walk do not admit a nearest neighbor transient Markov chain (not necessarily a reversible one), that crosses all edges with positive probability, while there is such chain for the square grid $\\mathbb{Z}^2$. In particular, the $d$-dimensional grid $\\mathbb{Z}^d$ admits such a Markov chain only when $d=2$. For $d=2$ we present a relevant example due to Gady Kozma, while the general statement for transient graphs is obtained by proving that for every transient irreducible Markov chain on a countable state space, which admits a stationary me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03479","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":""},"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":"1711.03479","created_at":"2026-05-17T23:54:03.175840+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03479v4","created_at":"2026-05-17T23:54:03.175840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03479","created_at":"2026-05-17T23:54:03.175840+00:00"},{"alias_kind":"pith_short_12","alias_value":"O4AUP5I2TOR2","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"O4AUP5I2TOR27JFV","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"O4AUP5I2","created_at":"2026-05-18T12:31:34.259226+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/O4AUP5I2TOR27JFVBIYAZHFMU6","json":"https://pith.science/pith/O4AUP5I2TOR27JFVBIYAZHFMU6.json","graph_json":"https://pith.science/api/pith-number/O4AUP5I2TOR27JFVBIYAZHFMU6/graph.json","events_json":"https://pith.science/api/pith-number/O4AUP5I2TOR27JFVBIYAZHFMU6/events.json","paper":"https://pith.science/paper/O4AUP5I2"},"agent_actions":{"view_html":"https://pith.science/pith/O4AUP5I2TOR27JFVBIYAZHFMU6","download_json":"https://pith.science/pith/O4AUP5I2TOR27JFVBIYAZHFMU6.json","view_paper":"https://pith.science/paper/O4AUP5I2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03479&json=true","fetch_graph":"https://pith.science/api/pith-number/O4AUP5I2TOR27JFVBIYAZHFMU6/graph.json","fetch_events":"https://pith.science/api/pith-number/O4AUP5I2TOR27JFVBIYAZHFMU6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O4AUP5I2TOR27JFVBIYAZHFMU6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O4AUP5I2TOR27JFVBIYAZHFMU6/action/storage_attestation","attest_author":"https://pith.science/pith/O4AUP5I2TOR27JFVBIYAZHFMU6/action/author_attestation","sign_citation":"https://pith.science/pith/O4AUP5I2TOR27JFVBIYAZHFMU6/action/citation_signature","submit_replication":"https://pith.science/pith/O4AUP5I2TOR27JFVBIYAZHFMU6/action/replication_record"}},"created_at":"2026-05-17T23:54:03.175840+00:00","updated_at":"2026-05-17T23:54:03.175840+00:00"}