{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MBFCVWKBMODDX5A6RPFKDOPD7K","short_pith_number":"pith:MBFCVWKB","canonical_record":{"source":{"id":"1707.04251","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2017-07-12T18:13:31Z","cross_cats_sorted":[],"title_canon_sha256":"15f19c636a22917bfc6ada3148236b0488466f07541da1dbb947b30da5670868","abstract_canon_sha256":"82270f7a91c23e0ffd528d23361347520b101914d61702560a7a0a3ddc2330fd"},"schema_version":"1.0"},"canonical_sha256":"604a2ad94163863bf41e8bcaa1b9e3fa96d6a0d4225e433c7d4b6b983bd349e9","source":{"kind":"arxiv","id":"1707.04251","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04251","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04251v1","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04251","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"MBFCVWKBMODD","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MBFCVWKBMODDX5A6","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MBFCVWKB","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MBFCVWKBMODDX5A6RPFKDOPD7K","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04251","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2017-07-12T18:13:31Z","cross_cats_sorted":[],"title_canon_sha256":"15f19c636a22917bfc6ada3148236b0488466f07541da1dbb947b30da5670868","abstract_canon_sha256":"82270f7a91c23e0ffd528d23361347520b101914d61702560a7a0a3ddc2330fd"},"schema_version":"1.0"},"canonical_sha256":"604a2ad94163863bf41e8bcaa1b9e3fa96d6a0d4225e433c7d4b6b983bd349e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:18.852149Z","signature_b64":"p4XzVaSe2wQTOWgzhp9EiPXuoaoWC3IErTZ+oNlzaze23Cjt26G2VQ/hv623HowxC69sBeZPRN+7YL3RBSRJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"604a2ad94163863bf41e8bcaa1b9e3fa96d6a0d4225e433c7d4b6b983bd349e9","last_reissued_at":"2026-05-18T00:40:18.851521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:18.851521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04251","source_version":1,"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-18T00:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VzU+raQYoNoclaxE8Z0olOavdjwONIRnEM+QdvV06vWVik5WvXsmjMe17hNtKw9BfWJAx/F5s4j7Ms22sgk1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:37:52.406544Z"},"content_sha256":"2cbb335720837026e484b878462751e21efd7e7bfc9a9cc5a8c48bbecf7303e6","schema_version":"1.0","event_id":"sha256:2cbb335720837026e484b878462751e21efd7e7bfc9a9cc5a8c48bbecf7303e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MBFCVWKBMODDX5A6RPFKDOPD7K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Defensive Alliances in Graphs of Bounded Treewidth","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bernhard Bliem, Stefan Woltran","submitted_at":"2017-07-12T18:13:31Z","abstract_excerpt":"A set S of vertices of a graph is a defensive alliance if, for each element of S, the majority of its neighbors is in S. The problem of finding a defensive alliance of minimum size in a given graph is NP-hard and there are polynomial-time algorithms if certain parameters are bounded by a fixed constant. In particular, fixed-parameter tractability results have been obtained for some structural parameters such as the vertex cover number. However, for the parameter treewidth, the question of whether the problem is FPT has remained open. This is unfortunate because treewidth is perhaps the most pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04251","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"},"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-18T00:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZvBlUG0PQMPXeueFfEsmWHDlCEUFhap1v5GHbBWoqdiUFG7QFOhte9aBF8bG7dNZWiZlaeSCAd/8tyhSdWVKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:37:52.407237Z"},"content_sha256":"679ebcf8de8942a0986b1e9f8cde313a7af0c88a07ee4f18adb81691fd6bbcbb","schema_version":"1.0","event_id":"sha256:679ebcf8de8942a0986b1e9f8cde313a7af0c88a07ee4f18adb81691fd6bbcbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBFCVWKBMODDX5A6RPFKDOPD7K/bundle.json","state_url":"https://pith.science/pith/MBFCVWKBMODDX5A6RPFKDOPD7K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBFCVWKBMODDX5A6RPFKDOPD7K/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-05T03:37:52Z","links":{"resolver":"https://pith.science/pith/MBFCVWKBMODDX5A6RPFKDOPD7K","bundle":"https://pith.science/pith/MBFCVWKBMODDX5A6RPFKDOPD7K/bundle.json","state":"https://pith.science/pith/MBFCVWKBMODDX5A6RPFKDOPD7K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBFCVWKBMODDX5A6RPFKDOPD7K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MBFCVWKBMODDX5A6RPFKDOPD7K","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":"82270f7a91c23e0ffd528d23361347520b101914d61702560a7a0a3ddc2330fd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2017-07-12T18:13:31Z","title_canon_sha256":"15f19c636a22917bfc6ada3148236b0488466f07541da1dbb947b30da5670868"},"schema_version":"1.0","source":{"id":"1707.04251","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04251","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04251v1","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04251","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"MBFCVWKBMODD","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MBFCVWKBMODDX5A6","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MBFCVWKB","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:679ebcf8de8942a0986b1e9f8cde313a7af0c88a07ee4f18adb81691fd6bbcbb","target":"graph","created_at":"2026-05-18T00:40:18Z","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":"A set S of vertices of a graph is a defensive alliance if, for each element of S, the majority of its neighbors is in S. The problem of finding a defensive alliance of minimum size in a given graph is NP-hard and there are polynomial-time algorithms if certain parameters are bounded by a fixed constant. In particular, fixed-parameter tractability results have been obtained for some structural parameters such as the vertex cover number. However, for the parameter treewidth, the question of whether the problem is FPT has remained open. This is unfortunate because treewidth is perhaps the most pr","authors_text":"Bernhard Bliem, Stefan Woltran","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2017-07-12T18:13:31Z","title":"Defensive Alliances in Graphs of Bounded Treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04251","kind":"arxiv","version":1},"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:2cbb335720837026e484b878462751e21efd7e7bfc9a9cc5a8c48bbecf7303e6","target":"record","created_at":"2026-05-18T00:40:18Z","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":"82270f7a91c23e0ffd528d23361347520b101914d61702560a7a0a3ddc2330fd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2017-07-12T18:13:31Z","title_canon_sha256":"15f19c636a22917bfc6ada3148236b0488466f07541da1dbb947b30da5670868"},"schema_version":"1.0","source":{"id":"1707.04251","kind":"arxiv","version":1}},"canonical_sha256":"604a2ad94163863bf41e8bcaa1b9e3fa96d6a0d4225e433c7d4b6b983bd349e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"604a2ad94163863bf41e8bcaa1b9e3fa96d6a0d4225e433c7d4b6b983bd349e9","first_computed_at":"2026-05-18T00:40:18.851521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:18.851521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p4XzVaSe2wQTOWgzhp9EiPXuoaoWC3IErTZ+oNlzaze23Cjt26G2VQ/hv623HowxC69sBeZPRN+7YL3RBSRJDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:18.852149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04251","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2cbb335720837026e484b878462751e21efd7e7bfc9a9cc5a8c48bbecf7303e6","sha256:679ebcf8de8942a0986b1e9f8cde313a7af0c88a07ee4f18adb81691fd6bbcbb"],"state_sha256":"5eff07707388bd3e796726fc9adfc1eb71782e39c799c83952117dc56422fb47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HKB2t77pITz8qd8PUpkFpeW01yL2ggGIRmkwVVInoOyWeru35dyw3FCXzKFeXUJ6f8Ad2fW9oi7J3N7PI1ayCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:37:52.411351Z","bundle_sha256":"bbd68be2cade9dea2208a54ff004a704c3f33f8494b79da88d2858dabf45e885"}}