{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XJZFM65UVXC32LHDS5TO7VXQRY","short_pith_number":"pith:XJZFM65U","schema_version":"1.0","canonical_sha256":"ba72567bb4adc5bd2ce39766efd6f08e28f2cb8a71036f8194c5cefcec299e66","source":{"kind":"arxiv","id":"1811.01121","version":3},"attestation_state":"computed","paper":{"title":"Optimal Sequence Length Requirements for Phylogenetic Tree Reconstruction with Indels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","q-bio.QM"],"primary_cat":"cs.DS","authors_text":"Arun Ganesh, Qiuyi Zhang","submitted_at":"2018-11-02T23:17:17Z","abstract_excerpt":"We consider the phylogenetic tree reconstruction problem with insertions and deletions (indels). Phylogenetic algorithms proceed under a model where sequences evolve down the model tree, and given sequences at the leaves, the problem is to reconstruct the model tree with high probability. Traditionally, sequences mutate by substitution-only processes, although some recent work considers evolutionary processes with insertions and deletions. In this paper, we improve on previous work by giving a reconstruction algorithm that simultaneously has $O(\\text{poly} \\log n)$ sequence length and tolerate"},"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":"1811.01121","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-02T23:17:17Z","cross_cats_sorted":["math.PR","q-bio.QM"],"title_canon_sha256":"8b0cd593eac6cae339213bbab20486ab065527bebb5a70b941a3feaefbb9c4b3","abstract_canon_sha256":"87364bdf14b855dec7b95fa6c1f4824ad2237216fca8fc0750a242b216a504bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:04.358394Z","signature_b64":"de5nKzqABJT3hy5soO4V3E9Dd9Gb2sJDEUeuilzzeAHjlmaS5olifRcfhjFSMErj3PnE5lmtqTCqNvqdq000Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba72567bb4adc5bd2ce39766efd6f08e28f2cb8a71036f8194c5cefcec299e66","last_reissued_at":"2026-05-17T23:53:04.357823Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:04.357823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Sequence Length Requirements for Phylogenetic Tree Reconstruction with Indels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","q-bio.QM"],"primary_cat":"cs.DS","authors_text":"Arun Ganesh, Qiuyi Zhang","submitted_at":"2018-11-02T23:17:17Z","abstract_excerpt":"We consider the phylogenetic tree reconstruction problem with insertions and deletions (indels). Phylogenetic algorithms proceed under a model where sequences evolve down the model tree, and given sequences at the leaves, the problem is to reconstruct the model tree with high probability. Traditionally, sequences mutate by substitution-only processes, although some recent work considers evolutionary processes with insertions and deletions. In this paper, we improve on previous work by giving a reconstruction algorithm that simultaneously has $O(\\text{poly} \\log n)$ sequence length and tolerate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01121","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":"1811.01121","created_at":"2026-05-17T23:53:04.357899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.01121v3","created_at":"2026-05-17T23:53:04.357899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01121","created_at":"2026-05-17T23:53:04.357899+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJZFM65UVXC3","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJZFM65UVXC32LHD","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJZFM65U","created_at":"2026-05-18T12:33:01.666342+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/XJZFM65UVXC32LHDS5TO7VXQRY","json":"https://pith.science/pith/XJZFM65UVXC32LHDS5TO7VXQRY.json","graph_json":"https://pith.science/api/pith-number/XJZFM65UVXC32LHDS5TO7VXQRY/graph.json","events_json":"https://pith.science/api/pith-number/XJZFM65UVXC32LHDS5TO7VXQRY/events.json","paper":"https://pith.science/paper/XJZFM65U"},"agent_actions":{"view_html":"https://pith.science/pith/XJZFM65UVXC32LHDS5TO7VXQRY","download_json":"https://pith.science/pith/XJZFM65UVXC32LHDS5TO7VXQRY.json","view_paper":"https://pith.science/paper/XJZFM65U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.01121&json=true","fetch_graph":"https://pith.science/api/pith-number/XJZFM65UVXC32LHDS5TO7VXQRY/graph.json","fetch_events":"https://pith.science/api/pith-number/XJZFM65UVXC32LHDS5TO7VXQRY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJZFM65UVXC32LHDS5TO7VXQRY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJZFM65UVXC32LHDS5TO7VXQRY/action/storage_attestation","attest_author":"https://pith.science/pith/XJZFM65UVXC32LHDS5TO7VXQRY/action/author_attestation","sign_citation":"https://pith.science/pith/XJZFM65UVXC32LHDS5TO7VXQRY/action/citation_signature","submit_replication":"https://pith.science/pith/XJZFM65UVXC32LHDS5TO7VXQRY/action/replication_record"}},"created_at":"2026-05-17T23:53:04.357899+00:00","updated_at":"2026-05-17T23:53:04.357899+00:00"}