{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:337M2GIIOKRXLCUUPFILQFBCYD","short_pith_number":"pith:337M2GII","schema_version":"1.0","canonical_sha256":"defecd190872a3758a947950b81422c0c3a70236179424c4628afdcf04d7b443","source":{"kind":"arxiv","id":"1203.3284","version":1},"attestation_state":"computed","paper":{"title":"Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"cs.DS","authors_text":"Masashi Kiyomi, Toshiki Saitoh, Yoshio Okamoto","submitted_at":"2012-03-15T07:50:06Z","abstract_excerpt":"We study a character-based phylogeny reconstruction problem when an incomplete set of data is given. More specifically, we consider the situation under the directed perfect phylogeny assumption with binary characters in which for some species the states of some characters are missing. Our main object is to give an efficient algorithm to enumerate (or list) all perfect phylogenies that can be obtained when the missing entries are completed. While a simple branch-and-bound algorithm (B&B) shows a theoretically good performance, we propose another approach based on a zero-suppressed binary decisi"},"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":"1203.3284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-15T07:50:06Z","cross_cats_sorted":["q-bio.PE"],"title_canon_sha256":"a0321c9c4ed42ef429cbc7fac60320a9fa79bdfd5ddfd5c4ec53928251e16696","abstract_canon_sha256":"73199bb95fb751692510c8580e0e23241849e198a5467c8204d36971fe915882"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:02.296170Z","signature_b64":"Zojt8Dg1hQCoo/Wqnh+edpBeQrahtSu3La8g1LytoDEhy8zNkglcwOd3Nn9vuk07t3LXvf4f8nJMKg5ss7b4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"defecd190872a3758a947950b81422c0c3a70236179424c4628afdcf04d7b443","last_reissued_at":"2026-05-18T04:00:02.295693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:02.295693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"cs.DS","authors_text":"Masashi Kiyomi, Toshiki Saitoh, Yoshio Okamoto","submitted_at":"2012-03-15T07:50:06Z","abstract_excerpt":"We study a character-based phylogeny reconstruction problem when an incomplete set of data is given. More specifically, we consider the situation under the directed perfect phylogeny assumption with binary characters in which for some species the states of some characters are missing. Our main object is to give an efficient algorithm to enumerate (or list) all perfect phylogenies that can be obtained when the missing entries are completed. While a simple branch-and-bound algorithm (B&B) shows a theoretically good performance, we propose another approach based on a zero-suppressed binary decisi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3284","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":"1203.3284","created_at":"2026-05-18T04:00:02.295766+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.3284v1","created_at":"2026-05-18T04:00:02.295766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3284","created_at":"2026-05-18T04:00:02.295766+00:00"},{"alias_kind":"pith_short_12","alias_value":"337M2GIIOKRX","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"337M2GIIOKRXLCUU","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"337M2GII","created_at":"2026-05-18T12:26:50.516681+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/337M2GIIOKRXLCUUPFILQFBCYD","json":"https://pith.science/pith/337M2GIIOKRXLCUUPFILQFBCYD.json","graph_json":"https://pith.science/api/pith-number/337M2GIIOKRXLCUUPFILQFBCYD/graph.json","events_json":"https://pith.science/api/pith-number/337M2GIIOKRXLCUUPFILQFBCYD/events.json","paper":"https://pith.science/paper/337M2GII"},"agent_actions":{"view_html":"https://pith.science/pith/337M2GIIOKRXLCUUPFILQFBCYD","download_json":"https://pith.science/pith/337M2GIIOKRXLCUUPFILQFBCYD.json","view_paper":"https://pith.science/paper/337M2GII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.3284&json=true","fetch_graph":"https://pith.science/api/pith-number/337M2GIIOKRXLCUUPFILQFBCYD/graph.json","fetch_events":"https://pith.science/api/pith-number/337M2GIIOKRXLCUUPFILQFBCYD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/337M2GIIOKRXLCUUPFILQFBCYD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/337M2GIIOKRXLCUUPFILQFBCYD/action/storage_attestation","attest_author":"https://pith.science/pith/337M2GIIOKRXLCUUPFILQFBCYD/action/author_attestation","sign_citation":"https://pith.science/pith/337M2GIIOKRXLCUUPFILQFBCYD/action/citation_signature","submit_replication":"https://pith.science/pith/337M2GIIOKRXLCUUPFILQFBCYD/action/replication_record"}},"created_at":"2026-05-18T04:00:02.295766+00:00","updated_at":"2026-05-18T04:00:02.295766+00:00"}