{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2QQRJ2P5EG73QFXW5YEFBSXZUT","short_pith_number":"pith:2QQRJ2P5","schema_version":"1.0","canonical_sha256":"d42114e9fd21bfb816f6ee0850caf9a4c6f0090f4b6c326052acf82f78a6f17c","source":{"kind":"arxiv","id":"1701.05492","version":3},"attestation_state":"computed","paper":{"title":"Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.CO","q-bio.PE"],"primary_cat":"cs.DM","authors_text":"Ademir Hujdurovi\\'c, Alexandru I. Tomescu, Edin Husi\\'c, Martin Milani\\v{c}, Romeo Rizzi","submitted_at":"2017-01-19T16:05:48Z","abstract_excerpt":"Motivated by applications in cancer genomics and following the work of Hajirasouliha and Raphael (WABI 2014), Hujdurovi\\'c et al. (IEEE TCBB, to appear) introduced the minimum conflict-free row split (MCRS) problem: split each row of a given binary matrix into a bitwise OR of a set of rows so that the resulting matrix corresponds to a perfect phylogeny and has the minimum possible number of rows among all matrices with this property. Hajirasouliha and Raphael also proposed the study of a similar problem, in which the task is to minimize the number of distinct rows of the resulting matrix. Hujd"},"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":"1701.05492","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-19T16:05:48Z","cross_cats_sorted":["cs.CC","cs.DS","math.CO","q-bio.PE"],"title_canon_sha256":"e954ead1b8883fff8997030a081ca9ffa102c6eab71b44aca079a2a586a83b1a","abstract_canon_sha256":"16fbac8146d4c599c8e4af779e14448146edc9dd3ac82a446183139fa9f10fc7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:31.555141Z","signature_b64":"TXmQ4Hu1BylGZptMWP1Y8dcUl51LBSfJ1r3WHrm68GCcg5cltYk5w34+AEoa5lG+H8j7G0xuqKRS3h4YDYkfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d42114e9fd21bfb816f6ee0850caf9a4c6f0090f4b6c326052acf82f78a6f17c","last_reissued_at":"2026-05-18T00:24:31.554567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:31.554567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.CO","q-bio.PE"],"primary_cat":"cs.DM","authors_text":"Ademir Hujdurovi\\'c, Alexandru I. Tomescu, Edin Husi\\'c, Martin Milani\\v{c}, Romeo Rizzi","submitted_at":"2017-01-19T16:05:48Z","abstract_excerpt":"Motivated by applications in cancer genomics and following the work of Hajirasouliha and Raphael (WABI 2014), Hujdurovi\\'c et al. (IEEE TCBB, to appear) introduced the minimum conflict-free row split (MCRS) problem: split each row of a given binary matrix into a bitwise OR of a set of rows so that the resulting matrix corresponds to a perfect phylogeny and has the minimum possible number of rows among all matrices with this property. Hajirasouliha and Raphael also proposed the study of a similar problem, in which the task is to minimize the number of distinct rows of the resulting matrix. Hujd"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05492","kind":"arxiv","version":3},"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":"1701.05492","created_at":"2026-05-18T00:24:31.554668+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.05492v3","created_at":"2026-05-18T00:24:31.554668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05492","created_at":"2026-05-18T00:24:31.554668+00:00"},{"alias_kind":"pith_short_12","alias_value":"2QQRJ2P5EG73","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2QQRJ2P5EG73QFXW","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2QQRJ2P5","created_at":"2026-05-18T12:30:55.937587+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/2QQRJ2P5EG73QFXW5YEFBSXZUT","json":"https://pith.science/pith/2QQRJ2P5EG73QFXW5YEFBSXZUT.json","graph_json":"https://pith.science/api/pith-number/2QQRJ2P5EG73QFXW5YEFBSXZUT/graph.json","events_json":"https://pith.science/api/pith-number/2QQRJ2P5EG73QFXW5YEFBSXZUT/events.json","paper":"https://pith.science/paper/2QQRJ2P5"},"agent_actions":{"view_html":"https://pith.science/pith/2QQRJ2P5EG73QFXW5YEFBSXZUT","download_json":"https://pith.science/pith/2QQRJ2P5EG73QFXW5YEFBSXZUT.json","view_paper":"https://pith.science/paper/2QQRJ2P5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.05492&json=true","fetch_graph":"https://pith.science/api/pith-number/2QQRJ2P5EG73QFXW5YEFBSXZUT/graph.json","fetch_events":"https://pith.science/api/pith-number/2QQRJ2P5EG73QFXW5YEFBSXZUT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2QQRJ2P5EG73QFXW5YEFBSXZUT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2QQRJ2P5EG73QFXW5YEFBSXZUT/action/storage_attestation","attest_author":"https://pith.science/pith/2QQRJ2P5EG73QFXW5YEFBSXZUT/action/author_attestation","sign_citation":"https://pith.science/pith/2QQRJ2P5EG73QFXW5YEFBSXZUT/action/citation_signature","submit_replication":"https://pith.science/pith/2QQRJ2P5EG73QFXW5YEFBSXZUT/action/replication_record"}},"created_at":"2026-05-18T00:24:31.554668+00:00","updated_at":"2026-05-18T00:24:31.554668+00:00"}