{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KPQCQKPJFRJ2SGEZGKK44AQOIG","short_pith_number":"pith:KPQCQKPJ","canonical_record":{"source":{"id":"1112.6255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-29T09:02:35Z","cross_cats_sorted":[],"title_canon_sha256":"58a3d2c12027f9a61a53ac3bbbf95c28bed9eb99752e3f1c722fe046c7be4d1d","abstract_canon_sha256":"93f9f8512beef8d33ffa0c6e639d49a020d69e288813747f6a0c418b4786f841"},"schema_version":"1.0"},"canonical_sha256":"53e02829e92c53a918993295ce020e4186f56a7dede7ca5fd68201ff40edde0d","source":{"kind":"arxiv","id":"1112.6255","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.6255","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"1112.6255v1","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6255","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"KPQCQKPJFRJ2","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KPQCQKPJFRJ2SGEZ","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KPQCQKPJ","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KPQCQKPJFRJ2SGEZGKK44AQOIG","target":"record","payload":{"canonical_record":{"source":{"id":"1112.6255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-29T09:02:35Z","cross_cats_sorted":[],"title_canon_sha256":"58a3d2c12027f9a61a53ac3bbbf95c28bed9eb99752e3f1c722fe046c7be4d1d","abstract_canon_sha256":"93f9f8512beef8d33ffa0c6e639d49a020d69e288813747f6a0c418b4786f841"},"schema_version":"1.0"},"canonical_sha256":"53e02829e92c53a918993295ce020e4186f56a7dede7ca5fd68201ff40edde0d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:36.394102Z","signature_b64":"ewPok38+3tCc6UYOj1GMtpO8RK3lhjpuzbE0UK65+wx0gdrfFcKjJoBJm5QND6XuUYkKO83h9kDjpkwjEmb9Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53e02829e92c53a918993295ce020e4186f56a7dede7ca5fd68201ff40edde0d","last_reissued_at":"2026-05-18T04:05:36.393328Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:36.393328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.6255","source_version":1,"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-05-18T04:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YhiYmdWloiQvkYZ+W95fYdJNg8x5nY/fAvGaN+T9w+rhGL6RyuWx10+DSoHFa/7JbPOeaZ/IkJzrx2MPUOkSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:16:40.657919Z"},"content_sha256":"0f3d885a1564c7b056747ffde22042346395e9f60c1de160f00bd37393d49557","schema_version":"1.0","event_id":"sha256:0f3d885a1564c7b056747ffde22042346395e9f60c1de160f00bd37393d49557"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KPQCQKPJFRJ2SGEZGKK44AQOIG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On group feedback vertex set parameterized by the size of the cutset","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","submitted_at":"2011-12-29T09:02:35Z","abstract_excerpt":"We study the parameterized complexity of a robust generalization of the classical Feedback Vertex Set problem, namely the Group Feedback Vertex Set problem; we are given a graph G with edges labeled with group elements, and the goal is to compute the smallest set of vertices that hits all cycles of G that evaluate to a non-null element of the group. This problem generalizes not only Feedback Vertex Set, but also Subset Feedback Vertex Set, Multiway Cut and Odd Cycle Transversal. Completing the results of Guillemot [Discr. Opt. 2011], we provide a fixed-parameter algorithm for the parameterizat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6255","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"},"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-05-18T04:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rh3yJQQ2sJZMiJtzpgSWb7gxbLldPbABQ9l+5hybz03zb/lUq8Jb+Ym8f1yEEeHuBw9tiBhPi0/35r31pLrWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:16:40.658270Z"},"content_sha256":"6afb55ef5037b2b875378e8afb34cbcf56e1b1bf65138b5cfe5376f274f3e8d0","schema_version":"1.0","event_id":"sha256:6afb55ef5037b2b875378e8afb34cbcf56e1b1bf65138b5cfe5376f274f3e8d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KPQCQKPJFRJ2SGEZGKK44AQOIG/bundle.json","state_url":"https://pith.science/pith/KPQCQKPJFRJ2SGEZGKK44AQOIG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KPQCQKPJFRJ2SGEZGKK44AQOIG/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-06-01T01:16:40Z","links":{"resolver":"https://pith.science/pith/KPQCQKPJFRJ2SGEZGKK44AQOIG","bundle":"https://pith.science/pith/KPQCQKPJFRJ2SGEZGKK44AQOIG/bundle.json","state":"https://pith.science/pith/KPQCQKPJFRJ2SGEZGKK44AQOIG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KPQCQKPJFRJ2SGEZGKK44AQOIG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KPQCQKPJFRJ2SGEZGKK44AQOIG","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":"93f9f8512beef8d33ffa0c6e639d49a020d69e288813747f6a0c418b4786f841","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-29T09:02:35Z","title_canon_sha256":"58a3d2c12027f9a61a53ac3bbbf95c28bed9eb99752e3f1c722fe046c7be4d1d"},"schema_version":"1.0","source":{"id":"1112.6255","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.6255","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"1112.6255v1","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6255","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"KPQCQKPJFRJ2","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KPQCQKPJFRJ2SGEZ","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KPQCQKPJ","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:6afb55ef5037b2b875378e8afb34cbcf56e1b1bf65138b5cfe5376f274f3e8d0","target":"graph","created_at":"2026-05-18T04:05:36Z","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"},"paper":{"abstract_excerpt":"We study the parameterized complexity of a robust generalization of the classical Feedback Vertex Set problem, namely the Group Feedback Vertex Set problem; we are given a graph G with edges labeled with group elements, and the goal is to compute the smallest set of vertices that hits all cycles of G that evaluate to a non-null element of the group. This problem generalizes not only Feedback Vertex Set, but also Subset Feedback Vertex Set, Multiway Cut and Odd Cycle Transversal. Completing the results of Guillemot [Discr. Opt. 2011], we provide a fixed-parameter algorithm for the parameterizat","authors_text":"Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-29T09:02:35Z","title":"On group feedback vertex set parameterized by the size of the cutset"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6255","kind":"arxiv","version":1},"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:0f3d885a1564c7b056747ffde22042346395e9f60c1de160f00bd37393d49557","target":"record","created_at":"2026-05-18T04:05:36Z","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":"93f9f8512beef8d33ffa0c6e639d49a020d69e288813747f6a0c418b4786f841","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-29T09:02:35Z","title_canon_sha256":"58a3d2c12027f9a61a53ac3bbbf95c28bed9eb99752e3f1c722fe046c7be4d1d"},"schema_version":"1.0","source":{"id":"1112.6255","kind":"arxiv","version":1}},"canonical_sha256":"53e02829e92c53a918993295ce020e4186f56a7dede7ca5fd68201ff40edde0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53e02829e92c53a918993295ce020e4186f56a7dede7ca5fd68201ff40edde0d","first_computed_at":"2026-05-18T04:05:36.393328Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:36.393328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ewPok38+3tCc6UYOj1GMtpO8RK3lhjpuzbE0UK65+wx0gdrfFcKjJoBJm5QND6XuUYkKO83h9kDjpkwjEmb9Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:36.394102Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.6255","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f3d885a1564c7b056747ffde22042346395e9f60c1de160f00bd37393d49557","sha256:6afb55ef5037b2b875378e8afb34cbcf56e1b1bf65138b5cfe5376f274f3e8d0"],"state_sha256":"eedd32bcf6ce739337c23490f39114d6ff0dc9d97566fd643de0a51ee079d0e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mZgpkpcNA5/NAEuojOitHFqNelPG9AgJfhdH7hSzDxmwzHyqfq8Db06fn4iA6BSbOuv68w4nqXL36kkhFlqXCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:16:40.660624Z","bundle_sha256":"e5f99fa9dffb66270bda66f46d71f67bf76a1c1f5ea2d203cc9d5ea2baae1e09"}}