{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DDQMPMR5EHFMBGMTWNZTK477FY","short_pith_number":"pith:DDQMPMR5","canonical_record":{"source":{"id":"1505.06164","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-22T18:00:24Z","cross_cats_sorted":[],"title_canon_sha256":"20c6b499db34793a3cb27d20880745c4936ed9c0c34183a8fe14c7547a3e882c","abstract_canon_sha256":"67710fb6abb13a5769c69ac1b4db958661cf2aa57871030ecee6fda80830afc8"},"schema_version":"1.0"},"canonical_sha256":"18e0c7b23d21cac09993b3733573ff2e2d5b6875a337378ee523b8049ee74359","source":{"kind":"arxiv","id":"1505.06164","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06164","created_at":"2026-05-18T00:07:24Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06164v3","created_at":"2026-05-18T00:07:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06164","created_at":"2026-05-18T00:07:24Z"},{"alias_kind":"pith_short_12","alias_value":"DDQMPMR5EHFM","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DDQMPMR5EHFMBGMT","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DDQMPMR5","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DDQMPMR5EHFMBGMTWNZTK477FY","target":"record","payload":{"canonical_record":{"source":{"id":"1505.06164","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-22T18:00:24Z","cross_cats_sorted":[],"title_canon_sha256":"20c6b499db34793a3cb27d20880745c4936ed9c0c34183a8fe14c7547a3e882c","abstract_canon_sha256":"67710fb6abb13a5769c69ac1b4db958661cf2aa57871030ecee6fda80830afc8"},"schema_version":"1.0"},"canonical_sha256":"18e0c7b23d21cac09993b3733573ff2e2d5b6875a337378ee523b8049ee74359","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:24.024577Z","signature_b64":"HS6tJyjwiKuKVs8zQG5EZmXW3H2bDVTRUM9DbjKEc3eCxYx+mZpAkHQiT2jlK6/uxh77oe7Mw9nOd/6P341wAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18e0c7b23d21cac09993b3733573ff2e2d5b6875a337378ee523b8049ee74359","last_reissued_at":"2026-05-18T00:07:24.024158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:24.024158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.06164","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:07:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zQgoOhhqN7QKLV0mJPleefLHglpDdE/ofrx6pxeWI789Ss2WhEk0TU0tdENhMp52IbAxc73a8uzIT5LXEmH1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:07:56.279298Z"},"content_sha256":"6e76804fce01f61375e5fb8f19d8721a9bffd5f3a3d00de9c278082a2bc0174a","schema_version":"1.0","event_id":"sha256:6e76804fce01f61375e5fb8f19d8721a9bffd5f3a3d00de9c278082a2bc0174a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DDQMPMR5EHFMBGMTWNZTK477FY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the limiting law of the length of the longest common and increasing subsequences in random words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Christian Houdr\\'e, Jean-Christophe Breton","submitted_at":"2015-05-22T18:00:24Z","abstract_excerpt":"Let $X=(X_i)_{i\\ge 1}$ and $Y=(Y_i)_{i\\ge 1}$ be two sequences of independent and identically distributed (iid) random variables taking their values, uniformly, in a common totally ordered finite alphabet. Let LCI$_n$ be the length of the longest common and (weakly) increasing subsequence of $X_1\\cdots X_n$ and $Y_1\\cdots Y_n$. As $n$ grows without bound, and when properly centered and normalized, LCI$_n$ is shown to converge, in distribution, towards a Brownian functional that we identify."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06164","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:07:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4A9kjTN6LKe59j2Gui6t6CO2hY89o++ylOSc4Rk/seiIxlT4fIUYB9Zn5W6viBbOxRXcTF3BlAo3tLjiM5ETAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:07:56.279661Z"},"content_sha256":"e78aaf81e1a79d894f8f38b6aad4b7e612205c3897197b3edcb320014824b778","schema_version":"1.0","event_id":"sha256:e78aaf81e1a79d894f8f38b6aad4b7e612205c3897197b3edcb320014824b778"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DDQMPMR5EHFMBGMTWNZTK477FY/bundle.json","state_url":"https://pith.science/pith/DDQMPMR5EHFMBGMTWNZTK477FY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DDQMPMR5EHFMBGMTWNZTK477FY/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-05-31T05:07:56Z","links":{"resolver":"https://pith.science/pith/DDQMPMR5EHFMBGMTWNZTK477FY","bundle":"https://pith.science/pith/DDQMPMR5EHFMBGMTWNZTK477FY/bundle.json","state":"https://pith.science/pith/DDQMPMR5EHFMBGMTWNZTK477FY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DDQMPMR5EHFMBGMTWNZTK477FY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DDQMPMR5EHFMBGMTWNZTK477FY","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":"67710fb6abb13a5769c69ac1b4db958661cf2aa57871030ecee6fda80830afc8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-22T18:00:24Z","title_canon_sha256":"20c6b499db34793a3cb27d20880745c4936ed9c0c34183a8fe14c7547a3e882c"},"schema_version":"1.0","source":{"id":"1505.06164","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06164","created_at":"2026-05-18T00:07:24Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06164v3","created_at":"2026-05-18T00:07:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06164","created_at":"2026-05-18T00:07:24Z"},{"alias_kind":"pith_short_12","alias_value":"DDQMPMR5EHFM","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DDQMPMR5EHFMBGMT","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DDQMPMR5","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:e78aaf81e1a79d894f8f38b6aad4b7e612205c3897197b3edcb320014824b778","target":"graph","created_at":"2026-05-18T00:07:24Z","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=(X_i)_{i\\ge 1}$ and $Y=(Y_i)_{i\\ge 1}$ be two sequences of independent and identically distributed (iid) random variables taking their values, uniformly, in a common totally ordered finite alphabet. Let LCI$_n$ be the length of the longest common and (weakly) increasing subsequence of $X_1\\cdots X_n$ and $Y_1\\cdots Y_n$. As $n$ grows without bound, and when properly centered and normalized, LCI$_n$ is shown to converge, in distribution, towards a Brownian functional that we identify.","authors_text":"Christian Houdr\\'e, Jean-Christophe Breton","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-22T18:00:24Z","title":"On the limiting law of the length of the longest common and increasing subsequences in random words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06164","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:6e76804fce01f61375e5fb8f19d8721a9bffd5f3a3d00de9c278082a2bc0174a","target":"record","created_at":"2026-05-18T00:07:24Z","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":"67710fb6abb13a5769c69ac1b4db958661cf2aa57871030ecee6fda80830afc8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-22T18:00:24Z","title_canon_sha256":"20c6b499db34793a3cb27d20880745c4936ed9c0c34183a8fe14c7547a3e882c"},"schema_version":"1.0","source":{"id":"1505.06164","kind":"arxiv","version":3}},"canonical_sha256":"18e0c7b23d21cac09993b3733573ff2e2d5b6875a337378ee523b8049ee74359","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18e0c7b23d21cac09993b3733573ff2e2d5b6875a337378ee523b8049ee74359","first_computed_at":"2026-05-18T00:07:24.024158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:24.024158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HS6tJyjwiKuKVs8zQG5EZmXW3H2bDVTRUM9DbjKEc3eCxYx+mZpAkHQiT2jlK6/uxh77oe7Mw9nOd/6P341wAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:24.024577Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.06164","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e76804fce01f61375e5fb8f19d8721a9bffd5f3a3d00de9c278082a2bc0174a","sha256:e78aaf81e1a79d894f8f38b6aad4b7e612205c3897197b3edcb320014824b778"],"state_sha256":"2ce6f4b6f151dae8e77de74b4d81b0db7b94d22b5a1f79d1c95b2ef15f29dc39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lBt//8hwRMkwvrXQ9GyKBECsuovdWH+ECeEgE4P9bgKj4+VGnV51+5BXqOGkwgfoZnlC4vm/nGsDipF4AKzQDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:07:56.282169Z","bundle_sha256":"c428535cc01af4e65a50431d437b15289c7941bae712beb247201e1545a1e9d4"}}