{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:L5N4TR2LPCO34M4GAHSELT5LMA","short_pith_number":"pith:L5N4TR2L","schema_version":"1.0","canonical_sha256":"5f5bc9c74b789dbe338601e445cfab60248382f1184594b91b3fe1443358e9ca","source":{"kind":"arxiv","id":"2308.15444","version":2},"attestation_state":"computed","paper":{"title":"On the hardness of inclusion-wise minimal separators enumeration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Caroline Brosse, Kazuhiro Kurita, Kunihiro Wasa, Oscar Defrain, Takeaki Uno, Vincent Limouzy","submitted_at":"2023-08-29T17:11:55Z","abstract_excerpt":"Enumeration problems are often encountered as key subroutines in the exact computation of graph parameters such as chromatic number, treewidth, or treedepth. In the case of treedepth computation, the enumeration of inclusion-wise minimal separators plays a crucial role. However and quite surprisingly, the complexity status of this problem has not been settled since it has been posed as an open direction by Kloks and Kratsch in 1998. Recently at the PACE 2020 competition dedicated to treedepth computation, solvers have been circumventing that by listing all minimal $a$-$b$ separators and filter"},"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":"2308.15444","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2023-08-29T17:11:55Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bb46dd22414af763adc61abe7a954617bad4cafafbd09a60b66d68e3a3a1f0ce","abstract_canon_sha256":"080f0976d18c551dcaf9bcf163d45abd838abf97155b06d5d554ffd707a7ce45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:23:28.492396Z","signature_b64":"uEgJ+a9qJKGqumGySpDO83FE3xsNSoQtogYI9rA7wSiD58n1HYqlhG4iGvYWKJwvkPQBaHNT5zZkvWS/7g3eDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f5bc9c74b789dbe338601e445cfab60248382f1184594b91b3fe1443358e9ca","last_reissued_at":"2026-07-05T07:23:28.491909Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:23:28.491909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the hardness of inclusion-wise minimal separators enumeration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Caroline Brosse, Kazuhiro Kurita, Kunihiro Wasa, Oscar Defrain, Takeaki Uno, Vincent Limouzy","submitted_at":"2023-08-29T17:11:55Z","abstract_excerpt":"Enumeration problems are often encountered as key subroutines in the exact computation of graph parameters such as chromatic number, treewidth, or treedepth. In the case of treedepth computation, the enumeration of inclusion-wise minimal separators plays a crucial role. However and quite surprisingly, the complexity status of this problem has not been settled since it has been posed as an open direction by Kloks and Kratsch in 1998. Recently at the PACE 2020 competition dedicated to treedepth computation, solvers have been circumventing that by listing all minimal $a$-$b$ separators and filter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.15444","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.15444/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2308.15444","created_at":"2026-07-05T07:23:28.491966+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.15444v2","created_at":"2026-07-05T07:23:28.491966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.15444","created_at":"2026-07-05T07:23:28.491966+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5N4TR2LPCO3","created_at":"2026-07-05T07:23:28.491966+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5N4TR2LPCO34M4G","created_at":"2026-07-05T07:23:28.491966+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5N4TR2L","created_at":"2026-07-05T07:23:28.491966+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/L5N4TR2LPCO34M4GAHSELT5LMA","json":"https://pith.science/pith/L5N4TR2LPCO34M4GAHSELT5LMA.json","graph_json":"https://pith.science/api/pith-number/L5N4TR2LPCO34M4GAHSELT5LMA/graph.json","events_json":"https://pith.science/api/pith-number/L5N4TR2LPCO34M4GAHSELT5LMA/events.json","paper":"https://pith.science/paper/L5N4TR2L"},"agent_actions":{"view_html":"https://pith.science/pith/L5N4TR2LPCO34M4GAHSELT5LMA","download_json":"https://pith.science/pith/L5N4TR2LPCO34M4GAHSELT5LMA.json","view_paper":"https://pith.science/paper/L5N4TR2L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.15444&json=true","fetch_graph":"https://pith.science/api/pith-number/L5N4TR2LPCO34M4GAHSELT5LMA/graph.json","fetch_events":"https://pith.science/api/pith-number/L5N4TR2LPCO34M4GAHSELT5LMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5N4TR2LPCO34M4GAHSELT5LMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5N4TR2LPCO34M4GAHSELT5LMA/action/storage_attestation","attest_author":"https://pith.science/pith/L5N4TR2LPCO34M4GAHSELT5LMA/action/author_attestation","sign_citation":"https://pith.science/pith/L5N4TR2LPCO34M4GAHSELT5LMA/action/citation_signature","submit_replication":"https://pith.science/pith/L5N4TR2LPCO34M4GAHSELT5LMA/action/replication_record"}},"created_at":"2026-07-05T07:23:28.491966+00:00","updated_at":"2026-07-05T07:23:28.491966+00:00"}