{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PBPT2LUQKQRVZ4KLEQWY45D2EU","short_pith_number":"pith:PBPT2LUQ","canonical_record":{"source":{"id":"1411.6804","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-25T10:41:32Z","cross_cats_sorted":["q-bio.PE"],"title_canon_sha256":"5ea9a284d52ad8f8d2aef4c7c64636fab84f69cb6c23fa6f7dd02cff7d2aebd5","abstract_canon_sha256":"1bdbe03d7e6378925c6f1fe2ff4d6f698bf884c4b730b3cf4342d9c0570a4ec8"},"schema_version":"1.0"},"canonical_sha256":"785f3d2e9054235cf14b242d8e747a251fc538330cec0987cf9f85eb383d05d2","source":{"kind":"arxiv","id":"1411.6804","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6804","created_at":"2026-05-18T02:32:47Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6804v1","created_at":"2026-05-18T02:32:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6804","created_at":"2026-05-18T02:32:47Z"},{"alias_kind":"pith_short_12","alias_value":"PBPT2LUQKQRV","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PBPT2LUQKQRVZ4KL","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PBPT2LUQ","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PBPT2LUQKQRVZ4KLEQWY45D2EU","target":"record","payload":{"canonical_record":{"source":{"id":"1411.6804","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-25T10:41:32Z","cross_cats_sorted":["q-bio.PE"],"title_canon_sha256":"5ea9a284d52ad8f8d2aef4c7c64636fab84f69cb6c23fa6f7dd02cff7d2aebd5","abstract_canon_sha256":"1bdbe03d7e6378925c6f1fe2ff4d6f698bf884c4b730b3cf4342d9c0570a4ec8"},"schema_version":"1.0"},"canonical_sha256":"785f3d2e9054235cf14b242d8e747a251fc538330cec0987cf9f85eb383d05d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:47.279346Z","signature_b64":"wA+wzw/laTKIWmhtCDyh8y1mG9C3vdV/+sJ3KK1O2lxR3f81lrKXF4WbzyMs3fdf4BzyGG9/2K/1/STQzKmRBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"785f3d2e9054235cf14b242d8e747a251fc538330cec0987cf9f85eb383d05d2","last_reissued_at":"2026-05-18T02:32:47.278924Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:47.278924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.6804","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-18T02:32:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3+bI7iyekRojwAtD1S0sVpvXhue6ye3r9iW65Bkquq3Us7qCQrN69kE2uUyBc8lH3ebNvd5YKYbga9ndlq6CAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:38:19.024045Z"},"content_sha256":"54cb27f75a9516f6119ee6d7dbeefddec66fa9525d22b73765fb4da30dc968b6","schema_version":"1.0","event_id":"sha256:54cb27f75a9516f6119ee6d7dbeefddec66fa9525d22b73765fb4da30dc968b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PBPT2LUQKQRVZ4KLEQWY45D2EU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"cs.DS","authors_text":"Celine Scornavacca, Katharina Huber, Leo van Iersel, Taoyang Wu, Vincent Moulton","submitted_at":"2014-11-25T10:41:32Z","abstract_excerpt":"Binets and trinets are phylogenetic networks with two and three leaves, respectively. Here we consider the problem of deciding if there exists a binary level-1 phylogenetic network displaying a given set $\\mathcal{T}$ of binary binets or trinets over a set $X$ of taxa, and constructing such a network whenever it exists. We show that this is NP-hard for trinets but polynomial-time solvable for binets. Moreover, we show that the problem is still polynomial-time solvable for inputs consisting of binets and trinets as long as the cycles in the trinets have size three. Finally, we present an $O(3^{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6804","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-18T02:32:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aY+Mo6h75PGf9ndSYJ4BFB6jLExCoUoALrz+6XGK4qBpYfFazuuH/O2Pofnf/Vsf+C9516L5+7QeSc1yI7WPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:38:19.024645Z"},"content_sha256":"efb9ac98c7699231c55ee400e8b33275e9beabad13467818cc1c2c44e93f7250","schema_version":"1.0","event_id":"sha256:efb9ac98c7699231c55ee400e8b33275e9beabad13467818cc1c2c44e93f7250"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PBPT2LUQKQRVZ4KLEQWY45D2EU/bundle.json","state_url":"https://pith.science/pith/PBPT2LUQKQRVZ4KLEQWY45D2EU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PBPT2LUQKQRVZ4KLEQWY45D2EU/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-31T08:38:19Z","links":{"resolver":"https://pith.science/pith/PBPT2LUQKQRVZ4KLEQWY45D2EU","bundle":"https://pith.science/pith/PBPT2LUQKQRVZ4KLEQWY45D2EU/bundle.json","state":"https://pith.science/pith/PBPT2LUQKQRVZ4KLEQWY45D2EU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PBPT2LUQKQRVZ4KLEQWY45D2EU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PBPT2LUQKQRVZ4KLEQWY45D2EU","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":"1bdbe03d7e6378925c6f1fe2ff4d6f698bf884c4b730b3cf4342d9c0570a4ec8","cross_cats_sorted":["q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-25T10:41:32Z","title_canon_sha256":"5ea9a284d52ad8f8d2aef4c7c64636fab84f69cb6c23fa6f7dd02cff7d2aebd5"},"schema_version":"1.0","source":{"id":"1411.6804","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6804","created_at":"2026-05-18T02:32:47Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6804v1","created_at":"2026-05-18T02:32:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6804","created_at":"2026-05-18T02:32:47Z"},{"alias_kind":"pith_short_12","alias_value":"PBPT2LUQKQRV","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PBPT2LUQKQRVZ4KL","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PBPT2LUQ","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:efb9ac98c7699231c55ee400e8b33275e9beabad13467818cc1c2c44e93f7250","target":"graph","created_at":"2026-05-18T02:32:47Z","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":"Binets and trinets are phylogenetic networks with two and three leaves, respectively. Here we consider the problem of deciding if there exists a binary level-1 phylogenetic network displaying a given set $\\mathcal{T}$ of binary binets or trinets over a set $X$ of taxa, and constructing such a network whenever it exists. We show that this is NP-hard for trinets but polynomial-time solvable for binets. Moreover, we show that the problem is still polynomial-time solvable for inputs consisting of binets and trinets as long as the cycles in the trinets have size three. Finally, we present an $O(3^{","authors_text":"Celine Scornavacca, Katharina Huber, Leo van Iersel, Taoyang Wu, Vincent Moulton","cross_cats":["q-bio.PE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-25T10:41:32Z","title":"Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6804","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:54cb27f75a9516f6119ee6d7dbeefddec66fa9525d22b73765fb4da30dc968b6","target":"record","created_at":"2026-05-18T02:32:47Z","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":"1bdbe03d7e6378925c6f1fe2ff4d6f698bf884c4b730b3cf4342d9c0570a4ec8","cross_cats_sorted":["q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-25T10:41:32Z","title_canon_sha256":"5ea9a284d52ad8f8d2aef4c7c64636fab84f69cb6c23fa6f7dd02cff7d2aebd5"},"schema_version":"1.0","source":{"id":"1411.6804","kind":"arxiv","version":1}},"canonical_sha256":"785f3d2e9054235cf14b242d8e747a251fc538330cec0987cf9f85eb383d05d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"785f3d2e9054235cf14b242d8e747a251fc538330cec0987cf9f85eb383d05d2","first_computed_at":"2026-05-18T02:32:47.278924Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:47.278924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wA+wzw/laTKIWmhtCDyh8y1mG9C3vdV/+sJ3KK1O2lxR3f81lrKXF4WbzyMs3fdf4BzyGG9/2K/1/STQzKmRBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:47.279346Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6804","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54cb27f75a9516f6119ee6d7dbeefddec66fa9525d22b73765fb4da30dc968b6","sha256:efb9ac98c7699231c55ee400e8b33275e9beabad13467818cc1c2c44e93f7250"],"state_sha256":"8811e632d45ee7fa4b8ac013bb46d0a1087ede787ef4b59b91054ca26ae60566"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sRxJbFWT5TZTkuUdbNw4bglEXFWUYSPPkM6zDTKnJqbufDrEBt0kPFhEPfxmRf1dOD4HTW2SvQHHscsWi7rRCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:38:19.027920Z","bundle_sha256":"0672c127163538e8fbb7dad220fbcdcfe0203571dabc7afe9ad6659d6f44f0de"}}