{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2VGF4Z3ZCVYIWFVFLHHOD6GNUP","short_pith_number":"pith:2VGF4Z3Z","canonical_record":{"source":{"id":"1804.10633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-04-27T18:17:16Z","cross_cats_sorted":[],"title_canon_sha256":"5fcc893ba1d2359943ebc48bd9baf35a15675b3632aba24fc41ae9f42c700c0d","abstract_canon_sha256":"309dc4a20a7580f867dfef543eaf79da3ab763f08cf14c16c263873a41aa2c04"},"schema_version":"1.0"},"canonical_sha256":"d54c5e677915708b16a559cee1f8cda3f98fd5ba70d76d872be7b506827641a8","source":{"kind":"arxiv","id":"1804.10633","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10633","created_at":"2026-05-18T00:17:16Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10633v1","created_at":"2026-05-18T00:17:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10633","created_at":"2026-05-18T00:17:16Z"},{"alias_kind":"pith_short_12","alias_value":"2VGF4Z3ZCVYI","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2VGF4Z3ZCVYIWFVF","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2VGF4Z3Z","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2VGF4Z3ZCVYIWFVFLHHOD6GNUP","target":"record","payload":{"canonical_record":{"source":{"id":"1804.10633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-04-27T18:17:16Z","cross_cats_sorted":[],"title_canon_sha256":"5fcc893ba1d2359943ebc48bd9baf35a15675b3632aba24fc41ae9f42c700c0d","abstract_canon_sha256":"309dc4a20a7580f867dfef543eaf79da3ab763f08cf14c16c263873a41aa2c04"},"schema_version":"1.0"},"canonical_sha256":"d54c5e677915708b16a559cee1f8cda3f98fd5ba70d76d872be7b506827641a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:16.044973Z","signature_b64":"a3OncrrSPqf9s0aEtlVAz6TVrawugpaaLnUnazs8qaQGob4Pipb9/OYAocEK5cev6ReE0eCH+bGoJ/ReFKkgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d54c5e677915708b16a559cee1f8cda3f98fd5ba70d76d872be7b506827641a8","last_reissued_at":"2026-05-18T00:17:16.044334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:16.044334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.10633","source_version":1,"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:17:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ofslN4KI9+cVBGs7VD44iEd0/H9ZiUB5rfb5qgZb/KSV7xXSly+5nU6Qkyw9+wAn/92IuPyAtY40RV2Q2qJ8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:57:12.480544Z"},"content_sha256":"aea339157ee863632bf26aa754dddb595db303541168daccb9932e8b633d7ff6","schema_version":"1.0","event_id":"sha256:aea339157ee863632bf26aa754dddb595db303541168daccb9932e8b633d7ff6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2VGF4Z3ZCVYIWFVFLHHOD6GNUP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stable limit laws for random walk in a sparse random environment I: moderate sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alexander Iksanov, Alexander Marynych, Alexander Roitershtein, Dariusz Buraczewski, Piotr Dyszewski","submitted_at":"2018-04-27T18:17:16Z","abstract_excerpt":"A random walk in a sparse random environment is a model introduced by Matzavinos et al. [Electron. J. Probab. 21, paper no. 72: 2016] as a generalization of both a simple symmetric random walk and a classical random walk in a random environment. A random walk $(X_n)_{n\\in \\mathbb{N}\\cup\\{0\\}}$ in a sparse random environment $(S_k,\\lambda_k)_{k\\in\\mathbb{Z}}$ is a nearest neighbor random walk on $\\mathbb{Z}$ that jumps to the left or to the right with probability $1/2$ from every point of $\\mathbb{Z}\\setminus \\{\\ldots,S_{-1},S_0=0,S_1,\\ldots\\}$ and jumps to the right (left) with the random prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10633","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"},"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:17:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MQZPQ/id0IhwbIfr2EVRtiMDtkqJ0dijLfou111n7HCJaGf2NOUA/6cXPnrjq4rt6NQ3g6FTMPwD6WJvCTCsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:57:12.480892Z"},"content_sha256":"82cdf51ed59d59dc22ed326a06af3d047cb2d5295a33a515d787e430e76f0900","schema_version":"1.0","event_id":"sha256:82cdf51ed59d59dc22ed326a06af3d047cb2d5295a33a515d787e430e76f0900"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2VGF4Z3ZCVYIWFVFLHHOD6GNUP/bundle.json","state_url":"https://pith.science/pith/2VGF4Z3ZCVYIWFVFLHHOD6GNUP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2VGF4Z3ZCVYIWFVFLHHOD6GNUP/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-05-28T12:57:12Z","links":{"resolver":"https://pith.science/pith/2VGF4Z3ZCVYIWFVFLHHOD6GNUP","bundle":"https://pith.science/pith/2VGF4Z3ZCVYIWFVFLHHOD6GNUP/bundle.json","state":"https://pith.science/pith/2VGF4Z3ZCVYIWFVFLHHOD6GNUP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2VGF4Z3ZCVYIWFVFLHHOD6GNUP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2VGF4Z3ZCVYIWFVFLHHOD6GNUP","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":"309dc4a20a7580f867dfef543eaf79da3ab763f08cf14c16c263873a41aa2c04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-04-27T18:17:16Z","title_canon_sha256":"5fcc893ba1d2359943ebc48bd9baf35a15675b3632aba24fc41ae9f42c700c0d"},"schema_version":"1.0","source":{"id":"1804.10633","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10633","created_at":"2026-05-18T00:17:16Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10633v1","created_at":"2026-05-18T00:17:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10633","created_at":"2026-05-18T00:17:16Z"},{"alias_kind":"pith_short_12","alias_value":"2VGF4Z3ZCVYI","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2VGF4Z3ZCVYIWFVF","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2VGF4Z3Z","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:82cdf51ed59d59dc22ed326a06af3d047cb2d5295a33a515d787e430e76f0900","target":"graph","created_at":"2026-05-18T00:17:16Z","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":"A random walk in a sparse random environment is a model introduced by Matzavinos et al. [Electron. J. Probab. 21, paper no. 72: 2016] as a generalization of both a simple symmetric random walk and a classical random walk in a random environment. A random walk $(X_n)_{n\\in \\mathbb{N}\\cup\\{0\\}}$ in a sparse random environment $(S_k,\\lambda_k)_{k\\in\\mathbb{Z}}$ is a nearest neighbor random walk on $\\mathbb{Z}$ that jumps to the left or to the right with probability $1/2$ from every point of $\\mathbb{Z}\\setminus \\{\\ldots,S_{-1},S_0=0,S_1,\\ldots\\}$ and jumps to the right (left) with the random prob","authors_text":"Alexander Iksanov, Alexander Marynych, Alexander Roitershtein, Dariusz Buraczewski, Piotr Dyszewski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-04-27T18:17:16Z","title":"Stable limit laws for random walk in a sparse random environment I: moderate sparsity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10633","kind":"arxiv","version":1},"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:aea339157ee863632bf26aa754dddb595db303541168daccb9932e8b633d7ff6","target":"record","created_at":"2026-05-18T00:17:16Z","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":"309dc4a20a7580f867dfef543eaf79da3ab763f08cf14c16c263873a41aa2c04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-04-27T18:17:16Z","title_canon_sha256":"5fcc893ba1d2359943ebc48bd9baf35a15675b3632aba24fc41ae9f42c700c0d"},"schema_version":"1.0","source":{"id":"1804.10633","kind":"arxiv","version":1}},"canonical_sha256":"d54c5e677915708b16a559cee1f8cda3f98fd5ba70d76d872be7b506827641a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d54c5e677915708b16a559cee1f8cda3f98fd5ba70d76d872be7b506827641a8","first_computed_at":"2026-05-18T00:17:16.044334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:16.044334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a3OncrrSPqf9s0aEtlVAz6TVrawugpaaLnUnazs8qaQGob4Pipb9/OYAocEK5cev6ReE0eCH+bGoJ/ReFKkgAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:16.044973Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.10633","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aea339157ee863632bf26aa754dddb595db303541168daccb9932e8b633d7ff6","sha256:82cdf51ed59d59dc22ed326a06af3d047cb2d5295a33a515d787e430e76f0900"],"state_sha256":"51c7160a2002f0dc2f817bf2b2222696e615315edd9a5b90bf302aedfa139ff4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ilDHin4257S3bTmtNoGe4UXgZgvkP7pQ81ZPBbTWNwriz0lziRGeq2whyDAGAt9LjxjKU4Yiipq7lNhiiULqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:57:12.482941Z","bundle_sha256":"cfc81511b993e05d0e147afaaf5dfb6623f27c1bbd5f9f9bfa49a2a7ad10d633"}}