{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6B5TJG7I7DIV7KZWIAWNIWKURA","short_pith_number":"pith:6B5TJG7I","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"},"canonical_sha256":"f07b349be8f8d15fab36402cd459548805bdbc837c7f8375a3c10cb0ef3a1bd7","source":{"kind":"arxiv","id":"1704.02062","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02062","created_at":"2026-05-18T00:28:35Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02062v3","created_at":"2026-05-18T00:28:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02062","created_at":"2026-05-18T00:28:35Z"},{"alias_kind":"pith_short_12","alias_value":"6B5TJG7I7DIV","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6B5TJG7I7DIV7KZW","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6B5TJG7I","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6B5TJG7I7DIV7KZWIAWNIWKURA","target":"record","payload":{"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"},"canonical_sha256":"f07b349be8f8d15fab36402cd459548805bdbc837c7f8375a3c10cb0ef3a1bd7","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"},"source_kind":"arxiv","source_id":"1704.02062","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-18T00:28:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QJI9xRgHFvTb9aEDu1EKHlK1T5b2+ZTcMznuPKLliH+OtFR5wBntYoK6S7nTZYp+iQfA+kHopad+GPf2ZnuQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:55:06.039701Z"},"content_sha256":"5ad94b9bc7ac7d04bea751caec9574a93fe8b8dc5717ec3a3df8fa6c86b9f184","schema_version":"1.0","event_id":"sha256:5ad94b9bc7ac7d04bea751caec9574a93fe8b8dc5717ec3a3df8fa6c86b9f184"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6B5TJG7I7DIV7KZWIAWNIWKURA","target":"graph","payload":{"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"},"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:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mBh//D3/MULgNM3Xz5umS1bfFJCM5rS2x8R/b5nHl2aNpz2ymDQBQGwmmJHIBsRHefaBRCMazqXAoCZZ+MeTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:55:06.040074Z"},"content_sha256":"13ac7a88f29e01ae915b33a57fb6bd30b4688c290b77c23ac42b7aa50bd8ac51","schema_version":"1.0","event_id":"sha256:13ac7a88f29e01ae915b33a57fb6bd30b4688c290b77c23ac42b7aa50bd8ac51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6B5TJG7I7DIV7KZWIAWNIWKURA/bundle.json","state_url":"https://pith.science/pith/6B5TJG7I7DIV7KZWIAWNIWKURA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6B5TJG7I7DIV7KZWIAWNIWKURA/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-31T11:55:06Z","links":{"resolver":"https://pith.science/pith/6B5TJG7I7DIV7KZWIAWNIWKURA","bundle":"https://pith.science/pith/6B5TJG7I7DIV7KZWIAWNIWKURA/bundle.json","state":"https://pith.science/pith/6B5TJG7I7DIV7KZWIAWNIWKURA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6B5TJG7I7DIV7KZWIAWNIWKURA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6B5TJG7I7DIV7KZWIAWNIWKURA","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":"cb76500c3aa1f4c694ffb84ac9ea49193b2e3823592d6cdbd6ac8b1785a26f8e","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-04-07T01:07:26Z","title_canon_sha256":"85568919afaea245373a68c5983419b7b6faa1d8f9aaa1110016e393ec2af678"},"schema_version":"1.0","source":{"id":"1704.02062","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02062","created_at":"2026-05-18T00:28:35Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02062v3","created_at":"2026-05-18T00:28:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02062","created_at":"2026-05-18T00:28:35Z"},{"alias_kind":"pith_short_12","alias_value":"6B5TJG7I7DIV","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6B5TJG7I7DIV7KZW","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6B5TJG7I","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:13ac7a88f29e01ae915b33a57fb6bd30b4688c290b77c23ac42b7aa50bd8ac51","target":"graph","created_at":"2026-05-18T00:28:35Z","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":"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","authors_text":"Andrew Francis, Katharina Huber, Vincent Moulton","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-04-07T01:07:26Z","title":"Tree-based unrooted phylogenetic networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02062","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:5ad94b9bc7ac7d04bea751caec9574a93fe8b8dc5717ec3a3df8fa6c86b9f184","target":"record","created_at":"2026-05-18T00:28:35Z","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":"cb76500c3aa1f4c694ffb84ac9ea49193b2e3823592d6cdbd6ac8b1785a26f8e","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-04-07T01:07:26Z","title_canon_sha256":"85568919afaea245373a68c5983419b7b6faa1d8f9aaa1110016e393ec2af678"},"schema_version":"1.0","source":{"id":"1704.02062","kind":"arxiv","version":3}},"canonical_sha256":"f07b349be8f8d15fab36402cd459548805bdbc837c7f8375a3c10cb0ef3a1bd7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f07b349be8f8d15fab36402cd459548805bdbc837c7f8375a3c10cb0ef3a1bd7","first_computed_at":"2026-05-18T00:28:35.607885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:35.607885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rY1x7CTXcktiEn2QwY8V7eKF6sWyhqr8BesyCMPAIpZSpUQ2w2QziIfxfqQ632APFM0LVtaitdvHUBuEPbvyAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:35.608583Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02062","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ad94b9bc7ac7d04bea751caec9574a93fe8b8dc5717ec3a3df8fa6c86b9f184","sha256:13ac7a88f29e01ae915b33a57fb6bd30b4688c290b77c23ac42b7aa50bd8ac51"],"state_sha256":"03a75ab970bb9be0f21bb5128fd917f4a2447dd060932c761755473a2938630d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4BUcYK+e21L426nC9AezMf35zhQ+/v07YGjatHv42LSPKN8ddRUCPRt+YBYzwUrCI4YbtRYsdDQSpw3/DlnHBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:55:06.042490Z","bundle_sha256":"661e58ad5df6e81f17870183450aa7af705cf48bc8aa3df22b9ea7f8fcd5a651"}}