{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:X55Y25K6SPREXWJVTUYXIOCRVN","short_pith_number":"pith:X55Y25K6","schema_version":"1.0","canonical_sha256":"bf7b8d755e93e24bd9359d31743851ab5979727cdbad627c2f46a67efa767309","source":{"kind":"arxiv","id":"1703.05788","version":1},"attestation_state":"computed","paper":{"title":"Non-normal limiting distribution for optimal alignment scores of strings in binary alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Heinrich Matzinger, Ionel Popescu, Jun Tao Duan","submitted_at":"2017-03-16T18:36:51Z","abstract_excerpt":"We consider two independent binary i.i.d. random strings $X$ and $Y$ of equal length $n$ and the optimal alignments according to a symmetric scoring functions only. We decompose the space of scoring functions into five components. Two of these components add a part to the optimal score which does not depend on the alignment and which is asymptotically normal.\n  We show that when we restrict the number of gaps sufficiently and add them only into one sequence, then the alignment score can be decomposed into a part which is normal and has order $O(\\sqrt{n})$ and a part which is on a smaller order"},"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":"1703.05788","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-03-16T18:36:51Z","cross_cats_sorted":[],"title_canon_sha256":"e36118876924eaf58333325d5f9875b99d7a7bb64811556e711690d9b0b7ba64","abstract_canon_sha256":"d5be7518bc8fda9e93e460d1ad61e49f79306c13ee2a9901e58cd1007295e7b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:56.638246Z","signature_b64":"IocVgAhXsDaXRmeQeSewZOELWPmVA+9dbLEZd7o4/PHUaWBeYnN1tjba+Z1K3ZoSrGyZOgYaRPvyhFJcC+j8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf7b8d755e93e24bd9359d31743851ab5979727cdbad627c2f46a67efa767309","last_reissued_at":"2026-05-18T00:38:56.637075Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:56.637075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-normal limiting distribution for optimal alignment scores of strings in binary alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Heinrich Matzinger, Ionel Popescu, Jun Tao Duan","submitted_at":"2017-03-16T18:36:51Z","abstract_excerpt":"We consider two independent binary i.i.d. random strings $X$ and $Y$ of equal length $n$ and the optimal alignments according to a symmetric scoring functions only. We decompose the space of scoring functions into five components. Two of these components add a part to the optimal score which does not depend on the alignment and which is asymptotically normal.\n  We show that when we restrict the number of gaps sufficiently and add them only into one sequence, then the alignment score can be decomposed into a part which is normal and has order $O(\\sqrt{n})$ and a part which is on a smaller order"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05788","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":"1703.05788","created_at":"2026-05-18T00:38:56.637558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.05788v1","created_at":"2026-05-18T00:38:56.637558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05788","created_at":"2026-05-18T00:38:56.637558+00:00"},{"alias_kind":"pith_short_12","alias_value":"X55Y25K6SPRE","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"X55Y25K6SPREXWJV","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"X55Y25K6","created_at":"2026-05-18T12:31:53.515858+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/X55Y25K6SPREXWJVTUYXIOCRVN","json":"https://pith.science/pith/X55Y25K6SPREXWJVTUYXIOCRVN.json","graph_json":"https://pith.science/api/pith-number/X55Y25K6SPREXWJVTUYXIOCRVN/graph.json","events_json":"https://pith.science/api/pith-number/X55Y25K6SPREXWJVTUYXIOCRVN/events.json","paper":"https://pith.science/paper/X55Y25K6"},"agent_actions":{"view_html":"https://pith.science/pith/X55Y25K6SPREXWJVTUYXIOCRVN","download_json":"https://pith.science/pith/X55Y25K6SPREXWJVTUYXIOCRVN.json","view_paper":"https://pith.science/paper/X55Y25K6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.05788&json=true","fetch_graph":"https://pith.science/api/pith-number/X55Y25K6SPREXWJVTUYXIOCRVN/graph.json","fetch_events":"https://pith.science/api/pith-number/X55Y25K6SPREXWJVTUYXIOCRVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X55Y25K6SPREXWJVTUYXIOCRVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X55Y25K6SPREXWJVTUYXIOCRVN/action/storage_attestation","attest_author":"https://pith.science/pith/X55Y25K6SPREXWJVTUYXIOCRVN/action/author_attestation","sign_citation":"https://pith.science/pith/X55Y25K6SPREXWJVTUYXIOCRVN/action/citation_signature","submit_replication":"https://pith.science/pith/X55Y25K6SPREXWJVTUYXIOCRVN/action/replication_record"}},"created_at":"2026-05-18T00:38:56.637558+00:00","updated_at":"2026-05-18T00:38:56.637558+00:00"}