{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IDVYKQDNDUWRSODKHMYJASKHXT","short_pith_number":"pith:IDVYKQDN","schema_version":"1.0","canonical_sha256":"40eb85406d1d2d19386a3b30904947bcc53d6d55f5a38dff480b7532fdcbc4d6","source":{"kind":"arxiv","id":"1407.2860","version":3},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.2860","created_at":"2026-05-18T01:03:45.273693+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.2860v3","created_at":"2026-05-18T01:03:45.273693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2860","created_at":"2026-05-18T01:03:45.273693+00:00"},{"alias_kind":"pith_short_12","alias_value":"IDVYKQDNDUWR","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IDVYKQDNDUWRSODK","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IDVYKQDN","created_at":"2026-05-18T12:28:33.132498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IDVYKQDNDUWRSODKHMYJASKHXT","json":"https://pith.science/pith/IDVYKQDNDUWRSODKHMYJASKHXT.json","graph_json":"https://pith.science/api/pith-number/IDVYKQDNDUWRSODKHMYJASKHXT/graph.json","events_json":"https://pith.science/api/pith-number/IDVYKQDNDUWRSODKHMYJASKHXT/events.json","paper":"https://pith.science/paper/IDVYKQDN"},"agent_actions":{"view_html":"https://pith.science/pith/IDVYKQDNDUWRSODKHMYJASKHXT","download_json":"https://pith.science/pith/IDVYKQDNDUWRSODKHMYJASKHXT.json","view_paper":"https://pith.science/paper/IDVYKQDN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.2860&json=true","fetch_graph":"https://pith.science/api/pith-number/IDVYKQDNDUWRSODKHMYJASKHXT/graph.json","fetch_events":"https://pith.science/api/pith-number/IDVYKQDNDUWRSODKHMYJASKHXT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IDVYKQDNDUWRSODKHMYJASKHXT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IDVYKQDNDUWRSODKHMYJASKHXT/action/storage_attestation","attest_author":"https://pith.science/pith/IDVYKQDNDUWRSODKHMYJASKHXT/action/author_attestation","sign_citation":"https://pith.science/pith/IDVYKQDNDUWRSODKHMYJASKHXT/action/citation_signature","submit_replication":"https://pith.science/pith/IDVYKQDNDUWRSODKHMYJASKHXT/action/replication_record"}},"created_at":"2026-05-18T01:03:45.273693+00:00","updated_at":"2026-05-18T01:03:45.273693+00:00"}