{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ZRJIYFO7VWLB3OORKGLGL77ENJ","short_pith_number":"pith:ZRJIYFO7","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"},"canonical_sha256":"cc528c15dfad961db9d1519665ffe46a7840cd51bb2db36d4cfb77dab77e6a6d","source":{"kind":"arxiv","id":"2407.10925","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.10925","created_at":"2026-07-05T08:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"2407.10925v1","created_at":"2026-07-05T08:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.10925","created_at":"2026-07-05T08:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"ZRJIYFO7VWLB","created_at":"2026-07-05T08:44:06Z"},{"alias_kind":"pith_short_16","alias_value":"ZRJIYFO7VWLB3OOR","created_at":"2026-07-05T08:44:06Z"},{"alias_kind":"pith_short_8","alias_value":"ZRJIYFO7","created_at":"2026-07-05T08:44:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ZRJIYFO7VWLB3OORKGLGL77ENJ","target":"record","payload":{"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"},"canonical_sha256":"cc528c15dfad961db9d1519665ffe46a7840cd51bb2db36d4cfb77dab77e6a6d","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"},"source_kind":"arxiv","source_id":"2407.10925","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-07-05T08:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CKJjTY3W6mZALK3lp77Q0e/ZFiMFIIQkkl0G8qGp2FpXVaH3PduxcXpviwIASnEhHgygptSkLbU9dUQBDc2lAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-28T19:45:55.277980Z"},"content_sha256":"f361a6fc095df7438155cfb2e748b4e445297ac537a692b47e03f075301c91aa","schema_version":"1.0","event_id":"sha256:f361a6fc095df7438155cfb2e748b4e445297ac537a692b47e03f075301c91aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ZRJIYFO7VWLB3OORKGLGL77ENJ","target":"graph","payload":{"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"},"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-07-05T08:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VPeG0mIu+rcI4rGYkSNhZIUwQ3S7zhr8IfSUuOpBiX5qpKr/UQ0BpHnVVCkNWJEBSyfU6b8Dic076gcS6mpQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-28T19:45:55.278846Z"},"content_sha256":"a5c4ff20dec6afa054740b2fe2e38dcb6246ba05a53695498d5fd4b79338e587","schema_version":"1.0","event_id":"sha256:a5c4ff20dec6afa054740b2fe2e38dcb6246ba05a53695498d5fd4b79338e587"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZRJIYFO7VWLB3OORKGLGL77ENJ/bundle.json","state_url":"https://pith.science/pith/ZRJIYFO7VWLB3OORKGLGL77ENJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZRJIYFO7VWLB3OORKGLGL77ENJ/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-07-28T19:45:55Z","links":{"resolver":"https://pith.science/pith/ZRJIYFO7VWLB3OORKGLGL77ENJ","bundle":"https://pith.science/pith/ZRJIYFO7VWLB3OORKGLGL77ENJ/bundle.json","state":"https://pith.science/pith/ZRJIYFO7VWLB3OORKGLGL77ENJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZRJIYFO7VWLB3OORKGLGL77ENJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ZRJIYFO7VWLB3OORKGLGL77ENJ","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":"65913b4a09c88dfdbe8e9fc22d8ea77df784d98982ecdb9f2ce8ca17260cb09e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-07-15T17:25:41Z","title_canon_sha256":"9ea8a21f8f90d6e47ce91f0e1649cce0cec2250f5cadc44c8c2d2bc7fec990cf"},"schema_version":"1.0","source":{"id":"2407.10925","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.10925","created_at":"2026-07-05T08:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"2407.10925v1","created_at":"2026-07-05T08:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.10925","created_at":"2026-07-05T08:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"ZRJIYFO7VWLB","created_at":"2026-07-05T08:44:06Z"},{"alias_kind":"pith_short_16","alias_value":"ZRJIYFO7VWLB3OOR","created_at":"2026-07-05T08:44:06Z"},{"alias_kind":"pith_short_8","alias_value":"ZRJIYFO7","created_at":"2026-07-05T08:44:06Z"}],"graph_snapshots":[{"event_id":"sha256:a5c4ff20dec6afa054740b2fe2e38dcb6246ba05a53695498d5fd4b79338e587","target":"graph","created_at":"2026-07-05T08:44:06Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.10925/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andrew Salls, Chase Miller, Daniel Reichman, Duncan Soiffer, G\\'abor S\\'ark\\\"ozy, George T. Heineman","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-07-15T17:25:41Z","title":"Improved Lower Bounds on the Expected Length of Longest Common Subsequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.10925","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:f361a6fc095df7438155cfb2e748b4e445297ac537a692b47e03f075301c91aa","target":"record","created_at":"2026-07-05T08:44:06Z","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":"65913b4a09c88dfdbe8e9fc22d8ea77df784d98982ecdb9f2ce8ca17260cb09e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-07-15T17:25:41Z","title_canon_sha256":"9ea8a21f8f90d6e47ce91f0e1649cce0cec2250f5cadc44c8c2d2bc7fec990cf"},"schema_version":"1.0","source":{"id":"2407.10925","kind":"arxiv","version":1}},"canonical_sha256":"cc528c15dfad961db9d1519665ffe46a7840cd51bb2db36d4cfb77dab77e6a6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc528c15dfad961db9d1519665ffe46a7840cd51bb2db36d4cfb77dab77e6a6d","first_computed_at":"2026-07-05T08:44:06.239110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:44:06.239110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jVTuXzjOttn9EMMFGY64Qr3Z8I6G5PjriEb7LtLFdnEYEY4MvgodUOXoNfc09KA70qXqeYHGqtSIyhCBOZ+4Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:44:06.239591Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.10925","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f361a6fc095df7438155cfb2e748b4e445297ac537a692b47e03f075301c91aa","sha256:a5c4ff20dec6afa054740b2fe2e38dcb6246ba05a53695498d5fd4b79338e587"],"state_sha256":"67820d9b60be6108432574624de568a7b36e402381a32f76d2e607f7486dd5ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NwvmbiW8uaNf/1sFCkvuuVqHqWDFG/wOuaJBjJTAzWAYmzeqq57LNj6uyq74AyXYwVlWSKsJ8sHCc1Qx+5+HDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-28T19:45:55.283305Z","bundle_sha256":"9f6707dbbac889f0443e0f5fd9bb1975aa62d288b18b8f19c3e111882e7c5684"}}