{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XJZFM65UVXC32LHDS5TO7VXQRY","short_pith_number":"pith:XJZFM65U","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"},"canonical_sha256":"ba72567bb4adc5bd2ce39766efd6f08e28f2cb8a71036f8194c5cefcec299e66","source":{"kind":"arxiv","id":"1811.01121","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01121","created_at":"2026-05-17T23:53:04Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01121v3","created_at":"2026-05-17T23:53:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01121","created_at":"2026-05-17T23:53:04Z"},{"alias_kind":"pith_short_12","alias_value":"XJZFM65UVXC3","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XJZFM65UVXC32LHD","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XJZFM65U","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XJZFM65UVXC32LHDS5TO7VXQRY","target":"record","payload":{"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"},"canonical_sha256":"ba72567bb4adc5bd2ce39766efd6f08e28f2cb8a71036f8194c5cefcec299e66","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"},"source_kind":"arxiv","source_id":"1811.01121","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZlFdldLovvznv1VpCTbXw2JccqRH9600atPp9PRmyhSwDEinxrQzWwpue7Jpau5zUBEieZnUPqXXGUJKdbSTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:22:43.342195Z"},"content_sha256":"91ca358115c9090a22374831e2d4d7d246b865c7c57b35a3c5ebebc891034ff0","schema_version":"1.0","event_id":"sha256:91ca358115c9090a22374831e2d4d7d246b865c7c57b35a3c5ebebc891034ff0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XJZFM65UVXC32LHDS5TO7VXQRY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O/h2ATbf7fuOyjpA8HZo2WoFV/tEr9rCSwd5sFQWyUJ/PrUVDsnuFKF4Wls1Hr27RfuBOqQ2Dq2LkNtYCrS8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:22:43.342860Z"},"content_sha256":"b4807c5d1ad2baf6362b0dc076d8141fc94660205aaf4534f14b1ad07a617832","schema_version":"1.0","event_id":"sha256:b4807c5d1ad2baf6362b0dc076d8141fc94660205aaf4534f14b1ad07a617832"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XJZFM65UVXC32LHDS5TO7VXQRY/bundle.json","state_url":"https://pith.science/pith/XJZFM65UVXC32LHDS5TO7VXQRY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XJZFM65UVXC32LHDS5TO7VXQRY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T23:22:43Z","links":{"resolver":"https://pith.science/pith/XJZFM65UVXC32LHDS5TO7VXQRY","bundle":"https://pith.science/pith/XJZFM65UVXC32LHDS5TO7VXQRY/bundle.json","state":"https://pith.science/pith/XJZFM65UVXC32LHDS5TO7VXQRY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XJZFM65UVXC32LHDS5TO7VXQRY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XJZFM65UVXC32LHDS5TO7VXQRY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"87364bdf14b855dec7b95fa6c1f4824ad2237216fca8fc0750a242b216a504bd","cross_cats_sorted":["math.PR","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-02T23:17:17Z","title_canon_sha256":"8b0cd593eac6cae339213bbab20486ab065527bebb5a70b941a3feaefbb9c4b3"},"schema_version":"1.0","source":{"id":"1811.01121","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01121","created_at":"2026-05-17T23:53:04Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01121v3","created_at":"2026-05-17T23:53:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01121","created_at":"2026-05-17T23:53:04Z"},{"alias_kind":"pith_short_12","alias_value":"XJZFM65UVXC3","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XJZFM65UVXC32LHD","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XJZFM65U","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:b4807c5d1ad2baf6362b0dc076d8141fc94660205aaf4534f14b1ad07a617832","target":"graph","created_at":"2026-05-17T23:53:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Arun Ganesh, Qiuyi Zhang","cross_cats":["math.PR","q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-02T23:17:17Z","title":"Optimal Sequence Length Requirements for Phylogenetic Tree Reconstruction with Indels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01121","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:91ca358115c9090a22374831e2d4d7d246b865c7c57b35a3c5ebebc891034ff0","target":"record","created_at":"2026-05-17T23:53:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"87364bdf14b855dec7b95fa6c1f4824ad2237216fca8fc0750a242b216a504bd","cross_cats_sorted":["math.PR","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-02T23:17:17Z","title_canon_sha256":"8b0cd593eac6cae339213bbab20486ab065527bebb5a70b941a3feaefbb9c4b3"},"schema_version":"1.0","source":{"id":"1811.01121","kind":"arxiv","version":3}},"canonical_sha256":"ba72567bb4adc5bd2ce39766efd6f08e28f2cb8a71036f8194c5cefcec299e66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba72567bb4adc5bd2ce39766efd6f08e28f2cb8a71036f8194c5cefcec299e66","first_computed_at":"2026-05-17T23:53:04.357823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:04.357823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"de5nKzqABJT3hy5soO4V3E9Dd9Gb2sJDEUeuilzzeAHjlmaS5olifRcfhjFSMErj3PnE5lmtqTCqNvqdq000Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:04.358394Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01121","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91ca358115c9090a22374831e2d4d7d246b865c7c57b35a3c5ebebc891034ff0","sha256:b4807c5d1ad2baf6362b0dc076d8141fc94660205aaf4534f14b1ad07a617832"],"state_sha256":"f25ed7d261458e22bf883eb1b82a3f7785cc54b21ec57cd0d285e4dc272af649"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vGFQUjzYYfaimdv6yl4qh6OWuCAfOCJ8Qrfahb5Ep1v2Mlz4cqYLkYApyQEy5JFqtytO5ulIYkIPSU0vKob4CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:22:43.346195Z","bundle_sha256":"c7bd5ec5af623ac8d42e05f19d3db128ed38c6f83aff1704b35d1408b21f6d9b"}}