{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:T2DOC2UTLVO5U5NA5VWUC5GX24","short_pith_number":"pith:T2DOC2UT","canonical_record":{"source":{"id":"1507.05463","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-20T12:17:26Z","cross_cats_sorted":[],"title_canon_sha256":"f77865b2f661a12260c02cd65c619adbd50ea450946641ddc053c8ad9c6bd31f","abstract_canon_sha256":"34211cd6e2f14096c53062dd2e29172c0050d5c66b9b2af6db2936545011491d"},"schema_version":"1.0"},"canonical_sha256":"9e86e16a935d5dda75a0ed6d4174d7d71abbbc868515f9f0679035979b00737c","source":{"kind":"arxiv","id":"1507.05463","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05463","created_at":"2026-05-18T01:36:36Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05463v1","created_at":"2026-05-18T01:36:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05463","created_at":"2026-05-18T01:36:36Z"},{"alias_kind":"pith_short_12","alias_value":"T2DOC2UTLVO5","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T2DOC2UTLVO5U5NA","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T2DOC2UT","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:T2DOC2UTLVO5U5NA5VWUC5GX24","target":"record","payload":{"canonical_record":{"source":{"id":"1507.05463","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-20T12:17:26Z","cross_cats_sorted":[],"title_canon_sha256":"f77865b2f661a12260c02cd65c619adbd50ea450946641ddc053c8ad9c6bd31f","abstract_canon_sha256":"34211cd6e2f14096c53062dd2e29172c0050d5c66b9b2af6db2936545011491d"},"schema_version":"1.0"},"canonical_sha256":"9e86e16a935d5dda75a0ed6d4174d7d71abbbc868515f9f0679035979b00737c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:36.736812Z","signature_b64":"xeU5fKJcHJ5gGO8lAs8Wv8losekpwbL3r/Vu0vpyrKB3aLFKHVwzO3wAJcropznZ5pj0aSLirbBNX/iQsIFuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e86e16a935d5dda75a0ed6d4174d7d71abbbc868515f9f0679035979b00737c","last_reissued_at":"2026-05-18T01:36:36.736112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:36.736112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.05463","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-18T01:36:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FfORH/pk9n4CzgcM6F60rSPKCmW8Bjv0R7Y4fkIruBd7GdIgQBJg0bVul/Qog2I0hKZYhh4UEnBkld46tkNaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:59:11.655412Z"},"content_sha256":"94d7ea77d0bd656cac7464ad3455ccd7ba803eec97ff0ea9b5177f44c9b1de3b","schema_version":"1.0","event_id":"sha256:94d7ea77d0bd656cac7464ad3455ccd7ba803eec97ff0ea9b5177f44c9b1de3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:T2DOC2UTLVO5U5NA5VWUC5GX24","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Problems on Graphs of High Rank-Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eduard Eiben, Robert Ganian, Stefan Szeider","submitted_at":"2015-07-20T12:17:26Z","abstract_excerpt":"A modulator of a graph G to a specified graph class H is a set of vertices whose deletion puts G into H. The cardinality of a modulator to various tractable graph classes has long been used as a structural parameter which can be exploited to obtain FPT algorithms for a range of hard problems. Here we investigate what happens when a graph contains a modulator which is large but \"well-structured\" (in the sense of having bounded rank-width). Can such modulators still be exploited to obtain efficient algorithms? And is it even possible to find such modulators efficiently?\n  We first show that the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05463","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-18T01:36:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YoFqcSTuqBfgeZrtKt0CJ4KoEq+I1tAewHbNuNubcPpJZBk7tXOiqNXUQ9B/8xy7Fxgl5mo4RFg3o3FZiSYODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:59:11.655771Z"},"content_sha256":"d5de66635ce5eb43ee33a6edc674b26f5c1f0bcf8be96095cc3dc7208403fc9a","schema_version":"1.0","event_id":"sha256:d5de66635ce5eb43ee33a6edc674b26f5c1f0bcf8be96095cc3dc7208403fc9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T2DOC2UTLVO5U5NA5VWUC5GX24/bundle.json","state_url":"https://pith.science/pith/T2DOC2UTLVO5U5NA5VWUC5GX24/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T2DOC2UTLVO5U5NA5VWUC5GX24/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-28T21:59:11Z","links":{"resolver":"https://pith.science/pith/T2DOC2UTLVO5U5NA5VWUC5GX24","bundle":"https://pith.science/pith/T2DOC2UTLVO5U5NA5VWUC5GX24/bundle.json","state":"https://pith.science/pith/T2DOC2UTLVO5U5NA5VWUC5GX24/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T2DOC2UTLVO5U5NA5VWUC5GX24/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:T2DOC2UTLVO5U5NA5VWUC5GX24","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":"34211cd6e2f14096c53062dd2e29172c0050d5c66b9b2af6db2936545011491d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-20T12:17:26Z","title_canon_sha256":"f77865b2f661a12260c02cd65c619adbd50ea450946641ddc053c8ad9c6bd31f"},"schema_version":"1.0","source":{"id":"1507.05463","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05463","created_at":"2026-05-18T01:36:36Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05463v1","created_at":"2026-05-18T01:36:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05463","created_at":"2026-05-18T01:36:36Z"},{"alias_kind":"pith_short_12","alias_value":"T2DOC2UTLVO5","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T2DOC2UTLVO5U5NA","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T2DOC2UT","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:d5de66635ce5eb43ee33a6edc674b26f5c1f0bcf8be96095cc3dc7208403fc9a","target":"graph","created_at":"2026-05-18T01:36:36Z","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 modulator of a graph G to a specified graph class H is a set of vertices whose deletion puts G into H. The cardinality of a modulator to various tractable graph classes has long been used as a structural parameter which can be exploited to obtain FPT algorithms for a range of hard problems. Here we investigate what happens when a graph contains a modulator which is large but \"well-structured\" (in the sense of having bounded rank-width). Can such modulators still be exploited to obtain efficient algorithms? And is it even possible to find such modulators efficiently?\n  We first show that the ","authors_text":"Eduard Eiben, Robert Ganian, Stefan Szeider","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-20T12:17:26Z","title":"Solving Problems on Graphs of High Rank-Width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05463","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:94d7ea77d0bd656cac7464ad3455ccd7ba803eec97ff0ea9b5177f44c9b1de3b","target":"record","created_at":"2026-05-18T01:36:36Z","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":"34211cd6e2f14096c53062dd2e29172c0050d5c66b9b2af6db2936545011491d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-20T12:17:26Z","title_canon_sha256":"f77865b2f661a12260c02cd65c619adbd50ea450946641ddc053c8ad9c6bd31f"},"schema_version":"1.0","source":{"id":"1507.05463","kind":"arxiv","version":1}},"canonical_sha256":"9e86e16a935d5dda75a0ed6d4174d7d71abbbc868515f9f0679035979b00737c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e86e16a935d5dda75a0ed6d4174d7d71abbbc868515f9f0679035979b00737c","first_computed_at":"2026-05-18T01:36:36.736112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:36.736112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xeU5fKJcHJ5gGO8lAs8Wv8losekpwbL3r/Vu0vpyrKB3aLFKHVwzO3wAJcropznZ5pj0aSLirbBNX/iQsIFuDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:36.736812Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05463","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94d7ea77d0bd656cac7464ad3455ccd7ba803eec97ff0ea9b5177f44c9b1de3b","sha256:d5de66635ce5eb43ee33a6edc674b26f5c1f0bcf8be96095cc3dc7208403fc9a"],"state_sha256":"7af8ae15a9e8fd4887fe414049f6fd3665acd564d543818615eb640faa7f846a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d6NM4+friLSpq0HyqCoNv47S2s9rZ1lbYp5FEDL1EjVg3HN3/wg5+Z/D5jsblfo2PvNNZeD2LFOSBdQdGjQVCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:59:11.658131Z","bundle_sha256":"caf850db7e098f3ef94d3042ae375420c1ab8c38f8edb5428b0a64cc6949b684"}}