{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:N64VKRZ3PCXIRV6INOIEJ2DJ7J","short_pith_number":"pith:N64VKRZ3","schema_version":"1.0","canonical_sha256":"6fb955473b78ae88d7c86b9044e869fa4dd761cb5ce5d7df4dea7453b213e37d","source":{"kind":"arxiv","id":"1104.1044","version":2},"attestation_state":"computed","paper":{"title":"Fixed Parameter Tractable Algorithm for Firefighting Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ming Lam Leung","submitted_at":"2011-04-06T09:33:42Z","abstract_excerpt":"The firefighter problem is defined as below. A fire initially breaks out at a vertex r on a graph G. In each step, a firefighter chooses to protect one vertex, which is not yet burnt. And the fire spreads out to its unprotected neighboring vertices afterwards. The objective of the problem is to choose a sequence of vertices to protect, in order to save maximum number of vertices from the fire.\n  In this paper, we will introduce a parameter k into the firefighter problem and give several FPT algorithms using a random separation technique of Cai, Chan and Chan. We will prove firefighter problem "},"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":"1104.1044","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-06T09:33:42Z","cross_cats_sorted":[],"title_canon_sha256":"4105074fcd6a0df93221b8d5856c72e6d8de42b9b8d609b1b0d3ba51eac7617a","abstract_canon_sha256":"c3a0688abbb5328de0ae1270d9d6401753b4e74eb98459d21f52191a4b7fa4f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:10.822555Z","signature_b64":"nv8eLe+k1kj+WLDEXDcj5lm13ogp0PwZmJ2bTV6gclMLpM9mxFtW+qlctfSmtxCIlk2OmWmcAa0mS9Gey4PfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fb955473b78ae88d7c86b9044e869fa4dd761cb5ce5d7df4dea7453b213e37d","last_reissued_at":"2026-05-18T02:22:10.822096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:10.822096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed Parameter Tractable Algorithm for Firefighting Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ming Lam Leung","submitted_at":"2011-04-06T09:33:42Z","abstract_excerpt":"The firefighter problem is defined as below. A fire initially breaks out at a vertex r on a graph G. In each step, a firefighter chooses to protect one vertex, which is not yet burnt. And the fire spreads out to its unprotected neighboring vertices afterwards. The objective of the problem is to choose a sequence of vertices to protect, in order to save maximum number of vertices from the fire.\n  In this paper, we will introduce a parameter k into the firefighter problem and give several FPT algorithms using a random separation technique of Cai, Chan and Chan. We will prove firefighter problem "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1044","kind":"arxiv","version":2},"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":"1104.1044","created_at":"2026-05-18T02:22:10.822158+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.1044v2","created_at":"2026-05-18T02:22:10.822158+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1044","created_at":"2026-05-18T02:22:10.822158+00:00"},{"alias_kind":"pith_short_12","alias_value":"N64VKRZ3PCXI","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"N64VKRZ3PCXIRV6I","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"N64VKRZ3","created_at":"2026-05-18T12:26:37.096874+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/N64VKRZ3PCXIRV6INOIEJ2DJ7J","json":"https://pith.science/pith/N64VKRZ3PCXIRV6INOIEJ2DJ7J.json","graph_json":"https://pith.science/api/pith-number/N64VKRZ3PCXIRV6INOIEJ2DJ7J/graph.json","events_json":"https://pith.science/api/pith-number/N64VKRZ3PCXIRV6INOIEJ2DJ7J/events.json","paper":"https://pith.science/paper/N64VKRZ3"},"agent_actions":{"view_html":"https://pith.science/pith/N64VKRZ3PCXIRV6INOIEJ2DJ7J","download_json":"https://pith.science/pith/N64VKRZ3PCXIRV6INOIEJ2DJ7J.json","view_paper":"https://pith.science/paper/N64VKRZ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.1044&json=true","fetch_graph":"https://pith.science/api/pith-number/N64VKRZ3PCXIRV6INOIEJ2DJ7J/graph.json","fetch_events":"https://pith.science/api/pith-number/N64VKRZ3PCXIRV6INOIEJ2DJ7J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N64VKRZ3PCXIRV6INOIEJ2DJ7J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N64VKRZ3PCXIRV6INOIEJ2DJ7J/action/storage_attestation","attest_author":"https://pith.science/pith/N64VKRZ3PCXIRV6INOIEJ2DJ7J/action/author_attestation","sign_citation":"https://pith.science/pith/N64VKRZ3PCXIRV6INOIEJ2DJ7J/action/citation_signature","submit_replication":"https://pith.science/pith/N64VKRZ3PCXIRV6INOIEJ2DJ7J/action/replication_record"}},"created_at":"2026-05-18T02:22:10.822158+00:00","updated_at":"2026-05-18T02:22:10.822158+00:00"}