{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JJAPVBDLH5PI27RD6RX4XT4PGR","short_pith_number":"pith:JJAPVBDL","canonical_record":{"source":{"id":"1811.03788","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2018-11-09T06:08:39Z","cross_cats_sorted":[],"title_canon_sha256":"e8314c09415d044bf5708e069a1c180b67b478e9f6f870ef39733c5d727c398d","abstract_canon_sha256":"82d17c0fba4c8089a9b7cd2485483ab8ae30d54dc46dcc1433e6c77ed264b4e4"},"schema_version":"1.0"},"canonical_sha256":"4a40fa846b3f5e8d7e23f46fcbcf8f34709d03473a50285e9ff46898dd8c1938","source":{"kind":"arxiv","id":"1811.03788","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03788","created_at":"2026-05-17T23:48:31Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03788v2","created_at":"2026-05-17T23:48:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03788","created_at":"2026-05-17T23:48:31Z"},{"alias_kind":"pith_short_12","alias_value":"JJAPVBDLH5PI","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JJAPVBDLH5PI27RD","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JJAPVBDL","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JJAPVBDLH5PI27RD6RX4XT4PGR","target":"record","payload":{"canonical_record":{"source":{"id":"1811.03788","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2018-11-09T06:08:39Z","cross_cats_sorted":[],"title_canon_sha256":"e8314c09415d044bf5708e069a1c180b67b478e9f6f870ef39733c5d727c398d","abstract_canon_sha256":"82d17c0fba4c8089a9b7cd2485483ab8ae30d54dc46dcc1433e6c77ed264b4e4"},"schema_version":"1.0"},"canonical_sha256":"4a40fa846b3f5e8d7e23f46fcbcf8f34709d03473a50285e9ff46898dd8c1938","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:31.639356Z","signature_b64":"HF7dGtjFsM8Tfk/KY4g1JHYV+ql1rfiF+gF4aJOdT+bTbDGXAMprtqMZBCOYB/easVqgcpxuX3F3WnptLeduBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a40fa846b3f5e8d7e23f46fcbcf8f34709d03473a50285e9ff46898dd8c1938","last_reissued_at":"2026-05-17T23:48:31.638911Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:31.638911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.03788","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-17T23:48:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hSOZoNHukQIy/KrrDPg5vAlq951kr9h+mM8ZTSdKIrS/z3cI71OBnnAYYTx3ikk+2tI5/Qb/HzaMCiLXSxxCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:02:23.800190Z"},"content_sha256":"76a22e61b8dc17b0978be2e1859885eb80f3ffaf36d12c293d0185f03aee3e62","schema_version":"1.0","event_id":"sha256:76a22e61b8dc17b0978be2e1859885eb80f3ffaf36d12c293d0185f03aee3e62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JJAPVBDLH5PI27RD6RX4XT4PGR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variable-step-length algorithms for a random walk: hitting probability and computation performance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Anton Yu. Menshutin, Lev N. Shchur, Olga Klimenkova","submitted_at":"2018-11-09T06:08:39Z","abstract_excerpt":"We present a comparative study of several algorithms for an in-plane random walk with a variable step. The goal is to check the efficiency of the algorithm in the case where the random walk terminates at some boundary. We recently found that a finite step of the random walk produces a bias in the hitting probability and this bias vanishes in the limit of an infinitesimal step. Therefore, it is important to know how a change in the step size of the random walk influences the performance of simulations. We propose an algorithm with the most effective procedure for the step-length-change protocol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03788","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-17T23:48:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rrgG/1yM5gL0ylQG5s87afO77HzSrVcH0lJGgXZ88EY9iP9fkCxYnQKDmm4ofwrnod+lRnFGRPQrSwZAppmlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:02:23.800564Z"},"content_sha256":"f6196550e6174f5492dd0fd03ffe61fcb13b2e9406442657fdefa42e5dad97ae","schema_version":"1.0","event_id":"sha256:f6196550e6174f5492dd0fd03ffe61fcb13b2e9406442657fdefa42e5dad97ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJAPVBDLH5PI27RD6RX4XT4PGR/bundle.json","state_url":"https://pith.science/pith/JJAPVBDLH5PI27RD6RX4XT4PGR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJAPVBDLH5PI27RD6RX4XT4PGR/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-22T13:02:23Z","links":{"resolver":"https://pith.science/pith/JJAPVBDLH5PI27RD6RX4XT4PGR","bundle":"https://pith.science/pith/JJAPVBDLH5PI27RD6RX4XT4PGR/bundle.json","state":"https://pith.science/pith/JJAPVBDLH5PI27RD6RX4XT4PGR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJAPVBDLH5PI27RD6RX4XT4PGR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JJAPVBDLH5PI27RD6RX4XT4PGR","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":"82d17c0fba4c8089a9b7cd2485483ab8ae30d54dc46dcc1433e6c77ed264b4e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2018-11-09T06:08:39Z","title_canon_sha256":"e8314c09415d044bf5708e069a1c180b67b478e9f6f870ef39733c5d727c398d"},"schema_version":"1.0","source":{"id":"1811.03788","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03788","created_at":"2026-05-17T23:48:31Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03788v2","created_at":"2026-05-17T23:48:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03788","created_at":"2026-05-17T23:48:31Z"},{"alias_kind":"pith_short_12","alias_value":"JJAPVBDLH5PI","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JJAPVBDLH5PI27RD","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JJAPVBDL","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:f6196550e6174f5492dd0fd03ffe61fcb13b2e9406442657fdefa42e5dad97ae","target":"graph","created_at":"2026-05-17T23:48:31Z","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 present a comparative study of several algorithms for an in-plane random walk with a variable step. The goal is to check the efficiency of the algorithm in the case where the random walk terminates at some boundary. We recently found that a finite step of the random walk produces a bias in the hitting probability and this bias vanishes in the limit of an infinitesimal step. Therefore, it is important to know how a change in the step size of the random walk influences the performance of simulations. We propose an algorithm with the most effective procedure for the step-length-change protocol","authors_text":"Anton Yu. Menshutin, Lev N. Shchur, Olga Klimenkova","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2018-11-09T06:08:39Z","title":"Variable-step-length algorithms for a random walk: hitting probability and computation performance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03788","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:76a22e61b8dc17b0978be2e1859885eb80f3ffaf36d12c293d0185f03aee3e62","target":"record","created_at":"2026-05-17T23:48:31Z","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":"82d17c0fba4c8089a9b7cd2485483ab8ae30d54dc46dcc1433e6c77ed264b4e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2018-11-09T06:08:39Z","title_canon_sha256":"e8314c09415d044bf5708e069a1c180b67b478e9f6f870ef39733c5d727c398d"},"schema_version":"1.0","source":{"id":"1811.03788","kind":"arxiv","version":2}},"canonical_sha256":"4a40fa846b3f5e8d7e23f46fcbcf8f34709d03473a50285e9ff46898dd8c1938","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a40fa846b3f5e8d7e23f46fcbcf8f34709d03473a50285e9ff46898dd8c1938","first_computed_at":"2026-05-17T23:48:31.638911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:31.638911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HF7dGtjFsM8Tfk/KY4g1JHYV+ql1rfiF+gF4aJOdT+bTbDGXAMprtqMZBCOYB/easVqgcpxuX3F3WnptLeduBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:31.639356Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.03788","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76a22e61b8dc17b0978be2e1859885eb80f3ffaf36d12c293d0185f03aee3e62","sha256:f6196550e6174f5492dd0fd03ffe61fcb13b2e9406442657fdefa42e5dad97ae"],"state_sha256":"f90ba9ef31925a984e53f62a1b876a7dc8f757a0923197da9206d6e330db861c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y/5WJ8Tf5R/tjojUZJoQ60cvxR5FU9hfjs+LChhWYehMld6Xl4v1E5c63Z28jM/DVxOYsJWufnpOJARYk8aiAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T13:02:23.802490Z","bundle_sha256":"86f273fccc3d59d015dd2d6f660c6e1984016e5acb807e6daa6922b7319c6d09"}}