{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OELG3YJHLFN6EKDUGDX7M4DKH6","short_pith_number":"pith:OELG3YJH","schema_version":"1.0","canonical_sha256":"71166de127595be2287430eff6706a3f939bb827c70b634b56c9696f17a83784","source":{"kind":"arxiv","id":"1201.5513","version":1},"attestation_state":"computed","paper":{"title":"Faster and Simpler Minimal Conflicting Set Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aida Ouangraoua, Mathieu Raffinot","submitted_at":"2012-01-26T13:35:33Z","abstract_excerpt":"Let C be a finite set of N elements and R = r_1,r_2,..., r_m a family of M subsets of C. A subset X of R verifies the Consecutive Ones Property (C1P) if there exists a permutation P of C such that each r_i in X is an interval of P. A Minimal Conflicting Set (MCS) S is a subset of R that does not verify the C1P, but such that any of its proper subsets does. In this paper, we present a new simpler and faster algorithm to decide if a given element r in R belongs to at least one MCS. Our algorithm runs in O(N^2M^2 + NM^7), largely improving the current O(M^6N^5 (M+N)^2 log(M+N)) fastest algorithm "},"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":"1201.5513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-26T13:35:33Z","cross_cats_sorted":[],"title_canon_sha256":"7982faee4ccaeacbf8164d0d3ca84595d5eb447403fec4bae4214d5a3ebc1dea","abstract_canon_sha256":"b78cf7b29802a3e417b3d533422f170aab86cba54cf16e016168e5558d7762e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:46.099736Z","signature_b64":"/Pke97cf5cIW54vvzaDkLEr0pS9JDf0lhRxyPC1YkO6hSkuti0qA/4d5vEL7+EHWP3zJidiUKcvFyu1nPU5rCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71166de127595be2287430eff6706a3f939bb827c70b634b56c9696f17a83784","last_reissued_at":"2026-05-18T04:03:46.099105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:46.099105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster and Simpler Minimal Conflicting Set Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aida Ouangraoua, Mathieu Raffinot","submitted_at":"2012-01-26T13:35:33Z","abstract_excerpt":"Let C be a finite set of N elements and R = r_1,r_2,..., r_m a family of M subsets of C. A subset X of R verifies the Consecutive Ones Property (C1P) if there exists a permutation P of C such that each r_i in X is an interval of P. A Minimal Conflicting Set (MCS) S is a subset of R that does not verify the C1P, but such that any of its proper subsets does. In this paper, we present a new simpler and faster algorithm to decide if a given element r in R belongs to at least one MCS. Our algorithm runs in O(N^2M^2 + NM^7), largely improving the current O(M^6N^5 (M+N)^2 log(M+N)) fastest algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5513","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":"1201.5513","created_at":"2026-05-18T04:03:46.099230+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.5513v1","created_at":"2026-05-18T04:03:46.099230+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5513","created_at":"2026-05-18T04:03:46.099230+00:00"},{"alias_kind":"pith_short_12","alias_value":"OELG3YJHLFN6","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OELG3YJHLFN6EKDU","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OELG3YJH","created_at":"2026-05-18T12:27:16.716162+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/OELG3YJHLFN6EKDUGDX7M4DKH6","json":"https://pith.science/pith/OELG3YJHLFN6EKDUGDX7M4DKH6.json","graph_json":"https://pith.science/api/pith-number/OELG3YJHLFN6EKDUGDX7M4DKH6/graph.json","events_json":"https://pith.science/api/pith-number/OELG3YJHLFN6EKDUGDX7M4DKH6/events.json","paper":"https://pith.science/paper/OELG3YJH"},"agent_actions":{"view_html":"https://pith.science/pith/OELG3YJHLFN6EKDUGDX7M4DKH6","download_json":"https://pith.science/pith/OELG3YJHLFN6EKDUGDX7M4DKH6.json","view_paper":"https://pith.science/paper/OELG3YJH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.5513&json=true","fetch_graph":"https://pith.science/api/pith-number/OELG3YJHLFN6EKDUGDX7M4DKH6/graph.json","fetch_events":"https://pith.science/api/pith-number/OELG3YJHLFN6EKDUGDX7M4DKH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OELG3YJHLFN6EKDUGDX7M4DKH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OELG3YJHLFN6EKDUGDX7M4DKH6/action/storage_attestation","attest_author":"https://pith.science/pith/OELG3YJHLFN6EKDUGDX7M4DKH6/action/author_attestation","sign_citation":"https://pith.science/pith/OELG3YJHLFN6EKDUGDX7M4DKH6/action/citation_signature","submit_replication":"https://pith.science/pith/OELG3YJHLFN6EKDUGDX7M4DKH6/action/replication_record"}},"created_at":"2026-05-18T04:03:46.099230+00:00","updated_at":"2026-05-18T04:03:46.099230+00:00"}