{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:NRJY5VIRGVUJEMFQ4CPO4PHC34","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":"e8ce6934196a5fdede5db0fb0cef9dc9b9549d75923cfbaf8ad32fa0fc8afd47","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-10T13:02:31Z","title_canon_sha256":"d1cf14223799ae6a4ce2fc391e048527b1e9d1c25c30781ba1f64ed15027efe2"},"schema_version":"1.0","source":{"id":"2004.05018","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.05018","created_at":"2026-07-05T03:08:53Z"},{"alias_kind":"arxiv_version","alias_value":"2004.05018v3","created_at":"2026-07-05T03:08:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.05018","created_at":"2026-07-05T03:08:53Z"},{"alias_kind":"pith_short_12","alias_value":"NRJY5VIRGVUJ","created_at":"2026-07-05T03:08:53Z"},{"alias_kind":"pith_short_16","alias_value":"NRJY5VIRGVUJEMFQ","created_at":"2026-07-05T03:08:53Z"},{"alias_kind":"pith_short_8","alias_value":"NRJY5VIR","created_at":"2026-07-05T03:08:53Z"}],"graph_snapshots":[{"event_id":"sha256:3ccb260f760fae5d49063f56c441951eed640d7741aac943171e083bf84ed2a9","target":"graph","created_at":"2026-07-05T03:08:53Z","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/2004.05018/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A large number of NP-hard graph problems become polynomial-time solvable on graph classes where the mim-width is bounded and quickly computable. Hence, when solving such problems on special graph classes, it is helpful to know whether the graph class under consideration has bounded mim-width. We first extend the toolkit for proving (un)boundedness of mim-width of graph classes. This enables us to initiate a systematic study into bounding mim-width from the perspective of hereditary graph classes. For a given graph $H$, the class of $H$-free graphs has bounded mim-width if and only if it has bo","authors_text":"Andrea Munaro, Daniel Paulusma, Giacomo Paesani, Jake Horsfield, Nick Brettell","cross_cats":["cs.CC","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-10T13:02:31Z","title":"Bounding the Mim-Width of Hereditary Graph Classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.05018","kind":"arxiv","version":3},"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:3d455e00103dd755754b8d330756ae2d2775be456b63de942b365ca0de13e817","target":"record","created_at":"2026-07-05T03:08:53Z","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":"e8ce6934196a5fdede5db0fb0cef9dc9b9549d75923cfbaf8ad32fa0fc8afd47","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-10T13:02:31Z","title_canon_sha256":"d1cf14223799ae6a4ce2fc391e048527b1e9d1c25c30781ba1f64ed15027efe2"},"schema_version":"1.0","source":{"id":"2004.05018","kind":"arxiv","version":3}},"canonical_sha256":"6c538ed51135689230b0e09eee3ce2df30aee398597bffa3d651f2e61caf2220","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c538ed51135689230b0e09eee3ce2df30aee398597bffa3d651f2e61caf2220","first_computed_at":"2026-07-05T03:08:53.580863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:08:53.580863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E5xYP16MJbmporGnT1lID+DpHKfsu3iraC3XJ7y61kbUjkYQOsrLTviOMJieA/7gYZBjy+XBmfFi3WQ6qRcRBw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:08:53.581268Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.05018","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d455e00103dd755754b8d330756ae2d2775be456b63de942b365ca0de13e817","sha256:3ccb260f760fae5d49063f56c441951eed640d7741aac943171e083bf84ed2a9"],"state_sha256":"bbb3025a6b04cb6392de50813be5206242ffee82a839ebc545ed8cbfd34426ad"}