{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:D6XHHQWD5IFUXJCPRV3ETBGIL2","short_pith_number":"pith:D6XHHQWD","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"},"canonical_sha256":"1fae73c2c3ea0b4ba44f8d764984c85eb9ed848cb99bf959714b37bcf6bd1437","source":{"kind":"arxiv","id":"1310.6205","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6205","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6205v2","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6205","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"D6XHHQWD5IFU","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"D6XHHQWD5IFUXJCP","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"D6XHHQWD","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:D6XHHQWD5IFUXJCPRV3ETBGIL2","target":"record","payload":{"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"},"canonical_sha256":"1fae73c2c3ea0b4ba44f8d764984c85eb9ed848cb99bf959714b37bcf6bd1437","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"},"source_kind":"arxiv","source_id":"1310.6205","source_version":2,"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-18T01:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qrj2S+T2bfJ/Bj8mx7tET/1GLPkkVXdpYMBNoHBiWin3vPy1YyychxrhQxrTnnbiAYg1q2AsUzicGl8RCWXYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:48:19.499800Z"},"content_sha256":"bea48c99f273b32b83c72b613967bc573dd530336c36e4072ccd1a8a20a9970d","schema_version":"1.0","event_id":"sha256:bea48c99f273b32b83c72b613967bc573dd530336c36e4072ccd1a8a20a9970d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:D6XHHQWD5IFUXJCPRV3ETBGIL2","target":"graph","payload":{"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"},"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-18T01:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"72SCSdRT40P1+T4eiyKF86LN9s+cyUhQ4vAKjPEvAGtSnI1/310aQgzSY+EHKHUD65kW0KdeupYc19kBxmKHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:48:19.500439Z"},"content_sha256":"a8371deb2604a4fb9331788a6cddf01a7135ccbb6a47731039442eab77bf7a76","schema_version":"1.0","event_id":"sha256:a8371deb2604a4fb9331788a6cddf01a7135ccbb6a47731039442eab77bf7a76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D6XHHQWD5IFUXJCPRV3ETBGIL2/bundle.json","state_url":"https://pith.science/pith/D6XHHQWD5IFUXJCPRV3ETBGIL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D6XHHQWD5IFUXJCPRV3ETBGIL2/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-06-05T18:48:19Z","links":{"resolver":"https://pith.science/pith/D6XHHQWD5IFUXJCPRV3ETBGIL2","bundle":"https://pith.science/pith/D6XHHQWD5IFUXJCPRV3ETBGIL2/bundle.json","state":"https://pith.science/pith/D6XHHQWD5IFUXJCPRV3ETBGIL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D6XHHQWD5IFUXJCPRV3ETBGIL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:D6XHHQWD5IFUXJCPRV3ETBGIL2","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":"81ef2bbd4993db39906d3946fcc331df8ea6f2abea5c09439ed89afb6d967c5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-10-23T12:36:51Z","title_canon_sha256":"02d127e53b74d36b55856849aded5429b6defe82cac6e87942ef9f2f3e887c24"},"schema_version":"1.0","source":{"id":"1310.6205","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6205","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6205v2","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6205","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"D6XHHQWD5IFU","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"D6XHHQWD5IFUXJCP","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"D6XHHQWD","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:a8371deb2604a4fb9331788a6cddf01a7135ccbb6a47731039442eab77bf7a76","target":"graph","created_at":"2026-05-18T01:26:32Z","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":"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","authors_text":"Kristina Vuskovi\\'c, Nicolas Trotignon, St\\'ephan Thomass\\'e","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-10-23T12:36:51Z","title":"Parameterized algorithm for weighted independent set problem in bull-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6205","kind":"arxiv","version":2},"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:bea48c99f273b32b83c72b613967bc573dd530336c36e4072ccd1a8a20a9970d","target":"record","created_at":"2026-05-18T01:26:32Z","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":"81ef2bbd4993db39906d3946fcc331df8ea6f2abea5c09439ed89afb6d967c5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-10-23T12:36:51Z","title_canon_sha256":"02d127e53b74d36b55856849aded5429b6defe82cac6e87942ef9f2f3e887c24"},"schema_version":"1.0","source":{"id":"1310.6205","kind":"arxiv","version":2}},"canonical_sha256":"1fae73c2c3ea0b4ba44f8d764984c85eb9ed848cb99bf959714b37bcf6bd1437","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1fae73c2c3ea0b4ba44f8d764984c85eb9ed848cb99bf959714b37bcf6bd1437","first_computed_at":"2026-05-18T01:26:32.070449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:32.070449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bXhp1yoFTRAJ7+3DGjLa33Pt4ougfWYHs8IRjgescJXnl+ZemD9rVJDtirJa2y0TDbn/EIGIPAZc2hoLJ+xWAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:32.071171Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.6205","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bea48c99f273b32b83c72b613967bc573dd530336c36e4072ccd1a8a20a9970d","sha256:a8371deb2604a4fb9331788a6cddf01a7135ccbb6a47731039442eab77bf7a76"],"state_sha256":"71b4e0e7e8a7e8d2839b8162cc18250de78fda5b5837905711312dea29b5917f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"58jn3niRbRCViEpXdkwBXKvAUXYvlkd/9f8nPL1Yqc1qh2G12WCPZ0uabj+m+KIrhtq5uQvAFO95+ne2XkqFAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T18:48:19.505246Z","bundle_sha256":"a70072ee28b52dd11d3d545990010e88b130402e77f1b27484fc0d2828b162cb"}}