{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MX3UORRGW5EW5OKGEDXSWMCG7P","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":"f84708699340d50fb070ed087f8628dadce0f79fd18c58464884f43abd8fb6d1","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-28T19:26:46Z","title_canon_sha256":"a1277d3c2a1ba9a885d123214510d7d0063c5b3e47a9478aa8b09a72fc25d999"},"schema_version":"1.0","source":{"id":"1707.09383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.09383","created_at":"2026-05-18T00:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.09383v1","created_at":"2026-05-18T00:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09383","created_at":"2026-05-18T00:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"MX3UORRGW5EW","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MX3UORRGW5EW5OKG","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MX3UORRG","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:ad4b130b4d95190b3cca22412eb5f01593518618463d5101e04beb1f97f72088","target":"graph","created_at":"2026-05-18T00:39:11Z","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":"The Near-Bipartiteness problem is that of deciding whether or not the vertices of a graph can be partitioned into sets $A$ and $B$, where $A$ is an independent set and $B$ induces a forest. The set $A$ in such a partition is said to be an independent feedback vertex set. Yang and Yuan proved that Near-Bipartiteness is polynomial-time solvable for graphs of diameter 2 and NP-complete for graphs of diameter 4. We show that Near-Bipartiteness is NP-complete for graphs of diameter 3, resolving their open problem. We also generalise their result for diameter 2 by proving that even the problem of co","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-28T19:26:46Z","title":"Independent Feedback Vertex Sets for Graphs of Bounded Diameter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09383","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:07f200db3059bf529fb37c58ffd42aa57f4fd3f5ddf6a9a9ba42357ed953ae88","target":"record","created_at":"2026-05-18T00:39:11Z","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":"f84708699340d50fb070ed087f8628dadce0f79fd18c58464884f43abd8fb6d1","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-28T19:26:46Z","title_canon_sha256":"a1277d3c2a1ba9a885d123214510d7d0063c5b3e47a9478aa8b09a72fc25d999"},"schema_version":"1.0","source":{"id":"1707.09383","kind":"arxiv","version":1}},"canonical_sha256":"65f7474626b7496eb94620ef2b3046fbcc87e058ea264ed9d0d0344bbe7f3f59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65f7474626b7496eb94620ef2b3046fbcc87e058ea264ed9d0d0344bbe7f3f59","first_computed_at":"2026-05-18T00:39:11.503743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:11.503743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+vVP2aZSZx2bww0wXz+0az+oOU1foDaNOxM08vRMioewrr2cGURJBsJr6KQvMrARIEFfmcGOkWLDoE7ADWsaDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:11.504432Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.09383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07f200db3059bf529fb37c58ffd42aa57f4fd3f5ddf6a9a9ba42357ed953ae88","sha256:ad4b130b4d95190b3cca22412eb5f01593518618463d5101e04beb1f97f72088"],"state_sha256":"53a7128a85938ec2fb2fad1b68d1c8ca91bf808cc2c11e5809c492d2d239bb1e"}