{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OELG3YJHLFN6EKDUGDX7M4DKH6","short_pith_number":"pith:OELG3YJH","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"},"canonical_sha256":"71166de127595be2287430eff6706a3f939bb827c70b634b56c9696f17a83784","source":{"kind":"arxiv","id":"1201.5513","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5513","created_at":"2026-05-18T04:03:46Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5513v1","created_at":"2026-05-18T04:03:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5513","created_at":"2026-05-18T04:03:46Z"},{"alias_kind":"pith_short_12","alias_value":"OELG3YJHLFN6","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OELG3YJHLFN6EKDU","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OELG3YJH","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OELG3YJHLFN6EKDUGDX7M4DKH6","target":"record","payload":{"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"},"canonical_sha256":"71166de127595be2287430eff6706a3f939bb827c70b634b56c9696f17a83784","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"},"source_kind":"arxiv","source_id":"1201.5513","source_version":1,"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-18T04:03:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wXtvO+Xj2eBR1QoZtpUQEZvZKn26n3FNoBGC1JYOtoX5IowxXUNuS70hoiMJbm2L0PKfs0uEvObQ8VT1H5fkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:10:22.257962Z"},"content_sha256":"ce91697444988d591a22516577797b57b17c57e79972ef1a8a3ad53cfba8d2a1","schema_version":"1.0","event_id":"sha256:ce91697444988d591a22516577797b57b17c57e79972ef1a8a3ad53cfba8d2a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OELG3YJHLFN6EKDUGDX7M4DKH6","target":"graph","payload":{"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"},"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-18T04:03:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZQntHZ8hgRokfRUXmOFkUAUmDH/X0zebSvQo7W/chUbIf6GVtVEzTS0z+Grz9hI1DDmKWdgi7qgEyd7LVKAjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:10:22.258451Z"},"content_sha256":"7d01900ddc7db3c941647c03c825422f1f90aedb87340e6df109fb6192e7a007","schema_version":"1.0","event_id":"sha256:7d01900ddc7db3c941647c03c825422f1f90aedb87340e6df109fb6192e7a007"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OELG3YJHLFN6EKDUGDX7M4DKH6/bundle.json","state_url":"https://pith.science/pith/OELG3YJHLFN6EKDUGDX7M4DKH6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OELG3YJHLFN6EKDUGDX7M4DKH6/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-27T08:10:22Z","links":{"resolver":"https://pith.science/pith/OELG3YJHLFN6EKDUGDX7M4DKH6","bundle":"https://pith.science/pith/OELG3YJHLFN6EKDUGDX7M4DKH6/bundle.json","state":"https://pith.science/pith/OELG3YJHLFN6EKDUGDX7M4DKH6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OELG3YJHLFN6EKDUGDX7M4DKH6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OELG3YJHLFN6EKDUGDX7M4DKH6","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":"b78cf7b29802a3e417b3d533422f170aab86cba54cf16e016168e5558d7762e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-26T13:35:33Z","title_canon_sha256":"7982faee4ccaeacbf8164d0d3ca84595d5eb447403fec4bae4214d5a3ebc1dea"},"schema_version":"1.0","source":{"id":"1201.5513","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5513","created_at":"2026-05-18T04:03:46Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5513v1","created_at":"2026-05-18T04:03:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5513","created_at":"2026-05-18T04:03:46Z"},{"alias_kind":"pith_short_12","alias_value":"OELG3YJHLFN6","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OELG3YJHLFN6EKDU","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OELG3YJH","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:7d01900ddc7db3c941647c03c825422f1f90aedb87340e6df109fb6192e7a007","target":"graph","created_at":"2026-05-18T04:03:46Z","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":"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 ","authors_text":"Aida Ouangraoua, Mathieu Raffinot","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-26T13:35:33Z","title":"Faster and Simpler Minimal Conflicting Set Identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5513","kind":"arxiv","version":1},"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:ce91697444988d591a22516577797b57b17c57e79972ef1a8a3ad53cfba8d2a1","target":"record","created_at":"2026-05-18T04:03:46Z","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":"b78cf7b29802a3e417b3d533422f170aab86cba54cf16e016168e5558d7762e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-26T13:35:33Z","title_canon_sha256":"7982faee4ccaeacbf8164d0d3ca84595d5eb447403fec4bae4214d5a3ebc1dea"},"schema_version":"1.0","source":{"id":"1201.5513","kind":"arxiv","version":1}},"canonical_sha256":"71166de127595be2287430eff6706a3f939bb827c70b634b56c9696f17a83784","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71166de127595be2287430eff6706a3f939bb827c70b634b56c9696f17a83784","first_computed_at":"2026-05-18T04:03:46.099105Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:46.099105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Pke97cf5cIW54vvzaDkLEr0pS9JDf0lhRxyPC1YkO6hSkuti0qA/4d5vEL7+EHWP3zJidiUKcvFyu1nPU5rCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:46.099736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.5513","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce91697444988d591a22516577797b57b17c57e79972ef1a8a3ad53cfba8d2a1","sha256:7d01900ddc7db3c941647c03c825422f1f90aedb87340e6df109fb6192e7a007"],"state_sha256":"0d6b06619523225813748eca78c03c1b25f68036c2ec46c529b00f6c4544f758"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hA29Y+ju1oyEZrJruBbR46id7f4wAKuUl8EWZz7+dVZ2IQbgtyHBwAkU31eyz8ByEKXsNOnH9ELGFJSWk2YVDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:10:22.261261Z","bundle_sha256":"ec2066f6fc96bc643db048d7bf19003ec69dfafb4fd646c19d8b5bc5988dbbec"}}