{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:5UVOP43F2JQJIJ25ZB57TENZ4K","short_pith_number":"pith:5UVOP43F","canonical_record":{"source":{"id":"2212.04726","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-12-09T08:48:32Z","cross_cats_sorted":[],"title_canon_sha256":"5b87077ea917f37bc318063cf78ed547f61a0dd4b99e576bf9560411fd27728d","abstract_canon_sha256":"64bc665a372e31568e4ee05fd7b32251aac8a332a530f46c7d58e6ba197fafe2"},"schema_version":"1.0"},"canonical_sha256":"ed2ae7f365d26094275dc87bf991b9e2b2019ae82a0de41c41bc975f92e237f3","source":{"kind":"arxiv","id":"2212.04726","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.04726","created_at":"2026-07-05T09:56:19Z"},{"alias_kind":"arxiv_version","alias_value":"2212.04726v4","created_at":"2026-07-05T09:56:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.04726","created_at":"2026-07-05T09:56:19Z"},{"alias_kind":"pith_short_12","alias_value":"5UVOP43F2JQJ","created_at":"2026-07-05T09:56:19Z"},{"alias_kind":"pith_short_16","alias_value":"5UVOP43F2JQJIJ25","created_at":"2026-07-05T09:56:19Z"},{"alias_kind":"pith_short_8","alias_value":"5UVOP43F","created_at":"2026-07-05T09:56:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:5UVOP43F2JQJIJ25ZB57TENZ4K","target":"record","payload":{"canonical_record":{"source":{"id":"2212.04726","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-12-09T08:48:32Z","cross_cats_sorted":[],"title_canon_sha256":"5b87077ea917f37bc318063cf78ed547f61a0dd4b99e576bf9560411fd27728d","abstract_canon_sha256":"64bc665a372e31568e4ee05fd7b32251aac8a332a530f46c7d58e6ba197fafe2"},"schema_version":"1.0"},"canonical_sha256":"ed2ae7f365d26094275dc87bf991b9e2b2019ae82a0de41c41bc975f92e237f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:19.944437Z","signature_b64":"n0RHz+sb165Pfm1G0Bpy85fuTKaXVUbHlvDAAWg7TXpL/FDVFTKJrldYyokhJhSbO/0QWToII2y2SBSsXQKtDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed2ae7f365d26094275dc87bf991b9e2b2019ae82a0de41c41bc975f92e237f3","last_reissued_at":"2026-07-05T09:56:19.944007Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:19.944007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.04726","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:56:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M3cBRpWk82PRPEfhumi/NTZsoeUAkHvO4cgjShRfB+yif+1WJcsPcP2jVW2PILJIQ0t2WkH+iwv2kUBB9qDOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T03:30:37.385764Z"},"content_sha256":"5237825c45efd83679f99b5747446c62cf2c9f91e0fd8879771c6ba31333ccaf","schema_version":"1.0","event_id":"sha256:5237825c45efd83679f99b5747446c62cf2c9f91e0fd8879771c6ba31333ccaf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:5UVOP43F2JQJIJ25ZB57TENZ4K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Breaking the Barrier $2^k$ for Subset Feedback Vertex Set in Chordal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mingyu Xiao, Tian Bai","submitted_at":"2022-12-09T08:48:32Z","abstract_excerpt":"The Subset Feedback Vertex Set problem (SFVS), to delete $k$ vertices from a given graph such that any vertex in a vertex subset (called a terminal set) is not in a cycle in the remaining graph, generalizes the famous Feedback Vertex Set problem and Multiway Cut problem. SFVS remains NP-hard even in split and chordal graphs, and SFVS in Chordal Graphs (SFVS-C) can be considered as an implicit 3-Hitting Set problem. However, it is not easy to solve SFVS-C faster than 3-Hitting Set. In 2019, Philip, Rajan, Saurabh, and Tale (Algorithmica 2019) proved that SFVS-C can be solved in $\\mathcal{O}^{*}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.04726","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2212.04726/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:56:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fw3BbyHfZQ06FfwBFSrAbt0jZYjapLMY2gafBZ0L8ExwY6qFRL2Nfoc1h/8AHeIasSNkYBb7raO4WO0xzl4JAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T03:30:37.386140Z"},"content_sha256":"d677867c8e96fb495267a2bc57bbfc7fe026fa3c22d99847003298ac61a60d83","schema_version":"1.0","event_id":"sha256:d677867c8e96fb495267a2bc57bbfc7fe026fa3c22d99847003298ac61a60d83"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5UVOP43F2JQJIJ25ZB57TENZ4K/bundle.json","state_url":"https://pith.science/pith/5UVOP43F2JQJIJ25ZB57TENZ4K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5UVOP43F2JQJIJ25ZB57TENZ4K/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-21T03:30:37Z","links":{"resolver":"https://pith.science/pith/5UVOP43F2JQJIJ25ZB57TENZ4K","bundle":"https://pith.science/pith/5UVOP43F2JQJIJ25ZB57TENZ4K/bundle.json","state":"https://pith.science/pith/5UVOP43F2JQJIJ25ZB57TENZ4K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5UVOP43F2JQJIJ25ZB57TENZ4K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:5UVOP43F2JQJIJ25ZB57TENZ4K","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":"64bc665a372e31568e4ee05fd7b32251aac8a332a530f46c7d58e6ba197fafe2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-12-09T08:48:32Z","title_canon_sha256":"5b87077ea917f37bc318063cf78ed547f61a0dd4b99e576bf9560411fd27728d"},"schema_version":"1.0","source":{"id":"2212.04726","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.04726","created_at":"2026-07-05T09:56:19Z"},{"alias_kind":"arxiv_version","alias_value":"2212.04726v4","created_at":"2026-07-05T09:56:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.04726","created_at":"2026-07-05T09:56:19Z"},{"alias_kind":"pith_short_12","alias_value":"5UVOP43F2JQJ","created_at":"2026-07-05T09:56:19Z"},{"alias_kind":"pith_short_16","alias_value":"5UVOP43F2JQJIJ25","created_at":"2026-07-05T09:56:19Z"},{"alias_kind":"pith_short_8","alias_value":"5UVOP43F","created_at":"2026-07-05T09:56:19Z"}],"graph_snapshots":[{"event_id":"sha256:d677867c8e96fb495267a2bc57bbfc7fe026fa3c22d99847003298ac61a60d83","target":"graph","created_at":"2026-07-05T09:56:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2212.04726/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Subset Feedback Vertex Set problem (SFVS), to delete $k$ vertices from a given graph such that any vertex in a vertex subset (called a terminal set) is not in a cycle in the remaining graph, generalizes the famous Feedback Vertex Set problem and Multiway Cut problem. SFVS remains NP-hard even in split and chordal graphs, and SFVS in Chordal Graphs (SFVS-C) can be considered as an implicit 3-Hitting Set problem. However, it is not easy to solve SFVS-C faster than 3-Hitting Set. In 2019, Philip, Rajan, Saurabh, and Tale (Algorithmica 2019) proved that SFVS-C can be solved in $\\mathcal{O}^{*}","authors_text":"Mingyu Xiao, Tian Bai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-12-09T08:48:32Z","title":"Breaking the Barrier $2^k$ for Subset Feedback Vertex Set in Chordal Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.04726","kind":"arxiv","version":4},"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:5237825c45efd83679f99b5747446c62cf2c9f91e0fd8879771c6ba31333ccaf","target":"record","created_at":"2026-07-05T09:56:19Z","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":"64bc665a372e31568e4ee05fd7b32251aac8a332a530f46c7d58e6ba197fafe2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-12-09T08:48:32Z","title_canon_sha256":"5b87077ea917f37bc318063cf78ed547f61a0dd4b99e576bf9560411fd27728d"},"schema_version":"1.0","source":{"id":"2212.04726","kind":"arxiv","version":4}},"canonical_sha256":"ed2ae7f365d26094275dc87bf991b9e2b2019ae82a0de41c41bc975f92e237f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed2ae7f365d26094275dc87bf991b9e2b2019ae82a0de41c41bc975f92e237f3","first_computed_at":"2026-07-05T09:56:19.944007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:56:19.944007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n0RHz+sb165Pfm1G0Bpy85fuTKaXVUbHlvDAAWg7TXpL/FDVFTKJrldYyokhJhSbO/0QWToII2y2SBSsXQKtDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:56:19.944437Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.04726","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5237825c45efd83679f99b5747446c62cf2c9f91e0fd8879771c6ba31333ccaf","sha256:d677867c8e96fb495267a2bc57bbfc7fe026fa3c22d99847003298ac61a60d83"],"state_sha256":"e055bd7ce488dc3b88a41132e6db83af587fd6bfc7192dcccb5c4fd997b9e7e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C/r6mT0ciUonWK+ozVH65wv7bpDEw9nYFVbkNdK3d7vsbTihZFbZhWxzY1nKOLCO7VYldfwzU1n3nVf6iWp1AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-21T03:30:37.388308Z","bundle_sha256":"287573a64f76fed29e0082f5e8b68034f862eac1d262496afe7cc7f1239f2d06"}}