{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RINO4XLPCC4U75GMZQ54CR5XK3","short_pith_number":"pith:RINO4XLP","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"},"canonical_sha256":"8a1aee5d6f10b94ff4cccc3bc147b756def91f7198adc7c163710e357b6dd911","source":{"kind":"arxiv","id":"1506.07675","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07675","created_at":"2026-05-18T01:11:21Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07675v4","created_at":"2026-05-18T01:11:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07675","created_at":"2026-05-18T01:11:21Z"},{"alias_kind":"pith_short_12","alias_value":"RINO4XLPCC4U","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RINO4XLPCC4U75GM","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RINO4XLP","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RINO4XLPCC4U75GMZQ54CR5XK3","target":"record","payload":{"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"},"canonical_sha256":"8a1aee5d6f10b94ff4cccc3bc147b756def91f7198adc7c163710e357b6dd911","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"},"source_kind":"arxiv","source_id":"1506.07675","source_version":4,"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-18T01:11:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UjX02uYpLdjdWyPHuJCp35gtRIV922OEk8/lroaA72lRr2hQubtRyrjffP90jWwT+7rQeDdNOWb+h/nAy/e2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:22:38.609504Z"},"content_sha256":"91db02423f584f284819980d14666fd17abf739c4482056924a08a5e8cc0a83a","schema_version":"1.0","event_id":"sha256:91db02423f584f284819980d14666fd17abf739c4482056924a08a5e8cc0a83a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RINO4XLPCC4U75GMZQ54CR5XK3","target":"graph","payload":{"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"},"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-18T01:11:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6w1YcTzKtiX6GbJ5htYuywBnc/xlBp84hIIuVLYiklNGH34lToaASMZLSS3M4M5wNXY0jEdax3f4aXLTylWXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:22:38.610110Z"},"content_sha256":"8dfe905d765922b733134bc2621ca9909816a50d95091950610375f751d3596d","schema_version":"1.0","event_id":"sha256:8dfe905d765922b733134bc2621ca9909816a50d95091950610375f751d3596d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RINO4XLPCC4U75GMZQ54CR5XK3/bundle.json","state_url":"https://pith.science/pith/RINO4XLPCC4U75GMZQ54CR5XK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RINO4XLPCC4U75GMZQ54CR5XK3/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-05-27T23:22:38Z","links":{"resolver":"https://pith.science/pith/RINO4XLPCC4U75GMZQ54CR5XK3","bundle":"https://pith.science/pith/RINO4XLPCC4U75GMZQ54CR5XK3/bundle.json","state":"https://pith.science/pith/RINO4XLPCC4U75GMZQ54CR5XK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RINO4XLPCC4U75GMZQ54CR5XK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RINO4XLPCC4U75GMZQ54CR5XK3","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":"32a2a72f4d366f284886bfc27aa3de42038ca66625ba8b3a53de0ff95ca464f9","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2015-06-25T09:33:04Z","title_canon_sha256":"16205fcf12fe0f5c93fba5f5dab74507e8dda8df0d6f9489f3693bb9ad2dc206"},"schema_version":"1.0","source":{"id":"1506.07675","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07675","created_at":"2026-05-18T01:11:21Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07675v4","created_at":"2026-05-18T01:11:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07675","created_at":"2026-05-18T01:11:21Z"},{"alias_kind":"pith_short_12","alias_value":"RINO4XLPCC4U","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RINO4XLPCC4U75GM","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RINO4XLP","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:8dfe905d765922b733134bc2621ca9909816a50d95091950610375f751d3596d","target":"graph","created_at":"2026-05-18T01:11:21Z","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":"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","authors_text":"Ademir Hujdurovi\\'c, Alexandru I. Tomescu, Bernard Ries, Martin Milani\\v{c}, Ur\\v{s}a Ka\\v{c}ar","cross_cats":["cs.CC","cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2015-06-25T09:33:04Z","title":"Complexity and algorithms for finding a perfect phylogeny from mixed tumor samples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07675","kind":"arxiv","version":4},"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:91db02423f584f284819980d14666fd17abf739c4482056924a08a5e8cc0a83a","target":"record","created_at":"2026-05-18T01:11:21Z","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":"32a2a72f4d366f284886bfc27aa3de42038ca66625ba8b3a53de0ff95ca464f9","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2015-06-25T09:33:04Z","title_canon_sha256":"16205fcf12fe0f5c93fba5f5dab74507e8dda8df0d6f9489f3693bb9ad2dc206"},"schema_version":"1.0","source":{"id":"1506.07675","kind":"arxiv","version":4}},"canonical_sha256":"8a1aee5d6f10b94ff4cccc3bc147b756def91f7198adc7c163710e357b6dd911","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a1aee5d6f10b94ff4cccc3bc147b756def91f7198adc7c163710e357b6dd911","first_computed_at":"2026-05-18T01:11:21.761665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:21.761665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vHZWxReXoPeYRxm48/GM/q27sDWrGkr70cxGefaNLI4JNBJ5Bu2Jik4xhCTN5fUOBFxcOXwXscBID3iST+BsDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:21.762351Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.07675","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91db02423f584f284819980d14666fd17abf739c4482056924a08a5e8cc0a83a","sha256:8dfe905d765922b733134bc2621ca9909816a50d95091950610375f751d3596d"],"state_sha256":"1f3c46f4e66d1de5154fb2aabc37ba612d2108ff2c6d29170a184a3928c2222c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n0U0MtVXTDSs4c6BzAHyz2lrEwzfVnSQin9yxFIRM+x4cdfoDPVxEYOqn6jTB2er+6Lt8y5IX2qYxf2PuXh/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:22:38.613535Z","bundle_sha256":"2b73d565b1048627ef8890a21a9179723359862615b5a3c2440435f15ce1a4b2"}}