{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2QQRJ2P5EG73QFXW5YEFBSXZUT","short_pith_number":"pith:2QQRJ2P5","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"},"canonical_sha256":"d42114e9fd21bfb816f6ee0850caf9a4c6f0090f4b6c326052acf82f78a6f17c","source":{"kind":"arxiv","id":"1701.05492","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05492","created_at":"2026-05-18T00:24:31Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05492v3","created_at":"2026-05-18T00:24:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05492","created_at":"2026-05-18T00:24:31Z"},{"alias_kind":"pith_short_12","alias_value":"2QQRJ2P5EG73","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2QQRJ2P5EG73QFXW","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2QQRJ2P5","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2QQRJ2P5EG73QFXW5YEFBSXZUT","target":"record","payload":{"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"},"canonical_sha256":"d42114e9fd21bfb816f6ee0850caf9a4c6f0090f4b6c326052acf82f78a6f17c","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"},"source_kind":"arxiv","source_id":"1701.05492","source_version":3,"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-18T00:24:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8oKR4ydR/g3Inoy+nYvHLzeaZg/h1sB3jsa5ja+NFcN4DNt2Digd9rVDH6APmJ9LoWTJ5m+FRbEnUp4fYNrJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:28:41.384746Z"},"content_sha256":"a51594616872ccc67f9e1f6fd26ca28bd030dbf8e7a490791ea6ce1c6084b9d1","schema_version":"1.0","event_id":"sha256:a51594616872ccc67f9e1f6fd26ca28bd030dbf8e7a490791ea6ce1c6084b9d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2QQRJ2P5EG73QFXW5YEFBSXZUT","target":"graph","payload":{"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"},"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-18T00:24:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jxwYaBz2JDMX6B418nlIPjn+iRHhIBfrH9ObcW7Xq5D+qnbB5l+ahRZLyIYcFgfgqIlLetCDvfNQwMnt44ZdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:28:41.385513Z"},"content_sha256":"3704e12435f82e74cdb96a53dd1f221f40cf4e2ef151ecb4544216c029be0ee8","schema_version":"1.0","event_id":"sha256:3704e12435f82e74cdb96a53dd1f221f40cf4e2ef151ecb4544216c029be0ee8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2QQRJ2P5EG73QFXW5YEFBSXZUT/bundle.json","state_url":"https://pith.science/pith/2QQRJ2P5EG73QFXW5YEFBSXZUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2QQRJ2P5EG73QFXW5YEFBSXZUT/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-31T16:28:41Z","links":{"resolver":"https://pith.science/pith/2QQRJ2P5EG73QFXW5YEFBSXZUT","bundle":"https://pith.science/pith/2QQRJ2P5EG73QFXW5YEFBSXZUT/bundle.json","state":"https://pith.science/pith/2QQRJ2P5EG73QFXW5YEFBSXZUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2QQRJ2P5EG73QFXW5YEFBSXZUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2QQRJ2P5EG73QFXW5YEFBSXZUT","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":"16fbac8146d4c599c8e4af779e14448146edc9dd3ac82a446183139fa9f10fc7","cross_cats_sorted":["cs.CC","cs.DS","math.CO","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-19T16:05:48Z","title_canon_sha256":"e954ead1b8883fff8997030a081ca9ffa102c6eab71b44aca079a2a586a83b1a"},"schema_version":"1.0","source":{"id":"1701.05492","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05492","created_at":"2026-05-18T00:24:31Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05492v3","created_at":"2026-05-18T00:24:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05492","created_at":"2026-05-18T00:24:31Z"},{"alias_kind":"pith_short_12","alias_value":"2QQRJ2P5EG73","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2QQRJ2P5EG73QFXW","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2QQRJ2P5","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:3704e12435f82e74cdb96a53dd1f221f40cf4e2ef151ecb4544216c029be0ee8","target":"graph","created_at":"2026-05-18T00:24:31Z","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":"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","authors_text":"Ademir Hujdurovi\\'c, Alexandru I. Tomescu, Edin Husi\\'c, Martin Milani\\v{c}, Romeo Rizzi","cross_cats":["cs.CC","cs.DS","math.CO","q-bio.PE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-19T16:05:48Z","title":"Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05492","kind":"arxiv","version":3},"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:a51594616872ccc67f9e1f6fd26ca28bd030dbf8e7a490791ea6ce1c6084b9d1","target":"record","created_at":"2026-05-18T00:24:31Z","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":"16fbac8146d4c599c8e4af779e14448146edc9dd3ac82a446183139fa9f10fc7","cross_cats_sorted":["cs.CC","cs.DS","math.CO","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-19T16:05:48Z","title_canon_sha256":"e954ead1b8883fff8997030a081ca9ffa102c6eab71b44aca079a2a586a83b1a"},"schema_version":"1.0","source":{"id":"1701.05492","kind":"arxiv","version":3}},"canonical_sha256":"d42114e9fd21bfb816f6ee0850caf9a4c6f0090f4b6c326052acf82f78a6f17c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d42114e9fd21bfb816f6ee0850caf9a4c6f0090f4b6c326052acf82f78a6f17c","first_computed_at":"2026-05-18T00:24:31.554567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:31.554567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TXmQ4Hu1BylGZptMWP1Y8dcUl51LBSfJ1r3WHrm68GCcg5cltYk5w34+AEoa5lG+H8j7G0xuqKRS3h4YDYkfAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:31.555141Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05492","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a51594616872ccc67f9e1f6fd26ca28bd030dbf8e7a490791ea6ce1c6084b9d1","sha256:3704e12435f82e74cdb96a53dd1f221f40cf4e2ef151ecb4544216c029be0ee8"],"state_sha256":"3b5612f73d8b8c527d9578638d7c01efdd31635efd398457cee6d59f53914aa6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JSgFJ90u9f4YISJMeLUQuuagDaBYTpZQkLcuYsn6ox4DkYfbjY2FlfzPx71S9tN8uY7dvo8r4ckk33I3YM/1AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:28:41.390274Z","bundle_sha256":"413142093234e2c42ee6147906b74b88adc34a0755df20ccb314206676e76184"}}