{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ABW5LY2OBJ7Q43DNMUCKY74S2Z","short_pith_number":"pith:ABW5LY2O","schema_version":"1.0","canonical_sha256":"006dd5e34e0a7f0e6c6d6504ac7f92d65c70b9a7acf8f04acb97c759605ab62e","source":{"kind":"arxiv","id":"1510.01557","version":1},"attestation_state":"computed","paper":{"title":"Simultaneous Feedback Vertex Set: A Parameterized Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Akanksha Agrawal, Amer E. Mouawad, Daniel Lokshtanov, Saket Saurabh","submitted_at":"2015-10-06T12:49:14Z","abstract_excerpt":"Given a family of graphs $\\mathcal{F}$, a graph $G$, and a positive integer $k$, the $\\mathcal{F}$-Deletion problem asks whether we can delete at most $k$ vertices from $G$ to obtain a graph in $\\mathcal{F}$. $\\mathcal{F}$-Deletion generalizes many classical graph problems such as Vertex Cover, Feedback Vertex Set, and Odd Cycle Transversal. A graph $G = (V, \\cup_{i=1}^{\\alpha} E_{i})$, where the edge set of $G$ is partitioned into $\\alpha$ color classes, is called an $\\alpha$-edge-colored graph. A natural extension of the $\\mathcal{F}$-Deletion problem to edge-colored graphs is the $\\alpha$-S"},"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":"1510.01557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-06T12:49:14Z","cross_cats_sorted":[],"title_canon_sha256":"661fa298321f0f6be42cdfcbcd63fb2a186e950227cec269947d85b77b4a2f12","abstract_canon_sha256":"28d8ac9be78f835a4937605cae0bfcbe5824d637a36c4dd21ccc8922f973fabb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:56.623571Z","signature_b64":"3Jq1G4r8D7BO6dWAa9OK+bZSnwOLQ3pKuSaK4z8I7iZt8waL9wDshkg3EeohVojEXSvSN5JovdsbwuDAb/XXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"006dd5e34e0a7f0e6c6d6504ac7f92d65c70b9a7acf8f04acb97c759605ab62e","last_reissued_at":"2026-05-18T01:30:56.623180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:56.623180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simultaneous Feedback Vertex Set: A Parameterized Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Akanksha Agrawal, Amer E. Mouawad, Daniel Lokshtanov, Saket Saurabh","submitted_at":"2015-10-06T12:49:14Z","abstract_excerpt":"Given a family of graphs $\\mathcal{F}$, a graph $G$, and a positive integer $k$, the $\\mathcal{F}$-Deletion problem asks whether we can delete at most $k$ vertices from $G$ to obtain a graph in $\\mathcal{F}$. $\\mathcal{F}$-Deletion generalizes many classical graph problems such as Vertex Cover, Feedback Vertex Set, and Odd Cycle Transversal. A graph $G = (V, \\cup_{i=1}^{\\alpha} E_{i})$, where the edge set of $G$ is partitioned into $\\alpha$ color classes, is called an $\\alpha$-edge-colored graph. A natural extension of the $\\mathcal{F}$-Deletion problem to edge-colored graphs is the $\\alpha$-S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01557","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":"1510.01557","created_at":"2026-05-18T01:30:56.623237+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.01557v1","created_at":"2026-05-18T01:30:56.623237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01557","created_at":"2026-05-18T01:30:56.623237+00:00"},{"alias_kind":"pith_short_12","alias_value":"ABW5LY2OBJ7Q","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"ABW5LY2OBJ7Q43DN","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"ABW5LY2O","created_at":"2026-05-18T12:29:10.953037+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/ABW5LY2OBJ7Q43DNMUCKY74S2Z","json":"https://pith.science/pith/ABW5LY2OBJ7Q43DNMUCKY74S2Z.json","graph_json":"https://pith.science/api/pith-number/ABW5LY2OBJ7Q43DNMUCKY74S2Z/graph.json","events_json":"https://pith.science/api/pith-number/ABW5LY2OBJ7Q43DNMUCKY74S2Z/events.json","paper":"https://pith.science/paper/ABW5LY2O"},"agent_actions":{"view_html":"https://pith.science/pith/ABW5LY2OBJ7Q43DNMUCKY74S2Z","download_json":"https://pith.science/pith/ABW5LY2OBJ7Q43DNMUCKY74S2Z.json","view_paper":"https://pith.science/paper/ABW5LY2O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.01557&json=true","fetch_graph":"https://pith.science/api/pith-number/ABW5LY2OBJ7Q43DNMUCKY74S2Z/graph.json","fetch_events":"https://pith.science/api/pith-number/ABW5LY2OBJ7Q43DNMUCKY74S2Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ABW5LY2OBJ7Q43DNMUCKY74S2Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ABW5LY2OBJ7Q43DNMUCKY74S2Z/action/storage_attestation","attest_author":"https://pith.science/pith/ABW5LY2OBJ7Q43DNMUCKY74S2Z/action/author_attestation","sign_citation":"https://pith.science/pith/ABW5LY2OBJ7Q43DNMUCKY74S2Z/action/citation_signature","submit_replication":"https://pith.science/pith/ABW5LY2OBJ7Q43DNMUCKY74S2Z/action/replication_record"}},"created_at":"2026-05-18T01:30:56.623237+00:00","updated_at":"2026-05-18T01:30:56.623237+00:00"}