{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GSCAXF4XPH6KLS5T2XGY5JJMJT","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":"1ac952c24795077e4df4ad75e6bf0dd502bf365553f60fe741bcf658d1e927b0","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-31T12:32:54Z","title_canon_sha256":"ce277bfa759389e078c791017e142d402e205604b6db3fbff27ca93156ddf3d8"},"schema_version":"1.0","source":{"id":"1707.09817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.09817","created_at":"2026-05-18T00:39:08Z"},{"alias_kind":"arxiv_version","alias_value":"1707.09817v1","created_at":"2026-05-18T00:39:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09817","created_at":"2026-05-18T00:39:08Z"},{"alias_kind":"pith_short_12","alias_value":"GSCAXF4XPH6K","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GSCAXF4XPH6KLS5T","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GSCAXF4X","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:519778536d842242f372035baebaa0297eb87688622e102f12465d56e229b776","target":"graph","created_at":"2026-05-18T00:39:08Z","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":"We continue research into a well-studied family of problems that ask whether the vertices of a graph can be partitioned into sets $A$ and~$B$, where $A$ is an independent set and $B$ induces a graph from some specified graph class ${\\cal G}$. We let ${\\cal G}$ be the class of $k$-degenerate graphs. This problem is known to be polynomial-time solvable if $k=0$ (bipartite graphs) and NP-complete if $k=1$ (near-bipartite graphs) even for graphs of maximum degree $4$. Yang and Yuan [DM, 2006] showed that the $k=1$ case is polynomial-time solvable for graphs of maximum degree $3$. This also follows","authors_text":"Carl Feghali, Daniel Paulusma, Konrad K. Dabrowski, Marthe Bonamy, Matthew Johnson","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-31T12:32:54Z","title":"Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09817","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:875f25f44fc85c7099e6d1b77962a9c6d6eadeeec7ec074746194f78f49536e6","target":"record","created_at":"2026-05-18T00:39:08Z","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":"1ac952c24795077e4df4ad75e6bf0dd502bf365553f60fe741bcf658d1e927b0","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-31T12:32:54Z","title_canon_sha256":"ce277bfa759389e078c791017e142d402e205604b6db3fbff27ca93156ddf3d8"},"schema_version":"1.0","source":{"id":"1707.09817","kind":"arxiv","version":1}},"canonical_sha256":"34840b979779fca5cbb3d5cd8ea52c4ce7a63a5d21eb7937f609a015a0bedd88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34840b979779fca5cbb3d5cd8ea52c4ce7a63a5d21eb7937f609a015a0bedd88","first_computed_at":"2026-05-18T00:39:08.130705Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:08.130705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jsNeLc+h3XkRDbGvqxmPd/+MbJ7I4nwpPkjeUnanWQokyBjRGjQv2HtO5zdIoYFSmWjS/tdmq7kPdB9s8rL+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:08.131421Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.09817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:875f25f44fc85c7099e6d1b77962a9c6d6eadeeec7ec074746194f78f49536e6","sha256:519778536d842242f372035baebaa0297eb87688622e102f12465d56e229b776"],"state_sha256":"0a798a12938e3aca6c0f04b5cf49404c6ed56e97c7d56c35895f4fe6703c1603"}