{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:6ASHII4BCKNUWUIJGY3KFP2LCK","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":"5c5f57e0e0f2ca80f96c78a045d3a8bfb48c703c8e9af8c76f9323171851404d","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-08-20T14:47:54Z","title_canon_sha256":"58022a44ed798c9b94507f656ce34f7f2c876b57cc22be13d3043726d0616aba"},"schema_version":"1.0","source":{"id":"2008.09004","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.09004","created_at":"2026-07-05T07:40:47Z"},{"alias_kind":"arxiv_version","alias_value":"2008.09004v4","created_at":"2026-07-05T07:40:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.09004","created_at":"2026-07-05T07:40:47Z"},{"alias_kind":"pith_short_12","alias_value":"6ASHII4BCKNU","created_at":"2026-07-05T07:40:47Z"},{"alias_kind":"pith_short_16","alias_value":"6ASHII4BCKNUWUIJ","created_at":"2026-07-05T07:40:47Z"},{"alias_kind":"pith_short_8","alias_value":"6ASHII4B","created_at":"2026-07-05T07:40:47Z"}],"graph_snapshots":[{"event_id":"sha256:4f917e55fd6167c107b7a9acdc228259741a84345962987a3c3565bef51a3051","target":"graph","created_at":"2026-07-05T07:40:47Z","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/2008.09004/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A bipartite graph $G=(A,B,E)$ is ${\\cal H}$-convex, for some family of graphs ${\\cal H}$, if there exists a graph $H\\in {\\cal H}$ with $V(H)=A$ such that the set of neighbours in $A$ of each $b\\in B$ induces a connected subgraph of $H$. Many $\\mathsf{NP}$-complete problems, including problems such as Dominating Set, Feedback Vertex Set, Induced Matching and List $k$-Colouring, become polynomial-time solvable for ${\\mathcal H}$-convex graphs when ${\\mathcal H}$ is the set of paths. In this case, the class of ${\\mathcal H}$-convex graphs is known as the class of convex graphs. The underlying rea","authors_text":"Andrea Munaro, Dani\\\"el Paulusma, Flavia Bonomo-Braberman, 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-08-20T14:47:54Z","title":"Solving Problems on Generalized Convex Graphs via Mim-Width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.09004","kind":"arxiv","version":4},"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:376266f652564dbe29f5e8aa4e256e3cf29dd9d3a437570954d2702131a328d7","target":"record","created_at":"2026-07-05T07:40:47Z","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":"5c5f57e0e0f2ca80f96c78a045d3a8bfb48c703c8e9af8c76f9323171851404d","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-08-20T14:47:54Z","title_canon_sha256":"58022a44ed798c9b94507f656ce34f7f2c876b57cc22be13d3043726d0616aba"},"schema_version":"1.0","source":{"id":"2008.09004","kind":"arxiv","version":4}},"canonical_sha256":"f024742381129b4b51093636a2bf4b1280559303b2ae7f19518781ce55328f7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f024742381129b4b51093636a2bf4b1280559303b2ae7f19518781ce55328f7c","first_computed_at":"2026-07-05T07:40:47.386186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:40:47.386186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nsszW2hY/THtn7yPRwELnUzchH/w/mXV25Or7/8tRmzPdB9mNbXAiQgzUvop6tCdHGKlmsb62fWQE2TpwKzhAA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:40:47.386818Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.09004","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:376266f652564dbe29f5e8aa4e256e3cf29dd9d3a437570954d2702131a328d7","sha256:4f917e55fd6167c107b7a9acdc228259741a84345962987a3c3565bef51a3051"],"state_sha256":"ca5326ebb8848c25ad5dbdb65edbb2502c9601ffb3d6c6930c65f810b1a93bb8"}