{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VHGN3IJFSVH2YM6T5CLHRQSJQL","short_pith_number":"pith:VHGN3IJF","schema_version":"1.0","canonical_sha256":"a9ccdda125954fac33d3e89678c24982e2dd7fdec065049bf271f8ca7f3317c0","source":{"kind":"arxiv","id":"1705.06826","version":1},"attestation_state":"computed","paper":{"title":"Simulations, Computations, and Statistics for Longest Common Subsequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Christian Houdr\\'e, Qingqing liu","submitted_at":"2017-05-18T22:56:32Z","abstract_excerpt":"The length of the longest common subsequences (LCSs) is often used as a similarity measurement to compare two (or more) random words. Below we study its statistical behavior in mean and variance using a Monte-Carlo approach from which we then develop a hypothesis testing method for sequences similarity. Finally, theoretical upper bounds are obtained for the Chv\\'atal-Sankoff constant of multiple sequences."},"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":"1705.06826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-05-18T22:56:32Z","cross_cats_sorted":[],"title_canon_sha256":"e87929f6af88724f91df0deb3be42aee950a7949bb8d7575e35c6060ea3b5ed1","abstract_canon_sha256":"27e32547011f514abe5d742f9ddea159cfd91779e2819d69b57812d29843ea0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:11.207987Z","signature_b64":"CZZmGzQGRvfBZ+KD4W7een6vxUnzIihf15OvtbIk9aNDJm5tm0WcMPt2B5B3yo2hsG9PghX1IfpNS6nhK8zFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9ccdda125954fac33d3e89678c24982e2dd7fdec065049bf271f8ca7f3317c0","last_reissued_at":"2026-05-18T00:44:11.207331Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:11.207331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simulations, Computations, and Statistics for Longest Common Subsequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Christian Houdr\\'e, Qingqing liu","submitted_at":"2017-05-18T22:56:32Z","abstract_excerpt":"The length of the longest common subsequences (LCSs) is often used as a similarity measurement to compare two (or more) random words. Below we study its statistical behavior in mean and variance using a Monte-Carlo approach from which we then develop a hypothesis testing method for sequences similarity. Finally, theoretical upper bounds are obtained for the Chv\\'atal-Sankoff constant of multiple sequences."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06826","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":"1705.06826","created_at":"2026-05-18T00:44:11.207429+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.06826v1","created_at":"2026-05-18T00:44:11.207429+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06826","created_at":"2026-05-18T00:44:11.207429+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHGN3IJFSVH2","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHGN3IJFSVH2YM6T","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHGN3IJF","created_at":"2026-05-18T12:31:49.984773+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/VHGN3IJFSVH2YM6T5CLHRQSJQL","json":"https://pith.science/pith/VHGN3IJFSVH2YM6T5CLHRQSJQL.json","graph_json":"https://pith.science/api/pith-number/VHGN3IJFSVH2YM6T5CLHRQSJQL/graph.json","events_json":"https://pith.science/api/pith-number/VHGN3IJFSVH2YM6T5CLHRQSJQL/events.json","paper":"https://pith.science/paper/VHGN3IJF"},"agent_actions":{"view_html":"https://pith.science/pith/VHGN3IJFSVH2YM6T5CLHRQSJQL","download_json":"https://pith.science/pith/VHGN3IJFSVH2YM6T5CLHRQSJQL.json","view_paper":"https://pith.science/paper/VHGN3IJF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.06826&json=true","fetch_graph":"https://pith.science/api/pith-number/VHGN3IJFSVH2YM6T5CLHRQSJQL/graph.json","fetch_events":"https://pith.science/api/pith-number/VHGN3IJFSVH2YM6T5CLHRQSJQL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHGN3IJFSVH2YM6T5CLHRQSJQL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHGN3IJFSVH2YM6T5CLHRQSJQL/action/storage_attestation","attest_author":"https://pith.science/pith/VHGN3IJFSVH2YM6T5CLHRQSJQL/action/author_attestation","sign_citation":"https://pith.science/pith/VHGN3IJFSVH2YM6T5CLHRQSJQL/action/citation_signature","submit_replication":"https://pith.science/pith/VHGN3IJFSVH2YM6T5CLHRQSJQL/action/replication_record"}},"created_at":"2026-05-18T00:44:11.207429+00:00","updated_at":"2026-05-18T00:44:11.207429+00:00"}