{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HG5AA5THPWFYQGEOS4HDD6TFV2","short_pith_number":"pith:HG5AA5TH","schema_version":"1.0","canonical_sha256":"39ba0076677d8b88188e970e31fa65ae8f04abc6bfb3b2501a5dbe268e98fa31","source":{"kind":"arxiv","id":"1707.09402","version":1},"attestation_state":"computed","paper":{"title":"Independent Feedback Vertex Set for $P_5$-free Graphs","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-28T20:17:45Z","abstract_excerpt":"The NP-complete problem Feedback Vertex Set is that of deciding whether or not it is possible, for a given integer $k\\geq 0$, to delete at most $k$ vertices from a given graph so that what remains is a forest. The variant in which the deleted vertices must form an independent set is called Independent Feedback Vertex Set and is also NP-complete. In fact, even deciding if an independent feedback vertex set exists is NP-complete and this problem is closely related to the $3$-Colouring problem, or equivalently, to the problem of deciding whether or not a graph has an independent odd cycle transve"},"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.09402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-28T20:17:45Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"1c8dad4558b60566f9ca374b63d0f3b898a433eabc6e4d06c93ecba14314a427","abstract_canon_sha256":"94f176e1b04b97d56ef38d62a857da4a417a4d2ec4b2d91be21d136080c2f95b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:11.427602Z","signature_b64":"a2N4x880HkLcYOFdRPk11+cJhMPUU1kPeUEBmZ03aM+vF+OaJMjuzoXH1bswWX5NaGDFcqyfhoU0hDcbPQv7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39ba0076677d8b88188e970e31fa65ae8f04abc6bfb3b2501a5dbe268e98fa31","last_reissued_at":"2026-05-18T00:39:11.427058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:11.427058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Independent Feedback Vertex Set for $P_5$-free Graphs","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-28T20:17:45Z","abstract_excerpt":"The NP-complete problem Feedback Vertex Set is that of deciding whether or not it is possible, for a given integer $k\\geq 0$, to delete at most $k$ vertices from a given graph so that what remains is a forest. The variant in which the deleted vertices must form an independent set is called Independent Feedback Vertex Set and is also NP-complete. In fact, even deciding if an independent feedback vertex set exists is NP-complete and this problem is closely related to the $3$-Colouring problem, or equivalently, to the problem of deciding whether or not a graph has an independent odd cycle transve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09402","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.09402","created_at":"2026-05-18T00:39:11.427154+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.09402v1","created_at":"2026-05-18T00:39:11.427154+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09402","created_at":"2026-05-18T00:39:11.427154+00:00"},{"alias_kind":"pith_short_12","alias_value":"HG5AA5THPWFY","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HG5AA5THPWFYQGEO","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HG5AA5TH","created_at":"2026-05-18T12:31:18.294218+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/HG5AA5THPWFYQGEOS4HDD6TFV2","json":"https://pith.science/pith/HG5AA5THPWFYQGEOS4HDD6TFV2.json","graph_json":"https://pith.science/api/pith-number/HG5AA5THPWFYQGEOS4HDD6TFV2/graph.json","events_json":"https://pith.science/api/pith-number/HG5AA5THPWFYQGEOS4HDD6TFV2/events.json","paper":"https://pith.science/paper/HG5AA5TH"},"agent_actions":{"view_html":"https://pith.science/pith/HG5AA5THPWFYQGEOS4HDD6TFV2","download_json":"https://pith.science/pith/HG5AA5THPWFYQGEOS4HDD6TFV2.json","view_paper":"https://pith.science/paper/HG5AA5TH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.09402&json=true","fetch_graph":"https://pith.science/api/pith-number/HG5AA5THPWFYQGEOS4HDD6TFV2/graph.json","fetch_events":"https://pith.science/api/pith-number/HG5AA5THPWFYQGEOS4HDD6TFV2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HG5AA5THPWFYQGEOS4HDD6TFV2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HG5AA5THPWFYQGEOS4HDD6TFV2/action/storage_attestation","attest_author":"https://pith.science/pith/HG5AA5THPWFYQGEOS4HDD6TFV2/action/author_attestation","sign_citation":"https://pith.science/pith/HG5AA5THPWFYQGEOS4HDD6TFV2/action/citation_signature","submit_replication":"https://pith.science/pith/HG5AA5THPWFYQGEOS4HDD6TFV2/action/replication_record"}},"created_at":"2026-05-18T00:39:11.427154+00:00","updated_at":"2026-05-18T00:39:11.427154+00:00"}