{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:C32VJGMIET7L46X6KRUVIWCZCV","short_pith_number":"pith:C32VJGMI","canonical_record":{"source":{"id":"1302.2430","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-02-11T10:11:54Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a48e797f67a6d3fdc1baa0d78952f77f5d28715a0cb1fc4a7a75afcc7a780287","abstract_canon_sha256":"6791939a742b0f7f2d5616cf216502f942978d3261c4db181a862716732818fc"},"schema_version":"1.0"},"canonical_sha256":"16f554998824febe7afe5469545859155a40bcd176543d164ea11075f40288b5","source":{"kind":"arxiv","id":"1302.2430","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2430","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2430v3","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2430","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"pith_short_12","alias_value":"C32VJGMIET7L","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C32VJGMIET7L46X6","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C32VJGMI","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:C32VJGMIET7L46X6KRUVIWCZCV","target":"record","payload":{"canonical_record":{"source":{"id":"1302.2430","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-02-11T10:11:54Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a48e797f67a6d3fdc1baa0d78952f77f5d28715a0cb1fc4a7a75afcc7a780287","abstract_canon_sha256":"6791939a742b0f7f2d5616cf216502f942978d3261c4db181a862716732818fc"},"schema_version":"1.0"},"canonical_sha256":"16f554998824febe7afe5469545859155a40bcd176543d164ea11075f40288b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:49.639787Z","signature_b64":"MpDETxejfcBcThhpISE0cpxEr7MrY06fQj+apy2vQhJ6E6n8hVc+pbyqxzye06wl8/rKK4k/j4DxIw43RaZwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16f554998824febe7afe5469545859155a40bcd176543d164ea11075f40288b5","last_reissued_at":"2026-05-18T02:52:49.639411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:49.639411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.2430","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-18T02:52:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UVx8YWXKV9HkfkIhkmZQA5QjTAHeBu9ds/adBpGtC7q7MFSJvxI//NVwVUBh/b6sy8a4YmNFb9JIXTDTHkkUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:02:57.149378Z"},"content_sha256":"bc8ed14acb175ee8f0271326f1302e4cf12bedcc2eb5ddfa9d0fb6439f03084e","schema_version":"1.0","event_id":"sha256:bc8ed14acb175ee8f0271326f1302e4cf12bedcc2eb5ddfa9d0fb6439f03084e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:C32VJGMIET7L46X6KRUVIWCZCV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Computing the Maximum Parsimony Score of a Phylogenetic Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"q-bio.PE","authors_text":"Celine Scornavacca, Leo van Iersel, Mareike Fischer, Steven Kelk","submitted_at":"2013-02-11T10:11:54Z","abstract_excerpt":"Phylogenetic networks are used to display the relationship of different species whose evolution is not treelike, which is the case, for instance, in the presence of hybridization events or horizontal gene transfers. Tree inference methods such as Maximum Parsimony need to be modified in order to be applicable to networks. In this paper, we discuss two different definitions of Maximum Parsimony on networks, \"hardwired\" and \"softwired\", and examine the complexity of computing them given a network topology and a character. By exploiting a link with the problem Multicut, we show that computing the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2430","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-18T02:52:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GBC9WUMG2fzNwKaVzmb6yDw/X7XiN2aYJ0DVB96KG+QqhWwnRUWKRSB4NJI2YQUGizqMSvFVgkcnPh6QbMiUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:02:57.150021Z"},"content_sha256":"056024f3bf7880566801eb9c14902495c4f29941b52738d0b366186b5c79bc15","schema_version":"1.0","event_id":"sha256:056024f3bf7880566801eb9c14902495c4f29941b52738d0b366186b5c79bc15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C32VJGMIET7L46X6KRUVIWCZCV/bundle.json","state_url":"https://pith.science/pith/C32VJGMIET7L46X6KRUVIWCZCV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C32VJGMIET7L46X6KRUVIWCZCV/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-06T21:02:57Z","links":{"resolver":"https://pith.science/pith/C32VJGMIET7L46X6KRUVIWCZCV","bundle":"https://pith.science/pith/C32VJGMIET7L46X6KRUVIWCZCV/bundle.json","state":"https://pith.science/pith/C32VJGMIET7L46X6KRUVIWCZCV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C32VJGMIET7L46X6KRUVIWCZCV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:C32VJGMIET7L46X6KRUVIWCZCV","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":"6791939a742b0f7f2d5616cf216502f942978d3261c4db181a862716732818fc","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-02-11T10:11:54Z","title_canon_sha256":"a48e797f67a6d3fdc1baa0d78952f77f5d28715a0cb1fc4a7a75afcc7a780287"},"schema_version":"1.0","source":{"id":"1302.2430","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2430","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2430v3","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2430","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"pith_short_12","alias_value":"C32VJGMIET7L","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C32VJGMIET7L46X6","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C32VJGMI","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:056024f3bf7880566801eb9c14902495c4f29941b52738d0b366186b5c79bc15","target":"graph","created_at":"2026-05-18T02:52:49Z","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 used to display the relationship of different species whose evolution is not treelike, which is the case, for instance, in the presence of hybridization events or horizontal gene transfers. Tree inference methods such as Maximum Parsimony need to be modified in order to be applicable to networks. In this paper, we discuss two different definitions of Maximum Parsimony on networks, \"hardwired\" and \"softwired\", and examine the complexity of computing them given a network topology and a character. By exploiting a link with the problem Multicut, we show that computing the","authors_text":"Celine Scornavacca, Leo van Iersel, Mareike Fischer, Steven Kelk","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-02-11T10:11:54Z","title":"On Computing the Maximum Parsimony Score of a Phylogenetic Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2430","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:bc8ed14acb175ee8f0271326f1302e4cf12bedcc2eb5ddfa9d0fb6439f03084e","target":"record","created_at":"2026-05-18T02:52:49Z","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":"6791939a742b0f7f2d5616cf216502f942978d3261c4db181a862716732818fc","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-02-11T10:11:54Z","title_canon_sha256":"a48e797f67a6d3fdc1baa0d78952f77f5d28715a0cb1fc4a7a75afcc7a780287"},"schema_version":"1.0","source":{"id":"1302.2430","kind":"arxiv","version":3}},"canonical_sha256":"16f554998824febe7afe5469545859155a40bcd176543d164ea11075f40288b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16f554998824febe7afe5469545859155a40bcd176543d164ea11075f40288b5","first_computed_at":"2026-05-18T02:52:49.639411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:49.639411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MpDETxejfcBcThhpISE0cpxEr7MrY06fQj+apy2vQhJ6E6n8hVc+pbyqxzye06wl8/rKK4k/j4DxIw43RaZwDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:49.639787Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.2430","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc8ed14acb175ee8f0271326f1302e4cf12bedcc2eb5ddfa9d0fb6439f03084e","sha256:056024f3bf7880566801eb9c14902495c4f29941b52738d0b366186b5c79bc15"],"state_sha256":"1a89d1305314c9594f8d3c3f72fc8c58a0eae96a6dadfdd338351de923d68a26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PK3WKVMlZJEevtwmcmWl6sOsrgpx596EfcvYWYxHyjztRJkgxP4LRjz7jQ1upj1pltvtv5yItSOqLFqzaMNwCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:02:57.153640Z","bundle_sha256":"5167140cae51f17c4195a32682be6476d29465b9a3144903c949003198638577"}}