{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZRJIYFO7VWLB3OORKGLGL77ENJ","short_pith_number":"pith:ZRJIYFO7","schema_version":"1.0","canonical_sha256":"cc528c15dfad961db9d1519665ffe46a7840cd51bb2db36d4cfb77dab77e6a6d","source":{"kind":"arxiv","id":"2407.10925","version":1},"attestation_state":"computed","paper":{"title":"Improved Lower Bounds on the Expected Length of Longest Common Subsequences","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew Salls, Chase Miller, Daniel Reichman, Duncan Soiffer, G\\'abor S\\'ark\\\"ozy, George T. Heineman","submitted_at":"2024-07-15T17:25:41Z","abstract_excerpt":"It has been proven that, when normalized by $n$, the expected length of a longest common subsequence of $d$ random strings of length $n$ over an alphabet of size $\\sigma$ converges to some constant that depends only on $d$ and $\\sigma$. These values are known as the Chv\\'{a}tal-Sankoff constants, and determining their exact values is a well-known open problem. Upper and lower bounds are known for some combinations of $\\sigma$ and $d$, with the best lower and upper bounds for the most studied case, $\\sigma=2, d=2$, at $0.788071$ and $0.826280$, respectively. Building off previous algorithms for"},"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":"2407.10925","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-07-15T17:25:41Z","cross_cats_sorted":[],"title_canon_sha256":"9ea8a21f8f90d6e47ce91f0e1649cce0cec2250f5cadc44c8c2d2bc7fec990cf","abstract_canon_sha256":"65913b4a09c88dfdbe8e9fc22d8ea77df784d98982ecdb9f2ce8ca17260cb09e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:44:06.239591Z","signature_b64":"jVTuXzjOttn9EMMFGY64Qr3Z8I6G5PjriEb7LtLFdnEYEY4MvgodUOXoNfc09KA70qXqeYHGqtSIyhCBOZ+4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc528c15dfad961db9d1519665ffe46a7840cd51bb2db36d4cfb77dab77e6a6d","last_reissued_at":"2026-07-05T08:44:06.239110Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:44:06.239110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Lower Bounds on the Expected Length of Longest Common Subsequences","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew Salls, Chase Miller, Daniel Reichman, Duncan Soiffer, G\\'abor S\\'ark\\\"ozy, George T. Heineman","submitted_at":"2024-07-15T17:25:41Z","abstract_excerpt":"It has been proven that, when normalized by $n$, the expected length of a longest common subsequence of $d$ random strings of length $n$ over an alphabet of size $\\sigma$ converges to some constant that depends only on $d$ and $\\sigma$. These values are known as the Chv\\'{a}tal-Sankoff constants, and determining their exact values is a well-known open problem. Upper and lower bounds are known for some combinations of $\\sigma$ and $d$, with the best lower and upper bounds for the most studied case, $\\sigma=2, d=2$, at $0.788071$ and $0.826280$, respectively. Building off previous algorithms for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.10925","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.10925/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2407.10925","created_at":"2026-07-05T08:44:06.239167+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.10925v1","created_at":"2026-07-05T08:44:06.239167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.10925","created_at":"2026-07-05T08:44:06.239167+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZRJIYFO7VWLB","created_at":"2026-07-05T08:44:06.239167+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZRJIYFO7VWLB3OOR","created_at":"2026-07-05T08:44:06.239167+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZRJIYFO7","created_at":"2026-07-05T08:44:06.239167+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.07234","citing_title":"The Random Subsequence Model and Uniform Codes for the Deletion Channel","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZRJIYFO7VWLB3OORKGLGL77ENJ","json":"https://pith.science/pith/ZRJIYFO7VWLB3OORKGLGL77ENJ.json","graph_json":"https://pith.science/api/pith-number/ZRJIYFO7VWLB3OORKGLGL77ENJ/graph.json","events_json":"https://pith.science/api/pith-number/ZRJIYFO7VWLB3OORKGLGL77ENJ/events.json","paper":"https://pith.science/paper/ZRJIYFO7"},"agent_actions":{"view_html":"https://pith.science/pith/ZRJIYFO7VWLB3OORKGLGL77ENJ","download_json":"https://pith.science/pith/ZRJIYFO7VWLB3OORKGLGL77ENJ.json","view_paper":"https://pith.science/paper/ZRJIYFO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.10925&json=true","fetch_graph":"https://pith.science/api/pith-number/ZRJIYFO7VWLB3OORKGLGL77ENJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZRJIYFO7VWLB3OORKGLGL77ENJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZRJIYFO7VWLB3OORKGLGL77ENJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZRJIYFO7VWLB3OORKGLGL77ENJ/action/storage_attestation","attest_author":"https://pith.science/pith/ZRJIYFO7VWLB3OORKGLGL77ENJ/action/author_attestation","sign_citation":"https://pith.science/pith/ZRJIYFO7VWLB3OORKGLGL77ENJ/action/citation_signature","submit_replication":"https://pith.science/pith/ZRJIYFO7VWLB3OORKGLGL77ENJ/action/replication_record"}},"created_at":"2026-07-05T08:44:06.239167+00:00","updated_at":"2026-07-05T08:44:06.239167+00:00"}