{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:O7SYFVK7JZRHMSYUEDLRB6IKNZ","short_pith_number":"pith:O7SYFVK7","canonical_record":{"source":{"id":"1503.08790","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-30T18:54:08Z","cross_cats_sorted":[],"title_canon_sha256":"80f039013f7433ad798eb0debe774cce0884d49b4c23b4e9ae8a49277008aed3","abstract_canon_sha256":"3185ed59088b0c7e0b68994ce1475a47f8f3b1ad866da2098dea599ff3de2283"},"schema_version":"1.0"},"canonical_sha256":"77e582d55f4e62764b1420d710f90a6e4597e93850456db76f05ed4d6cd57db1","source":{"kind":"arxiv","id":"1503.08790","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08790","created_at":"2026-05-18T00:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08790v3","created_at":"2026-05-18T00:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08790","created_at":"2026-05-18T00:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"O7SYFVK7JZRH","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"O7SYFVK7JZRHMSYU","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"O7SYFVK7","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:O7SYFVK7JZRHMSYUEDLRB6IKNZ","target":"record","payload":{"canonical_record":{"source":{"id":"1503.08790","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-30T18:54:08Z","cross_cats_sorted":[],"title_canon_sha256":"80f039013f7433ad798eb0debe774cce0884d49b4c23b4e9ae8a49277008aed3","abstract_canon_sha256":"3185ed59088b0c7e0b68994ce1475a47f8f3b1ad866da2098dea599ff3de2283"},"schema_version":"1.0"},"canonical_sha256":"77e582d55f4e62764b1420d710f90a6e4597e93850456db76f05ed4d6cd57db1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:55.606577Z","signature_b64":"I5vFu2TdTitNtFL9xjAJGpm0AYBMYI8sSozsqwI712iJLo+i48GsD/AH0sH7/eeDVo9kO6mGSN7x1Py0rZ4lBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77e582d55f4e62764b1420d710f90a6e4597e93850456db76f05ed4d6cd57db1","last_reissued_at":"2026-05-18T00:58:55.605903Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:55.605903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.08790","source_version":3,"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:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pbohU07dCloN9CaQ6ymBrX1FvZ+hLoXpQRB+LpqH90OyWkcb0Y4WyFa4KNSsh/6vvel9Khr8poQJpQBJfhX2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:19:54.888026Z"},"content_sha256":"02368cae33905e9e5278d5e1ee86b43ea1ff359cf0d59c718fdd6a8b70f52c3f","schema_version":"1.0","event_id":"sha256:02368cae33905e9e5278d5e1ee86b43ea1ff359cf0d59c718fdd6a8b70f52c3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:O7SYFVK7JZRHMSYUEDLRB6IKNZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of Bidirectional Ballot Sequences and Random Walks Ending in their Maximum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Hackl, Clemens Heuberger, Helmut Prodinger, Stephan Wagner","submitted_at":"2015-03-30T18:54:08Z","abstract_excerpt":"Consider non-negative lattice paths ending at their maximum height, which will be called admissible paths. We show that the probability for a lattice path to be admissible is related to the Chebyshev polynomials of the first or second kind, depending on whether the lattice path is defined with a reflective barrier or not. Parameters like the number of admissible paths with given length or the expected height are analyzed asymptotically. Additionally, we use a bijection between admissible random walks and special binary sequences to prove a recent conjecture by Zhao on ballot sequences."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08790","kind":"arxiv","version":3},"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:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CgkoU8yV3F5JXMJphffXffICv+ug/MmNR66DjD8j+2aHVw4p3/7OhDe1/hgFdC17Ty+Hy7B1khFKIIuIxv1zDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:19:54.888390Z"},"content_sha256":"7b036a416e321e85db485d07305d72c721290c068adff0c21f07728890c0d195","schema_version":"1.0","event_id":"sha256:7b036a416e321e85db485d07305d72c721290c068adff0c21f07728890c0d195"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O7SYFVK7JZRHMSYUEDLRB6IKNZ/bundle.json","state_url":"https://pith.science/pith/O7SYFVK7JZRHMSYUEDLRB6IKNZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O7SYFVK7JZRHMSYUEDLRB6IKNZ/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-24T08:19:54Z","links":{"resolver":"https://pith.science/pith/O7SYFVK7JZRHMSYUEDLRB6IKNZ","bundle":"https://pith.science/pith/O7SYFVK7JZRHMSYUEDLRB6IKNZ/bundle.json","state":"https://pith.science/pith/O7SYFVK7JZRHMSYUEDLRB6IKNZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O7SYFVK7JZRHMSYUEDLRB6IKNZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:O7SYFVK7JZRHMSYUEDLRB6IKNZ","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":"3185ed59088b0c7e0b68994ce1475a47f8f3b1ad866da2098dea599ff3de2283","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-30T18:54:08Z","title_canon_sha256":"80f039013f7433ad798eb0debe774cce0884d49b4c23b4e9ae8a49277008aed3"},"schema_version":"1.0","source":{"id":"1503.08790","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08790","created_at":"2026-05-18T00:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08790v3","created_at":"2026-05-18T00:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08790","created_at":"2026-05-18T00:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"O7SYFVK7JZRH","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"O7SYFVK7JZRHMSYU","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"O7SYFVK7","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:7b036a416e321e85db485d07305d72c721290c068adff0c21f07728890c0d195","target":"graph","created_at":"2026-05-18T00:58:55Z","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":"Consider non-negative lattice paths ending at their maximum height, which will be called admissible paths. We show that the probability for a lattice path to be admissible is related to the Chebyshev polynomials of the first or second kind, depending on whether the lattice path is defined with a reflective barrier or not. Parameters like the number of admissible paths with given length or the expected height are analyzed asymptotically. Additionally, we use a bijection between admissible random walks and special binary sequences to prove a recent conjecture by Zhao on ballot sequences.","authors_text":"Benjamin Hackl, Clemens Heuberger, Helmut Prodinger, Stephan Wagner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-30T18:54:08Z","title":"Analysis of Bidirectional Ballot Sequences and Random Walks Ending in their Maximum"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08790","kind":"arxiv","version":3},"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:02368cae33905e9e5278d5e1ee86b43ea1ff359cf0d59c718fdd6a8b70f52c3f","target":"record","created_at":"2026-05-18T00:58:55Z","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":"3185ed59088b0c7e0b68994ce1475a47f8f3b1ad866da2098dea599ff3de2283","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-30T18:54:08Z","title_canon_sha256":"80f039013f7433ad798eb0debe774cce0884d49b4c23b4e9ae8a49277008aed3"},"schema_version":"1.0","source":{"id":"1503.08790","kind":"arxiv","version":3}},"canonical_sha256":"77e582d55f4e62764b1420d710f90a6e4597e93850456db76f05ed4d6cd57db1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77e582d55f4e62764b1420d710f90a6e4597e93850456db76f05ed4d6cd57db1","first_computed_at":"2026-05-18T00:58:55.605903Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:55.605903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I5vFu2TdTitNtFL9xjAJGpm0AYBMYI8sSozsqwI712iJLo+i48GsD/AH0sH7/eeDVo9kO6mGSN7x1Py0rZ4lBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:55.606577Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08790","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02368cae33905e9e5278d5e1ee86b43ea1ff359cf0d59c718fdd6a8b70f52c3f","sha256:7b036a416e321e85db485d07305d72c721290c068adff0c21f07728890c0d195"],"state_sha256":"800e69f5d51186b9b4c3640a3877b9ef7e133aecfb6245387c995d2ab956f2d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hYZq8/Xrw1aaTVIcEPqdKJ8/ZO2vftdRyu93jCJj9ogPrNthjVlsC/4zYUcV5QKqiNPHTl4nSNolyjlUZX0wBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T08:19:54.890273Z","bundle_sha256":"e1e8de0c2d7d7eb56cc633f4936b0249c014cdbc86f1458b6ad054e4825d6dcf"}}