{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EXYAMX3IVVYS66EUSJ5SGDWRO7","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":"d08caf7407b50b1f8a24ef918019b95e6704a08b597700c403457de2a32e4f54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-09-26T20:30:43Z","title_canon_sha256":"ea5bed30c3cf685c0cd2a445519fd8073bc1aab605b77e0c386bd70b7c9d4a2b"},"schema_version":"1.0","source":{"id":"1409.7713","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7713","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7713v1","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7713","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"EXYAMX3IVVYS","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EXYAMX3IVVYS66EU","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EXYAMX3I","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:bd7dea4f9951146a9a3de6dc086b5a19d821732e10c106f3e80b88d433d7ddf7","target":"graph","created_at":"2026-05-18T02:41:40Z","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":"Consider finite sequences $X_{[1,n]}=X_1\\dots X_n$ and $Y_{[1,n]}=Y_1\\dots Y_n$ of length $n$, consisting of i.i.d.\\ samples of random letters from a finite alphabet, and let $S$ and $T$ be chosen i.i.d.\\ randomly from the unit ball in the space of symmetric scoring functions over this alphabet augmented by a gap symbol. We prove a probabilistic upper bound of linear order in $n^{0.75}$ for the deviation of the score relative to $T$ of optimal alignments with gaps of $X_{[1,n]}$ and $Y_{[1,n]}$ relative to $S$. It remains an open problem to prove a lower bound. Our result contributes to the un","authors_text":"Heinrich Matzinger, Ionel Popescu, Raphael Hauser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-09-26T20:30:43Z","title":"An Upper Bound on the Convergence Rate of a Second Functional in Optimal Sequence Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7713","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:734d9cb1a8d09b967d9ab12cb1e74a3ec913271fc0c1313fd5981a6908380a26","target":"record","created_at":"2026-05-18T02:41:40Z","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":"d08caf7407b50b1f8a24ef918019b95e6704a08b597700c403457de2a32e4f54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-09-26T20:30:43Z","title_canon_sha256":"ea5bed30c3cf685c0cd2a445519fd8073bc1aab605b77e0c386bd70b7c9d4a2b"},"schema_version":"1.0","source":{"id":"1409.7713","kind":"arxiv","version":1}},"canonical_sha256":"25f0065f68ad712f7894927b230ed177cadc82b34ee10ca58ff07190614c954b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25f0065f68ad712f7894927b230ed177cadc82b34ee10ca58ff07190614c954b","first_computed_at":"2026-05-18T02:41:40.803011Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:40.803011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CXIuNHiChOTonMRhjiumYKhb8BvyTNke7hy/cnDTr4pvNXhNT7Of7Ownf0x8sV9bsShy97ZcLzpBInGSsSrUDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:40.803699Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7713","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:734d9cb1a8d09b967d9ab12cb1e74a3ec913271fc0c1313fd5981a6908380a26","sha256:bd7dea4f9951146a9a3de6dc086b5a19d821732e10c106f3e80b88d433d7ddf7"],"state_sha256":"15f70ede58ef7eca70627edd983581ff5d3d0d75ebac730d4fa9bc93846dcee4"}