{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PUBERREDUO7FLVPQRDCRDP7XVM","short_pith_number":"pith:PUBERRED","canonical_record":{"source":{"id":"1504.05515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-21T17:23:06Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"2b28894d33132883a041c4235b7cb5ac4b44ea4ec65014e7bdddfb1a9fcaded2","abstract_canon_sha256":"372a533134c9cf86fe5c5343ca6dfa88fcf7ee0d28cc482e0bd8806f45e0f2b1"},"schema_version":"1.0"},"canonical_sha256":"7d0248c483a3be55d5f088c511bff7ab0218fa7ac40769f97fbac73fcb99a17f","source":{"kind":"arxiv","id":"1504.05515","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05515","created_at":"2026-05-18T01:02:49Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05515v2","created_at":"2026-05-18T01:02:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05515","created_at":"2026-05-18T01:02:49Z"},{"alias_kind":"pith_short_12","alias_value":"PUBERREDUO7F","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PUBERREDUO7FLVPQ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PUBERRED","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PUBERREDUO7FLVPQRDCRDP7XVM","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-21T17:23:06Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"2b28894d33132883a041c4235b7cb5ac4b44ea4ec65014e7bdddfb1a9fcaded2","abstract_canon_sha256":"372a533134c9cf86fe5c5343ca6dfa88fcf7ee0d28cc482e0bd8806f45e0f2b1"},"schema_version":"1.0"},"canonical_sha256":"7d0248c483a3be55d5f088c511bff7ab0218fa7ac40769f97fbac73fcb99a17f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:49.999561Z","signature_b64":"D36aEr8wG5NZ82ueRtAXPB2BLhQGWgeDXTiaVjS5u0fO538d5w1jZH6AnNEqwvNqe0ssk4QzPBTcbNmdlvkvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d0248c483a3be55d5f088c511bff7ab0218fa7ac40769f97fbac73fcb99a17f","last_reissued_at":"2026-05-18T01:02:49.999045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:49.999045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05515","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:02:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oyLT0la0xfjg9QMNB82Mb5kuxlKkaq5ohkNrwWjY/zqZkNyb6BboGBLJJWtreDo6Vm2r1xBjwYwk0eneKyCxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:56:57.257879Z"},"content_sha256":"8090a56a89e427befe2f6c58327e84ce671de1f067c8f37de2c0f7e87052ab9d","schema_version":"1.0","event_id":"sha256:8090a56a89e427befe2f6c58327e84ce671de1f067c8f37de2c0f7e87052ab9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PUBERREDUO7FLVPQRDCRDP7XVM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized complexity dichotomy for $(r,\\ell)$-Vertex Deletion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Ignasi Sau, Julien Baste, Luerbio Faria, Sulamita Klein","submitted_at":"2015-04-21T17:23:06Z","abstract_excerpt":"For two integers $r, \\ell \\geq 0$, a graph $G = (V, E)$ is an $(r,\\ell)$-graph if $V$ can be partitioned into $r$ independent sets and $\\ell$ cliques. In the parameterized $(r,\\ell)$-Vertex Deletion problem, given a graph $G$ and an integer $k$, one has to decide whether at most $k$ vertices can be removed from $G$ to obtain an $(r,\\ell)$-graph. This problem is NP-hard if $r+\\ell \\geq 1$ and encompasses several relevant problems such as Vertex Cover and Odd Cycle Transversal. The parameterized complexity of $(r,\\ell)$-Vertex Deletion was known for all values of $(r,\\ell)$ except for $(2,1)$, $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05515","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:02:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Upt2wP3rdkLpnSUGJ/6uOlCpA7uf5mLRXComR3jnyQxU7taKHoJVVYw02zlm4kZoD3FucNL9z88/uhy6HpF5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:56:57.258225Z"},"content_sha256":"ae2c9b37214459cc1b40919497f9d9c0bf1ef21d6dad06b42a8272baa102f530","schema_version":"1.0","event_id":"sha256:ae2c9b37214459cc1b40919497f9d9c0bf1ef21d6dad06b42a8272baa102f530"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PUBERREDUO7FLVPQRDCRDP7XVM/bundle.json","state_url":"https://pith.science/pith/PUBERREDUO7FLVPQRDCRDP7XVM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PUBERREDUO7FLVPQRDCRDP7XVM/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-03T13:56:57Z","links":{"resolver":"https://pith.science/pith/PUBERREDUO7FLVPQRDCRDP7XVM","bundle":"https://pith.science/pith/PUBERREDUO7FLVPQRDCRDP7XVM/bundle.json","state":"https://pith.science/pith/PUBERREDUO7FLVPQRDCRDP7XVM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PUBERREDUO7FLVPQRDCRDP7XVM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PUBERREDUO7FLVPQRDCRDP7XVM","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":"372a533134c9cf86fe5c5343ca6dfa88fcf7ee0d28cc482e0bd8806f45e0f2b1","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-21T17:23:06Z","title_canon_sha256":"2b28894d33132883a041c4235b7cb5ac4b44ea4ec65014e7bdddfb1a9fcaded2"},"schema_version":"1.0","source":{"id":"1504.05515","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05515","created_at":"2026-05-18T01:02:49Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05515v2","created_at":"2026-05-18T01:02:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05515","created_at":"2026-05-18T01:02:49Z"},{"alias_kind":"pith_short_12","alias_value":"PUBERREDUO7F","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PUBERREDUO7FLVPQ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PUBERRED","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:ae2c9b37214459cc1b40919497f9d9c0bf1ef21d6dad06b42a8272baa102f530","target":"graph","created_at":"2026-05-18T01:02:49Z","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":"For two integers $r, \\ell \\geq 0$, a graph $G = (V, E)$ is an $(r,\\ell)$-graph if $V$ can be partitioned into $r$ independent sets and $\\ell$ cliques. In the parameterized $(r,\\ell)$-Vertex Deletion problem, given a graph $G$ and an integer $k$, one has to decide whether at most $k$ vertices can be removed from $G$ to obtain an $(r,\\ell)$-graph. This problem is NP-hard if $r+\\ell \\geq 1$ and encompasses several relevant problems such as Vertex Cover and Odd Cycle Transversal. The parameterized complexity of $(r,\\ell)$-Vertex Deletion was known for all values of $(r,\\ell)$ except for $(2,1)$, $","authors_text":"Ignasi Sau, Julien Baste, Luerbio Faria, Sulamita Klein","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-21T17:23:06Z","title":"Parameterized complexity dichotomy for $(r,\\ell)$-Vertex Deletion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05515","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:8090a56a89e427befe2f6c58327e84ce671de1f067c8f37de2c0f7e87052ab9d","target":"record","created_at":"2026-05-18T01:02:49Z","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":"372a533134c9cf86fe5c5343ca6dfa88fcf7ee0d28cc482e0bd8806f45e0f2b1","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-21T17:23:06Z","title_canon_sha256":"2b28894d33132883a041c4235b7cb5ac4b44ea4ec65014e7bdddfb1a9fcaded2"},"schema_version":"1.0","source":{"id":"1504.05515","kind":"arxiv","version":2}},"canonical_sha256":"7d0248c483a3be55d5f088c511bff7ab0218fa7ac40769f97fbac73fcb99a17f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d0248c483a3be55d5f088c511bff7ab0218fa7ac40769f97fbac73fcb99a17f","first_computed_at":"2026-05-18T01:02:49.999045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:49.999045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D36aEr8wG5NZ82ueRtAXPB2BLhQGWgeDXTiaVjS5u0fO538d5w1jZH6AnNEqwvNqe0ssk4QzPBTcbNmdlvkvCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:49.999561Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05515","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8090a56a89e427befe2f6c58327e84ce671de1f067c8f37de2c0f7e87052ab9d","sha256:ae2c9b37214459cc1b40919497f9d9c0bf1ef21d6dad06b42a8272baa102f530"],"state_sha256":"b47be0636c501a1a9a28153bbfc4a0595c652bb7a6a46084ee9921d9bfcf6c2c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aphwzbZZjM00X7EtVNXrcEN6LurGoE1FolJX23u+GYkjT05Up7UPoKV/Am/hz/Gc1n9lyf60U6lP6MtlcjJ4AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T13:56:57.260135Z","bundle_sha256":"eea626127e9efa3a37998da075f5fd3a99a0f13327139422c164f842f8a60935"}}