{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4SM3LFBENBI3YNYTGE5SSPEYWE","short_pith_number":"pith:4SM3LFBE","canonical_record":{"source":{"id":"1112.5359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-22T15:58:01Z","cross_cats_sorted":["cs.DS","q-bio.QM"],"title_canon_sha256":"360f313af4b2e726de76fb567efcdeab48880bd5ba5a75a1505b9118a27bb698","abstract_canon_sha256":"7636ed5133d227a10a1db1be954b4b6398293aa9ed179bf219f495d47ee19e8b"},"schema_version":"1.0"},"canonical_sha256":"e499b594246851bc3713313b293c98b13c49905b29026ea42fb70de7e5a8f02f","source":{"kind":"arxiv","id":"1112.5359","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5359","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5359v1","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5359","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"4SM3LFBENBI3","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4SM3LFBENBI3YNYT","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4SM3LFBE","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4SM3LFBENBI3YNYTGE5SSPEYWE","target":"record","payload":{"canonical_record":{"source":{"id":"1112.5359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-22T15:58:01Z","cross_cats_sorted":["cs.DS","q-bio.QM"],"title_canon_sha256":"360f313af4b2e726de76fb567efcdeab48880bd5ba5a75a1505b9118a27bb698","abstract_canon_sha256":"7636ed5133d227a10a1db1be954b4b6398293aa9ed179bf219f495d47ee19e8b"},"schema_version":"1.0"},"canonical_sha256":"e499b594246851bc3713313b293c98b13c49905b29026ea42fb70de7e5a8f02f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:47.476732Z","signature_b64":"5ibxZLeKTgMt96hXKpJBkZMBDKF2fIXpsS4IuvlKJ9ANwZDMLYx/LUhpnQeLS5+WoLjFAqmrP563axM4fPepDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e499b594246851bc3713313b293c98b13c49905b29026ea42fb70de7e5a8f02f","last_reissued_at":"2026-05-18T04:05:47.476356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:47.476356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.5359","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:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"owkzhqLiUAd7sUgz5m8msyKV8BdISLcCicS28kpVPrvcfh4WjiMuvkYQTfH0v9iiAyGetcrQ2QoCeANjwrngAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:54:31.433683Z"},"content_sha256":"a96fa90d1b86e009b0dfb7ea1a8b604324350850816caec54c0da42d48991379","schema_version":"1.0","event_id":"sha256:a96fa90d1b86e009b0dfb7ea1a8b604324350850816caec54c0da42d48991379"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4SM3LFBENBI3YNYTGE5SSPEYWE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cycle killer... qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","q-bio.QM"],"primary_cat":"math.CO","authors_text":"Celine Scornavacca, Leen Stougie, Leo van Iersel, Nela Lekic, Simone Linz, Steven Kelk","submitted_at":"2011-12-22T15:58:01Z","abstract_excerpt":"We show that the problem of computing the hybridization number of two rooted binary phylogenetic trees on the same set of taxa X has a constant factor polynomial-time approximation if and only if the problem of computing a minimum-size feedback vertex set in a directed graph (DFVS) has a constant factor polynomial-time approximation. The latter problem, which asks for a minimum number of vertices to be removed from a directed graph to transform it into a directed acyclic graph, is one of the problems in Karp's seminal 1972 list of 21 NP-complete problems. However, despite considerable attentio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5359","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:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kQqBs/WfjXLinuHDFG33s+AQCqG6pTghDqwTWr6Y7tdEST2wygVRbRtkj7of3IH56iYbZE0QdlzFgRWEj/n1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:54:31.434394Z"},"content_sha256":"c4da435a1455f0e0f798d47c20bae6fe71a2b3c064880f394afd1aeb1fb7cd45","schema_version":"1.0","event_id":"sha256:c4da435a1455f0e0f798d47c20bae6fe71a2b3c064880f394afd1aeb1fb7cd45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4SM3LFBENBI3YNYTGE5SSPEYWE/bundle.json","state_url":"https://pith.science/pith/4SM3LFBENBI3YNYTGE5SSPEYWE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4SM3LFBENBI3YNYTGE5SSPEYWE/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-07T07:54:31Z","links":{"resolver":"https://pith.science/pith/4SM3LFBENBI3YNYTGE5SSPEYWE","bundle":"https://pith.science/pith/4SM3LFBENBI3YNYTGE5SSPEYWE/bundle.json","state":"https://pith.science/pith/4SM3LFBENBI3YNYTGE5SSPEYWE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4SM3LFBENBI3YNYTGE5SSPEYWE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4SM3LFBENBI3YNYTGE5SSPEYWE","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":"7636ed5133d227a10a1db1be954b4b6398293aa9ed179bf219f495d47ee19e8b","cross_cats_sorted":["cs.DS","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-22T15:58:01Z","title_canon_sha256":"360f313af4b2e726de76fb567efcdeab48880bd5ba5a75a1505b9118a27bb698"},"schema_version":"1.0","source":{"id":"1112.5359","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5359","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5359v1","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5359","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"4SM3LFBENBI3","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4SM3LFBENBI3YNYT","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4SM3LFBE","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:c4da435a1455f0e0f798d47c20bae6fe71a2b3c064880f394afd1aeb1fb7cd45","target":"graph","created_at":"2026-05-18T04:05: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":"We show that the problem of computing the hybridization number of two rooted binary phylogenetic trees on the same set of taxa X has a constant factor polynomial-time approximation if and only if the problem of computing a minimum-size feedback vertex set in a directed graph (DFVS) has a constant factor polynomial-time approximation. The latter problem, which asks for a minimum number of vertices to be removed from a directed graph to transform it into a directed acyclic graph, is one of the problems in Karp's seminal 1972 list of 21 NP-complete problems. However, despite considerable attentio","authors_text":"Celine Scornavacca, Leen Stougie, Leo van Iersel, Nela Lekic, Simone Linz, Steven Kelk","cross_cats":["cs.DS","q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-22T15:58:01Z","title":"Cycle killer... qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5359","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:a96fa90d1b86e009b0dfb7ea1a8b604324350850816caec54c0da42d48991379","target":"record","created_at":"2026-05-18T04:05: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":"7636ed5133d227a10a1db1be954b4b6398293aa9ed179bf219f495d47ee19e8b","cross_cats_sorted":["cs.DS","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-22T15:58:01Z","title_canon_sha256":"360f313af4b2e726de76fb567efcdeab48880bd5ba5a75a1505b9118a27bb698"},"schema_version":"1.0","source":{"id":"1112.5359","kind":"arxiv","version":1}},"canonical_sha256":"e499b594246851bc3713313b293c98b13c49905b29026ea42fb70de7e5a8f02f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e499b594246851bc3713313b293c98b13c49905b29026ea42fb70de7e5a8f02f","first_computed_at":"2026-05-18T04:05:47.476356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:47.476356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5ibxZLeKTgMt96hXKpJBkZMBDKF2fIXpsS4IuvlKJ9ANwZDMLYx/LUhpnQeLS5+WoLjFAqmrP563axM4fPepDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:47.476732Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.5359","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a96fa90d1b86e009b0dfb7ea1a8b604324350850816caec54c0da42d48991379","sha256:c4da435a1455f0e0f798d47c20bae6fe71a2b3c064880f394afd1aeb1fb7cd45"],"state_sha256":"e93dff3946ea18867b6b40bb20bd1ef1755d17444c6ed1ede15808b534dfabf0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0anXIivwPDFV1QQXazDBUGbUdgFz40uaAgnGa1eyyhLoJxRm1EEvKu6jU26pi0adPn0x65IgGeIGn189WvGMBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T07:54:31.441347Z","bundle_sha256":"f248570f7e39eebf78c0c7f0d4a50f70afd08ceee26a33263d62ed5c652598c0"}}