{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:O4YEZGVNEQH5NUDZQP667N7TNQ","short_pith_number":"pith:O4YEZGVN","schema_version":"1.0","canonical_sha256":"77304c9aad240fd6d07983fdefb7f36c15f1b8aa58b502b97e58373434ab6ed8","source":{"kind":"arxiv","id":"1104.4471","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1104.4471","created_at":"2026-05-18T04:23:34.562461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.4471v1","created_at":"2026-05-18T04:23:34.562461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4471","created_at":"2026-05-18T04:23:34.562461+00:00"},{"alias_kind":"pith_short_12","alias_value":"O4YEZGVNEQH5","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"O4YEZGVNEQH5NUDZ","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"O4YEZGVN","created_at":"2026-05-18T12:26:37.096874+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O4YEZGVNEQH5NUDZQP667N7TNQ","json":"https://pith.science/pith/O4YEZGVNEQH5NUDZQP667N7TNQ.json","graph_json":"https://pith.science/api/pith-number/O4YEZGVNEQH5NUDZQP667N7TNQ/graph.json","events_json":"https://pith.science/api/pith-number/O4YEZGVNEQH5NUDZQP667N7TNQ/events.json","paper":"https://pith.science/paper/O4YEZGVN"},"agent_actions":{"view_html":"https://pith.science/pith/O4YEZGVNEQH5NUDZQP667N7TNQ","download_json":"https://pith.science/pith/O4YEZGVNEQH5NUDZQP667N7TNQ.json","view_paper":"https://pith.science/paper/O4YEZGVN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.4471&json=true","fetch_graph":"https://pith.science/api/pith-number/O4YEZGVNEQH5NUDZQP667N7TNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/O4YEZGVNEQH5NUDZQP667N7TNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O4YEZGVNEQH5NUDZQP667N7TNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O4YEZGVNEQH5NUDZQP667N7TNQ/action/storage_attestation","attest_author":"https://pith.science/pith/O4YEZGVNEQH5NUDZQP667N7TNQ/action/author_attestation","sign_citation":"https://pith.science/pith/O4YEZGVNEQH5NUDZQP667N7TNQ/action/citation_signature","submit_replication":"https://pith.science/pith/O4YEZGVNEQH5NUDZQP667N7TNQ/action/replication_record"}},"created_at":"2026-05-18T04:23:34.562461+00:00","updated_at":"2026-05-18T04:23:34.562461+00:00"}