{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PP3AJCPY4TC4QEGEZFGNGEGMRL","short_pith_number":"pith:PP3AJCPY","canonical_record":{"source":{"id":"1901.09434","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-27T20:20:07Z","cross_cats_sorted":[],"title_canon_sha256":"6361156787d1e61f9c209cfe1adbee5a26f212e36548d7ddab42ea264fe91a98","abstract_canon_sha256":"2a174ccc930b69bf4db6fd44cb4dfecb372e7baf49af5661c073fefdd3233fc9"},"schema_version":"1.0"},"canonical_sha256":"7bf60489f8e4c5c810c4c94cd310cc8ad81495dbb0bc9fc6e73fdddcfa4db067","source":{"kind":"arxiv","id":"1901.09434","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09434","created_at":"2026-05-17T23:55:02Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09434v2","created_at":"2026-05-17T23:55:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09434","created_at":"2026-05-17T23:55:02Z"},{"alias_kind":"pith_short_12","alias_value":"PP3AJCPY4TC4","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PP3AJCPY4TC4QEGE","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PP3AJCPY","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PP3AJCPY4TC4QEGEZFGNGEGMRL","target":"record","payload":{"canonical_record":{"source":{"id":"1901.09434","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-27T20:20:07Z","cross_cats_sorted":[],"title_canon_sha256":"6361156787d1e61f9c209cfe1adbee5a26f212e36548d7ddab42ea264fe91a98","abstract_canon_sha256":"2a174ccc930b69bf4db6fd44cb4dfecb372e7baf49af5661c073fefdd3233fc9"},"schema_version":"1.0"},"canonical_sha256":"7bf60489f8e4c5c810c4c94cd310cc8ad81495dbb0bc9fc6e73fdddcfa4db067","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:02.930066Z","signature_b64":"BNBMtmM5h6CkiLi6eGUnKqOP66ecB/N9H0NjDZXT3nXJyVXGX/w0VScLq0bQrUBonWQuJwqod9QT7ixoephLDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bf60489f8e4c5c810c4c94cd310cc8ad81495dbb0bc9fc6e73fdddcfa4db067","last_reissued_at":"2026-05-17T23:55:02.929601Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:02.929601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.09434","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-17T23:55:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RRVg4Sop39vS+HxRDwd6Kew7vOJETl6J5iLLbNSsd+ZnHYNPxEybzEzFb9BrjSoscWIbaV0izIjnQMkOhZ6ICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T03:08:55.875112Z"},"content_sha256":"04cfc1f0164b8e79def58b828befd26736b54dfbbe7efaa553f9937ca8b0f88a","schema_version":"1.0","event_id":"sha256:04cfc1f0164b8e79def58b828befd26736b54dfbbe7efaa553f9937ca8b0f88a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PP3AJCPY4TC4QEGEZFGNGEGMRL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Complexity of Safe Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hirotaka Ono, Ioannis Katsikarelis, Michael Lampis, R\\'emy Belmonte, Tesshu Hanaka, Yota Otachi","submitted_at":"2019-01-27T20:20:07Z","abstract_excerpt":"In this paper we study the problem of finding a small safe set $S$ in a graph $G$, i.e. a non-empty set of vertices such that no connected component of $G[S]$ is adjacent to a larger component in $G - S$. We enhance our understanding of the problem from the viewpoint of parameterized complexity by showing that (1) the problem is W[2]-hard when parameterized by the pathwidth $pw$ and cannot be solved in time $n^{o(pw)}$ unless the ETH is false, (2) it admits no polynomial kernel parameterized by the vertex cover number $vc$ unless $\\mathrm{PH} = \\Sigma^{\\mathrm{p}}_{3}$, but (3) it is fixed-par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09434","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-17T23:55:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gEPT//PJ/D0FYXp6Q0MH3Wpgzvt6+/JIeR9au0C9lDaMmtp0jMbHKc3PQRSvL8vxu+rTApgaGRsLb/bAO9B5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T03:08:55.875782Z"},"content_sha256":"1c8ebf30c0ca7cfe37b8edffff7bf3ef30f38b88b2ac29f2fe8c48581a32f3c0","schema_version":"1.0","event_id":"sha256:1c8ebf30c0ca7cfe37b8edffff7bf3ef30f38b88b2ac29f2fe8c48581a32f3c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PP3AJCPY4TC4QEGEZFGNGEGMRL/bundle.json","state_url":"https://pith.science/pith/PP3AJCPY4TC4QEGEZFGNGEGMRL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PP3AJCPY4TC4QEGEZFGNGEGMRL/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-05-22T03:08:55Z","links":{"resolver":"https://pith.science/pith/PP3AJCPY4TC4QEGEZFGNGEGMRL","bundle":"https://pith.science/pith/PP3AJCPY4TC4QEGEZFGNGEGMRL/bundle.json","state":"https://pith.science/pith/PP3AJCPY4TC4QEGEZFGNGEGMRL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PP3AJCPY4TC4QEGEZFGNGEGMRL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PP3AJCPY4TC4QEGEZFGNGEGMRL","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":"2a174ccc930b69bf4db6fd44cb4dfecb372e7baf49af5661c073fefdd3233fc9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-27T20:20:07Z","title_canon_sha256":"6361156787d1e61f9c209cfe1adbee5a26f212e36548d7ddab42ea264fe91a98"},"schema_version":"1.0","source":{"id":"1901.09434","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09434","created_at":"2026-05-17T23:55:02Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09434v2","created_at":"2026-05-17T23:55:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09434","created_at":"2026-05-17T23:55:02Z"},{"alias_kind":"pith_short_12","alias_value":"PP3AJCPY4TC4","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PP3AJCPY4TC4QEGE","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PP3AJCPY","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:1c8ebf30c0ca7cfe37b8edffff7bf3ef30f38b88b2ac29f2fe8c48581a32f3c0","target":"graph","created_at":"2026-05-17T23:55:02Z","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":"In this paper we study the problem of finding a small safe set $S$ in a graph $G$, i.e. a non-empty set of vertices such that no connected component of $G[S]$ is adjacent to a larger component in $G - S$. We enhance our understanding of the problem from the viewpoint of parameterized complexity by showing that (1) the problem is W[2]-hard when parameterized by the pathwidth $pw$ and cannot be solved in time $n^{o(pw)}$ unless the ETH is false, (2) it admits no polynomial kernel parameterized by the vertex cover number $vc$ unless $\\mathrm{PH} = \\Sigma^{\\mathrm{p}}_{3}$, but (3) it is fixed-par","authors_text":"Hirotaka Ono, Ioannis Katsikarelis, Michael Lampis, R\\'emy Belmonte, Tesshu Hanaka, Yota Otachi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-27T20:20:07Z","title":"Parameterized Complexity of Safe Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09434","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:04cfc1f0164b8e79def58b828befd26736b54dfbbe7efaa553f9937ca8b0f88a","target":"record","created_at":"2026-05-17T23:55:02Z","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":"2a174ccc930b69bf4db6fd44cb4dfecb372e7baf49af5661c073fefdd3233fc9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-27T20:20:07Z","title_canon_sha256":"6361156787d1e61f9c209cfe1adbee5a26f212e36548d7ddab42ea264fe91a98"},"schema_version":"1.0","source":{"id":"1901.09434","kind":"arxiv","version":2}},"canonical_sha256":"7bf60489f8e4c5c810c4c94cd310cc8ad81495dbb0bc9fc6e73fdddcfa4db067","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7bf60489f8e4c5c810c4c94cd310cc8ad81495dbb0bc9fc6e73fdddcfa4db067","first_computed_at":"2026-05-17T23:55:02.929601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:02.929601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BNBMtmM5h6CkiLi6eGUnKqOP66ecB/N9H0NjDZXT3nXJyVXGX/w0VScLq0bQrUBonWQuJwqod9QT7ixoephLDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:02.930066Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09434","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04cfc1f0164b8e79def58b828befd26736b54dfbbe7efaa553f9937ca8b0f88a","sha256:1c8ebf30c0ca7cfe37b8edffff7bf3ef30f38b88b2ac29f2fe8c48581a32f3c0"],"state_sha256":"8139d4d0e69accacd5ea64a6d82fdfe84c4215e69fc301748435dabd1572b9f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xyUEDXhGEj6bLI0YETJz7gGbPGmwZo8q5XX00bhrLotnpkLdUpeI1ymnJvVw3msEqwgAlrFgFeU9HALe9q1TCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T03:08:55.879874Z","bundle_sha256":"47f6272696c0f09c275ec3ed7d461adab130592dd279840ac528fe14c0eb6ec4"}}