{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6B5TJG7I7DIV7KZWIAWNIWKURA","short_pith_number":"pith:6B5TJG7I","schema_version":"1.0","canonical_sha256":"f07b349be8f8d15fab36402cd459548805bdbc837c7f8375a3c10cb0ef3a1bd7","source":{"kind":"arxiv","id":"1704.02062","version":3},"attestation_state":"computed","paper":{"title":"Tree-based unrooted phylogenetic networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"q-bio.PE","authors_text":"Andrew Francis, Katharina Huber, Vincent Moulton","submitted_at":"2017-04-07T01:07:26Z","abstract_excerpt":"Phylogenetic networks are a generalization of phylogenetic trees that are used to represent non-tree-like evolutionary histories that arise in organisms such as plants and bacteria, or uncertainty in evolutionary histories. An \\emph{unrooted} phylogenetic network on a nonempty, finite set $X$ of taxa, or \\emph{network}, is a connected graph in which every vertex has degree 1 or 3 and whose leaf-set is $X$. It is called a \\emph{phylogenetic tree} if the underlying graph is a tree. In this paper we consider properties of \\emph{tree-based networks}, that is, networks that can be constructed by ad"},"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":"1704.02062","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-04-07T01:07:26Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"85568919afaea245373a68c5983419b7b6faa1d8f9aaa1110016e393ec2af678","abstract_canon_sha256":"cb76500c3aa1f4c694ffb84ac9ea49193b2e3823592d6cdbd6ac8b1785a26f8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:35.608583Z","signature_b64":"rY1x7CTXcktiEn2QwY8V7eKF6sWyhqr8BesyCMPAIpZSpUQ2w2QziIfxfqQ632APFM0LVtaitdvHUBuEPbvyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f07b349be8f8d15fab36402cd459548805bdbc837c7f8375a3c10cb0ef3a1bd7","last_reissued_at":"2026-05-18T00:28:35.607885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:35.607885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree-based unrooted phylogenetic networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"q-bio.PE","authors_text":"Andrew Francis, Katharina Huber, Vincent Moulton","submitted_at":"2017-04-07T01:07:26Z","abstract_excerpt":"Phylogenetic networks are a generalization of phylogenetic trees that are used to represent non-tree-like evolutionary histories that arise in organisms such as plants and bacteria, or uncertainty in evolutionary histories. An \\emph{unrooted} phylogenetic network on a nonempty, finite set $X$ of taxa, or \\emph{network}, is a connected graph in which every vertex has degree 1 or 3 and whose leaf-set is $X$. It is called a \\emph{phylogenetic tree} if the underlying graph is a tree. In this paper we consider properties of \\emph{tree-based networks}, that is, networks that can be constructed by ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02062","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":"1704.02062","created_at":"2026-05-18T00:28:35.607984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02062v3","created_at":"2026-05-18T00:28:35.607984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02062","created_at":"2026-05-18T00:28:35.607984+00:00"},{"alias_kind":"pith_short_12","alias_value":"6B5TJG7I7DIV","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6B5TJG7I7DIV7KZW","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6B5TJG7I","created_at":"2026-05-18T12:31:03.183658+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/6B5TJG7I7DIV7KZWIAWNIWKURA","json":"https://pith.science/pith/6B5TJG7I7DIV7KZWIAWNIWKURA.json","graph_json":"https://pith.science/api/pith-number/6B5TJG7I7DIV7KZWIAWNIWKURA/graph.json","events_json":"https://pith.science/api/pith-number/6B5TJG7I7DIV7KZWIAWNIWKURA/events.json","paper":"https://pith.science/paper/6B5TJG7I"},"agent_actions":{"view_html":"https://pith.science/pith/6B5TJG7I7DIV7KZWIAWNIWKURA","download_json":"https://pith.science/pith/6B5TJG7I7DIV7KZWIAWNIWKURA.json","view_paper":"https://pith.science/paper/6B5TJG7I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02062&json=true","fetch_graph":"https://pith.science/api/pith-number/6B5TJG7I7DIV7KZWIAWNIWKURA/graph.json","fetch_events":"https://pith.science/api/pith-number/6B5TJG7I7DIV7KZWIAWNIWKURA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6B5TJG7I7DIV7KZWIAWNIWKURA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6B5TJG7I7DIV7KZWIAWNIWKURA/action/storage_attestation","attest_author":"https://pith.science/pith/6B5TJG7I7DIV7KZWIAWNIWKURA/action/author_attestation","sign_citation":"https://pith.science/pith/6B5TJG7I7DIV7KZWIAWNIWKURA/action/citation_signature","submit_replication":"https://pith.science/pith/6B5TJG7I7DIV7KZWIAWNIWKURA/action/replication_record"}},"created_at":"2026-05-18T00:28:35.607984+00:00","updated_at":"2026-05-18T00:28:35.607984+00:00"}