{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:JI6ED3K4T6JJMRKYLDEVJI542E","short_pith_number":"pith:JI6ED3K4","schema_version":"1.0","canonical_sha256":"4a3c41ed5c9f9296455858c954a3bcd13f491342a2a3aa0ef266f69d08cb6cdc","source":{"kind":"arxiv","id":"0912.4196","version":1},"attestation_state":"computed","paper":{"title":"Minimal Conflicting Sets for the Consecutive Ones Property in ancestral genome reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"q-bio.GN","authors_text":"Cedric Chauve, Tamon Stephen, Utz-Uwe Haus, Vivija P. You","submitted_at":"2009-12-21T16:03:06Z","abstract_excerpt":"A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1's on each row are consecutive. A Minimal Conflicting Set is a set of rows that does not have the C1P, but every proper subset has the C1P. Such submatrices have been considered in comparative genomics applications, but very little is known about their combinatorial structure and efficient algorithms to compute them. We first describe an algorithm that detects rows that belong to Minimal Conflicting Sets. This algorithm has a polynomial time complexity when the number of 1's in each ro"},"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":"0912.4196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.GN","submitted_at":"2009-12-21T16:03:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"33a7487f915e853b0d13964d5b503e58cf6209ebca8e594b9b7a0023c931371c","abstract_canon_sha256":"eaad38123fc17c60ca24684128e2dea856d344d0f6002f1ba8858e04dd1a8207"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:08.567548Z","signature_b64":"dqdIelJMhfluR3Pju32fqz0vFb0SDQW+hVvg//g1boazywV+uYXFALHYp1OcdvG2+R10ePvlTDyiYyI9VrBtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a3c41ed5c9f9296455858c954a3bcd13f491342a2a3aa0ef266f69d08cb6cdc","last_reissued_at":"2026-05-18T04:11:08.567047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:08.567047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal Conflicting Sets for the Consecutive Ones Property in ancestral genome reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"q-bio.GN","authors_text":"Cedric Chauve, Tamon Stephen, Utz-Uwe Haus, Vivija P. You","submitted_at":"2009-12-21T16:03:06Z","abstract_excerpt":"A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1's on each row are consecutive. A Minimal Conflicting Set is a set of rows that does not have the C1P, but every proper subset has the C1P. Such submatrices have been considered in comparative genomics applications, but very little is known about their combinatorial structure and efficient algorithms to compute them. We first describe an algorithm that detects rows that belong to Minimal Conflicting Sets. This algorithm has a polynomial time complexity when the number of 1's in each ro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.4196","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":"0912.4196","created_at":"2026-05-18T04:11:08.567125+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.4196v1","created_at":"2026-05-18T04:11:08.567125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.4196","created_at":"2026-05-18T04:11:08.567125+00:00"},{"alias_kind":"pith_short_12","alias_value":"JI6ED3K4T6JJ","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"JI6ED3K4T6JJMRKY","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"JI6ED3K4","created_at":"2026-05-18T12:26:00.592388+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/JI6ED3K4T6JJMRKYLDEVJI542E","json":"https://pith.science/pith/JI6ED3K4T6JJMRKYLDEVJI542E.json","graph_json":"https://pith.science/api/pith-number/JI6ED3K4T6JJMRKYLDEVJI542E/graph.json","events_json":"https://pith.science/api/pith-number/JI6ED3K4T6JJMRKYLDEVJI542E/events.json","paper":"https://pith.science/paper/JI6ED3K4"},"agent_actions":{"view_html":"https://pith.science/pith/JI6ED3K4T6JJMRKYLDEVJI542E","download_json":"https://pith.science/pith/JI6ED3K4T6JJMRKYLDEVJI542E.json","view_paper":"https://pith.science/paper/JI6ED3K4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.4196&json=true","fetch_graph":"https://pith.science/api/pith-number/JI6ED3K4T6JJMRKYLDEVJI542E/graph.json","fetch_events":"https://pith.science/api/pith-number/JI6ED3K4T6JJMRKYLDEVJI542E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JI6ED3K4T6JJMRKYLDEVJI542E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JI6ED3K4T6JJMRKYLDEVJI542E/action/storage_attestation","attest_author":"https://pith.science/pith/JI6ED3K4T6JJMRKYLDEVJI542E/action/author_attestation","sign_citation":"https://pith.science/pith/JI6ED3K4T6JJMRKYLDEVJI542E/action/citation_signature","submit_replication":"https://pith.science/pith/JI6ED3K4T6JJMRKYLDEVJI542E/action/replication_record"}},"created_at":"2026-05-18T04:11:08.567125+00:00","updated_at":"2026-05-18T04:11:08.567125+00:00"}