{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QHQFOTQB6VJ4IZHOIE6BOOYLKX","short_pith_number":"pith:QHQFOTQB","schema_version":"1.0","canonical_sha256":"81e0574e01f553c464ee413c173b0b55ec94525262253fc75292e34c7776ba96","source":{"kind":"arxiv","id":"1705.10923","version":1},"attestation_state":"computed","paper":{"title":"Saving Critical Nodes with Firefighters is FPT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anirban Dasgupta, Jayesh Choudhari, M. S. Ramanujan, Neeldhara Misra","submitted_at":"2017-05-31T02:44:22Z","abstract_excerpt":"We consider the problem of firefighting to save a critical subset of nodes. The firefighting game is a turn-based game played on a graph, where the fire spreads to vertices in a breadth-first manner from a source, and firefighters can be placed on yet unburnt vertices on alternate rounds to block the fire. In this work, we consider the problem of saving a critical subset of nodes from catching fire, given a total budget on the number of firefighters. We show that the problem is para-NP-hard when parameterized by the size of the critical set. We also show that it is fixed-parameter tractable on"},"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":"1705.10923","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2017-05-31T02:44:22Z","cross_cats_sorted":[],"title_canon_sha256":"2d726e32444e8cc1ee9043b5d337a3a79b866401b6cb7de7d757293d50cc3f88","abstract_canon_sha256":"8ea8f9c565aa821ee787a0a936e3cfee1354639c5047199862b13f9fd0aa9ff6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:19.849816Z","signature_b64":"gYeqxmmd+HKlnQMVOVgBwI5NaofoWt5Z/umxOyVXYfzct1CxiHohl9FsSRfbDblsjJADcCicwSvE1uaUgiA7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81e0574e01f553c464ee413c173b0b55ec94525262253fc75292e34c7776ba96","last_reissued_at":"2026-05-18T00:43:19.849266Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:19.849266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Saving Critical Nodes with Firefighters is FPT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anirban Dasgupta, Jayesh Choudhari, M. S. Ramanujan, Neeldhara Misra","submitted_at":"2017-05-31T02:44:22Z","abstract_excerpt":"We consider the problem of firefighting to save a critical subset of nodes. The firefighting game is a turn-based game played on a graph, where the fire spreads to vertices in a breadth-first manner from a source, and firefighters can be placed on yet unburnt vertices on alternate rounds to block the fire. In this work, we consider the problem of saving a critical subset of nodes from catching fire, given a total budget on the number of firefighters. We show that the problem is para-NP-hard when parameterized by the size of the critical set. We also show that it is fixed-parameter tractable on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10923","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":"1705.10923","created_at":"2026-05-18T00:43:19.849366+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10923v1","created_at":"2026-05-18T00:43:19.849366+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10923","created_at":"2026-05-18T00:43:19.849366+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHQFOTQB6VJ4","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHQFOTQB6VJ4IZHO","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHQFOTQB","created_at":"2026-05-18T12:31:39.905425+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/QHQFOTQB6VJ4IZHOIE6BOOYLKX","json":"https://pith.science/pith/QHQFOTQB6VJ4IZHOIE6BOOYLKX.json","graph_json":"https://pith.science/api/pith-number/QHQFOTQB6VJ4IZHOIE6BOOYLKX/graph.json","events_json":"https://pith.science/api/pith-number/QHQFOTQB6VJ4IZHOIE6BOOYLKX/events.json","paper":"https://pith.science/paper/QHQFOTQB"},"agent_actions":{"view_html":"https://pith.science/pith/QHQFOTQB6VJ4IZHOIE6BOOYLKX","download_json":"https://pith.science/pith/QHQFOTQB6VJ4IZHOIE6BOOYLKX.json","view_paper":"https://pith.science/paper/QHQFOTQB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10923&json=true","fetch_graph":"https://pith.science/api/pith-number/QHQFOTQB6VJ4IZHOIE6BOOYLKX/graph.json","fetch_events":"https://pith.science/api/pith-number/QHQFOTQB6VJ4IZHOIE6BOOYLKX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHQFOTQB6VJ4IZHOIE6BOOYLKX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHQFOTQB6VJ4IZHOIE6BOOYLKX/action/storage_attestation","attest_author":"https://pith.science/pith/QHQFOTQB6VJ4IZHOIE6BOOYLKX/action/author_attestation","sign_citation":"https://pith.science/pith/QHQFOTQB6VJ4IZHOIE6BOOYLKX/action/citation_signature","submit_replication":"https://pith.science/pith/QHQFOTQB6VJ4IZHOIE6BOOYLKX/action/replication_record"}},"created_at":"2026-05-18T00:43:19.849366+00:00","updated_at":"2026-05-18T00:43:19.849366+00:00"}