{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IIV3R6S2JKV5JRDEYWG5OCQDOF","short_pith_number":"pith:IIV3R6S2","schema_version":"1.0","canonical_sha256":"422bb8fa5a4aabd4c464c58dd70a03714b3eaffa90d03255b81bf32d4501410b","source":{"kind":"arxiv","id":"1707.08684","version":2},"attestation_state":"computed","paper":{"title":"A Naive Algorithm for Feedback Vertex Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Yixin Cao","submitted_at":"2017-07-27T02:04:31Z","abstract_excerpt":"Given a graph on $n$ vertices and an integer $k$, the feedback vertex set problem asks for the deletion of at most $k$ vertices to make the graph acyclic. We show that a greedy branching algorithm, which always branches on an undecided vertex with the largest degree, runs in single-exponential time, i.e., $O(c^k\\cdot n^2)$ for some constant $c$."},"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.08684","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-27T02:04:31Z","cross_cats_sorted":[],"title_canon_sha256":"daad04c6cc73a961d376445f63a2de91a2f19e7febec394e1d10ebce2fb39c8e","abstract_canon_sha256":"6f0e6e5c6c62ad8214687ca5bfeed1810d1c648bf8c303158678f11145f38581"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:06.325252Z","signature_b64":"ITVH5i7qa0bYpF6qQXK/0uXkHHIDsQsZCygjsckodT+3sUrJYb2oP7A8Ij2KDTdHWKE5Z2DP5SYGhWanttxjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"422bb8fa5a4aabd4c464c58dd70a03714b3eaffa90d03255b81bf32d4501410b","last_reissued_at":"2026-05-18T00:39:06.324681Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:06.324681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Naive Algorithm for Feedback Vertex Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Yixin Cao","submitted_at":"2017-07-27T02:04:31Z","abstract_excerpt":"Given a graph on $n$ vertices and an integer $k$, the feedback vertex set problem asks for the deletion of at most $k$ vertices to make the graph acyclic. We show that a greedy branching algorithm, which always branches on an undecided vertex with the largest degree, runs in single-exponential time, i.e., $O(c^k\\cdot n^2)$ for some constant $c$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08684","kind":"arxiv","version":2},"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.08684","created_at":"2026-05-18T00:39:06.324776+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.08684v2","created_at":"2026-05-18T00:39:06.324776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08684","created_at":"2026-05-18T00:39:06.324776+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIV3R6S2JKV5","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIV3R6S2JKV5JRDE","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIV3R6S2","created_at":"2026-05-18T12:31:21.493067+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/IIV3R6S2JKV5JRDEYWG5OCQDOF","json":"https://pith.science/pith/IIV3R6S2JKV5JRDEYWG5OCQDOF.json","graph_json":"https://pith.science/api/pith-number/IIV3R6S2JKV5JRDEYWG5OCQDOF/graph.json","events_json":"https://pith.science/api/pith-number/IIV3R6S2JKV5JRDEYWG5OCQDOF/events.json","paper":"https://pith.science/paper/IIV3R6S2"},"agent_actions":{"view_html":"https://pith.science/pith/IIV3R6S2JKV5JRDEYWG5OCQDOF","download_json":"https://pith.science/pith/IIV3R6S2JKV5JRDEYWG5OCQDOF.json","view_paper":"https://pith.science/paper/IIV3R6S2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.08684&json=true","fetch_graph":"https://pith.science/api/pith-number/IIV3R6S2JKV5JRDEYWG5OCQDOF/graph.json","fetch_events":"https://pith.science/api/pith-number/IIV3R6S2JKV5JRDEYWG5OCQDOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIV3R6S2JKV5JRDEYWG5OCQDOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIV3R6S2JKV5JRDEYWG5OCQDOF/action/storage_attestation","attest_author":"https://pith.science/pith/IIV3R6S2JKV5JRDEYWG5OCQDOF/action/author_attestation","sign_citation":"https://pith.science/pith/IIV3R6S2JKV5JRDEYWG5OCQDOF/action/citation_signature","submit_replication":"https://pith.science/pith/IIV3R6S2JKV5JRDEYWG5OCQDOF/action/replication_record"}},"created_at":"2026-05-18T00:39:06.324776+00:00","updated_at":"2026-05-18T00:39:06.324776+00:00"}