{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:U5RJYDDOF576SJJMHIHAS446OS","short_pith_number":"pith:U5RJYDDO","canonical_record":{"source":{"id":"1504.08120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-30T08:45:19Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"35c23b43384dad286196ec9a932aa8c5fa4ead90d448e3058e3bfa8b40fa75b3","abstract_canon_sha256":"60703b88e1ca8cd80249f39c97d308457dd2e81725b328f7abd01d257e80132a"},"schema_version":"1.0"},"canonical_sha256":"a7629c0c6e2f7fe9252c3a0e09739e74bb90b8dd9db8d5cc00bba3a3bb09398d","source":{"kind":"arxiv","id":"1504.08120","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.08120","created_at":"2026-05-18T02:17:10Z"},{"alias_kind":"arxiv_version","alias_value":"1504.08120v1","created_at":"2026-05-18T02:17:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08120","created_at":"2026-05-18T02:17:10Z"},{"alias_kind":"pith_short_12","alias_value":"U5RJYDDOF576","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"U5RJYDDOF576SJJM","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"U5RJYDDO","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:U5RJYDDOF576SJJMHIHAS446OS","target":"record","payload":{"canonical_record":{"source":{"id":"1504.08120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-30T08:45:19Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"35c23b43384dad286196ec9a932aa8c5fa4ead90d448e3058e3bfa8b40fa75b3","abstract_canon_sha256":"60703b88e1ca8cd80249f39c97d308457dd2e81725b328f7abd01d257e80132a"},"schema_version":"1.0"},"canonical_sha256":"a7629c0c6e2f7fe9252c3a0e09739e74bb90b8dd9db8d5cc00bba3a3bb09398d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:10.681480Z","signature_b64":"i6PZ779XjG1lzf1ZSfZkbpiH1Kk3RYN7SicMTo3OfVPsFA2NvWIqGGf/Roe5gHG99EAOFU/UkQRY8ffgmSGLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7629c0c6e2f7fe9252c3a0e09739e74bb90b8dd9db8d5cc00bba3a3bb09398d","last_reissued_at":"2026-05-18T02:17:10.680842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:10.680842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.08120","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-18T02:17:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DZoc1S5eTyhSnM5MwM4ujoeiK/GMBfCowOk00ngey5dmNPDJ6avSeyVxSGv1uc5dAySdzvGP5xQDiN3T0qL5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:41:15.152725Z"},"content_sha256":"ac5625e1ae5d1da0396d02607b842a0ac0df0dc49ad3ee6dd0bdc4819820d86a","schema_version":"1.0","event_id":"sha256:ac5625e1ae5d1da0396d02607b842a0ac0df0dc49ad3ee6dd0bdc4819820d86a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:U5RJYDDOF576SJJMHIHAS446OS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Algorithms for Deletion to (r,l)-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Fahad Panolan, Sudeshna Kolay","submitted_at":"2015-04-30T08:45:19Z","abstract_excerpt":"For fixed integers $r,\\ell \\geq 0$, a graph $G$ is called an {\\em $(r,\\ell)$-graph} if the vertex set $V(G)$ can be partitioned into $r$ independent sets and $\\ell$ cliques. This brings us to the following natural parameterized questions: {\\sc Vertex $(r,\\ell)$-Partization} and {\\sc Edge $(r,\\ell)$-Partization}. An input to these problems consist of a graph $G$ and a positive integer $k$ and the objective is to decide whether there exists a set $S\\subseteq V(G)$ ($S\\subseteq E(G)$) such that the deletion of $S$ from $G$ results in an $(r,\\ell)$-graph. These problems generalize well studied pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08120","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-18T02:17:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ae++D1jdvQPgWucglr2Dqs5yqRSkxy+HdoidDl/5/T8pmx3hibsfwEstZm1rAWrgVWvP0NR0pPe6zIFXwY0IAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:41:15.153476Z"},"content_sha256":"d911707ecf384bfabbb0e5552edbf807cd41a1dde89b71943e05190d3c08f5f3","schema_version":"1.0","event_id":"sha256:d911707ecf384bfabbb0e5552edbf807cd41a1dde89b71943e05190d3c08f5f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U5RJYDDOF576SJJMHIHAS446OS/bundle.json","state_url":"https://pith.science/pith/U5RJYDDOF576SJJMHIHAS446OS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U5RJYDDOF576SJJMHIHAS446OS/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-30T17:41:15Z","links":{"resolver":"https://pith.science/pith/U5RJYDDOF576SJJMHIHAS446OS","bundle":"https://pith.science/pith/U5RJYDDOF576SJJMHIHAS446OS/bundle.json","state":"https://pith.science/pith/U5RJYDDOF576SJJMHIHAS446OS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U5RJYDDOF576SJJMHIHAS446OS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:U5RJYDDOF576SJJMHIHAS446OS","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":"60703b88e1ca8cd80249f39c97d308457dd2e81725b328f7abd01d257e80132a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-30T08:45:19Z","title_canon_sha256":"35c23b43384dad286196ec9a932aa8c5fa4ead90d448e3058e3bfa8b40fa75b3"},"schema_version":"1.0","source":{"id":"1504.08120","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.08120","created_at":"2026-05-18T02:17:10Z"},{"alias_kind":"arxiv_version","alias_value":"1504.08120v1","created_at":"2026-05-18T02:17:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08120","created_at":"2026-05-18T02:17:10Z"},{"alias_kind":"pith_short_12","alias_value":"U5RJYDDOF576","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"U5RJYDDOF576SJJM","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"U5RJYDDO","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:d911707ecf384bfabbb0e5552edbf807cd41a1dde89b71943e05190d3c08f5f3","target":"graph","created_at":"2026-05-18T02:17:10Z","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 fixed integers $r,\\ell \\geq 0$, a graph $G$ is called an {\\em $(r,\\ell)$-graph} if the vertex set $V(G)$ can be partitioned into $r$ independent sets and $\\ell$ cliques. This brings us to the following natural parameterized questions: {\\sc Vertex $(r,\\ell)$-Partization} and {\\sc Edge $(r,\\ell)$-Partization}. An input to these problems consist of a graph $G$ and a positive integer $k$ and the objective is to decide whether there exists a set $S\\subseteq V(G)$ ($S\\subseteq E(G)$) such that the deletion of $S$ from $G$ results in an $(r,\\ell)$-graph. These problems generalize well studied pro","authors_text":"Fahad Panolan, Sudeshna Kolay","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-30T08:45:19Z","title":"Parameterized Algorithms for Deletion to (r,l)-graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08120","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:ac5625e1ae5d1da0396d02607b842a0ac0df0dc49ad3ee6dd0bdc4819820d86a","target":"record","created_at":"2026-05-18T02:17:10Z","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":"60703b88e1ca8cd80249f39c97d308457dd2e81725b328f7abd01d257e80132a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-30T08:45:19Z","title_canon_sha256":"35c23b43384dad286196ec9a932aa8c5fa4ead90d448e3058e3bfa8b40fa75b3"},"schema_version":"1.0","source":{"id":"1504.08120","kind":"arxiv","version":1}},"canonical_sha256":"a7629c0c6e2f7fe9252c3a0e09739e74bb90b8dd9db8d5cc00bba3a3bb09398d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7629c0c6e2f7fe9252c3a0e09739e74bb90b8dd9db8d5cc00bba3a3bb09398d","first_computed_at":"2026-05-18T02:17:10.680842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:10.680842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i6PZ779XjG1lzf1ZSfZkbpiH1Kk3RYN7SicMTo3OfVPsFA2NvWIqGGf/Roe5gHG99EAOFU/UkQRY8ffgmSGLBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:10.681480Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.08120","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac5625e1ae5d1da0396d02607b842a0ac0df0dc49ad3ee6dd0bdc4819820d86a","sha256:d911707ecf384bfabbb0e5552edbf807cd41a1dde89b71943e05190d3c08f5f3"],"state_sha256":"d56914cfbb3491591fbe03efc4a3a1866123a2402e8af9f2e6a8ba7cf72ab1cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v8VU2ggoIDlnbGcr4W67Vp3vV4XB5KuVjAuuaKVZjpvtuRmASNCqzWe5QklrPzqfI2zpkwMRd1WGXH1oJRkXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:41:15.158069Z","bundle_sha256":"102263bab86d008470c3d0b4015f0fda1be7e99767c00e981d84b423c4798028"}}