{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:EXU4QWCLYNPCB62MHN7NRK55HC","short_pith_number":"pith:EXU4QWCL","schema_version":"1.0","canonical_sha256":"25e9c8584bc35e20fb4c3b7ed8abbd3890503ba57749d8076c617521956c8767","source":{"kind":"arxiv","id":"1005.1893","version":2},"attestation_state":"computed","paper":{"title":"A probabilistic approach to the asymptotics of the length of the longest alternating subsequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Christian Houdr\\'e, Ricardo Restrepo","submitted_at":"2010-05-11T17:43:51Z","abstract_excerpt":"Let $LA_{n}(\\tau)$ be the length of the longest alternating subsequence of a uniform random permutation $\\tau\\in[n]$. Classical probabilistic arguments are used to rederive the asymptotic mean, variance and limiting law of $LA_{n}(\\tau)$. Our methodology is robust enough to tackle similar problems for finite alphabet random words or even Markovian sequences in which case our results are mainly original. A sketch of how some cases of pattern restricted permutations can also be tackled with probabilistic methods is finally presented."},"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":"1005.1893","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-05-11T17:43:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"586ae8e002a21f698d44baa20f6c1c533fa462c015c14cbe343c99785004c06f","abstract_canon_sha256":"fa5179142745203bda3af418b1ecbdb7b4cf583f94004dc8135cf98a16ff6a33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:04.163823Z","signature_b64":"olRtuquEr+yNbXh4UtqWnzuv+yi1uheruCs8VCx3l+LAIYIjDAbQLBwbUpQrWT5DhisYytyKIWQ2LDGT5ghtCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25e9c8584bc35e20fb4c3b7ed8abbd3890503ba57749d8076c617521956c8767","last_reissued_at":"2026-05-18T03:46:04.163149Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:04.163149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A probabilistic approach to the asymptotics of the length of the longest alternating subsequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Christian Houdr\\'e, Ricardo Restrepo","submitted_at":"2010-05-11T17:43:51Z","abstract_excerpt":"Let $LA_{n}(\\tau)$ be the length of the longest alternating subsequence of a uniform random permutation $\\tau\\in[n]$. Classical probabilistic arguments are used to rederive the asymptotic mean, variance and limiting law of $LA_{n}(\\tau)$. Our methodology is robust enough to tackle similar problems for finite alphabet random words or even Markovian sequences in which case our results are mainly original. A sketch of how some cases of pattern restricted permutations can also be tackled with probabilistic methods is finally presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1893","kind":"arxiv","version":2},"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":"1005.1893","created_at":"2026-05-18T03:46:04.163250+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.1893v2","created_at":"2026-05-18T03:46:04.163250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1893","created_at":"2026-05-18T03:46:04.163250+00:00"},{"alias_kind":"pith_short_12","alias_value":"EXU4QWCLYNPC","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"EXU4QWCLYNPCB62M","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"EXU4QWCL","created_at":"2026-05-18T12:26:06.534383+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/EXU4QWCLYNPCB62MHN7NRK55HC","json":"https://pith.science/pith/EXU4QWCLYNPCB62MHN7NRK55HC.json","graph_json":"https://pith.science/api/pith-number/EXU4QWCLYNPCB62MHN7NRK55HC/graph.json","events_json":"https://pith.science/api/pith-number/EXU4QWCLYNPCB62MHN7NRK55HC/events.json","paper":"https://pith.science/paper/EXU4QWCL"},"agent_actions":{"view_html":"https://pith.science/pith/EXU4QWCLYNPCB62MHN7NRK55HC","download_json":"https://pith.science/pith/EXU4QWCLYNPCB62MHN7NRK55HC.json","view_paper":"https://pith.science/paper/EXU4QWCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.1893&json=true","fetch_graph":"https://pith.science/api/pith-number/EXU4QWCLYNPCB62MHN7NRK55HC/graph.json","fetch_events":"https://pith.science/api/pith-number/EXU4QWCLYNPCB62MHN7NRK55HC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EXU4QWCLYNPCB62MHN7NRK55HC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EXU4QWCLYNPCB62MHN7NRK55HC/action/storage_attestation","attest_author":"https://pith.science/pith/EXU4QWCLYNPCB62MHN7NRK55HC/action/author_attestation","sign_citation":"https://pith.science/pith/EXU4QWCLYNPCB62MHN7NRK55HC/action/citation_signature","submit_replication":"https://pith.science/pith/EXU4QWCLYNPCB62MHN7NRK55HC/action/replication_record"}},"created_at":"2026-05-18T03:46:04.163250+00:00","updated_at":"2026-05-18T03:46:04.163250+00:00"}