{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IDVYKQDNDUWRSODKHMYJASKHXT","short_pith_number":"pith:IDVYKQDN","canonical_record":{"source":{"id":"1407.2860","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-07-10T16:49:25Z","cross_cats_sorted":[],"title_canon_sha256":"e12664fae1ddacbbfc611dde27137f5bb12d363676a9cc12638be86ede5d1ad2","abstract_canon_sha256":"58cfbf7ce3bd1774c8aebbed64f42ef843cb2f6613c35672a36fa52a556ab57a"},"schema_version":"1.0"},"canonical_sha256":"40eb85406d1d2d19386a3b30904947bcc53d6d55f5a38dff480b7532fdcbc4d6","source":{"kind":"arxiv","id":"1407.2860","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2860","created_at":"2026-05-18T01:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2860v3","created_at":"2026-05-18T01:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2860","created_at":"2026-05-18T01:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"IDVYKQDNDUWR","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IDVYKQDNDUWRSODK","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IDVYKQDN","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IDVYKQDNDUWRSODKHMYJASKHXT","target":"record","payload":{"canonical_record":{"source":{"id":"1407.2860","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-07-10T16:49:25Z","cross_cats_sorted":[],"title_canon_sha256":"e12664fae1ddacbbfc611dde27137f5bb12d363676a9cc12638be86ede5d1ad2","abstract_canon_sha256":"58cfbf7ce3bd1774c8aebbed64f42ef843cb2f6613c35672a36fa52a556ab57a"},"schema_version":"1.0"},"canonical_sha256":"40eb85406d1d2d19386a3b30904947bcc53d6d55f5a38dff480b7532fdcbc4d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:45.274099Z","signature_b64":"QcacgJ22F0aStyEykqDu5OwZR3CH3YdYkKb7OVN/NmgdKuXRrh/tCuzSqo/6j36As0Ak+9OIbZfrP3F3t2PnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40eb85406d1d2d19386a3b30904947bcc53d6d55f5a38dff480b7532fdcbc4d6","last_reissued_at":"2026-05-18T01:03:45.273605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:45.273605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.2860","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-18T01:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X7qFzGiPHxamgXFO+eYI01tu0r4hGNlvGLq07OPVQogW2wOl42QrfCLG+B3ZqUnvkCSp5uiAJ5u5x5e/ghwCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:28:23.544468Z"},"content_sha256":"cccc9c9ddeecd13f4c1f70466ccc0806b9214fffc8896ffdd1df2eba6fa45df6","schema_version":"1.0","event_id":"sha256:cccc9c9ddeecd13f4c1f70466ccc0806b9214fffc8896ffdd1df2eba6fa45df6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IDVYKQDNDUWRSODKHMYJASKHXT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Increasing subsequences of random walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Omer Angel, Rich\\'ard Balka, Yuval Peres","submitted_at":"2014-07-10T16:49:25Z","abstract_excerpt":"Given a sequence of $n$ real numbers $\\{S_i\\}_{i\\leq n}$, we consider the longest weakly increasing subsequence, namely $i_1<i_2<\\dots <i_L$ with $S_{i_k} \\leq S_{i_{k+1}}$ and $L$ maximal. When the elements $S_i$ are i.i.d. uniform random variables, Vershik and Kerov, and Logan and Shepp proved that $\\mathbb{E} L=(2+o(1)) \\sqrt{n}$.\n  We consider the case when $\\{S_i\\}_{i\\leq n}$ is a random walk on $\\mathbb{R}$ with increments of mean zero and finite (positive) variance. In this case, it is well known (e.g., using record times) that the length of the longest increasing subsequence satisfies "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2860","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-18T01:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4SzLtX4S2Q9MU2t/UyhlGEzzq/Mt0Qv78d8nE3xQCDqGNnc45AOAdnlmSf0pppeMVsTfHOun9o85D9ANT/46Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:28:23.544807Z"},"content_sha256":"04ba225f783908964f0447c343fa3ebbe8775242eb0e6beee0cf5485101662b0","schema_version":"1.0","event_id":"sha256:04ba225f783908964f0447c343fa3ebbe8775242eb0e6beee0cf5485101662b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IDVYKQDNDUWRSODKHMYJASKHXT/bundle.json","state_url":"https://pith.science/pith/IDVYKQDNDUWRSODKHMYJASKHXT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IDVYKQDNDUWRSODKHMYJASKHXT/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-22T11:28:23Z","links":{"resolver":"https://pith.science/pith/IDVYKQDNDUWRSODKHMYJASKHXT","bundle":"https://pith.science/pith/IDVYKQDNDUWRSODKHMYJASKHXT/bundle.json","state":"https://pith.science/pith/IDVYKQDNDUWRSODKHMYJASKHXT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IDVYKQDNDUWRSODKHMYJASKHXT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IDVYKQDNDUWRSODKHMYJASKHXT","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":"58cfbf7ce3bd1774c8aebbed64f42ef843cb2f6613c35672a36fa52a556ab57a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-07-10T16:49:25Z","title_canon_sha256":"e12664fae1ddacbbfc611dde27137f5bb12d363676a9cc12638be86ede5d1ad2"},"schema_version":"1.0","source":{"id":"1407.2860","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2860","created_at":"2026-05-18T01:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2860v3","created_at":"2026-05-18T01:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2860","created_at":"2026-05-18T01:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"IDVYKQDNDUWR","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IDVYKQDNDUWRSODK","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IDVYKQDN","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:04ba225f783908964f0447c343fa3ebbe8775242eb0e6beee0cf5485101662b0","target":"graph","created_at":"2026-05-18T01:03:45Z","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":"Given a sequence of $n$ real numbers $\\{S_i\\}_{i\\leq n}$, we consider the longest weakly increasing subsequence, namely $i_1<i_2<\\dots <i_L$ with $S_{i_k} \\leq S_{i_{k+1}}$ and $L$ maximal. When the elements $S_i$ are i.i.d. uniform random variables, Vershik and Kerov, and Logan and Shepp proved that $\\mathbb{E} L=(2+o(1)) \\sqrt{n}$.\n  We consider the case when $\\{S_i\\}_{i\\leq n}$ is a random walk on $\\mathbb{R}$ with increments of mean zero and finite (positive) variance. In this case, it is well known (e.g., using record times) that the length of the longest increasing subsequence satisfies ","authors_text":"Omer Angel, Rich\\'ard Balka, Yuval Peres","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-07-10T16:49:25Z","title":"Increasing subsequences of random walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2860","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:cccc9c9ddeecd13f4c1f70466ccc0806b9214fffc8896ffdd1df2eba6fa45df6","target":"record","created_at":"2026-05-18T01:03:45Z","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":"58cfbf7ce3bd1774c8aebbed64f42ef843cb2f6613c35672a36fa52a556ab57a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-07-10T16:49:25Z","title_canon_sha256":"e12664fae1ddacbbfc611dde27137f5bb12d363676a9cc12638be86ede5d1ad2"},"schema_version":"1.0","source":{"id":"1407.2860","kind":"arxiv","version":3}},"canonical_sha256":"40eb85406d1d2d19386a3b30904947bcc53d6d55f5a38dff480b7532fdcbc4d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40eb85406d1d2d19386a3b30904947bcc53d6d55f5a38dff480b7532fdcbc4d6","first_computed_at":"2026-05-18T01:03:45.273605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:45.273605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QcacgJ22F0aStyEykqDu5OwZR3CH3YdYkKb7OVN/NmgdKuXRrh/tCuzSqo/6j36As0Ak+9OIbZfrP3F3t2PnDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:45.274099Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.2860","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cccc9c9ddeecd13f4c1f70466ccc0806b9214fffc8896ffdd1df2eba6fa45df6","sha256:04ba225f783908964f0447c343fa3ebbe8775242eb0e6beee0cf5485101662b0"],"state_sha256":"73440b9b04b7a399bf3f5a3f9906c5dd42c6eb77dca6d4aa8106f558a79a1c66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YkG92T3JQ9MXmGOutq6YcKbwg4W2VtFBd9kLuNZvJrUpVRIMPvfjTQzFmZkscjiI3YpTwZki74RxXuvl+xrMAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T11:28:23.546712Z","bundle_sha256":"ce44e8d4f40d80a5af2a987e900ebfa037143f045d823aded5615edd9036c872"}}