{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SAO5ZL3W3OCXYR6WY4SAUUW67M","short_pith_number":"pith:SAO5ZL3W","canonical_record":{"source":{"id":"1504.05905","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-22T17:59:22Z","cross_cats_sorted":[],"title_canon_sha256":"b87933e2f22ce0e0814076d9cb6374025b734839192bb4ecd944af34eef25d89","abstract_canon_sha256":"6047ca0a6c91e0ce7b6be959a19cc4ed172d57331c5655061861858cea5b0433"},"schema_version":"1.0"},"canonical_sha256":"901ddcaf76db857c47d6c7240a52defb26720af3962706c4b9e40155d15ed5c7","source":{"kind":"arxiv","id":"1504.05905","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05905","created_at":"2026-05-18T01:23:04Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05905v2","created_at":"2026-05-18T01:23:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05905","created_at":"2026-05-18T01:23:04Z"},{"alias_kind":"pith_short_12","alias_value":"SAO5ZL3W3OCX","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"SAO5ZL3W3OCXYR6W","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"SAO5ZL3W","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SAO5ZL3W3OCXYR6WY4SAUUW67M","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05905","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-22T17:59:22Z","cross_cats_sorted":[],"title_canon_sha256":"b87933e2f22ce0e0814076d9cb6374025b734839192bb4ecd944af34eef25d89","abstract_canon_sha256":"6047ca0a6c91e0ce7b6be959a19cc4ed172d57331c5655061861858cea5b0433"},"schema_version":"1.0"},"canonical_sha256":"901ddcaf76db857c47d6c7240a52defb26720af3962706c4b9e40155d15ed5c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:04.119260Z","signature_b64":"7CHTLHK89d11La3o20DbCZbnsVZT0J+lk5DimE5bgSvXJpO6dtHpAt2NH6srIzr8FnDwIPw8MdMUoBMHQPoOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"901ddcaf76db857c47d6c7240a52defb26720af3962706c4b9e40155d15ed5c7","last_reissued_at":"2026-05-18T01:23:04.118630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:04.118630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05905","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:23:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fFtmU9efBLYWrtDu/5jEMb2XjoFF8pdHEAtG4bQIvrEpECinIvYYtDiIW95LFvbuFYtPtMu5Xjb9wepYf8lsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:55:05.249919Z"},"content_sha256":"5136a5edbcef2b331799f0de700a94ac8e6efdeced9b5b988b6b042aee901d38","schema_version":"1.0","event_id":"sha256:5136a5edbcef2b331799f0de700a94ac8e6efdeced9b5b988b6b042aee901d38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SAO5ZL3W3OCXYR6WY4SAUUW67M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An FPT algorithm and a polynomial kernel for Linear Rankwidth-1 Vertex Deletion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christophe Paul, Eun Jung Kim, Mamadou Moustapha Kant\\'e, O-joung Kwon","submitted_at":"2015-04-22T17:59:22Z","abstract_excerpt":"Linear rankwidth is a linearized variant of rankwidth, introduced by Oum and Seymour [Approximating clique-width and branch-width. J. Combin. Theory Ser. B, 96(4):514--528, 2006]. Motivated from recent development on graph modification problems regarding classes of graphs of bounded treewidth or pathwidth, we study the Linear Rankwidth-1 Vertex Deletion problem (shortly, LRW1-Vertex Deletion). In the LRW1-Vertex Deletion problem, given an $n$-vertex graph $G$ and a positive integer $k$, we want to decide whether there is a set of at most $k$ vertices whose removal turns $G$ into a graph of lin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05905","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:23:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s+FA1FusopjLqDsWX/BvSNvAnrkPw1E5OGCYhQSAijGI+j71eZyt4mUzT4iaiIw3kDZ+82NeolI0SAvskxcADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:55:05.250525Z"},"content_sha256":"6d4f97b892f3fbea8c5d062ff29c6b57447178dc514213853974e7b0e2f38049","schema_version":"1.0","event_id":"sha256:6d4f97b892f3fbea8c5d062ff29c6b57447178dc514213853974e7b0e2f38049"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SAO5ZL3W3OCXYR6WY4SAUUW67M/bundle.json","state_url":"https://pith.science/pith/SAO5ZL3W3OCXYR6WY4SAUUW67M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SAO5ZL3W3OCXYR6WY4SAUUW67M/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-28T07:55:05Z","links":{"resolver":"https://pith.science/pith/SAO5ZL3W3OCXYR6WY4SAUUW67M","bundle":"https://pith.science/pith/SAO5ZL3W3OCXYR6WY4SAUUW67M/bundle.json","state":"https://pith.science/pith/SAO5ZL3W3OCXYR6WY4SAUUW67M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SAO5ZL3W3OCXYR6WY4SAUUW67M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SAO5ZL3W3OCXYR6WY4SAUUW67M","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":"6047ca0a6c91e0ce7b6be959a19cc4ed172d57331c5655061861858cea5b0433","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-22T17:59:22Z","title_canon_sha256":"b87933e2f22ce0e0814076d9cb6374025b734839192bb4ecd944af34eef25d89"},"schema_version":"1.0","source":{"id":"1504.05905","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05905","created_at":"2026-05-18T01:23:04Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05905v2","created_at":"2026-05-18T01:23:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05905","created_at":"2026-05-18T01:23:04Z"},{"alias_kind":"pith_short_12","alias_value":"SAO5ZL3W3OCX","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"SAO5ZL3W3OCXYR6W","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"SAO5ZL3W","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:6d4f97b892f3fbea8c5d062ff29c6b57447178dc514213853974e7b0e2f38049","target":"graph","created_at":"2026-05-18T01:23:04Z","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":"Linear rankwidth is a linearized variant of rankwidth, introduced by Oum and Seymour [Approximating clique-width and branch-width. J. Combin. Theory Ser. B, 96(4):514--528, 2006]. Motivated from recent development on graph modification problems regarding classes of graphs of bounded treewidth or pathwidth, we study the Linear Rankwidth-1 Vertex Deletion problem (shortly, LRW1-Vertex Deletion). In the LRW1-Vertex Deletion problem, given an $n$-vertex graph $G$ and a positive integer $k$, we want to decide whether there is a set of at most $k$ vertices whose removal turns $G$ into a graph of lin","authors_text":"Christophe Paul, Eun Jung Kim, Mamadou Moustapha Kant\\'e, O-joung Kwon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-22T17:59:22Z","title":"An FPT algorithm and a polynomial kernel for Linear Rankwidth-1 Vertex Deletion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05905","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:5136a5edbcef2b331799f0de700a94ac8e6efdeced9b5b988b6b042aee901d38","target":"record","created_at":"2026-05-18T01:23:04Z","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":"6047ca0a6c91e0ce7b6be959a19cc4ed172d57331c5655061861858cea5b0433","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-22T17:59:22Z","title_canon_sha256":"b87933e2f22ce0e0814076d9cb6374025b734839192bb4ecd944af34eef25d89"},"schema_version":"1.0","source":{"id":"1504.05905","kind":"arxiv","version":2}},"canonical_sha256":"901ddcaf76db857c47d6c7240a52defb26720af3962706c4b9e40155d15ed5c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"901ddcaf76db857c47d6c7240a52defb26720af3962706c4b9e40155d15ed5c7","first_computed_at":"2026-05-18T01:23:04.118630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:04.118630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7CHTLHK89d11La3o20DbCZbnsVZT0J+lk5DimE5bgSvXJpO6dtHpAt2NH6srIzr8FnDwIPw8MdMUoBMHQPoOBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:04.119260Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05905","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5136a5edbcef2b331799f0de700a94ac8e6efdeced9b5b988b6b042aee901d38","sha256:6d4f97b892f3fbea8c5d062ff29c6b57447178dc514213853974e7b0e2f38049"],"state_sha256":"d1ad2554f2419897d172ffa1083bbd0b3bc8d8723da0cf2b8763e54422f25659"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rGpf4exHbXvROm9K62gYlCQziyTaSGE7Di65qUV8CHonMXnPgcT/Q+bqCvCL6gedHXi+8zF1zlDM3PD3vX1tDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:55:05.253615Z","bundle_sha256":"52d9fa5e466e8895cb029688d4acf14f9b7900c4a3acf8fa8aca83a25255df4d"}}