{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RINO4XLPCC4U75GMZQ54CR5XK3","short_pith_number":"pith:RINO4XLP","schema_version":"1.0","canonical_sha256":"8a1aee5d6f10b94ff4cccc3bc147b756def91f7198adc7c163710e357b6dd911","source":{"kind":"arxiv","id":"1506.07675","version":4},"attestation_state":"computed","paper":{"title":"Complexity and algorithms for finding a perfect phylogeny from mixed tumor samples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS"],"primary_cat":"q-bio.PE","authors_text":"Ademir Hujdurovi\\'c, Alexandru I. Tomescu, Bernard Ries, Martin Milani\\v{c}, Ur\\v{s}a Ka\\v{c}ar","submitted_at":"2015-06-25T09:33:04Z","abstract_excerpt":"Recently, Hajirasouliha and Raphael (WABI 2014) proposed a model for deconvoluting mixed tumor samples measured from a collection of high-throughput sequencing reads. This is related to understanding tumor evolution and critical cancer mutations. In short, their formulation asks to split each row of a binary matrix so that the resulting matrix corresponds to a perfect phylogeny and has the minimum number of rows among all matrices with this property. In this paper we disprove several claims about this problem, including an NP-hardness proof of it. However, we show that the problem is indeed NP"},"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":"1506.07675","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2015-06-25T09:33:04Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"title_canon_sha256":"16205fcf12fe0f5c93fba5f5dab74507e8dda8df0d6f9489f3693bb9ad2dc206","abstract_canon_sha256":"32a2a72f4d366f284886bfc27aa3de42038ca66625ba8b3a53de0ff95ca464f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:21.762351Z","signature_b64":"vHZWxReXoPeYRxm48/GM/q27sDWrGkr70cxGefaNLI4JNBJ5Bu2Jik4xhCTN5fUOBFxcOXwXscBID3iST+BsDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a1aee5d6f10b94ff4cccc3bc147b756def91f7198adc7c163710e357b6dd911","last_reissued_at":"2026-05-18T01:11:21.761665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:21.761665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity and algorithms for finding a perfect phylogeny from mixed tumor samples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS"],"primary_cat":"q-bio.PE","authors_text":"Ademir Hujdurovi\\'c, Alexandru I. Tomescu, Bernard Ries, Martin Milani\\v{c}, Ur\\v{s}a Ka\\v{c}ar","submitted_at":"2015-06-25T09:33:04Z","abstract_excerpt":"Recently, Hajirasouliha and Raphael (WABI 2014) proposed a model for deconvoluting mixed tumor samples measured from a collection of high-throughput sequencing reads. This is related to understanding tumor evolution and critical cancer mutations. In short, their formulation asks to split each row of a binary matrix so that the resulting matrix corresponds to a perfect phylogeny and has the minimum number of rows among all matrices with this property. In this paper we disprove several claims about this problem, including an NP-hardness proof of it. However, we show that the problem is indeed NP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07675","kind":"arxiv","version":4},"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":"1506.07675","created_at":"2026-05-18T01:11:21.761749+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.07675v4","created_at":"2026-05-18T01:11:21.761749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07675","created_at":"2026-05-18T01:11:21.761749+00:00"},{"alias_kind":"pith_short_12","alias_value":"RINO4XLPCC4U","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RINO4XLPCC4U75GM","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RINO4XLP","created_at":"2026-05-18T12:29:39.896362+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/RINO4XLPCC4U75GMZQ54CR5XK3","json":"https://pith.science/pith/RINO4XLPCC4U75GMZQ54CR5XK3.json","graph_json":"https://pith.science/api/pith-number/RINO4XLPCC4U75GMZQ54CR5XK3/graph.json","events_json":"https://pith.science/api/pith-number/RINO4XLPCC4U75GMZQ54CR5XK3/events.json","paper":"https://pith.science/paper/RINO4XLP"},"agent_actions":{"view_html":"https://pith.science/pith/RINO4XLPCC4U75GMZQ54CR5XK3","download_json":"https://pith.science/pith/RINO4XLPCC4U75GMZQ54CR5XK3.json","view_paper":"https://pith.science/paper/RINO4XLP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.07675&json=true","fetch_graph":"https://pith.science/api/pith-number/RINO4XLPCC4U75GMZQ54CR5XK3/graph.json","fetch_events":"https://pith.science/api/pith-number/RINO4XLPCC4U75GMZQ54CR5XK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RINO4XLPCC4U75GMZQ54CR5XK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RINO4XLPCC4U75GMZQ54CR5XK3/action/storage_attestation","attest_author":"https://pith.science/pith/RINO4XLPCC4U75GMZQ54CR5XK3/action/author_attestation","sign_citation":"https://pith.science/pith/RINO4XLPCC4U75GMZQ54CR5XK3/action/citation_signature","submit_replication":"https://pith.science/pith/RINO4XLPCC4U75GMZQ54CR5XK3/action/replication_record"}},"created_at":"2026-05-18T01:11:21.761749+00:00","updated_at":"2026-05-18T01:11:21.761749+00:00"}