{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:DNGWFHMHUTA6KBPF2JQKMXBOGT","short_pith_number":"pith:DNGWFHMH","schema_version":"1.0","canonical_sha256":"1b4d629d87a4c1e505e5d260a65c2e34cb53ca2acc33bfd83267659037ee2d56","source":{"kind":"arxiv","id":"0807.0051","version":2},"attestation_state":"computed","paper":{"title":"Lower Bounds for Optimal Alignments of Binary Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"q-bio.GN","authors_text":"Cynthia Vinzant","submitted_at":"2008-07-01T01:29:06Z","abstract_excerpt":"In parametric sequence alignment, optimal alignments of two sequences are computed as a function of the penalties for mismatches and spaces, producing many different optimal alignments. Here we give a 3/(2^{7/3}\\pi^{2/3})n^{2/3} +O(n^{1/3} \\log n) lower bound on the maximum number of distinct optimal alignment summaries of length-n binary sequences. This shows that the upper bound given by Gusfield et. al. is tight over all alphabets, thereby disproving the \"square root of n conjecture\". Thus the maximum number of distinct optimal alignment summaries (i.e. vertices of the alignment polytope) o"},"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":"0807.0051","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.GN","submitted_at":"2008-07-01T01:29:06Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"f53cf4bdaf4b41cfb61a7bf3345c96d57d5e477d64d7d416c2a8749638d27cc3","abstract_canon_sha256":"e27f7accbaf14fda3b35bee02126c3d6ebb2cfb5ecbf8ad81ab59b26a9a34b22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:30.045137Z","signature_b64":"NPW0qjWXhvemuanlbe53NTHEohEyTpJ0kLYoJgs/IYl/S8r8TBc+9JQAXJhKaryQpeHPUDaHXncy1u1BzOn+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b4d629d87a4c1e505e5d260a65c2e34cb53ca2acc33bfd83267659037ee2d56","last_reissued_at":"2026-05-18T04:31:30.044650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:30.044650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for Optimal Alignments of Binary Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"q-bio.GN","authors_text":"Cynthia Vinzant","submitted_at":"2008-07-01T01:29:06Z","abstract_excerpt":"In parametric sequence alignment, optimal alignments of two sequences are computed as a function of the penalties for mismatches and spaces, producing many different optimal alignments. Here we give a 3/(2^{7/3}\\pi^{2/3})n^{2/3} +O(n^{1/3} \\log n) lower bound on the maximum number of distinct optimal alignment summaries of length-n binary sequences. This shows that the upper bound given by Gusfield et. al. is tight over all alphabets, thereby disproving the \"square root of n conjecture\". Thus the maximum number of distinct optimal alignment summaries (i.e. vertices of the alignment polytope) o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.0051","kind":"arxiv","version":2},"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":"0807.0051","created_at":"2026-05-18T04:31:30.044726+00:00"},{"alias_kind":"arxiv_version","alias_value":"0807.0051v2","created_at":"2026-05-18T04:31:30.044726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.0051","created_at":"2026-05-18T04:31:30.044726+00:00"},{"alias_kind":"pith_short_12","alias_value":"DNGWFHMHUTA6","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"DNGWFHMHUTA6KBPF","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"DNGWFHMH","created_at":"2026-05-18T12:25:57.157939+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/DNGWFHMHUTA6KBPF2JQKMXBOGT","json":"https://pith.science/pith/DNGWFHMHUTA6KBPF2JQKMXBOGT.json","graph_json":"https://pith.science/api/pith-number/DNGWFHMHUTA6KBPF2JQKMXBOGT/graph.json","events_json":"https://pith.science/api/pith-number/DNGWFHMHUTA6KBPF2JQKMXBOGT/events.json","paper":"https://pith.science/paper/DNGWFHMH"},"agent_actions":{"view_html":"https://pith.science/pith/DNGWFHMHUTA6KBPF2JQKMXBOGT","download_json":"https://pith.science/pith/DNGWFHMHUTA6KBPF2JQKMXBOGT.json","view_paper":"https://pith.science/paper/DNGWFHMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0807.0051&json=true","fetch_graph":"https://pith.science/api/pith-number/DNGWFHMHUTA6KBPF2JQKMXBOGT/graph.json","fetch_events":"https://pith.science/api/pith-number/DNGWFHMHUTA6KBPF2JQKMXBOGT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DNGWFHMHUTA6KBPF2JQKMXBOGT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DNGWFHMHUTA6KBPF2JQKMXBOGT/action/storage_attestation","attest_author":"https://pith.science/pith/DNGWFHMHUTA6KBPF2JQKMXBOGT/action/author_attestation","sign_citation":"https://pith.science/pith/DNGWFHMHUTA6KBPF2JQKMXBOGT/action/citation_signature","submit_replication":"https://pith.science/pith/DNGWFHMHUTA6KBPF2JQKMXBOGT/action/replication_record"}},"created_at":"2026-05-18T04:31:30.044726+00:00","updated_at":"2026-05-18T04:31:30.044726+00:00"}