{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:D6XHHQWD5IFUXJCPRV3ETBGIL2","short_pith_number":"pith:D6XHHQWD","schema_version":"1.0","canonical_sha256":"1fae73c2c3ea0b4ba44f8d764984c85eb9ed848cb99bf959714b37bcf6bd1437","source":{"kind":"arxiv","id":"1310.6205","version":2},"attestation_state":"computed","paper":{"title":"Parameterized algorithm for weighted independent set problem in bull-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Kristina Vuskovi\\'c, Nicolas Trotignon, St\\'ephan Thomass\\'e","submitted_at":"2013-10-23T12:36:51Z","abstract_excerpt":"The maximum stable set problem is NP-hard, even when restricted to triangle-free graphs. In particular, one cannot expect a polynomial time algorithm deciding if a bull-free graph has a stable set of size $k$, when $k$ is part of the instance. Our main result in this paper is to show the existence of an FPT algorithm when we parameterize the problem by the solution size $k$. A polynomial kernel is unlikely to exist for this problem. We show however that our problem has a polynomial size Turing-kernel. More precisely, the hard cases are instances of size $O(k^5)$. As a byproduct, if we forbid o"},"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":"1310.6205","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-10-23T12:36:51Z","cross_cats_sorted":[],"title_canon_sha256":"02d127e53b74d36b55856849aded5429b6defe82cac6e87942ef9f2f3e887c24","abstract_canon_sha256":"81ef2bbd4993db39906d3946fcc331df8ea6f2abea5c09439ed89afb6d967c5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:32.071171Z","signature_b64":"bXhp1yoFTRAJ7+3DGjLa33Pt4ougfWYHs8IRjgescJXnl+ZemD9rVJDtirJa2y0TDbn/EIGIPAZc2hoLJ+xWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fae73c2c3ea0b4ba44f8d764984c85eb9ed848cb99bf959714b37bcf6bd1437","last_reissued_at":"2026-05-18T01:26:32.070449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:32.070449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized algorithm for weighted independent set problem in bull-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Kristina Vuskovi\\'c, Nicolas Trotignon, St\\'ephan Thomass\\'e","submitted_at":"2013-10-23T12:36:51Z","abstract_excerpt":"The maximum stable set problem is NP-hard, even when restricted to triangle-free graphs. In particular, one cannot expect a polynomial time algorithm deciding if a bull-free graph has a stable set of size $k$, when $k$ is part of the instance. Our main result in this paper is to show the existence of an FPT algorithm when we parameterize the problem by the solution size $k$. A polynomial kernel is unlikely to exist for this problem. We show however that our problem has a polynomial size Turing-kernel. More precisely, the hard cases are instances of size $O(k^5)$. As a byproduct, if we forbid o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6205","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":"1310.6205","created_at":"2026-05-18T01:26:32.070579+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.6205v2","created_at":"2026-05-18T01:26:32.070579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6205","created_at":"2026-05-18T01:26:32.070579+00:00"},{"alias_kind":"pith_short_12","alias_value":"D6XHHQWD5IFU","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"D6XHHQWD5IFUXJCP","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"D6XHHQWD","created_at":"2026-05-18T12:27:40.988391+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/D6XHHQWD5IFUXJCPRV3ETBGIL2","json":"https://pith.science/pith/D6XHHQWD5IFUXJCPRV3ETBGIL2.json","graph_json":"https://pith.science/api/pith-number/D6XHHQWD5IFUXJCPRV3ETBGIL2/graph.json","events_json":"https://pith.science/api/pith-number/D6XHHQWD5IFUXJCPRV3ETBGIL2/events.json","paper":"https://pith.science/paper/D6XHHQWD"},"agent_actions":{"view_html":"https://pith.science/pith/D6XHHQWD5IFUXJCPRV3ETBGIL2","download_json":"https://pith.science/pith/D6XHHQWD5IFUXJCPRV3ETBGIL2.json","view_paper":"https://pith.science/paper/D6XHHQWD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.6205&json=true","fetch_graph":"https://pith.science/api/pith-number/D6XHHQWD5IFUXJCPRV3ETBGIL2/graph.json","fetch_events":"https://pith.science/api/pith-number/D6XHHQWD5IFUXJCPRV3ETBGIL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D6XHHQWD5IFUXJCPRV3ETBGIL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D6XHHQWD5IFUXJCPRV3ETBGIL2/action/storage_attestation","attest_author":"https://pith.science/pith/D6XHHQWD5IFUXJCPRV3ETBGIL2/action/author_attestation","sign_citation":"https://pith.science/pith/D6XHHQWD5IFUXJCPRV3ETBGIL2/action/citation_signature","submit_replication":"https://pith.science/pith/D6XHHQWD5IFUXJCPRV3ETBGIL2/action/replication_record"}},"created_at":"2026-05-18T01:26:32.070579+00:00","updated_at":"2026-05-18T01:26:32.070579+00:00"}