{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:O5QMMKDCRH4TSZ4ZNY2JTODMOT","short_pith_number":"pith:O5QMMKDC","canonical_record":{"source":{"id":"1110.0728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-10-04T15:34:28Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"cbb84ff53d224bb3f01d9038ab831f55f6955f9374758b214a55215ba23271a2","abstract_canon_sha256":"5008bed7492c9d80ef972043a6b0f32a97bb08b3b4dfcb107603e31783d48238"},"schema_version":"1.0"},"canonical_sha256":"7760c6286289f93967996e3499b86c74ea8b512d0a5efdc43eacdc1a38998a8c","source":{"kind":"arxiv","id":"1110.0728","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0728","created_at":"2026-05-18T04:11:41Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0728v1","created_at":"2026-05-18T04:11:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0728","created_at":"2026-05-18T04:11:41Z"},{"alias_kind":"pith_short_12","alias_value":"O5QMMKDCRH4T","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"O5QMMKDCRH4TSZ4Z","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"O5QMMKDC","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:O5QMMKDCRH4TSZ4ZNY2JTODMOT","target":"record","payload":{"canonical_record":{"source":{"id":"1110.0728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-10-04T15:34:28Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"cbb84ff53d224bb3f01d9038ab831f55f6955f9374758b214a55215ba23271a2","abstract_canon_sha256":"5008bed7492c9d80ef972043a6b0f32a97bb08b3b4dfcb107603e31783d48238"},"schema_version":"1.0"},"canonical_sha256":"7760c6286289f93967996e3499b86c74ea8b512d0a5efdc43eacdc1a38998a8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:41.128076Z","signature_b64":"KBhoriwr1LLzO9m150OIwq7h3Xe3rb28Ixe0JzF8rtPlyzFnmHWkyOJjsfLcsEig/ejR/Zi1M/VvVysnRc2mBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7760c6286289f93967996e3499b86c74ea8b512d0a5efdc43eacdc1a38998a8c","last_reissued_at":"2026-05-18T04:11:41.127624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:41.127624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.0728","source_version":1,"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-18T04:11:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oV7+7bWNjDv/WccTwP2KRfGI/gx+uhvahVLJ8ADoznRntUxxQDq1nfouOC6NL8L4waqNjQkD2lRvGgO17543Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:20:41.560916Z"},"content_sha256":"9dc3181762a1f036d78a5f308fb6160e5a9f3f19cbed9982834906a6bf5b94ad","schema_version":"1.0","event_id":"sha256:9dc3181762a1f036d78a5f308fb6160e5a9f3f19cbed9982834906a6bf5b94ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:O5QMMKDCRH4TSZ4ZNY2JTODMOT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"q-bio.PE","authors_text":"K. T. Huber, V. Moulton","submitted_at":"2011-10-04T15:34:28Z","abstract_excerpt":"Phylogenetic networks are a generalization of phylogenetic trees that are used in biology to represent reticulate or non-treelike evolution. Recently, several algorithms have been developed which aim to construct phylogenetic networks from biological data using {\\em triplets}, i.e. binary phylogenetic trees on 3-element subsets of a given set of species. However, a fundamental problem with this approach is that the triplets displayed by a phylogenetic network do not necessary uniquely determine or {\\em encode} the network. Here we propose an alternative approach to encoding and constructing ph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0728","kind":"arxiv","version":1},"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-18T04:11:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F3wrKnDU9PFKA8FU9HxzMEATDFiLxJZR2in/Fw2FoabIS4t/ztLl/pFCVRQlHANcYG73uy057YltaOmOvq39BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:20:41.561261Z"},"content_sha256":"7ff9375c69eb8378d7647ec5e3816b62699ad6cc2f2ca36c334d06886c095f30","schema_version":"1.0","event_id":"sha256:7ff9375c69eb8378d7647ec5e3816b62699ad6cc2f2ca36c334d06886c095f30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O5QMMKDCRH4TSZ4ZNY2JTODMOT/bundle.json","state_url":"https://pith.science/pith/O5QMMKDCRH4TSZ4ZNY2JTODMOT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O5QMMKDCRH4TSZ4ZNY2JTODMOT/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-11T12:20:41Z","links":{"resolver":"https://pith.science/pith/O5QMMKDCRH4TSZ4ZNY2JTODMOT","bundle":"https://pith.science/pith/O5QMMKDCRH4TSZ4ZNY2JTODMOT/bundle.json","state":"https://pith.science/pith/O5QMMKDCRH4TSZ4ZNY2JTODMOT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O5QMMKDCRH4TSZ4ZNY2JTODMOT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:O5QMMKDCRH4TSZ4ZNY2JTODMOT","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":"5008bed7492c9d80ef972043a6b0f32a97bb08b3b4dfcb107603e31783d48238","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-10-04T15:34:28Z","title_canon_sha256":"cbb84ff53d224bb3f01d9038ab831f55f6955f9374758b214a55215ba23271a2"},"schema_version":"1.0","source":{"id":"1110.0728","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0728","created_at":"2026-05-18T04:11:41Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0728v1","created_at":"2026-05-18T04:11:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0728","created_at":"2026-05-18T04:11:41Z"},{"alias_kind":"pith_short_12","alias_value":"O5QMMKDCRH4T","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"O5QMMKDCRH4TSZ4Z","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"O5QMMKDC","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:7ff9375c69eb8378d7647ec5e3816b62699ad6cc2f2ca36c334d06886c095f30","target":"graph","created_at":"2026-05-18T04:11:41Z","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 in biology to represent reticulate or non-treelike evolution. Recently, several algorithms have been developed which aim to construct phylogenetic networks from biological data using {\\em triplets}, i.e. binary phylogenetic trees on 3-element subsets of a given set of species. However, a fundamental problem with this approach is that the triplets displayed by a phylogenetic network do not necessary uniquely determine or {\\em encode} the network. Here we propose an alternative approach to encoding and constructing ph","authors_text":"K. T. Huber, V. Moulton","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-10-04T15:34:28Z","title":"Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0728","kind":"arxiv","version":1},"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:9dc3181762a1f036d78a5f308fb6160e5a9f3f19cbed9982834906a6bf5b94ad","target":"record","created_at":"2026-05-18T04:11:41Z","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":"5008bed7492c9d80ef972043a6b0f32a97bb08b3b4dfcb107603e31783d48238","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-10-04T15:34:28Z","title_canon_sha256":"cbb84ff53d224bb3f01d9038ab831f55f6955f9374758b214a55215ba23271a2"},"schema_version":"1.0","source":{"id":"1110.0728","kind":"arxiv","version":1}},"canonical_sha256":"7760c6286289f93967996e3499b86c74ea8b512d0a5efdc43eacdc1a38998a8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7760c6286289f93967996e3499b86c74ea8b512d0a5efdc43eacdc1a38998a8c","first_computed_at":"2026-05-18T04:11:41.127624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:41.127624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KBhoriwr1LLzO9m150OIwq7h3Xe3rb28Ixe0JzF8rtPlyzFnmHWkyOJjsfLcsEig/ejR/Zi1M/VvVysnRc2mBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:41.128076Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.0728","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9dc3181762a1f036d78a5f308fb6160e5a9f3f19cbed9982834906a6bf5b94ad","sha256:7ff9375c69eb8378d7647ec5e3816b62699ad6cc2f2ca36c334d06886c095f30"],"state_sha256":"f62786dfa2f4a5dd95963a882a2d813b7ccdef5d58cedd662a7d63d8cbc5a5b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IrR9ZZdCcEXPeDm2whPjMdbooulxh5ubSF7RCYGISR18wQtNMGoCyGBSBuXV6645goRVhvXA49V9S8mmmpsRDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:20:41.563680Z","bundle_sha256":"e35e60eb1562b3974ea1dd802f8c53af2d044eb098e273645c64c55005475f9c"}}