{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:PY3OPU6SFPO64XEGK3EQIDXDST","short_pith_number":"pith:PY3OPU6S","canonical_record":{"source":{"id":"1004.1850","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-04-11T22:27:34Z","cross_cats_sorted":[],"title_canon_sha256":"24f709b6df8a8552986a8298ad74b8d876f5e7ebc2514fec10353a1c8db4f955","abstract_canon_sha256":"a8dc4dd1de881582ecc2cd28fd772a7b29ea867705d5cca62a7bb4dc5334e777"},"schema_version":"1.0"},"canonical_sha256":"7e36e7d3d22bddee5c8656c9040ee394c9dc6aeada7ce692e45c7393f911de78","source":{"kind":"arxiv","id":"1004.1850","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.1850","created_at":"2026-05-18T04:19:13Z"},{"alias_kind":"arxiv_version","alias_value":"1004.1850v8","created_at":"2026-05-18T04:19:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.1850","created_at":"2026-05-18T04:19:13Z"},{"alias_kind":"pith_short_12","alias_value":"PY3OPU6SFPO6","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PY3OPU6SFPO64XEG","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PY3OPU6S","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:PY3OPU6SFPO64XEGK3EQIDXDST","target":"record","payload":{"canonical_record":{"source":{"id":"1004.1850","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-04-11T22:27:34Z","cross_cats_sorted":[],"title_canon_sha256":"24f709b6df8a8552986a8298ad74b8d876f5e7ebc2514fec10353a1c8db4f955","abstract_canon_sha256":"a8dc4dd1de881582ecc2cd28fd772a7b29ea867705d5cca62a7bb4dc5334e777"},"schema_version":"1.0"},"canonical_sha256":"7e36e7d3d22bddee5c8656c9040ee394c9dc6aeada7ce692e45c7393f911de78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:13.392298Z","signature_b64":"lBIcl6dXW2u64vdMPEF/bedLVFubBc5SYcr4U4H7fva+JEkjeuEgBbV9mD2NDmVGyQErVkyBT4BTeLiomHawBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e36e7d3d22bddee5c8656c9040ee394c9dc6aeada7ce692e45c7393f911de78","last_reissued_at":"2026-05-18T04:19:13.391887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:13.391887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.1850","source_version":8,"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-18T04:19:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+kmV/RyplVvopF08wrtM9BzGfza+Vdbn52O7C54oI11bNYhJ5KZfGid66K+K+ER0+ivgcqrEV4EYeaiHuvzXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:12:59.965067Z"},"content_sha256":"dbbf70284b3f0687be513c9e88cc79d94d2058f932fe817c826ee38308cf5bd9","schema_version":"1.0","event_id":"sha256:dbbf70284b3f0687be513c9e88cc79d94d2058f932fe817c826ee38308cf5bd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:PY3OPU6SFPO64XEGK3EQIDXDST","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Level-crossings of symmetric random walks and their application","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Vyacheslav M. Abramov","submitted_at":"2010-04-11T22:27:34Z","abstract_excerpt":"Let $X_1$, $X_2$, $...$ be a sequence of independently and identically distributed random variables with $\\mathsf{E}X_1=0$, and let $S_0=0$ and $S_t=S_{t-1}+X_t$, $t=1,2,...$, be a random walk. Denote $\\tau={cases}\\inf\\{t>1: S_t\\leq0\\}, &\\text{if} \\ X_1>0, 1, &\\text{otherwise}. {cases}$ Let $\\alpha$ denote a positive number, and let $L_\\alpha$ denote the number of level-crossings from the below (or above) across the level $\\alpha$ during the interval $[0, \\tau]$. Under quite general assumption, an inequality for the expected number of level-crossings is established. Under some special assumpti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.1850","kind":"arxiv","version":8},"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-18T04:19:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Eg/2CVo+HJYG262BpnCz0MX6VUDuVU07MXKgyznHR6Z8jzcWEcQR7v5UFexeip7P1ndVwJ7fivDs4RcXhoyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:12:59.965452Z"},"content_sha256":"6c01089c553f1c750ac2c29d1eed052b1c026d898b195edf06d1bef9ed0523c0","schema_version":"1.0","event_id":"sha256:6c01089c553f1c750ac2c29d1eed052b1c026d898b195edf06d1bef9ed0523c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PY3OPU6SFPO64XEGK3EQIDXDST/bundle.json","state_url":"https://pith.science/pith/PY3OPU6SFPO64XEGK3EQIDXDST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PY3OPU6SFPO64XEGK3EQIDXDST/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-11T12:12:59Z","links":{"resolver":"https://pith.science/pith/PY3OPU6SFPO64XEGK3EQIDXDST","bundle":"https://pith.science/pith/PY3OPU6SFPO64XEGK3EQIDXDST/bundle.json","state":"https://pith.science/pith/PY3OPU6SFPO64XEGK3EQIDXDST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PY3OPU6SFPO64XEGK3EQIDXDST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:PY3OPU6SFPO64XEGK3EQIDXDST","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":"a8dc4dd1de881582ecc2cd28fd772a7b29ea867705d5cca62a7bb4dc5334e777","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-04-11T22:27:34Z","title_canon_sha256":"24f709b6df8a8552986a8298ad74b8d876f5e7ebc2514fec10353a1c8db4f955"},"schema_version":"1.0","source":{"id":"1004.1850","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.1850","created_at":"2026-05-18T04:19:13Z"},{"alias_kind":"arxiv_version","alias_value":"1004.1850v8","created_at":"2026-05-18T04:19:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.1850","created_at":"2026-05-18T04:19:13Z"},{"alias_kind":"pith_short_12","alias_value":"PY3OPU6SFPO6","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PY3OPU6SFPO64XEG","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PY3OPU6S","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:6c01089c553f1c750ac2c29d1eed052b1c026d898b195edf06d1bef9ed0523c0","target":"graph","created_at":"2026-05-18T04:19:13Z","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":"Let $X_1$, $X_2$, $...$ be a sequence of independently and identically distributed random variables with $\\mathsf{E}X_1=0$, and let $S_0=0$ and $S_t=S_{t-1}+X_t$, $t=1,2,...$, be a random walk. Denote $\\tau={cases}\\inf\\{t>1: S_t\\leq0\\}, &\\text{if} \\ X_1>0, 1, &\\text{otherwise}. {cases}$ Let $\\alpha$ denote a positive number, and let $L_\\alpha$ denote the number of level-crossings from the below (or above) across the level $\\alpha$ during the interval $[0, \\tau]$. Under quite general assumption, an inequality for the expected number of level-crossings is established. Under some special assumpti","authors_text":"Vyacheslav M. Abramov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-04-11T22:27:34Z","title":"Level-crossings of symmetric random walks and their application"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.1850","kind":"arxiv","version":8},"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:dbbf70284b3f0687be513c9e88cc79d94d2058f932fe817c826ee38308cf5bd9","target":"record","created_at":"2026-05-18T04:19:13Z","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":"a8dc4dd1de881582ecc2cd28fd772a7b29ea867705d5cca62a7bb4dc5334e777","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-04-11T22:27:34Z","title_canon_sha256":"24f709b6df8a8552986a8298ad74b8d876f5e7ebc2514fec10353a1c8db4f955"},"schema_version":"1.0","source":{"id":"1004.1850","kind":"arxiv","version":8}},"canonical_sha256":"7e36e7d3d22bddee5c8656c9040ee394c9dc6aeada7ce692e45c7393f911de78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e36e7d3d22bddee5c8656c9040ee394c9dc6aeada7ce692e45c7393f911de78","first_computed_at":"2026-05-18T04:19:13.391887Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:13.391887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lBIcl6dXW2u64vdMPEF/bedLVFubBc5SYcr4U4H7fva+JEkjeuEgBbV9mD2NDmVGyQErVkyBT4BTeLiomHawBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:13.392298Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.1850","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbbf70284b3f0687be513c9e88cc79d94d2058f932fe817c826ee38308cf5bd9","sha256:6c01089c553f1c750ac2c29d1eed052b1c026d898b195edf06d1bef9ed0523c0"],"state_sha256":"0d9cfa51f51e1fb17388097bd7ae82d4aa1fb06eba4382ea9aabecbb7cb58b70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DNzvTZpAkOSE9eBniaT/nlfyNoqxqX7fkEemU2vMs6C0xlUs6j2Qea0GrnhvVkK+ajP9JLAH9yyPV5OIpTKOAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:12:59.967393Z","bundle_sha256":"72672ed16caa5571b913aef150644858186a901d197c2da2408fdf1014ce4638"}}