{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UY2AD5LQUL4ZKE4SE5YKX6XPYZ","short_pith_number":"pith:UY2AD5LQ","canonical_record":{"source":{"id":"1503.07310","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-25T09:18:40Z","cross_cats_sorted":[],"title_canon_sha256":"7f0f11158c53a8e5ad6984a1c7e41e632b873af081614e01c5ffc51df1f0135d","abstract_canon_sha256":"ca6b8070d8929100d5dd4247530ec6e1b4b767787a4276427d9f49e4c806d3f2"},"schema_version":"1.0"},"canonical_sha256":"a63401f570a2f99513922770abfaefc64c2fee01ea14a9c5133d67bbd682ff1f","source":{"kind":"arxiv","id":"1503.07310","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07310","created_at":"2026-05-18T00:38:11Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07310v5","created_at":"2026-05-18T00:38:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07310","created_at":"2026-05-18T00:38:11Z"},{"alias_kind":"pith_short_12","alias_value":"UY2AD5LQUL4Z","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UY2AD5LQUL4ZKE4S","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UY2AD5LQ","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UY2AD5LQUL4ZKE4SE5YKX6XPYZ","target":"record","payload":{"canonical_record":{"source":{"id":"1503.07310","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-25T09:18:40Z","cross_cats_sorted":[],"title_canon_sha256":"7f0f11158c53a8e5ad6984a1c7e41e632b873af081614e01c5ffc51df1f0135d","abstract_canon_sha256":"ca6b8070d8929100d5dd4247530ec6e1b4b767787a4276427d9f49e4c806d3f2"},"schema_version":"1.0"},"canonical_sha256":"a63401f570a2f99513922770abfaefc64c2fee01ea14a9c5133d67bbd682ff1f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:11.913764Z","signature_b64":"IlUoJpMlcQMx213X51VYam8d3y+CGTpKYOd7f80b5SEiUpOoMuXOnt6lzAAo09xgztj1ymQ1Ak3hKf2BpIoCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a63401f570a2f99513922770abfaefc64c2fee01ea14a9c5133d67bbd682ff1f","last_reissued_at":"2026-05-18T00:38:11.913070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:11.913070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.07310","source_version":5,"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:38:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fYZEPZS/cUOB85QCeO0Np2mHPXJSuYZsoo8PKKscVuxe62bUNBtmqau8lwZwvZLimFZIhVQWLeCCZoAVr15lCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:42:21.686718Z"},"content_sha256":"e17838a1d5de5282ef6cc06fc9e443139e58f485569a19070d334247e959a5c0","schema_version":"1.0","event_id":"sha256:e17838a1d5de5282ef6cc06fc9e443139e58f485569a19070d334247e959a5c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UY2AD5LQUL4ZKE4SE5YKX6XPYZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Phylogeny Constraint Satisfaction Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Manuel Bodirsky, Peter Jonsson, Trung Van Pham","submitted_at":"2015-03-25T09:18:40Z","abstract_excerpt":"We systematically study the computational complexity of a broad class of computational problems in phylogenetic reconstruction. The class contains for example the rooted triple consistency problem, forbidden subtree problems, the quartet consistency problem, and many other problems studied in the bioinformatics literature. The studied problems can be described as \\emph{constraint satisfaction problems} where the constraints have a first-order definition over the rooted triple relation. We show that every such phylogeny problem can be solved in polynomial time or is NP-complete. On the algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07310","kind":"arxiv","version":5},"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:38:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vjBaQt7Zwc96xhr3vllwFsedwBAXdGLznVmCVuaLaQlb53mY5i5CciyCYlU/Yh9SE3D8I01OdSab7EAk9Y7nDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:42:21.687440Z"},"content_sha256":"56c2925c369e4b82bffdf961f8f7a6c6bbc3c3fc0c1a6ac7b0ba71284a894b12","schema_version":"1.0","event_id":"sha256:56c2925c369e4b82bffdf961f8f7a6c6bbc3c3fc0c1a6ac7b0ba71284a894b12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UY2AD5LQUL4ZKE4SE5YKX6XPYZ/bundle.json","state_url":"https://pith.science/pith/UY2AD5LQUL4ZKE4SE5YKX6XPYZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UY2AD5LQUL4ZKE4SE5YKX6XPYZ/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-26T10:42:21Z","links":{"resolver":"https://pith.science/pith/UY2AD5LQUL4ZKE4SE5YKX6XPYZ","bundle":"https://pith.science/pith/UY2AD5LQUL4ZKE4SE5YKX6XPYZ/bundle.json","state":"https://pith.science/pith/UY2AD5LQUL4ZKE4SE5YKX6XPYZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UY2AD5LQUL4ZKE4SE5YKX6XPYZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UY2AD5LQUL4ZKE4SE5YKX6XPYZ","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":"ca6b8070d8929100d5dd4247530ec6e1b4b767787a4276427d9f49e4c806d3f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-25T09:18:40Z","title_canon_sha256":"7f0f11158c53a8e5ad6984a1c7e41e632b873af081614e01c5ffc51df1f0135d"},"schema_version":"1.0","source":{"id":"1503.07310","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07310","created_at":"2026-05-18T00:38:11Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07310v5","created_at":"2026-05-18T00:38:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07310","created_at":"2026-05-18T00:38:11Z"},{"alias_kind":"pith_short_12","alias_value":"UY2AD5LQUL4Z","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UY2AD5LQUL4ZKE4S","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UY2AD5LQ","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:56c2925c369e4b82bffdf961f8f7a6c6bbc3c3fc0c1a6ac7b0ba71284a894b12","target":"graph","created_at":"2026-05-18T00:38:11Z","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":"We systematically study the computational complexity of a broad class of computational problems in phylogenetic reconstruction. The class contains for example the rooted triple consistency problem, forbidden subtree problems, the quartet consistency problem, and many other problems studied in the bioinformatics literature. The studied problems can be described as \\emph{constraint satisfaction problems} where the constraints have a first-order definition over the rooted triple relation. We show that every such phylogeny problem can be solved in polynomial time or is NP-complete. On the algorith","authors_text":"Manuel Bodirsky, Peter Jonsson, Trung Van Pham","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-25T09:18:40Z","title":"The Complexity of Phylogeny Constraint Satisfaction Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07310","kind":"arxiv","version":5},"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:e17838a1d5de5282ef6cc06fc9e443139e58f485569a19070d334247e959a5c0","target":"record","created_at":"2026-05-18T00:38:11Z","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":"ca6b8070d8929100d5dd4247530ec6e1b4b767787a4276427d9f49e4c806d3f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-25T09:18:40Z","title_canon_sha256":"7f0f11158c53a8e5ad6984a1c7e41e632b873af081614e01c5ffc51df1f0135d"},"schema_version":"1.0","source":{"id":"1503.07310","kind":"arxiv","version":5}},"canonical_sha256":"a63401f570a2f99513922770abfaefc64c2fee01ea14a9c5133d67bbd682ff1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a63401f570a2f99513922770abfaefc64c2fee01ea14a9c5133d67bbd682ff1f","first_computed_at":"2026-05-18T00:38:11.913070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:11.913070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IlUoJpMlcQMx213X51VYam8d3y+CGTpKYOd7f80b5SEiUpOoMuXOnt6lzAAo09xgztj1ymQ1Ak3hKf2BpIoCDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:11.913764Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.07310","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e17838a1d5de5282ef6cc06fc9e443139e58f485569a19070d334247e959a5c0","sha256:56c2925c369e4b82bffdf961f8f7a6c6bbc3c3fc0c1a6ac7b0ba71284a894b12"],"state_sha256":"bb89cff2fb59fdb944cfc40f52de7caf2f0fc438ac8633eda0c4d10a2ff06680"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZW/t/Wirx5ey18wdqz9PwzxrZvL6U96WSWiVKe5qiD2m8FF59zRN6swnvxDxE4makni0EQMU/E8YWug3OKTHBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:42:21.691003Z","bundle_sha256":"914352ad0ef1c8605dcecba398f812b95361ef1db3e0d550965cae5f18319fde"}}