{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EXYAMX3IVVYS66EUSJ5SGDWRO7","short_pith_number":"pith:EXYAMX3I","schema_version":"1.0","canonical_sha256":"25f0065f68ad712f7894927b230ed177cadc82b34ee10ca58ff07190614c954b","source":{"kind":"arxiv","id":"1409.7713","version":1},"attestation_state":"computed","paper":{"title":"An Upper Bound on the Convergence Rate of a Second Functional in Optimal Sequence Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Heinrich Matzinger, Ionel Popescu, Raphael Hauser","submitted_at":"2014-09-26T20:30:43Z","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"},"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":"1409.7713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-09-26T20:30:43Z","cross_cats_sorted":[],"title_canon_sha256":"ea5bed30c3cf685c0cd2a445519fd8073bc1aab605b77e0c386bd70b7c9d4a2b","abstract_canon_sha256":"d08caf7407b50b1f8a24ef918019b95e6704a08b597700c403457de2a32e4f54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:40.803699Z","signature_b64":"CXIuNHiChOTonMRhjiumYKhb8BvyTNke7hy/cnDTr4pvNXhNT7Of7Ownf0x8sV9bsShy97ZcLzpBInGSsSrUDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25f0065f68ad712f7894927b230ed177cadc82b34ee10ca58ff07190614c954b","last_reissued_at":"2026-05-18T02:41:40.803011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:40.803011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Upper Bound on the Convergence Rate of a Second Functional in Optimal Sequence Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Heinrich Matzinger, Ionel Popescu, Raphael Hauser","submitted_at":"2014-09-26T20:30:43Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7713","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":"1409.7713","created_at":"2026-05-18T02:41:40.803130+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.7713v1","created_at":"2026-05-18T02:41:40.803130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7713","created_at":"2026-05-18T02:41:40.803130+00:00"},{"alias_kind":"pith_short_12","alias_value":"EXYAMX3IVVYS","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"EXYAMX3IVVYS66EU","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"EXYAMX3I","created_at":"2026-05-18T12:28:28.263976+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/EXYAMX3IVVYS66EUSJ5SGDWRO7","json":"https://pith.science/pith/EXYAMX3IVVYS66EUSJ5SGDWRO7.json","graph_json":"https://pith.science/api/pith-number/EXYAMX3IVVYS66EUSJ5SGDWRO7/graph.json","events_json":"https://pith.science/api/pith-number/EXYAMX3IVVYS66EUSJ5SGDWRO7/events.json","paper":"https://pith.science/paper/EXYAMX3I"},"agent_actions":{"view_html":"https://pith.science/pith/EXYAMX3IVVYS66EUSJ5SGDWRO7","download_json":"https://pith.science/pith/EXYAMX3IVVYS66EUSJ5SGDWRO7.json","view_paper":"https://pith.science/paper/EXYAMX3I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.7713&json=true","fetch_graph":"https://pith.science/api/pith-number/EXYAMX3IVVYS66EUSJ5SGDWRO7/graph.json","fetch_events":"https://pith.science/api/pith-number/EXYAMX3IVVYS66EUSJ5SGDWRO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EXYAMX3IVVYS66EUSJ5SGDWRO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EXYAMX3IVVYS66EUSJ5SGDWRO7/action/storage_attestation","attest_author":"https://pith.science/pith/EXYAMX3IVVYS66EUSJ5SGDWRO7/action/author_attestation","sign_citation":"https://pith.science/pith/EXYAMX3IVVYS66EUSJ5SGDWRO7/action/citation_signature","submit_replication":"https://pith.science/pith/EXYAMX3IVVYS66EUSJ5SGDWRO7/action/replication_record"}},"created_at":"2026-05-18T02:41:40.803130+00:00","updated_at":"2026-05-18T02:41:40.803130+00:00"}