{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:PMYTAFYLDXSVY5ZEQLFWOZSS3W","short_pith_number":"pith:PMYTAFYL","canonical_record":{"source":{"id":"2407.02086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-07-02T09:23:41Z","cross_cats_sorted":[],"title_canon_sha256":"148d3beacd253b054c6d1c68173d7e4ea82277515e9b03696979cbefdccda73b","abstract_canon_sha256":"522b124e8a7a7455f4f194a94747fb6aa67af832e4335d734bdb298665a4c348"},"schema_version":"1.0"},"canonical_sha256":"7b3130170b1de55c772482cb676652dd86a1cef899dd05e90cc4816e003493df","source":{"kind":"arxiv","id":"2407.02086","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.02086","created_at":"2026-07-05T08:39:09Z"},{"alias_kind":"arxiv_version","alias_value":"2407.02086v1","created_at":"2026-07-05T08:39:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.02086","created_at":"2026-07-05T08:39:09Z"},{"alias_kind":"pith_short_12","alias_value":"PMYTAFYLDXSV","created_at":"2026-07-05T08:39:09Z"},{"alias_kind":"pith_short_16","alias_value":"PMYTAFYLDXSVY5ZE","created_at":"2026-07-05T08:39:09Z"},{"alias_kind":"pith_short_8","alias_value":"PMYTAFYL","created_at":"2026-07-05T08:39:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:PMYTAFYLDXSVY5ZEQLFWOZSS3W","target":"record","payload":{"canonical_record":{"source":{"id":"2407.02086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-07-02T09:23:41Z","cross_cats_sorted":[],"title_canon_sha256":"148d3beacd253b054c6d1c68173d7e4ea82277515e9b03696979cbefdccda73b","abstract_canon_sha256":"522b124e8a7a7455f4f194a94747fb6aa67af832e4335d734bdb298665a4c348"},"schema_version":"1.0"},"canonical_sha256":"7b3130170b1de55c772482cb676652dd86a1cef899dd05e90cc4816e003493df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:39:09.918847Z","signature_b64":"r1NZZVXzcZCtlbeb6XY5dWRb6AV8gMwPOB26BhRQuAf4X5rOdUexS+4TEHDBi3h0fRUcKHKRyXRfhNVReo/kBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b3130170b1de55c772482cb676652dd86a1cef899dd05e90cc4816e003493df","last_reissued_at":"2026-07-05T08:39:09.918415Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:39:09.918415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.02086","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-07-05T08:39:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HhUCf7pyoOcfD6GLryZ8X1xSHfX9j/e6JxlBNwqLZekvTiHAa85Vgf51ZqGmeGi6iKzizFHKRUg6VyuIiAOqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:34:24.796069Z"},"content_sha256":"5cd3ae1532d0f036c62497c428df835bd7296b50e2139bedaeb4243c09f8809e","schema_version":"1.0","event_id":"sha256:5cd3ae1532d0f036c62497c428df835bd7296b50e2139bedaeb4243c09f8809e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:PMYTAFYLDXSVY5ZEQLFWOZSS3W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On polynomial kernelization for Stable Cutset","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Stefan Kratsch, Van Bang Le","submitted_at":"2024-07-02T09:23:41Z","abstract_excerpt":"A stable cutset in a graph $G$ is a set $S\\subseteq V(G)$ such that vertices of $S$ are pairwise non-adjacent and such that $G-S$ is disconnected, i.e., it is both stable (or independent) set and a cutset (or separator). Unlike general cutsets, it is $NP$-complete to determine whether a given graph $G$ has any stable cutset. Recently, Rauch et al.\\ [FCT 2023] gave a number of fixed-parameter tractable (FPT) algorithms, time $f(k)\\cdot |V(G)|^c$, for Stable Cutset under a variety of parameters $k$ such as the size of a (given) dominating set, the size of an odd cycle transversal, or the deletio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.02086","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.02086/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:39:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xze14GGNB2xb+j4JY4pzClglM+vyawyVPnAysRTuq5ylUJWwSshC2ryefxYzwW3r7nNWpffRSpyIsXlrPi9kDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:34:24.796989Z"},"content_sha256":"5bf94f28d940293250fcfbc957f4be66b56ba022fe7620a1f774b2741e868925","schema_version":"1.0","event_id":"sha256:5bf94f28d940293250fcfbc957f4be66b56ba022fe7620a1f774b2741e868925"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PMYTAFYLDXSVY5ZEQLFWOZSS3W/bundle.json","state_url":"https://pith.science/pith/PMYTAFYLDXSVY5ZEQLFWOZSS3W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PMYTAFYLDXSVY5ZEQLFWOZSS3W/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-08-14T06:34:24Z","links":{"resolver":"https://pith.science/pith/PMYTAFYLDXSVY5ZEQLFWOZSS3W","bundle":"https://pith.science/pith/PMYTAFYLDXSVY5ZEQLFWOZSS3W/bundle.json","state":"https://pith.science/pith/PMYTAFYLDXSVY5ZEQLFWOZSS3W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PMYTAFYLDXSVY5ZEQLFWOZSS3W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:PMYTAFYLDXSVY5ZEQLFWOZSS3W","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":"522b124e8a7a7455f4f194a94747fb6aa67af832e4335d734bdb298665a4c348","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-07-02T09:23:41Z","title_canon_sha256":"148d3beacd253b054c6d1c68173d7e4ea82277515e9b03696979cbefdccda73b"},"schema_version":"1.0","source":{"id":"2407.02086","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.02086","created_at":"2026-07-05T08:39:09Z"},{"alias_kind":"arxiv_version","alias_value":"2407.02086v1","created_at":"2026-07-05T08:39:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.02086","created_at":"2026-07-05T08:39:09Z"},{"alias_kind":"pith_short_12","alias_value":"PMYTAFYLDXSV","created_at":"2026-07-05T08:39:09Z"},{"alias_kind":"pith_short_16","alias_value":"PMYTAFYLDXSVY5ZE","created_at":"2026-07-05T08:39:09Z"},{"alias_kind":"pith_short_8","alias_value":"PMYTAFYL","created_at":"2026-07-05T08:39:09Z"}],"graph_snapshots":[{"event_id":"sha256:5bf94f28d940293250fcfbc957f4be66b56ba022fe7620a1f774b2741e868925","target":"graph","created_at":"2026-07-05T08:39:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.02086/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A stable cutset in a graph $G$ is a set $S\\subseteq V(G)$ such that vertices of $S$ are pairwise non-adjacent and such that $G-S$ is disconnected, i.e., it is both stable (or independent) set and a cutset (or separator). Unlike general cutsets, it is $NP$-complete to determine whether a given graph $G$ has any stable cutset. Recently, Rauch et al.\\ [FCT 2023] gave a number of fixed-parameter tractable (FPT) algorithms, time $f(k)\\cdot |V(G)|^c$, for Stable Cutset under a variety of parameters $k$ such as the size of a (given) dominating set, the size of an odd cycle transversal, or the deletio","authors_text":"Stefan Kratsch, Van Bang Le","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-07-02T09:23:41Z","title":"On polynomial kernelization for Stable Cutset"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.02086","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:5cd3ae1532d0f036c62497c428df835bd7296b50e2139bedaeb4243c09f8809e","target":"record","created_at":"2026-07-05T08:39:09Z","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":"522b124e8a7a7455f4f194a94747fb6aa67af832e4335d734bdb298665a4c348","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-07-02T09:23:41Z","title_canon_sha256":"148d3beacd253b054c6d1c68173d7e4ea82277515e9b03696979cbefdccda73b"},"schema_version":"1.0","source":{"id":"2407.02086","kind":"arxiv","version":1}},"canonical_sha256":"7b3130170b1de55c772482cb676652dd86a1cef899dd05e90cc4816e003493df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b3130170b1de55c772482cb676652dd86a1cef899dd05e90cc4816e003493df","first_computed_at":"2026-07-05T08:39:09.918415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:39:09.918415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r1NZZVXzcZCtlbeb6XY5dWRb6AV8gMwPOB26BhRQuAf4X5rOdUexS+4TEHDBi3h0fRUcKHKRyXRfhNVReo/kBw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:39:09.918847Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.02086","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cd3ae1532d0f036c62497c428df835bd7296b50e2139bedaeb4243c09f8809e","sha256:5bf94f28d940293250fcfbc957f4be66b56ba022fe7620a1f774b2741e868925"],"state_sha256":"709952aa5433904361d67f54ae83be654a84da1d913c8b09526f384fc7e8509e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0E7wnXmAqJUdEXp20/TQkZ+KjcN7OQuyLKsRehTm9yICbx3gX5O7Z7DxqPPVPGWZakagiBeQ4GlSRFKr0liSBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T06:34:24.804250Z","bundle_sha256":"cd346c3e55ad0040a0d00bc13a7520185089d4a079199b629f27f606913d7c30"}}