{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WCKZU3UNDZZ5Z66ABCMNJAT2J7","short_pith_number":"pith:WCKZU3UN","canonical_record":{"source":{"id":"1105.0474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-03T04:16:42Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d0d9b2dd6a49811bda2140dd2ad94174d6d86dd47b1a52f41d99d0db3b73e3fe","abstract_canon_sha256":"44006dac4885b33faa29baf62feaac073a6d967573e104b1441c235a0204f138"},"schema_version":"1.0"},"canonical_sha256":"b0959a6e8d1e73dcfbc00898d4827a4fe7e1d2f7261ef0ef17f9c41ed7f10830","source":{"kind":"arxiv","id":"1105.0474","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0474","created_at":"2026-05-18T04:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0474v1","created_at":"2026-05-18T04:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0474","created_at":"2026-05-18T04:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"WCKZU3UNDZZ5","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WCKZU3UNDZZ5Z66A","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WCKZU3UN","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WCKZU3UNDZZ5Z66ABCMNJAT2J7","target":"record","payload":{"canonical_record":{"source":{"id":"1105.0474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-03T04:16:42Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d0d9b2dd6a49811bda2140dd2ad94174d6d86dd47b1a52f41d99d0db3b73e3fe","abstract_canon_sha256":"44006dac4885b33faa29baf62feaac073a6d967573e104b1441c235a0204f138"},"schema_version":"1.0"},"canonical_sha256":"b0959a6e8d1e73dcfbc00898d4827a4fe7e1d2f7261ef0ef17f9c41ed7f10830","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:11.214182Z","signature_b64":"hwjAExEDTE4J+BojuNLFHQz3u2JAIIQTOG0Aa8YTxlS0A7qojTpBUGaJVN98LjN4t5ge/isP8JRixX8Ju+5mDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0959a6e8d1e73dcfbc00898d4827a4fe7e1d2f7261ef0ef17f9c41ed7f10830","last_reissued_at":"2026-05-18T04:23:11.213708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:11.213708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.0474","source_version":1,"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-18T04:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ltjtuJzWTDJQHOP3IC9J9sp8i4FMF5k57hhYUzxIcq8T1k5/MicKUD29niDQEk8EzDFkTZWpN45kGClYVHqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:18:39.660039Z"},"content_sha256":"aaefcdd3fd9d1350ab674d346c6ca3290074555ba0c144436ff862dbdf1cc74e","schema_version":"1.0","event_id":"sha256:aaefcdd3fd9d1350ab674d346c6ca3290074555ba0c144436ff862dbdf1cc74e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WCKZU3UNDZZ5Z66ABCMNJAT2J7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalizations and Variants of the Largest Non-crossing Matching Problem in Random Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jos\\'e A. Soto, Marcos Kiwi","submitted_at":"2011-05-03T04:16:42Z","abstract_excerpt":"We are interested in the statistics of the length of the longest increasing subsequence of 2-rowed lexicographically sorted arrays chosen according to distinct families of distributions D = (D_n)_n, and when n goes to infinity. This framework encompasses well studied problems such as the so called Longest Increasing Subsequence problem, the Longest Common Subsequence problem, problems concerning directed bond percolation models, among others. We define several natural families of distinct distributions and characterize the asymptotic behavior of the expected length of a longest increasing subs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0474","kind":"arxiv","version":1},"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-18T04:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6uBK+2ecVgIkiWTVBAteXaysZHUwsTrgTRUpPcBie5pm2BCNdD8C8FmWIG3ODkOF38gE1s+joxVvbIDPaQ5xCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:18:39.660403Z"},"content_sha256":"dfc193932daccfcf04dd39503b5265a5fca4b1e0cc2f27fb69a96bbd724c27a4","schema_version":"1.0","event_id":"sha256:dfc193932daccfcf04dd39503b5265a5fca4b1e0cc2f27fb69a96bbd724c27a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WCKZU3UNDZZ5Z66ABCMNJAT2J7/bundle.json","state_url":"https://pith.science/pith/WCKZU3UNDZZ5Z66ABCMNJAT2J7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WCKZU3UNDZZ5Z66ABCMNJAT2J7/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-04T18:18:39Z","links":{"resolver":"https://pith.science/pith/WCKZU3UNDZZ5Z66ABCMNJAT2J7","bundle":"https://pith.science/pith/WCKZU3UNDZZ5Z66ABCMNJAT2J7/bundle.json","state":"https://pith.science/pith/WCKZU3UNDZZ5Z66ABCMNJAT2J7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WCKZU3UNDZZ5Z66ABCMNJAT2J7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WCKZU3UNDZZ5Z66ABCMNJAT2J7","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":"44006dac4885b33faa29baf62feaac073a6d967573e104b1441c235a0204f138","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-03T04:16:42Z","title_canon_sha256":"d0d9b2dd6a49811bda2140dd2ad94174d6d86dd47b1a52f41d99d0db3b73e3fe"},"schema_version":"1.0","source":{"id":"1105.0474","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0474","created_at":"2026-05-18T04:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0474v1","created_at":"2026-05-18T04:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0474","created_at":"2026-05-18T04:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"WCKZU3UNDZZ5","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WCKZU3UNDZZ5Z66A","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WCKZU3UN","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:dfc193932daccfcf04dd39503b5265a5fca4b1e0cc2f27fb69a96bbd724c27a4","target":"graph","created_at":"2026-05-18T04:23:11Z","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":"We are interested in the statistics of the length of the longest increasing subsequence of 2-rowed lexicographically sorted arrays chosen according to distinct families of distributions D = (D_n)_n, and when n goes to infinity. This framework encompasses well studied problems such as the so called Longest Increasing Subsequence problem, the Longest Common Subsequence problem, problems concerning directed bond percolation models, among others. We define several natural families of distinct distributions and characterize the asymptotic behavior of the expected length of a longest increasing subs","authors_text":"Jos\\'e A. Soto, Marcos Kiwi","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-03T04:16:42Z","title":"Generalizations and Variants of the Largest Non-crossing Matching Problem in Random Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0474","kind":"arxiv","version":1},"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:aaefcdd3fd9d1350ab674d346c6ca3290074555ba0c144436ff862dbdf1cc74e","target":"record","created_at":"2026-05-18T04:23:11Z","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":"44006dac4885b33faa29baf62feaac073a6d967573e104b1441c235a0204f138","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-03T04:16:42Z","title_canon_sha256":"d0d9b2dd6a49811bda2140dd2ad94174d6d86dd47b1a52f41d99d0db3b73e3fe"},"schema_version":"1.0","source":{"id":"1105.0474","kind":"arxiv","version":1}},"canonical_sha256":"b0959a6e8d1e73dcfbc00898d4827a4fe7e1d2f7261ef0ef17f9c41ed7f10830","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0959a6e8d1e73dcfbc00898d4827a4fe7e1d2f7261ef0ef17f9c41ed7f10830","first_computed_at":"2026-05-18T04:23:11.213708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:11.213708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hwjAExEDTE4J+BojuNLFHQz3u2JAIIQTOG0Aa8YTxlS0A7qojTpBUGaJVN98LjN4t5ge/isP8JRixX8Ju+5mDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:11.214182Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.0474","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aaefcdd3fd9d1350ab674d346c6ca3290074555ba0c144436ff862dbdf1cc74e","sha256:dfc193932daccfcf04dd39503b5265a5fca4b1e0cc2f27fb69a96bbd724c27a4"],"state_sha256":"ef1746432c47503c5b56084b9f4baffa46df7301760175280579968e9ddd8d1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uMGnKaj2eAoIqkD2HboH751ZsRz65k8fsq0diwGbzrwm5lGEdnF7OPUzfpLJIugovwhbKQkpsB6z9+F4AANGAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:18:39.662422Z","bundle_sha256":"e6d48392e0d6e507835388337bfa4badcc922665e395d1f4c8a23faa9d2d3912"}}