{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RY55MYGJDIHGF4QRV7JYY3BPZ2","short_pith_number":"pith:RY55MYGJ","canonical_record":{"source":{"id":"1305.4883","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-21T17:04:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c1ffb76c2f170ccb87e0ae14b0067af882d8df2417251601023494d7185f1e7f","abstract_canon_sha256":"afa9427e848c7effe885476e0503802068fa87107c93c0d3f4051eac89413d98"},"schema_version":"1.0"},"canonical_sha256":"8e3bd660c91a0e62f211afd38c6c2fcea38dcd5d3532200f4e95a4dc8d9e37d0","source":{"kind":"arxiv","id":"1305.4883","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4883","created_at":"2026-05-18T03:25:15Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4883v1","created_at":"2026-05-18T03:25:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4883","created_at":"2026-05-18T03:25:15Z"},{"alias_kind":"pith_short_12","alias_value":"RY55MYGJDIHG","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RY55MYGJDIHGF4QR","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RY55MYGJ","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RY55MYGJDIHGF4QRV7JYY3BPZ2","target":"record","payload":{"canonical_record":{"source":{"id":"1305.4883","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-21T17:04:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c1ffb76c2f170ccb87e0ae14b0067af882d8df2417251601023494d7185f1e7f","abstract_canon_sha256":"afa9427e848c7effe885476e0503802068fa87107c93c0d3f4051eac89413d98"},"schema_version":"1.0"},"canonical_sha256":"8e3bd660c91a0e62f211afd38c6c2fcea38dcd5d3532200f4e95a4dc8d9e37d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:15.052201Z","signature_b64":"n8Oj9u55snFEPguVPrSftEArTXRPDRlMsxKrx3PDBvwwOH5mGyeI9xtL6bAg4SLWDlF/C5HDbLSbpdWPfxRuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e3bd660c91a0e62f211afd38c6c2fcea38dcd5d3532200f4e95a4dc8d9e37d0","last_reissued_at":"2026-05-18T03:25:15.051592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:15.051592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.4883","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-18T03:25:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pDCKULk8fZOXv4Q8/Lar9bDCOmCkpiNYvue25f4f3nU8VCHQ40zHgdlXluse1M4Mx9VSwzBsIvFMmzpaGWqoAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:13:10.138505Z"},"content_sha256":"e58b0b35353438a52d60198efdde4a5877f45a3fd770017d08b78b7a9a82c334","schema_version":"1.0","event_id":"sha256:e58b0b35353438a52d60198efdde4a5877f45a3fd770017d08b78b7a9a82c334"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RY55MYGJDIHGF4QRV7JYY3BPZ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Repetition-free longest common subsequence of random sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Cristina G. Fernandes, Marcos Kiwi","submitted_at":"2013-05-21T17:04:21Z","abstract_excerpt":"A repetition free Longest Common Subsequence (LCS) of two sequences x and y is an LCS of x and y where each symbol may appear at most once. Let R denote the length of a repetition free LCS of two sequences of n symbols each one chosen randomly, uniformly, and independently over a k-ary alphabet. We study the asymptotic, in n and k, behavior of R and establish that there are three distinct regimes, depending on the relative speed of growth of n and k. For each regime we establish the limiting behavior of R. In fact, we do more, since we actually establish tail bounds for large deviations of R f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4883","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-18T03:25:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tK2AZE6/Nm24FdTh6PL/jgqSjHDPsMZymorUyb9/Xp7L5aRxOcJRnCXMmEAYj3wE+JDKnXmujb9Y37OWekS/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:13:10.138850Z"},"content_sha256":"591d0bda4ffaea6d551f38e5bafe6a7e5f9d49569da8fbaa571e030013ba3583","schema_version":"1.0","event_id":"sha256:591d0bda4ffaea6d551f38e5bafe6a7e5f9d49569da8fbaa571e030013ba3583"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RY55MYGJDIHGF4QRV7JYY3BPZ2/bundle.json","state_url":"https://pith.science/pith/RY55MYGJDIHGF4QRV7JYY3BPZ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RY55MYGJDIHGF4QRV7JYY3BPZ2/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-04T17:13:10Z","links":{"resolver":"https://pith.science/pith/RY55MYGJDIHGF4QRV7JYY3BPZ2","bundle":"https://pith.science/pith/RY55MYGJDIHGF4QRV7JYY3BPZ2/bundle.json","state":"https://pith.science/pith/RY55MYGJDIHGF4QRV7JYY3BPZ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RY55MYGJDIHGF4QRV7JYY3BPZ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RY55MYGJDIHGF4QRV7JYY3BPZ2","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":"afa9427e848c7effe885476e0503802068fa87107c93c0d3f4051eac89413d98","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-21T17:04:21Z","title_canon_sha256":"c1ffb76c2f170ccb87e0ae14b0067af882d8df2417251601023494d7185f1e7f"},"schema_version":"1.0","source":{"id":"1305.4883","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4883","created_at":"2026-05-18T03:25:15Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4883v1","created_at":"2026-05-18T03:25:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4883","created_at":"2026-05-18T03:25:15Z"},{"alias_kind":"pith_short_12","alias_value":"RY55MYGJDIHG","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RY55MYGJDIHGF4QR","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RY55MYGJ","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:591d0bda4ffaea6d551f38e5bafe6a7e5f9d49569da8fbaa571e030013ba3583","target":"graph","created_at":"2026-05-18T03:25:15Z","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":"A repetition free Longest Common Subsequence (LCS) of two sequences x and y is an LCS of x and y where each symbol may appear at most once. Let R denote the length of a repetition free LCS of two sequences of n symbols each one chosen randomly, uniformly, and independently over a k-ary alphabet. We study the asymptotic, in n and k, behavior of R and establish that there are three distinct regimes, depending on the relative speed of growth of n and k. For each regime we establish the limiting behavior of R. In fact, we do more, since we actually establish tail bounds for large deviations of R f","authors_text":"Cristina G. Fernandes, Marcos Kiwi","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-21T17:04:21Z","title":"Repetition-free longest common subsequence of random sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4883","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:e58b0b35353438a52d60198efdde4a5877f45a3fd770017d08b78b7a9a82c334","target":"record","created_at":"2026-05-18T03:25:15Z","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":"afa9427e848c7effe885476e0503802068fa87107c93c0d3f4051eac89413d98","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-21T17:04:21Z","title_canon_sha256":"c1ffb76c2f170ccb87e0ae14b0067af882d8df2417251601023494d7185f1e7f"},"schema_version":"1.0","source":{"id":"1305.4883","kind":"arxiv","version":1}},"canonical_sha256":"8e3bd660c91a0e62f211afd38c6c2fcea38dcd5d3532200f4e95a4dc8d9e37d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e3bd660c91a0e62f211afd38c6c2fcea38dcd5d3532200f4e95a4dc8d9e37d0","first_computed_at":"2026-05-18T03:25:15.051592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:15.051592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n8Oj9u55snFEPguVPrSftEArTXRPDRlMsxKrx3PDBvwwOH5mGyeI9xtL6bAg4SLWDlF/C5HDbLSbpdWPfxRuBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:15.052201Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.4883","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e58b0b35353438a52d60198efdde4a5877f45a3fd770017d08b78b7a9a82c334","sha256:591d0bda4ffaea6d551f38e5bafe6a7e5f9d49569da8fbaa571e030013ba3583"],"state_sha256":"565edc6d856efea826364426c811fb4de4345686c07c1ca009992c0e38c3d1e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EpE41F601akejtb7mb2eRWA5ZelHccdOVmbvOW/S7BevRlphjhVnrV/Gu6VKy6fFkXPfddDfE1mSVmp4FrYgDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:13:10.140816Z","bundle_sha256":"f11096f9b62a1587e44282a6d3cb40a230dd2c8732df214b8cf21a76d16cb018"}}