{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KUMO7PEMG57DCU3WZ3ICKQ5Z4Q","short_pith_number":"pith:KUMO7PEM","schema_version":"1.0","canonical_sha256":"5518efbc8c377e315376ced02543b9e4134170ba5b249e1b1b00b88c4d8e785d","source":{"kind":"arxiv","id":"1903.04534","version":1},"attestation_state":"computed","paper":{"title":"Minimal separators in graph classes defined by small forbidden induced subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Martin Milani\\v{c}, Nevena Piva\\v{c}","submitted_at":"2019-03-11T18:41:34Z","abstract_excerpt":"Minimal separators in graphs are an important concept in algorithmic graph theory. In particular, many problems that are NP-hard for general graphs are known to become polynomial-time solvable for classes of graphs with a polynomially bounded number of minimal separators. Several well-known graph classes have this property, including chordal graphs, permutation graphs, circular-arc graphs, and circle graphs. We perform a systematic study of the question which classes of graphs defined by small forbidden induced subgraphs have a polynomially bounded number of minimal separators. We focus on set"},"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":"1903.04534","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-11T18:41:34Z","cross_cats_sorted":[],"title_canon_sha256":"586256f4b48ea60b9605efcfca72618cf69ff74a87c8646b445806a25203b6c1","abstract_canon_sha256":"5cb31ca049448e5cf54b2c2b73d8bc58263af32dd6c79810a51e6c94bafd1075"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:37.624125Z","signature_b64":"bSP9Kb42pYFfdqb0U6lkFSTITtIKmeSx8gTA+z25R9l/7faaSweAHE/W6EG1AggN1YAWojngWANpVJcMz64zDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5518efbc8c377e315376ced02543b9e4134170ba5b249e1b1b00b88c4d8e785d","last_reissued_at":"2026-05-17T23:44:37.623700Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:37.623700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal separators in graph classes defined by small forbidden induced subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Martin Milani\\v{c}, Nevena Piva\\v{c}","submitted_at":"2019-03-11T18:41:34Z","abstract_excerpt":"Minimal separators in graphs are an important concept in algorithmic graph theory. In particular, many problems that are NP-hard for general graphs are known to become polynomial-time solvable for classes of graphs with a polynomially bounded number of minimal separators. Several well-known graph classes have this property, including chordal graphs, permutation graphs, circular-arc graphs, and circle graphs. We perform a systematic study of the question which classes of graphs defined by small forbidden induced subgraphs have a polynomially bounded number of minimal separators. We focus on set"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04534","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":"1903.04534","created_at":"2026-05-17T23:44:37.623767+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.04534v1","created_at":"2026-05-17T23:44:37.623767+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04534","created_at":"2026-05-17T23:44:37.623767+00:00"},{"alias_kind":"pith_short_12","alias_value":"KUMO7PEMG57D","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KUMO7PEMG57DCU3W","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KUMO7PEM","created_at":"2026-05-18T12:33:21.387695+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/KUMO7PEMG57DCU3WZ3ICKQ5Z4Q","json":"https://pith.science/pith/KUMO7PEMG57DCU3WZ3ICKQ5Z4Q.json","graph_json":"https://pith.science/api/pith-number/KUMO7PEMG57DCU3WZ3ICKQ5Z4Q/graph.json","events_json":"https://pith.science/api/pith-number/KUMO7PEMG57DCU3WZ3ICKQ5Z4Q/events.json","paper":"https://pith.science/paper/KUMO7PEM"},"agent_actions":{"view_html":"https://pith.science/pith/KUMO7PEMG57DCU3WZ3ICKQ5Z4Q","download_json":"https://pith.science/pith/KUMO7PEMG57DCU3WZ3ICKQ5Z4Q.json","view_paper":"https://pith.science/paper/KUMO7PEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.04534&json=true","fetch_graph":"https://pith.science/api/pith-number/KUMO7PEMG57DCU3WZ3ICKQ5Z4Q/graph.json","fetch_events":"https://pith.science/api/pith-number/KUMO7PEMG57DCU3WZ3ICKQ5Z4Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KUMO7PEMG57DCU3WZ3ICKQ5Z4Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KUMO7PEMG57DCU3WZ3ICKQ5Z4Q/action/storage_attestation","attest_author":"https://pith.science/pith/KUMO7PEMG57DCU3WZ3ICKQ5Z4Q/action/author_attestation","sign_citation":"https://pith.science/pith/KUMO7PEMG57DCU3WZ3ICKQ5Z4Q/action/citation_signature","submit_replication":"https://pith.science/pith/KUMO7PEMG57DCU3WZ3ICKQ5Z4Q/action/replication_record"}},"created_at":"2026-05-17T23:44:37.623767+00:00","updated_at":"2026-05-17T23:44:37.623767+00:00"}