{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:O4YEZGVNEQH5NUDZQP667N7TNQ","short_pith_number":"pith:O4YEZGVN","canonical_record":{"source":{"id":"1104.4471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-22T15:48:15Z","cross_cats_sorted":[],"title_canon_sha256":"6a3e7260f9681a886b166c04aed0fed52b59bc967d763643d2df6f53b5195dfb","abstract_canon_sha256":"d6dbb6c5cb544cd2c9da32755aca435982c3fe37f2556176b7a3926d8ff87b6b"},"schema_version":"1.0"},"canonical_sha256":"77304c9aad240fd6d07983fdefb7f36c15f1b8aa58b502b97e58373434ab6ed8","source":{"kind":"arxiv","id":"1104.4471","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4471","created_at":"2026-05-18T04:23:34Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4471v1","created_at":"2026-05-18T04:23:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4471","created_at":"2026-05-18T04:23:34Z"},{"alias_kind":"pith_short_12","alias_value":"O4YEZGVNEQH5","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"O4YEZGVNEQH5NUDZ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"O4YEZGVN","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:O4YEZGVNEQH5NUDZQP667N7TNQ","target":"record","payload":{"canonical_record":{"source":{"id":"1104.4471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-22T15:48:15Z","cross_cats_sorted":[],"title_canon_sha256":"6a3e7260f9681a886b166c04aed0fed52b59bc967d763643d2df6f53b5195dfb","abstract_canon_sha256":"d6dbb6c5cb544cd2c9da32755aca435982c3fe37f2556176b7a3926d8ff87b6b"},"schema_version":"1.0"},"canonical_sha256":"77304c9aad240fd6d07983fdefb7f36c15f1b8aa58b502b97e58373434ab6ed8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:34.562860Z","signature_b64":"KjLeelhxKygdd5p7RNzoVxLgJSc9CLwwC8U3v4S+GIm+N2XhNU6pam/CzaYi5Q3AA5RFgheCtbP9pSj+T7kXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77304c9aad240fd6d07983fdefb7f36c15f1b8aa58b502b97e58373434ab6ed8","last_reissued_at":"2026-05-18T04:23:34.562397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:34.562397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.4471","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:23:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bEYEwz5aSjc4RnRl4IXtq3XQhxbRlUPvTQAWwmhyaxYfKx4eNqfcGiuXLRjCvPMeVP3gJQC4n4YWm9e2dw4rDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:35:37.862063Z"},"content_sha256":"278e6a2ff6bab5ebdb11967748850f4e8fb9a8e8f8e4fd41a9788b9e2c06620a","schema_version":"1.0","event_id":"sha256:278e6a2ff6bab5ebdb11967748850f4e8fb9a8e8f8e4fd41a9788b9e2c06620a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:O4YEZGVNEQH5NUDZQP667N7TNQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards a Data Reduction for the Minimum Flip Supertree Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sebastian B\\\"ocker","submitted_at":"2011-04-22T15:48:15Z","abstract_excerpt":"In computational phylogenetics, the problem of constructing a supertree of a given set of rooted input trees can be formalized in different ways, to cope with contradictory information in the input. We consider the Minimum Flip Supertree problem, where the input trees are transformed into a 0/1/?-matrix, such that each row represents a taxon, and each column represents an inner node of one of the input trees. Our goal is to find a perfect phylogeny for the input matrix requiring a minimum number of 0/1-flips, that is, corrections of 0/1-entries in the matrix. The problem is known to be NP-comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4471","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:23:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d7HmrMaR5qMpv3BhViBB60/Eh7RjgC2PzlwVUuSvoaC1MONpfeah+a96OdLGpeYUyVY0TIV0maUExUxShD/cCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:35:37.862760Z"},"content_sha256":"7970d29e42cf8e1be06eff3cfb768ba30a75bb2a6437742c3a8768426cf9a552","schema_version":"1.0","event_id":"sha256:7970d29e42cf8e1be06eff3cfb768ba30a75bb2a6437742c3a8768426cf9a552"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O4YEZGVNEQH5NUDZQP667N7TNQ/bundle.json","state_url":"https://pith.science/pith/O4YEZGVNEQH5NUDZQP667N7TNQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O4YEZGVNEQH5NUDZQP667N7TNQ/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-09T01:35:37Z","links":{"resolver":"https://pith.science/pith/O4YEZGVNEQH5NUDZQP667N7TNQ","bundle":"https://pith.science/pith/O4YEZGVNEQH5NUDZQP667N7TNQ/bundle.json","state":"https://pith.science/pith/O4YEZGVNEQH5NUDZQP667N7TNQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O4YEZGVNEQH5NUDZQP667N7TNQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:O4YEZGVNEQH5NUDZQP667N7TNQ","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":"d6dbb6c5cb544cd2c9da32755aca435982c3fe37f2556176b7a3926d8ff87b6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-22T15:48:15Z","title_canon_sha256":"6a3e7260f9681a886b166c04aed0fed52b59bc967d763643d2df6f53b5195dfb"},"schema_version":"1.0","source":{"id":"1104.4471","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4471","created_at":"2026-05-18T04:23:34Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4471v1","created_at":"2026-05-18T04:23:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4471","created_at":"2026-05-18T04:23:34Z"},{"alias_kind":"pith_short_12","alias_value":"O4YEZGVNEQH5","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"O4YEZGVNEQH5NUDZ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"O4YEZGVN","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:7970d29e42cf8e1be06eff3cfb768ba30a75bb2a6437742c3a8768426cf9a552","target":"graph","created_at":"2026-05-18T04:23:34Z","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":"In computational phylogenetics, the problem of constructing a supertree of a given set of rooted input trees can be formalized in different ways, to cope with contradictory information in the input. We consider the Minimum Flip Supertree problem, where the input trees are transformed into a 0/1/?-matrix, such that each row represents a taxon, and each column represents an inner node of one of the input trees. Our goal is to find a perfect phylogeny for the input matrix requiring a minimum number of 0/1-flips, that is, corrections of 0/1-entries in the matrix. The problem is known to be NP-comp","authors_text":"Sebastian B\\\"ocker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-22T15:48:15Z","title":"Towards a Data Reduction for the Minimum Flip Supertree Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4471","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:278e6a2ff6bab5ebdb11967748850f4e8fb9a8e8f8e4fd41a9788b9e2c06620a","target":"record","created_at":"2026-05-18T04:23:34Z","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":"d6dbb6c5cb544cd2c9da32755aca435982c3fe37f2556176b7a3926d8ff87b6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-22T15:48:15Z","title_canon_sha256":"6a3e7260f9681a886b166c04aed0fed52b59bc967d763643d2df6f53b5195dfb"},"schema_version":"1.0","source":{"id":"1104.4471","kind":"arxiv","version":1}},"canonical_sha256":"77304c9aad240fd6d07983fdefb7f36c15f1b8aa58b502b97e58373434ab6ed8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77304c9aad240fd6d07983fdefb7f36c15f1b8aa58b502b97e58373434ab6ed8","first_computed_at":"2026-05-18T04:23:34.562397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:34.562397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KjLeelhxKygdd5p7RNzoVxLgJSc9CLwwC8U3v4S+GIm+N2XhNU6pam/CzaYi5Q3AA5RFgheCtbP9pSj+T7kXBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:34.562860Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.4471","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:278e6a2ff6bab5ebdb11967748850f4e8fb9a8e8f8e4fd41a9788b9e2c06620a","sha256:7970d29e42cf8e1be06eff3cfb768ba30a75bb2a6437742c3a8768426cf9a552"],"state_sha256":"04690337b332f828fae05704824704707d466f848d67f56dabdacef13257abc1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zBAvZgpi5bQmiu8x5j58+K+xk+yHnV1c2kxLGVL6zJvvSz8MyrHDtCtB/yIzhdyAggI8eTT9opH5DrPpMWyVDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T01:35:37.866647Z","bundle_sha256":"cfb86c76b79740d72c4cad91f0ead4452bd71f758b6522a483a6a821913b6b60"}}