{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QBFGBBWGMMNJITUMYQPZSS25NE","short_pith_number":"pith:QBFGBBWG","canonical_record":{"source":{"id":"1704.06831","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-04-22T18:25:44Z","cross_cats_sorted":["cs.CE","math.PR","math.ST","stat.TH"],"title_canon_sha256":"341563db63449781a9e902324120cbf62c88c9c532bf337d75d4cd4110c092c9","abstract_canon_sha256":"f2c33cb6257255477d943369a17cd39ab397744eb4b470b351642f232881d9f6"},"schema_version":"1.0"},"canonical_sha256":"804a6086c6631a944e8cc41f994b5d692f1f5c4484ee770007a5a01314655a44","source":{"kind":"arxiv","id":"1704.06831","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06831","created_at":"2026-05-18T00:28:55Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06831v2","created_at":"2026-05-18T00:28:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06831","created_at":"2026-05-18T00:28:55Z"},{"alias_kind":"pith_short_12","alias_value":"QBFGBBWGMMNJ","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QBFGBBWGMMNJITUM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QBFGBBWG","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QBFGBBWGMMNJITUMYQPZSS25NE","target":"record","payload":{"canonical_record":{"source":{"id":"1704.06831","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-04-22T18:25:44Z","cross_cats_sorted":["cs.CE","math.PR","math.ST","stat.TH"],"title_canon_sha256":"341563db63449781a9e902324120cbf62c88c9c532bf337d75d4cd4110c092c9","abstract_canon_sha256":"f2c33cb6257255477d943369a17cd39ab397744eb4b470b351642f232881d9f6"},"schema_version":"1.0"},"canonical_sha256":"804a6086c6631a944e8cc41f994b5d692f1f5c4484ee770007a5a01314655a44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:55.925679Z","signature_b64":"OSH5Usx1gXcpWJ5M4yNO7v1wrEoBhJ/5dBVvgb83qPSkXFB5GJua8ZgvGVVJX1D8/7X9I6xHSE9mc49tOTOICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"804a6086c6631a944e8cc41f994b5d692f1f5c4484ee770007a5a01314655a44","last_reissued_at":"2026-05-18T00:28:55.924581Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:55.924581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.06831","source_version":2,"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-18T00:28:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8RRVCwwrHXE67YxrlRuSDDwH/4zLf4b04/J9nDrHAcdeyOvAB/AllhL6k8XExIGVjpGdpVMPtE2/VZBVWwXBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:58:47.151453Z"},"content_sha256":"f019038450bf1c8c38fcf7e9260e2277ace52dedbb0c9042b00799b4f2af019f","schema_version":"1.0","event_id":"sha256:f019038450bf1c8c38fcf7e9260e2277ace52dedbb0c9042b00799b4f2af019f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QBFGBBWGMMNJITUMYQPZSS25NE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Species tree estimation using ASTRAL: how many genes are enough?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","math.PR","math.ST","stat.TH"],"primary_cat":"q-bio.PE","authors_text":"Sebastien Roch, Shubhanshu Shekhar, Siavash Mirarab","submitted_at":"2017-04-22T18:25:44Z","abstract_excerpt":"Species tree reconstruction from genomic data is increasingly performed using methods that account for sources of gene tree discordance such as incomplete lineage sorting. One popular method for reconstructing species trees from unrooted gene tree topologies is ASTRAL. In this paper, we derive theoretical sample complexity results for the number of genes required by ASTRAL to guarantee reconstruction of the correct species tree with high probability. We also validate those theoretical bounds in a simulation study. Our results indicate that ASTRAL requires $\\mathcal{O}(f^{-2} \\log n)$ gene tree"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06831","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"},"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-18T00:28:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tm8cGX6TgAm7kia5PBIshhYc2DgFTsTa8IuZZ9VShZa9Rsf/OtJFGtzZoQoz8sToX3q2VkWVwFSaKwzInN89Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:58:47.152117Z"},"content_sha256":"76064a3b6ad41a5103b88fb6e1226e9fb675fe181ca64786b85027eba757ca9d","schema_version":"1.0","event_id":"sha256:76064a3b6ad41a5103b88fb6e1226e9fb675fe181ca64786b85027eba757ca9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QBFGBBWGMMNJITUMYQPZSS25NE/bundle.json","state_url":"https://pith.science/pith/QBFGBBWGMMNJITUMYQPZSS25NE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QBFGBBWGMMNJITUMYQPZSS25NE/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-25T05:58:47Z","links":{"resolver":"https://pith.science/pith/QBFGBBWGMMNJITUMYQPZSS25NE","bundle":"https://pith.science/pith/QBFGBBWGMMNJITUMYQPZSS25NE/bundle.json","state":"https://pith.science/pith/QBFGBBWGMMNJITUMYQPZSS25NE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QBFGBBWGMMNJITUMYQPZSS25NE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QBFGBBWGMMNJITUMYQPZSS25NE","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":"f2c33cb6257255477d943369a17cd39ab397744eb4b470b351642f232881d9f6","cross_cats_sorted":["cs.CE","math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-04-22T18:25:44Z","title_canon_sha256":"341563db63449781a9e902324120cbf62c88c9c532bf337d75d4cd4110c092c9"},"schema_version":"1.0","source":{"id":"1704.06831","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06831","created_at":"2026-05-18T00:28:55Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06831v2","created_at":"2026-05-18T00:28:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06831","created_at":"2026-05-18T00:28:55Z"},{"alias_kind":"pith_short_12","alias_value":"QBFGBBWGMMNJ","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QBFGBBWGMMNJITUM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QBFGBBWG","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:76064a3b6ad41a5103b88fb6e1226e9fb675fe181ca64786b85027eba757ca9d","target":"graph","created_at":"2026-05-18T00:28:55Z","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":"Species tree reconstruction from genomic data is increasingly performed using methods that account for sources of gene tree discordance such as incomplete lineage sorting. One popular method for reconstructing species trees from unrooted gene tree topologies is ASTRAL. In this paper, we derive theoretical sample complexity results for the number of genes required by ASTRAL to guarantee reconstruction of the correct species tree with high probability. We also validate those theoretical bounds in a simulation study. Our results indicate that ASTRAL requires $\\mathcal{O}(f^{-2} \\log n)$ gene tree","authors_text":"Sebastien Roch, Shubhanshu Shekhar, Siavash Mirarab","cross_cats":["cs.CE","math.PR","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-04-22T18:25:44Z","title":"Species tree estimation using ASTRAL: how many genes are enough?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06831","kind":"arxiv","version":2},"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:f019038450bf1c8c38fcf7e9260e2277ace52dedbb0c9042b00799b4f2af019f","target":"record","created_at":"2026-05-18T00:28:55Z","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":"f2c33cb6257255477d943369a17cd39ab397744eb4b470b351642f232881d9f6","cross_cats_sorted":["cs.CE","math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-04-22T18:25:44Z","title_canon_sha256":"341563db63449781a9e902324120cbf62c88c9c532bf337d75d4cd4110c092c9"},"schema_version":"1.0","source":{"id":"1704.06831","kind":"arxiv","version":2}},"canonical_sha256":"804a6086c6631a944e8cc41f994b5d692f1f5c4484ee770007a5a01314655a44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"804a6086c6631a944e8cc41f994b5d692f1f5c4484ee770007a5a01314655a44","first_computed_at":"2026-05-18T00:28:55.924581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:55.924581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OSH5Usx1gXcpWJ5M4yNO7v1wrEoBhJ/5dBVvgb83qPSkXFB5GJua8ZgvGVVJX1D8/7X9I6xHSE9mc49tOTOICQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:55.925679Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.06831","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f019038450bf1c8c38fcf7e9260e2277ace52dedbb0c9042b00799b4f2af019f","sha256:76064a3b6ad41a5103b88fb6e1226e9fb675fe181ca64786b85027eba757ca9d"],"state_sha256":"54134dd07d622263ed6fa83f33496a8423e15ec0d37bbaef80bd5a65ddc98237"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+i9YqValVKtIVQnvHmFl1pQkYtew9kETHqzUnNqhgMV4o/bUHdCi5vWul9fLzdz7F6c1qVUEh3nJQIaCcb7DAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T05:58:47.155848Z","bundle_sha256":"c7372d349b63b25b030a80a0864ca353b14bd63efde280ae4c7c8b6b3ae6da38"}}