{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MX3UORRGW5EW5OKGEDXSWMCG7P","short_pith_number":"pith:MX3UORRG","schema_version":"1.0","canonical_sha256":"65f7474626b7496eb94620ef2b3046fbcc87e058ea264ed9d0d0344bbe7f3f59","source":{"kind":"arxiv","id":"1707.09383","version":1},"attestation_state":"computed","paper":{"title":"Independent Feedback Vertex Sets for Graphs of Bounded Diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Carl Feghali, Daniel Paulusma, Konrad K. Dabrowski, Marthe Bonamy, Matthew Johnson","submitted_at":"2017-07-28T19:26:46Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1707.09383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-28T19:26:46Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"a1277d3c2a1ba9a885d123214510d7d0063c5b3e47a9478aa8b09a72fc25d999","abstract_canon_sha256":"f84708699340d50fb070ed087f8628dadce0f79fd18c58464884f43abd8fb6d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:11.504432Z","signature_b64":"+vVP2aZSZx2bww0wXz+0az+oOU1foDaNOxM08vRMioewrr2cGURJBsJr6KQvMrARIEFfmcGOkWLDoE7ADWsaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65f7474626b7496eb94620ef2b3046fbcc87e058ea264ed9d0d0344bbe7f3f59","last_reissued_at":"2026-05-18T00:39:11.503743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:11.503743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Independent Feedback Vertex Sets for Graphs of Bounded Diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Carl Feghali, Daniel Paulusma, Konrad K. Dabrowski, Marthe Bonamy, Matthew Johnson","submitted_at":"2017-07-28T19:26:46Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09383","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.09383","created_at":"2026-05-18T00:39:11.503867+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.09383v1","created_at":"2026-05-18T00:39:11.503867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09383","created_at":"2026-05-18T00:39:11.503867+00:00"},{"alias_kind":"pith_short_12","alias_value":"MX3UORRGW5EW","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MX3UORRGW5EW5OKG","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MX3UORRG","created_at":"2026-05-18T12:31:31.346846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MX3UORRGW5EW5OKGEDXSWMCG7P","json":"https://pith.science/pith/MX3UORRGW5EW5OKGEDXSWMCG7P.json","graph_json":"https://pith.science/api/pith-number/MX3UORRGW5EW5OKGEDXSWMCG7P/graph.json","events_json":"https://pith.science/api/pith-number/MX3UORRGW5EW5OKGEDXSWMCG7P/events.json","paper":"https://pith.science/paper/MX3UORRG"},"agent_actions":{"view_html":"https://pith.science/pith/MX3UORRGW5EW5OKGEDXSWMCG7P","download_json":"https://pith.science/pith/MX3UORRGW5EW5OKGEDXSWMCG7P.json","view_paper":"https://pith.science/paper/MX3UORRG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.09383&json=true","fetch_graph":"https://pith.science/api/pith-number/MX3UORRGW5EW5OKGEDXSWMCG7P/graph.json","fetch_events":"https://pith.science/api/pith-number/MX3UORRGW5EW5OKGEDXSWMCG7P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MX3UORRGW5EW5OKGEDXSWMCG7P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MX3UORRGW5EW5OKGEDXSWMCG7P/action/storage_attestation","attest_author":"https://pith.science/pith/MX3UORRGW5EW5OKGEDXSWMCG7P/action/author_attestation","sign_citation":"https://pith.science/pith/MX3UORRGW5EW5OKGEDXSWMCG7P/action/citation_signature","submit_replication":"https://pith.science/pith/MX3UORRGW5EW5OKGEDXSWMCG7P/action/replication_record"}},"created_at":"2026-05-18T00:39:11.503867+00:00","updated_at":"2026-05-18T00:39:11.503867+00:00"}