{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:USBUEWJVBMTOMBEXSZS4XYWGDN","short_pith_number":"pith:USBUEWJV","schema_version":"1.0","canonical_sha256":"a4834259350b26e604979665cbe2c61b5ff78a60fd3a36e86e8ee4657ecb6d2a","source":{"kind":"arxiv","id":"1905.12233","version":1},"attestation_state":"computed","paper":{"title":"Improved Analysis of Highest-Degree Branching for Feedback Vertex Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Yoichi Iwata, Yusuke Kobayashi","submitted_at":"2019-05-29T06:10:26Z","abstract_excerpt":"Recent empirical evaluations of exact algorithms for Feedback Vertex Set have demonstrated the efficiency of a highest-degree branching algorithm with a degree-based pruning heuristic. In this paper, we prove that this empirically fast algorithm runs in $O(3.460^k n)$ time, where $k$ is the solution size. This improves the previous best $O(3.619^k n)$-time deterministic algorithm obtained by Kociumaka and Pilipczuk."},"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":"1905.12233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-29T06:10:26Z","cross_cats_sorted":[],"title_canon_sha256":"eabbbed294c3c70295ba8542cc5428d6034ed1332c81790789f403003a0e6c6a","abstract_canon_sha256":"8c17cadf6a0126133bce3cc49242cc6097a807d5b9d17776b2ca3669e1a2df58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:44.932625Z","signature_b64":"Qyi+LIPP4nc1SvTZYbjnBwxU8tNQA1aAG0zuYm96wjzITLHBo5Cafa7j9laTetsq2wA8gq6AiZuavTfnMiWKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4834259350b26e604979665cbe2c61b5ff78a60fd3a36e86e8ee4657ecb6d2a","last_reissued_at":"2026-05-17T23:44:44.932130Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:44.932130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Analysis of Highest-Degree Branching for Feedback Vertex Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Yoichi Iwata, Yusuke Kobayashi","submitted_at":"2019-05-29T06:10:26Z","abstract_excerpt":"Recent empirical evaluations of exact algorithms for Feedback Vertex Set have demonstrated the efficiency of a highest-degree branching algorithm with a degree-based pruning heuristic. In this paper, we prove that this empirically fast algorithm runs in $O(3.460^k n)$ time, where $k$ is the solution size. This improves the previous best $O(3.619^k n)$-time deterministic algorithm obtained by Kociumaka and Pilipczuk."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12233","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":"1905.12233","created_at":"2026-05-17T23:44:44.932200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.12233v1","created_at":"2026-05-17T23:44:44.932200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12233","created_at":"2026-05-17T23:44:44.932200+00:00"},{"alias_kind":"pith_short_12","alias_value":"USBUEWJVBMTO","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"USBUEWJVBMTOMBEX","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"USBUEWJV","created_at":"2026-05-18T12:33:30.264802+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/USBUEWJVBMTOMBEXSZS4XYWGDN","json":"https://pith.science/pith/USBUEWJVBMTOMBEXSZS4XYWGDN.json","graph_json":"https://pith.science/api/pith-number/USBUEWJVBMTOMBEXSZS4XYWGDN/graph.json","events_json":"https://pith.science/api/pith-number/USBUEWJVBMTOMBEXSZS4XYWGDN/events.json","paper":"https://pith.science/paper/USBUEWJV"},"agent_actions":{"view_html":"https://pith.science/pith/USBUEWJVBMTOMBEXSZS4XYWGDN","download_json":"https://pith.science/pith/USBUEWJVBMTOMBEXSZS4XYWGDN.json","view_paper":"https://pith.science/paper/USBUEWJV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.12233&json=true","fetch_graph":"https://pith.science/api/pith-number/USBUEWJVBMTOMBEXSZS4XYWGDN/graph.json","fetch_events":"https://pith.science/api/pith-number/USBUEWJVBMTOMBEXSZS4XYWGDN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USBUEWJVBMTOMBEXSZS4XYWGDN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USBUEWJVBMTOMBEXSZS4XYWGDN/action/storage_attestation","attest_author":"https://pith.science/pith/USBUEWJVBMTOMBEXSZS4XYWGDN/action/author_attestation","sign_citation":"https://pith.science/pith/USBUEWJVBMTOMBEXSZS4XYWGDN/action/citation_signature","submit_replication":"https://pith.science/pith/USBUEWJVBMTOMBEXSZS4XYWGDN/action/replication_record"}},"created_at":"2026-05-17T23:44:44.932200+00:00","updated_at":"2026-05-17T23:44:44.932200+00:00"}