{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FLWKRPKS54HT5X2CYBO5UMSTEV","short_pith_number":"pith:FLWKRPKS","schema_version":"1.0","canonical_sha256":"2aeca8bd52ef0f3edf42c05dda3253257eeb33a21c2843690981aa6494312879","source":{"kind":"arxiv","id":"1611.07701","version":1},"attestation_state":"computed","paper":{"title":"Simultaneous Feedback Edge Set: A Parameterized Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Akanksha Agrawal, Fahad Panolan, Meirav Zehavi, Saket Saurabh","submitted_at":"2016-11-23T09:32:46Z","abstract_excerpt":"In this paper we consider Simultaneous Feedback Edge Set (Sim-FES) problem. In this problem, the input is an $n$-vertex graph $G$, an integer $k$ and a coloring function ${\\sf col}: E(G) \\rightarrow 2^{[\\alpha]}$ and the objective is to check whether there is an edge subset $S$ of cardinality at most $k$ in $G$ such that for all $i \\in [\\alpha]$, $G_i - S$ is acyclic. Here, $G_i=(V(G), \\{e\\in E(G) \\mid i \\in {\\sf col}(e)\\})$ and $[\\alpha]=\\{1,\\ldots,\\alpha\\}$. When $\\alpha =1$, the problem is polynomial time solvable. We show that for $\\alpha =3$ Sim-FES is NP-hard by giving a reduction from V"},"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":"1611.07701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-23T09:32:46Z","cross_cats_sorted":[],"title_canon_sha256":"00ee2b3cbf85ac3f2ead04b98ea94a3bfc4cda57029b31db263f0781f1e8f877","abstract_canon_sha256":"853d586777317ca6eaeb8456f060e84cf67dfd46d43edc76309f42eb9afb741e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:00.053168Z","signature_b64":"/aRSTj2cqU/ev6bYYPTGRdMCffhRUpkZMiaMSOGvOUkdvjnPSbpNRW6mJKxi6tTfZVpbTOf0efUkuSDTfI/yAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2aeca8bd52ef0f3edf42c05dda3253257eeb33a21c2843690981aa6494312879","last_reissued_at":"2026-05-18T00:57:00.052688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:00.052688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simultaneous Feedback Edge Set: A Parameterized Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Akanksha Agrawal, Fahad Panolan, Meirav Zehavi, Saket Saurabh","submitted_at":"2016-11-23T09:32:46Z","abstract_excerpt":"In this paper we consider Simultaneous Feedback Edge Set (Sim-FES) problem. In this problem, the input is an $n$-vertex graph $G$, an integer $k$ and a coloring function ${\\sf col}: E(G) \\rightarrow 2^{[\\alpha]}$ and the objective is to check whether there is an edge subset $S$ of cardinality at most $k$ in $G$ such that for all $i \\in [\\alpha]$, $G_i - S$ is acyclic. Here, $G_i=(V(G), \\{e\\in E(G) \\mid i \\in {\\sf col}(e)\\})$ and $[\\alpha]=\\{1,\\ldots,\\alpha\\}$. When $\\alpha =1$, the problem is polynomial time solvable. We show that for $\\alpha =3$ Sim-FES is NP-hard by giving a reduction from V"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07701","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":"1611.07701","created_at":"2026-05-18T00:57:00.052771+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07701v1","created_at":"2026-05-18T00:57:00.052771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07701","created_at":"2026-05-18T00:57:00.052771+00:00"},{"alias_kind":"pith_short_12","alias_value":"FLWKRPKS54HT","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FLWKRPKS54HT5X2C","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FLWKRPKS","created_at":"2026-05-18T12:30:15.759754+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/FLWKRPKS54HT5X2CYBO5UMSTEV","json":"https://pith.science/pith/FLWKRPKS54HT5X2CYBO5UMSTEV.json","graph_json":"https://pith.science/api/pith-number/FLWKRPKS54HT5X2CYBO5UMSTEV/graph.json","events_json":"https://pith.science/api/pith-number/FLWKRPKS54HT5X2CYBO5UMSTEV/events.json","paper":"https://pith.science/paper/FLWKRPKS"},"agent_actions":{"view_html":"https://pith.science/pith/FLWKRPKS54HT5X2CYBO5UMSTEV","download_json":"https://pith.science/pith/FLWKRPKS54HT5X2CYBO5UMSTEV.json","view_paper":"https://pith.science/paper/FLWKRPKS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07701&json=true","fetch_graph":"https://pith.science/api/pith-number/FLWKRPKS54HT5X2CYBO5UMSTEV/graph.json","fetch_events":"https://pith.science/api/pith-number/FLWKRPKS54HT5X2CYBO5UMSTEV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FLWKRPKS54HT5X2CYBO5UMSTEV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FLWKRPKS54HT5X2CYBO5UMSTEV/action/storage_attestation","attest_author":"https://pith.science/pith/FLWKRPKS54HT5X2CYBO5UMSTEV/action/author_attestation","sign_citation":"https://pith.science/pith/FLWKRPKS54HT5X2CYBO5UMSTEV/action/citation_signature","submit_replication":"https://pith.science/pith/FLWKRPKS54HT5X2CYBO5UMSTEV/action/replication_record"}},"created_at":"2026-05-18T00:57:00.052771+00:00","updated_at":"2026-05-18T00:57:00.052771+00:00"}