{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FLWKRPKS54HT5X2CYBO5UMSTEV","short_pith_number":"pith:FLWKRPKS","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"},"canonical_sha256":"2aeca8bd52ef0f3edf42c05dda3253257eeb33a21c2843690981aa6494312879","source":{"kind":"arxiv","id":"1611.07701","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07701","created_at":"2026-05-18T00:57:00Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07701v1","created_at":"2026-05-18T00:57:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07701","created_at":"2026-05-18T00:57:00Z"},{"alias_kind":"pith_short_12","alias_value":"FLWKRPKS54HT","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FLWKRPKS54HT5X2C","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FLWKRPKS","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FLWKRPKS54HT5X2CYBO5UMSTEV","target":"record","payload":{"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"},"canonical_sha256":"2aeca8bd52ef0f3edf42c05dda3253257eeb33a21c2843690981aa6494312879","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"},"source_kind":"arxiv","source_id":"1611.07701","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-18T00:57:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rk1L0nlTu2Yic6lEEnOAP+0qdQva+g3ggQHUCn/O8JyNWoEO8AmiT67V/Ymv6wFlIaDAVzhVTQkvkFAom56LBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:38:23.057025Z"},"content_sha256":"eb45bf0791c84a617f65a9640249ed5680927315ac40fad542add955cbe08192","schema_version":"1.0","event_id":"sha256:eb45bf0791c84a617f65a9640249ed5680927315ac40fad542add955cbe08192"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FLWKRPKS54HT5X2CYBO5UMSTEV","target":"graph","payload":{"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"},"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-18T00:57:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NhiGNFgFbtNo2EAKpSnJeMRhGUBfY8TYoQseW5scKkQNQVHknKNQ0hbzJoAwwFYryk/xVi7PkpegyxmvMydhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:38:23.057765Z"},"content_sha256":"78a29c79ea3fc84031ba70f640f43984b38abbf69d70edf7f8444367ab139513","schema_version":"1.0","event_id":"sha256:78a29c79ea3fc84031ba70f640f43984b38abbf69d70edf7f8444367ab139513"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FLWKRPKS54HT5X2CYBO5UMSTEV/bundle.json","state_url":"https://pith.science/pith/FLWKRPKS54HT5X2CYBO5UMSTEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FLWKRPKS54HT5X2CYBO5UMSTEV/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-05-30T10:38:23Z","links":{"resolver":"https://pith.science/pith/FLWKRPKS54HT5X2CYBO5UMSTEV","bundle":"https://pith.science/pith/FLWKRPKS54HT5X2CYBO5UMSTEV/bundle.json","state":"https://pith.science/pith/FLWKRPKS54HT5X2CYBO5UMSTEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FLWKRPKS54HT5X2CYBO5UMSTEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FLWKRPKS54HT5X2CYBO5UMSTEV","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":"853d586777317ca6eaeb8456f060e84cf67dfd46d43edc76309f42eb9afb741e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-23T09:32:46Z","title_canon_sha256":"00ee2b3cbf85ac3f2ead04b98ea94a3bfc4cda57029b31db263f0781f1e8f877"},"schema_version":"1.0","source":{"id":"1611.07701","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07701","created_at":"2026-05-18T00:57:00Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07701v1","created_at":"2026-05-18T00:57:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07701","created_at":"2026-05-18T00:57:00Z"},{"alias_kind":"pith_short_12","alias_value":"FLWKRPKS54HT","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FLWKRPKS54HT5X2C","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FLWKRPKS","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:78a29c79ea3fc84031ba70f640f43984b38abbf69d70edf7f8444367ab139513","target":"graph","created_at":"2026-05-18T00:57:00Z","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":"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","authors_text":"Akanksha Agrawal, Fahad Panolan, Meirav Zehavi, Saket Saurabh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-23T09:32:46Z","title":"Simultaneous Feedback Edge Set: A Parameterized Perspective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07701","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:eb45bf0791c84a617f65a9640249ed5680927315ac40fad542add955cbe08192","target":"record","created_at":"2026-05-18T00:57:00Z","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":"853d586777317ca6eaeb8456f060e84cf67dfd46d43edc76309f42eb9afb741e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-23T09:32:46Z","title_canon_sha256":"00ee2b3cbf85ac3f2ead04b98ea94a3bfc4cda57029b31db263f0781f1e8f877"},"schema_version":"1.0","source":{"id":"1611.07701","kind":"arxiv","version":1}},"canonical_sha256":"2aeca8bd52ef0f3edf42c05dda3253257eeb33a21c2843690981aa6494312879","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2aeca8bd52ef0f3edf42c05dda3253257eeb33a21c2843690981aa6494312879","first_computed_at":"2026-05-18T00:57:00.052688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:00.052688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/aRSTj2cqU/ev6bYYPTGRdMCffhRUpkZMiaMSOGvOUkdvjnPSbpNRW6mJKxi6tTfZVpbTOf0efUkuSDTfI/yAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:00.053168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07701","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb45bf0791c84a617f65a9640249ed5680927315ac40fad542add955cbe08192","sha256:78a29c79ea3fc84031ba70f640f43984b38abbf69d70edf7f8444367ab139513"],"state_sha256":"a76108f77545fb70917d4a0898caa9e4c6ab186e592962e1d9faae50594b8776"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UqKthcBRmS6YjRgAqQGuXPdokj0SgFfwp1MIR754g1O54VMPrxrPFSZd2T4c7WHbG/Ut8Gw23s8AG0bdGDyyCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:38:23.061823Z","bundle_sha256":"f087e0c55ebde3fdb7cc65382b1bf3096146625de3ac98ac1ef26ad816aebfec"}}