{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:VADFTFWGEHMKMHVEE2IDYA7RUY","short_pith_number":"pith:VADFTFWG","canonical_record":{"source":{"id":"2007.14179","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-28T13:06:53Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"84cdd8a4d305bafdf4a881155194d09b6aea0f651e8908885bba85d92ba48773","abstract_canon_sha256":"768b20a249eeb6ea72f3fac888f0e7106512b24df19241f535da02bd79a04931"},"schema_version":"1.0"},"canonical_sha256":"a8065996c621d8a61ea426903c03f1a63f50c4d66bc35136225e859793e368f4","source":{"kind":"arxiv","id":"2007.14179","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.14179","created_at":"2026-07-05T01:22:56Z"},{"alias_kind":"arxiv_version","alias_value":"2007.14179v1","created_at":"2026-07-05T01:22:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.14179","created_at":"2026-07-05T01:22:56Z"},{"alias_kind":"pith_short_12","alias_value":"VADFTFWGEHMK","created_at":"2026-07-05T01:22:56Z"},{"alias_kind":"pith_short_16","alias_value":"VADFTFWGEHMKMHVE","created_at":"2026-07-05T01:22:56Z"},{"alias_kind":"pith_short_8","alias_value":"VADFTFWG","created_at":"2026-07-05T01:22:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:VADFTFWGEHMKMHVEE2IDYA7RUY","target":"record","payload":{"canonical_record":{"source":{"id":"2007.14179","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-28T13:06:53Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"84cdd8a4d305bafdf4a881155194d09b6aea0f651e8908885bba85d92ba48773","abstract_canon_sha256":"768b20a249eeb6ea72f3fac888f0e7106512b24df19241f535da02bd79a04931"},"schema_version":"1.0"},"canonical_sha256":"a8065996c621d8a61ea426903c03f1a63f50c4d66bc35136225e859793e368f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:22:56.139363Z","signature_b64":"ZreHREO3iVuF4nzXBem/u3tt56/ZytJ8wRt9Q5cXsWInaiFKRIpmZnN953VjAOPZTgV4hOijLSeSJuz5Nv4yBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8065996c621d8a61ea426903c03f1a63f50c4d66bc35136225e859793e368f4","last_reissued_at":"2026-07-05T01:22:56.138979Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:22:56.138979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.14179","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-07-05T01:22:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OHZpGBC1VDCrdF10dkOWqUUR6y642nW8CrdqHRcf/low9GTizutdCi3u4X4iNj3fH83AWYOb97IGTVuoGWoaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T18:44:01.150505Z"},"content_sha256":"a71fe844a3cc8d3440cb25004f2e4e3a5814ab63080a759051f0cdf83976589f","schema_version":"1.0","event_id":"sha256:a71fe844a3cc8d3440cb25004f2e4e3a5814ab63080a759051f0cdf83976589f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:VADFTFWGEHMKMHVEE2IDYA7RUY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Benjamin Bergougnoux, \\'Edouard Bonnet, Nick Brettell, O-joung Kwon","submitted_at":"2020-07-28T13:06:53Z","abstract_excerpt":"The Cut & Count technique and the rank-based approach have lead to single-exponential FPT algorithms parameterized by treewidth, that is, running in time $2^{O(tw)}n^{O(1)}$, for Feedback Vertex Set and connected versions of the classical graph problems (such as Vertex Cover and Dominating Set). We show that Subset Feedback Vertex Set, Subset Odd Cycle Transversal, Restricted Edge-Subset Feedback Edge Set, Node Multiway Cut, and Multiway Cut are unlikely to have such running times. More precisely, we match algorithms running in time $2^{O(tw \\log tw)}n^{O(1)}$ with tight lower bounds under the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.14179","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.14179/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-05T01:22:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pUDxJPqLsyfPfK0huwJMIsnZx69gTxj3JeXnbzbPSxDoZyUAMcrnqeR4RhOUlDDwnScpmWM6Yb+S33hGFamDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T18:44:01.151156Z"},"content_sha256":"0eb6d7c335b601f4386e34653ad4beb477409f30c12de1b5a915fa611755bcc0","schema_version":"1.0","event_id":"sha256:0eb6d7c335b601f4386e34653ad4beb477409f30c12de1b5a915fa611755bcc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VADFTFWGEHMKMHVEE2IDYA7RUY/bundle.json","state_url":"https://pith.science/pith/VADFTFWGEHMKMHVEE2IDYA7RUY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VADFTFWGEHMKMHVEE2IDYA7RUY/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-08-10T18:44:01Z","links":{"resolver":"https://pith.science/pith/VADFTFWGEHMKMHVEE2IDYA7RUY","bundle":"https://pith.science/pith/VADFTFWGEHMKMHVEE2IDYA7RUY/bundle.json","state":"https://pith.science/pith/VADFTFWGEHMKMHVEE2IDYA7RUY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VADFTFWGEHMKMHVEE2IDYA7RUY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:VADFTFWGEHMKMHVEE2IDYA7RUY","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":"768b20a249eeb6ea72f3fac888f0e7106512b24df19241f535da02bd79a04931","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-28T13:06:53Z","title_canon_sha256":"84cdd8a4d305bafdf4a881155194d09b6aea0f651e8908885bba85d92ba48773"},"schema_version":"1.0","source":{"id":"2007.14179","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.14179","created_at":"2026-07-05T01:22:56Z"},{"alias_kind":"arxiv_version","alias_value":"2007.14179v1","created_at":"2026-07-05T01:22:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.14179","created_at":"2026-07-05T01:22:56Z"},{"alias_kind":"pith_short_12","alias_value":"VADFTFWGEHMK","created_at":"2026-07-05T01:22:56Z"},{"alias_kind":"pith_short_16","alias_value":"VADFTFWGEHMKMHVE","created_at":"2026-07-05T01:22:56Z"},{"alias_kind":"pith_short_8","alias_value":"VADFTFWG","created_at":"2026-07-05T01:22:56Z"}],"graph_snapshots":[{"event_id":"sha256:0eb6d7c335b601f4386e34653ad4beb477409f30c12de1b5a915fa611755bcc0","target":"graph","created_at":"2026-07-05T01:22:56Z","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/2007.14179/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Cut & Count technique and the rank-based approach have lead to single-exponential FPT algorithms parameterized by treewidth, that is, running in time $2^{O(tw)}n^{O(1)}$, for Feedback Vertex Set and connected versions of the classical graph problems (such as Vertex Cover and Dominating Set). We show that Subset Feedback Vertex Set, Subset Odd Cycle Transversal, Restricted Edge-Subset Feedback Edge Set, Node Multiway Cut, and Multiway Cut are unlikely to have such running times. More precisely, we match algorithms running in time $2^{O(tw \\log tw)}n^{O(1)}$ with tight lower bounds under the","authors_text":"Benjamin Bergougnoux, \\'Edouard Bonnet, Nick Brettell, O-joung Kwon","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-28T13:06:53Z","title":"Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.14179","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:a71fe844a3cc8d3440cb25004f2e4e3a5814ab63080a759051f0cdf83976589f","target":"record","created_at":"2026-07-05T01:22:56Z","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":"768b20a249eeb6ea72f3fac888f0e7106512b24df19241f535da02bd79a04931","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-28T13:06:53Z","title_canon_sha256":"84cdd8a4d305bafdf4a881155194d09b6aea0f651e8908885bba85d92ba48773"},"schema_version":"1.0","source":{"id":"2007.14179","kind":"arxiv","version":1}},"canonical_sha256":"a8065996c621d8a61ea426903c03f1a63f50c4d66bc35136225e859793e368f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8065996c621d8a61ea426903c03f1a63f50c4d66bc35136225e859793e368f4","first_computed_at":"2026-07-05T01:22:56.138979Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:22:56.138979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZreHREO3iVuF4nzXBem/u3tt56/ZytJ8wRt9Q5cXsWInaiFKRIpmZnN953VjAOPZTgV4hOijLSeSJuz5Nv4yBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:22:56.139363Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.14179","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a71fe844a3cc8d3440cb25004f2e4e3a5814ab63080a759051f0cdf83976589f","sha256:0eb6d7c335b601f4386e34653ad4beb477409f30c12de1b5a915fa611755bcc0"],"state_sha256":"c6ca553360f36ae1ff224f6b5e7a497d1620ed992cc32ee21f1f9220e0b14fb1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NDexuxgozP37BU+lBQcYT9bduk5Sa2HijsOAPVHc+SWNofzokZJq9nYFzI2MZwEXqxCDzKEyEB/09uWo2Zq3Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T18:44:01.155966Z","bundle_sha256":"3295f0579f28d0391c36e9b41712634c39fc66fcb36ebafa8690eb2706fea2b2"}}