{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2YKEAKECLXABP2XLDUZEY34GEW","short_pith_number":"pith:2YKEAKEC","schema_version":"1.0","canonical_sha256":"d6144028825dc017eaeb1d324c6f86259c57788c1689b8d42d28839781b04fb3","source":{"kind":"arxiv","id":"1011.2688","version":3},"attestation_state":"computed","paper":{"title":"The rate of the convergence of the mean score in random sequence comparison","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Felipe Torres, Heinrich Matzinger, Juri Lember","submitted_at":"2010-11-11T15:31:20Z","abstract_excerpt":"We consider a general class of super-additive scores measuring the similarity of two independent sequences of $n$ i.i.d. letters from a finite alphabet. Our object of interest is the mean score by letter $l_n$. By the subadditivity $l_n$ is nondecreasing and converges to a limit $l$. We give a simple method of bounding the difference $l-l_n$ and obtaining the rate of convergence. Our result generalizes a previous result of Alexander, where only the special case of the longest common subsequence is considered."},"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":"1011.2688","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-11-11T15:31:20Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"03a54ec3ffdc7f7d625d096a4d855db27c71cba7281abaff7d7c30210f072fec","abstract_canon_sha256":"7258cf30d094e44c10cb12804ab299659715c597c80d99f4eb5a0137c8358684"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:47.539759Z","signature_b64":"jBlP9DOsoP6ndtWxf9N0K9jgMxgsPMdlFmDQhMAKbIrhr64q6OCpg1FGNw9Vvf15jZbJCkmhWZjOcsZOKjNkDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6144028825dc017eaeb1d324c6f86259c57788c1689b8d42d28839781b04fb3","last_reissued_at":"2026-05-18T04:35:47.539212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:47.539212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The rate of the convergence of the mean score in random sequence comparison","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Felipe Torres, Heinrich Matzinger, Juri Lember","submitted_at":"2010-11-11T15:31:20Z","abstract_excerpt":"We consider a general class of super-additive scores measuring the similarity of two independent sequences of $n$ i.i.d. letters from a finite alphabet. Our object of interest is the mean score by letter $l_n$. By the subadditivity $l_n$ is nondecreasing and converges to a limit $l$. We give a simple method of bounding the difference $l-l_n$ and obtaining the rate of convergence. Our result generalizes a previous result of Alexander, where only the special case of the longest common subsequence is considered."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2688","kind":"arxiv","version":3},"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":"1011.2688","created_at":"2026-05-18T04:35:47.539285+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.2688v3","created_at":"2026-05-18T04:35:47.539285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2688","created_at":"2026-05-18T04:35:47.539285+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YKEAKECLXAB","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YKEAKECLXABP2XL","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YKEAKEC","created_at":"2026-05-18T12:26:03.138858+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/2YKEAKECLXABP2XLDUZEY34GEW","json":"https://pith.science/pith/2YKEAKECLXABP2XLDUZEY34GEW.json","graph_json":"https://pith.science/api/pith-number/2YKEAKECLXABP2XLDUZEY34GEW/graph.json","events_json":"https://pith.science/api/pith-number/2YKEAKECLXABP2XLDUZEY34GEW/events.json","paper":"https://pith.science/paper/2YKEAKEC"},"agent_actions":{"view_html":"https://pith.science/pith/2YKEAKECLXABP2XLDUZEY34GEW","download_json":"https://pith.science/pith/2YKEAKECLXABP2XLDUZEY34GEW.json","view_paper":"https://pith.science/paper/2YKEAKEC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.2688&json=true","fetch_graph":"https://pith.science/api/pith-number/2YKEAKECLXABP2XLDUZEY34GEW/graph.json","fetch_events":"https://pith.science/api/pith-number/2YKEAKECLXABP2XLDUZEY34GEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YKEAKECLXABP2XLDUZEY34GEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YKEAKECLXABP2XLDUZEY34GEW/action/storage_attestation","attest_author":"https://pith.science/pith/2YKEAKECLXABP2XLDUZEY34GEW/action/author_attestation","sign_citation":"https://pith.science/pith/2YKEAKECLXABP2XLDUZEY34GEW/action/citation_signature","submit_replication":"https://pith.science/pith/2YKEAKECLXABP2XLDUZEY34GEW/action/replication_record"}},"created_at":"2026-05-18T04:35:47.539285+00:00","updated_at":"2026-05-18T04:35:47.539285+00:00"}