{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RGB4NVW4L7F7Z5Y6NYMQHBZBCF","short_pith_number":"pith:RGB4NVW4","canonical_record":{"source":{"id":"1601.02297","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-01-11T01:32:19Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1826c8a56e5bb7a59e7169a20b4a54c210ce75805ff6527e1383a5ddacb55573","abstract_canon_sha256":"74dc5096424440c23b5127142015da84ecb18c6cf190f0606c1a69f13075e0e7"},"schema_version":"1.0"},"canonical_sha256":"8983c6d6dc5fcbfcf71e6e19038721116bebf791c1d6c6b7d7e04cbd0de8048a","source":{"kind":"arxiv","id":"1601.02297","version":10},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02297","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02297v10","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02297","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"pith_short_12","alias_value":"RGB4NVW4L7F7","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RGB4NVW4L7F7Z5Y6","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RGB4NVW4","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RGB4NVW4L7F7Z5Y6NYMQHBZBCF","target":"record","payload":{"canonical_record":{"source":{"id":"1601.02297","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-01-11T01:32:19Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1826c8a56e5bb7a59e7169a20b4a54c210ce75805ff6527e1383a5ddacb55573","abstract_canon_sha256":"74dc5096424440c23b5127142015da84ecb18c6cf190f0606c1a69f13075e0e7"},"schema_version":"1.0"},"canonical_sha256":"8983c6d6dc5fcbfcf71e6e19038721116bebf791c1d6c6b7d7e04cbd0de8048a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:09.627815Z","signature_b64":"GYAF13iOqsKtUXmalnQ6P7lb5MolXM+u28WGw4xXfp7+sIybUGZBk74dx6/Qa+zwkcvUQV7x5l9/bRqd0NphCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8983c6d6dc5fcbfcf71e6e19038721116bebf791c1d6c6b7d7e04cbd0de8048a","last_reissued_at":"2026-05-18T00:00:09.627242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:09.627242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.02297","source_version":10,"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-18T00:00:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9TVzuzJhIGL+54vWatoylf2ZQByRynGBiNbcLBHu/k1BPCVYDd4fG69QEkaGQW1VSGYjwOezYj+famt5YRP5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:01:16.648421Z"},"content_sha256":"768624df724c077f7d76b34330eaa12a5472171f8d7bcd71ed4a5601de6db83f","schema_version":"1.0","event_id":"sha256:768624df724c077f7d76b34330eaa12a5472171f8d7bcd71ed4a5601de6db83f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RGB4NVW4L7F7Z5Y6NYMQHBZBCF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Conservative and semiconservative random walks: recurrence and transience","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Vyacheslav M. Abramov","submitted_at":"2016-01-11T01:32:19Z","abstract_excerpt":"In the present paper we define conservative and semiconservative random walks in $\\mathbb{Z}^d$ and study different families of random walks. The family of symmetric random walks is one of the families of conservative random walks, and simple (P\\'olya) random walks are their representatives. The classification of random walks given in the present paper enables us to provide a new approach to random walks in $\\mathbb{Z}^d$ by reduction to birth-and-death processes. We construct nontrivial examples of recurrent random walks in $\\mathbb{Z}^d$ for any $d\\geq3$ and transient random walks in $\\mathb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02297","kind":"arxiv","version":10},"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-18T00:00:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MeDQqd+nGEbssz54bpGpxjPyvOuKs9VsBtqCs7NdlmeSBr9Tka8AXuVBZmcxcZrCgyd1GlbOTwZDSc3tDAzqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:01:16.648779Z"},"content_sha256":"f179ea0d2a9758ac62ee23b47e39c63b9b8d43718b84427d005dcc815e456686","schema_version":"1.0","event_id":"sha256:f179ea0d2a9758ac62ee23b47e39c63b9b8d43718b84427d005dcc815e456686"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RGB4NVW4L7F7Z5Y6NYMQHBZBCF/bundle.json","state_url":"https://pith.science/pith/RGB4NVW4L7F7Z5Y6NYMQHBZBCF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RGB4NVW4L7F7Z5Y6NYMQHBZBCF/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-06-11T11:01:16Z","links":{"resolver":"https://pith.science/pith/RGB4NVW4L7F7Z5Y6NYMQHBZBCF","bundle":"https://pith.science/pith/RGB4NVW4L7F7Z5Y6NYMQHBZBCF/bundle.json","state":"https://pith.science/pith/RGB4NVW4L7F7Z5Y6NYMQHBZBCF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RGB4NVW4L7F7Z5Y6NYMQHBZBCF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RGB4NVW4L7F7Z5Y6NYMQHBZBCF","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":"74dc5096424440c23b5127142015da84ecb18c6cf190f0606c1a69f13075e0e7","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-01-11T01:32:19Z","title_canon_sha256":"1826c8a56e5bb7a59e7169a20b4a54c210ce75805ff6527e1383a5ddacb55573"},"schema_version":"1.0","source":{"id":"1601.02297","kind":"arxiv","version":10}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02297","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02297v10","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02297","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"pith_short_12","alias_value":"RGB4NVW4L7F7","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RGB4NVW4L7F7Z5Y6","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RGB4NVW4","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:f179ea0d2a9758ac62ee23b47e39c63b9b8d43718b84427d005dcc815e456686","target":"graph","created_at":"2026-05-18T00:00:09Z","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":"In the present paper we define conservative and semiconservative random walks in $\\mathbb{Z}^d$ and study different families of random walks. The family of symmetric random walks is one of the families of conservative random walks, and simple (P\\'olya) random walks are their representatives. The classification of random walks given in the present paper enables us to provide a new approach to random walks in $\\mathbb{Z}^d$ by reduction to birth-and-death processes. We construct nontrivial examples of recurrent random walks in $\\mathbb{Z}^d$ for any $d\\geq3$ and transient random walks in $\\mathb","authors_text":"Vyacheslav M. Abramov","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-01-11T01:32:19Z","title":"Conservative and semiconservative random walks: recurrence and transience"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02297","kind":"arxiv","version":10},"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:768624df724c077f7d76b34330eaa12a5472171f8d7bcd71ed4a5601de6db83f","target":"record","created_at":"2026-05-18T00:00:09Z","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":"74dc5096424440c23b5127142015da84ecb18c6cf190f0606c1a69f13075e0e7","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-01-11T01:32:19Z","title_canon_sha256":"1826c8a56e5bb7a59e7169a20b4a54c210ce75805ff6527e1383a5ddacb55573"},"schema_version":"1.0","source":{"id":"1601.02297","kind":"arxiv","version":10}},"canonical_sha256":"8983c6d6dc5fcbfcf71e6e19038721116bebf791c1d6c6b7d7e04cbd0de8048a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8983c6d6dc5fcbfcf71e6e19038721116bebf791c1d6c6b7d7e04cbd0de8048a","first_computed_at":"2026-05-18T00:00:09.627242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:09.627242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GYAF13iOqsKtUXmalnQ6P7lb5MolXM+u28WGw4xXfp7+sIybUGZBk74dx6/Qa+zwkcvUQV7x5l9/bRqd0NphCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:09.627815Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.02297","source_kind":"arxiv","source_version":10}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:768624df724c077f7d76b34330eaa12a5472171f8d7bcd71ed4a5601de6db83f","sha256:f179ea0d2a9758ac62ee23b47e39c63b9b8d43718b84427d005dcc815e456686"],"state_sha256":"8a37f2fde05615953f190f4695ecd2e25b678f66e2f076ed8a5c1337d25555c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1SlKbk3meRN+1PCImmmuR9xglY6IxNizi0Vdxa9kTCrfJ5EjRq6whQham6stg9i63V6ci/36LsylTVgOE8YpCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:01:16.650844Z","bundle_sha256":"251903b120c60a3dfb68820695e48bd66ec481f3c300ca1851892e7333f9d51f"}}