{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SEQH42JUAVV3P2JKXLDLYIAJVT","short_pith_number":"pith:SEQH42JU","canonical_record":{"source":{"id":"1711.04935","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-11-14T03:58:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b5b41645b09f65910d0363eff3fa35ffff6b6b7fc966091604174bcaa9a5a951","abstract_canon_sha256":"1981c75c66af1c4961b0ed76bd5c0068e16b1e8b07c68ea9787a05b14e572ed0"},"schema_version":"1.0"},"canonical_sha256":"91207e6934056bb7e92abac6bc2009acc78a89cbd3a45be7ea9755db109a6758","source":{"kind":"arxiv","id":"1711.04935","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04935","created_at":"2026-05-18T00:30:16Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04935v2","created_at":"2026-05-18T00:30:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04935","created_at":"2026-05-18T00:30:16Z"},{"alias_kind":"pith_short_12","alias_value":"SEQH42JUAVV3","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SEQH42JUAVV3P2JK","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SEQH42JU","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SEQH42JUAVV3P2JKXLDLYIAJVT","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04935","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-11-14T03:58:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b5b41645b09f65910d0363eff3fa35ffff6b6b7fc966091604174bcaa9a5a951","abstract_canon_sha256":"1981c75c66af1c4961b0ed76bd5c0068e16b1e8b07c68ea9787a05b14e572ed0"},"schema_version":"1.0"},"canonical_sha256":"91207e6934056bb7e92abac6bc2009acc78a89cbd3a45be7ea9755db109a6758","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:16.040347Z","signature_b64":"sQVQ7Q1tY/LwhgesefQpv6gvaNJMioXq3A5x/izjptmeLB80jLFopTHAX1DUWpJtzyzyLSOnb6IzWY12yfyQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91207e6934056bb7e92abac6bc2009acc78a89cbd3a45be7ea9755db109a6758","last_reissued_at":"2026-05-18T00:30:16.039602Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:16.039602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04935","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:30:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GxVbV6IClBeUXoumJI7IKaKYshel4bLupTr9ogBsAR9ezYy2uWq8IKeMpDeY3Z4P+sUyHEPlJAqSzCYolEnmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:16:18.437120Z"},"content_sha256":"c29ddc220ead7b593cb860bd6d59649f655001ada124feb4043544b490bfe52f","schema_version":"1.0","event_id":"sha256:c29ddc220ead7b593cb860bd6d59649f655001ada124feb4043544b490bfe52f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SEQH42JUAVV3P2JKXLDLYIAJVT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tree-Based Unrooted Nonbinary Phylogenetic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"q-bio.PE","authors_text":"Michael Hendriksen","submitted_at":"2017-11-14T03:58:48Z","abstract_excerpt":"Phylogenetic networks are a generalisation of phylogenetic trees that allow for more complex evolutionary histories that include hybridisation-like processes. It is of considerable interest whether a network can be considered `tree-like' or not, which lead to the introduction of \\textit{tree-based} networks in the rooted, binary context. Tree-based networks are those networks which can be constructed by adding additional edges into a given phylogenetic tree, called the \\textit{base tree}. Previous extensions have considered extending to the binary, unrooted case and the nonbinary, rooted case."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04935","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:30:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fSluNz3HZvSV/gSy+hlEpLud7CCCiK9SGGxOJe6EBw2TUuWfMKMRFvWNhm9tloP2iMnv7mPBMXlzVj+2n7mIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:16:18.437475Z"},"content_sha256":"150103a92558d2f3535d3141cdb53ae30112df06b5b8f587088d8728b88398a3","schema_version":"1.0","event_id":"sha256:150103a92558d2f3535d3141cdb53ae30112df06b5b8f587088d8728b88398a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SEQH42JUAVV3P2JKXLDLYIAJVT/bundle.json","state_url":"https://pith.science/pith/SEQH42JUAVV3P2JKXLDLYIAJVT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SEQH42JUAVV3P2JKXLDLYIAJVT/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-06-22T09:16:18Z","links":{"resolver":"https://pith.science/pith/SEQH42JUAVV3P2JKXLDLYIAJVT","bundle":"https://pith.science/pith/SEQH42JUAVV3P2JKXLDLYIAJVT/bundle.json","state":"https://pith.science/pith/SEQH42JUAVV3P2JKXLDLYIAJVT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SEQH42JUAVV3P2JKXLDLYIAJVT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SEQH42JUAVV3P2JKXLDLYIAJVT","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":"1981c75c66af1c4961b0ed76bd5c0068e16b1e8b07c68ea9787a05b14e572ed0","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-11-14T03:58:48Z","title_canon_sha256":"b5b41645b09f65910d0363eff3fa35ffff6b6b7fc966091604174bcaa9a5a951"},"schema_version":"1.0","source":{"id":"1711.04935","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04935","created_at":"2026-05-18T00:30:16Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04935v2","created_at":"2026-05-18T00:30:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04935","created_at":"2026-05-18T00:30:16Z"},{"alias_kind":"pith_short_12","alias_value":"SEQH42JUAVV3","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SEQH42JUAVV3P2JK","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SEQH42JU","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:150103a92558d2f3535d3141cdb53ae30112df06b5b8f587088d8728b88398a3","target":"graph","created_at":"2026-05-18T00:30:16Z","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 generalisation of phylogenetic trees that allow for more complex evolutionary histories that include hybridisation-like processes. It is of considerable interest whether a network can be considered `tree-like' or not, which lead to the introduction of \\textit{tree-based} networks in the rooted, binary context. Tree-based networks are those networks which can be constructed by adding additional edges into a given phylogenetic tree, called the \\textit{base tree}. Previous extensions have considered extending to the binary, unrooted case and the nonbinary, rooted case.","authors_text":"Michael Hendriksen","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-11-14T03:58:48Z","title":"Tree-Based Unrooted Nonbinary Phylogenetic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04935","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:c29ddc220ead7b593cb860bd6d59649f655001ada124feb4043544b490bfe52f","target":"record","created_at":"2026-05-18T00:30:16Z","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":"1981c75c66af1c4961b0ed76bd5c0068e16b1e8b07c68ea9787a05b14e572ed0","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-11-14T03:58:48Z","title_canon_sha256":"b5b41645b09f65910d0363eff3fa35ffff6b6b7fc966091604174bcaa9a5a951"},"schema_version":"1.0","source":{"id":"1711.04935","kind":"arxiv","version":2}},"canonical_sha256":"91207e6934056bb7e92abac6bc2009acc78a89cbd3a45be7ea9755db109a6758","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91207e6934056bb7e92abac6bc2009acc78a89cbd3a45be7ea9755db109a6758","first_computed_at":"2026-05-18T00:30:16.039602Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:16.039602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sQVQ7Q1tY/LwhgesefQpv6gvaNJMioXq3A5x/izjptmeLB80jLFopTHAX1DUWpJtzyzyLSOnb6IzWY12yfyQCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:16.040347Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04935","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c29ddc220ead7b593cb860bd6d59649f655001ada124feb4043544b490bfe52f","sha256:150103a92558d2f3535d3141cdb53ae30112df06b5b8f587088d8728b88398a3"],"state_sha256":"9dcb070d6cea17cdbf8990e2853e31ad3c52c35f28bdfded4895440b02c5daa3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ErHDcq5t10gku5GR+r66YxmaDVxETzpweXNkYR7yLzEfK8DG3ybuQH9sEBE0E73lsnSGEAuSYSCJcYBJw2eRDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T09:16:18.439525Z","bundle_sha256":"b032991c9d0e16555fbbad04ec20a9901a78b789bb3c560ebf86a68d68b4608a"}}