{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RY55MYGJDIHGF4QRV7JYY3BPZ2","short_pith_number":"pith:RY55MYGJ","schema_version":"1.0","canonical_sha256":"8e3bd660c91a0e62f211afd38c6c2fcea38dcd5d3532200f4e95a4dc8d9e37d0","source":{"kind":"arxiv","id":"1305.4883","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.4883","created_at":"2026-05-18T03:25:15.051658+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.4883v1","created_at":"2026-05-18T03:25:15.051658+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4883","created_at":"2026-05-18T03:25:15.051658+00:00"},{"alias_kind":"pith_short_12","alias_value":"RY55MYGJDIHG","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"RY55MYGJDIHGF4QR","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"RY55MYGJ","created_at":"2026-05-18T12:27:59.945178+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/RY55MYGJDIHGF4QRV7JYY3BPZ2","json":"https://pith.science/pith/RY55MYGJDIHGF4QRV7JYY3BPZ2.json","graph_json":"https://pith.science/api/pith-number/RY55MYGJDIHGF4QRV7JYY3BPZ2/graph.json","events_json":"https://pith.science/api/pith-number/RY55MYGJDIHGF4QRV7JYY3BPZ2/events.json","paper":"https://pith.science/paper/RY55MYGJ"},"agent_actions":{"view_html":"https://pith.science/pith/RY55MYGJDIHGF4QRV7JYY3BPZ2","download_json":"https://pith.science/pith/RY55MYGJDIHGF4QRV7JYY3BPZ2.json","view_paper":"https://pith.science/paper/RY55MYGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.4883&json=true","fetch_graph":"https://pith.science/api/pith-number/RY55MYGJDIHGF4QRV7JYY3BPZ2/graph.json","fetch_events":"https://pith.science/api/pith-number/RY55MYGJDIHGF4QRV7JYY3BPZ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RY55MYGJDIHGF4QRV7JYY3BPZ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RY55MYGJDIHGF4QRV7JYY3BPZ2/action/storage_attestation","attest_author":"https://pith.science/pith/RY55MYGJDIHGF4QRV7JYY3BPZ2/action/author_attestation","sign_citation":"https://pith.science/pith/RY55MYGJDIHGF4QRV7JYY3BPZ2/action/citation_signature","submit_replication":"https://pith.science/pith/RY55MYGJDIHGF4QRV7JYY3BPZ2/action/replication_record"}},"created_at":"2026-05-18T03:25:15.051658+00:00","updated_at":"2026-05-18T03:25:15.051658+00:00"}