{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:UJCVC2YSCORRYVRRBHQHQYHTQO","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":"e98ab7ba75250db650f6332574af2b84032b54079ed977c5250bad4780c33096","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-02-05T11:30:23Z","title_canon_sha256":"191ec887e7cf32871fb60c38bce78fe43de6995a26a8a67363b071cb9d40c0e9"},"schema_version":"1.0","source":{"id":"2102.04245","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.04245","created_at":"2026-07-05T02:14:01Z"},{"alias_kind":"arxiv_version","alias_value":"2102.04245v1","created_at":"2026-07-05T02:14:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.04245","created_at":"2026-07-05T02:14:01Z"},{"alias_kind":"pith_short_12","alias_value":"UJCVC2YSCORR","created_at":"2026-07-05T02:14:01Z"},{"alias_kind":"pith_short_16","alias_value":"UJCVC2YSCORRYVRR","created_at":"2026-07-05T02:14:01Z"},{"alias_kind":"pith_short_8","alias_value":"UJCVC2YS","created_at":"2026-07-05T02:14:01Z"}],"graph_snapshots":[{"event_id":"sha256:246baeddc9876d01686cfaf0e7d0e9a331559cb9509aca27007374962a87290e","target":"graph","created_at":"2026-07-05T02:14:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2102.04245/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given an implicational base, a well-known representation for a closure system, an inconsistency binary relation over a finite set, we are interested in the problem of enumerating all maximal consistent closed sets (denoted by MCCEnum for short). We show that MCCEnum cannot be solved in output-polynomial time unless $\\textsf{P} = \\textsf{NP}$, even for lower bounded lattices. We give an incremental-polynomial time algorithm to solve MCCEnum for closure systems with constant Carath\\'eodory number. Finally we prove that in biatomic atomistic closure systems MCCEnum can be solved in output-quasipo","authors_text":"Lhouari Nourine, Simon Vilmin","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-02-05T11:30:23Z","title":"Enumerating maximal consistent closed sets in closure systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.04245","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:12ed1e7e8f8c59ac7646131318331b1c31ce324366e3f611eef2ba9360d6620b","target":"record","created_at":"2026-07-05T02:14:01Z","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":"e98ab7ba75250db650f6332574af2b84032b54079ed977c5250bad4780c33096","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-02-05T11:30:23Z","title_canon_sha256":"191ec887e7cf32871fb60c38bce78fe43de6995a26a8a67363b071cb9d40c0e9"},"schema_version":"1.0","source":{"id":"2102.04245","kind":"arxiv","version":1}},"canonical_sha256":"a245516b1213a31c563109e07860f38388846351979f51c33bd1683c3d418067","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a245516b1213a31c563109e07860f38388846351979f51c33bd1683c3d418067","first_computed_at":"2026-07-05T02:14:01.634893Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:14:01.634893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YdLfH6EaDBVn7LVa90E1CNdiwlvl9WYRKcPrDYtMhMbpRtK/ScrtFHsTJEM57LuHPR0ZA1RRAY9wLgDRMVm2Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T02:14:01.635398Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.04245","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12ed1e7e8f8c59ac7646131318331b1c31ce324366e3f611eef2ba9360d6620b","sha256:246baeddc9876d01686cfaf0e7d0e9a331559cb9509aca27007374962a87290e"],"state_sha256":"9260f7796a89b4e5fb96218df1a466548acc1997bd9d6cd5e69d69fe6aff3a83"}