{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KUMO7PEMG57DCU3WZ3ICKQ5Z4Q","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":"5cb31ca049448e5cf54b2c2b73d8bc58263af32dd6c79810a51e6c94bafd1075","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-11T18:41:34Z","title_canon_sha256":"586256f4b48ea60b9605efcfca72618cf69ff74a87c8646b445806a25203b6c1"},"schema_version":"1.0","source":{"id":"1903.04534","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04534","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04534v1","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04534","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"KUMO7PEMG57D","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KUMO7PEMG57DCU3W","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KUMO7PEM","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:087b3067c926fc51b419a92b99f361c4a60cd80f0849ec018b4a6d5b61132fa2","target":"graph","created_at":"2026-05-17T23:44:37Z","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":"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","authors_text":"Martin Milani\\v{c}, Nevena Piva\\v{c}","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-11T18:41:34Z","title":"Minimal separators in graph classes defined by small forbidden induced subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04534","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:88d89f6c79fa0caea37f66dd83fb200caa05fed513c61f05a3fd8592b90a3c5b","target":"record","created_at":"2026-05-17T23:44:37Z","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":"5cb31ca049448e5cf54b2c2b73d8bc58263af32dd6c79810a51e6c94bafd1075","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-11T18:41:34Z","title_canon_sha256":"586256f4b48ea60b9605efcfca72618cf69ff74a87c8646b445806a25203b6c1"},"schema_version":"1.0","source":{"id":"1903.04534","kind":"arxiv","version":1}},"canonical_sha256":"5518efbc8c377e315376ced02543b9e4134170ba5b249e1b1b00b88c4d8e785d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5518efbc8c377e315376ced02543b9e4134170ba5b249e1b1b00b88c4d8e785d","first_computed_at":"2026-05-17T23:44:37.623700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:37.623700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bSP9Kb42pYFfdqb0U6lkFSTITtIKmeSx8gTA+z25R9l/7faaSweAHE/W6EG1AggN1YAWojngWANpVJcMz64zDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:37.624125Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.04534","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88d89f6c79fa0caea37f66dd83fb200caa05fed513c61f05a3fd8592b90a3c5b","sha256:087b3067c926fc51b419a92b99f361c4a60cd80f0849ec018b4a6d5b61132fa2"],"state_sha256":"bf14b546d1f67bbcec88caaaffdcc822d2a78f2d986780e537ce95910176fb2e"}