{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4SYPFZDRLJW7VYIHMEL6LECIRC","short_pith_number":"pith:4SYPFZDR","canonical_record":{"source":{"id":"1510.08154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-28T01:37:26Z","cross_cats_sorted":[],"title_canon_sha256":"33bfc00b8d42c8719a713d553018f98ed81c9e041527e38f93c806c8a14e6298","abstract_canon_sha256":"23f460330f451448dbe5e6f8fa4019faa44ec5a1a6681f3f33014ce75c52ae41"},"schema_version":"1.0"},"canonical_sha256":"e4b0f2e4715a6dfae1076117e5904888a86a8f76e32c556724e0b1acc2c834f3","source":{"kind":"arxiv","id":"1510.08154","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08154","created_at":"2026-05-18T01:28:37Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08154v1","created_at":"2026-05-18T01:28:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08154","created_at":"2026-05-18T01:28:37Z"},{"alias_kind":"pith_short_12","alias_value":"4SYPFZDRLJW7","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4SYPFZDRLJW7VYIH","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4SYPFZDR","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4SYPFZDRLJW7VYIHMEL6LECIRC","target":"record","payload":{"canonical_record":{"source":{"id":"1510.08154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-28T01:37:26Z","cross_cats_sorted":[],"title_canon_sha256":"33bfc00b8d42c8719a713d553018f98ed81c9e041527e38f93c806c8a14e6298","abstract_canon_sha256":"23f460330f451448dbe5e6f8fa4019faa44ec5a1a6681f3f33014ce75c52ae41"},"schema_version":"1.0"},"canonical_sha256":"e4b0f2e4715a6dfae1076117e5904888a86a8f76e32c556724e0b1acc2c834f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:37.165523Z","signature_b64":"c5LfO46G1aBw5VoQEbXIDrfKy2T7F64TuTZYsItBO0UYf2Y6ZVtYhH1V+MbmaQLaGZ3unUkNRVqLZFKF3e6gBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4b0f2e4715a6dfae1076117e5904888a86a8f76e32c556724e0b1acc2c834f3","last_reissued_at":"2026-05-18T01:28:37.165013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:37.165013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.08154","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:28:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gv3JtkTmK8JtkBgnBKb4qKgMyJmU7vefo6Rr0PNWr7vXXAQLJFVUQyhC/9p46OsPaPS0hiOPD87n3aXL14B/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:39:03.576058Z"},"content_sha256":"e0d56bfc8bb81d05fe36f7018edb19855091d1255e1154ebf831ffde1c2b0f15","schema_version":"1.0","event_id":"sha256:e0d56bfc8bb81d05fe36f7018edb19855091d1255e1154ebf831ffde1c2b0f15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4SYPFZDRLJW7VYIHMEL6LECIRC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Sudeshna Kolay","submitted_at":"2015-10-28T01:37:26Z","abstract_excerpt":"A graph $G$ is called a \\emph{block graph} if each maximal $2$-connected component of $G$ is a clique. In this paper we study the Block Graph Vertex Deletion from the perspective of fixed parameter tractable (FPT) and kernelization algorithm. In particular, an input to Block Graph Vertex Deletion consists of a graph $G$ and a positive integer $k$ and the objective to check whether there exists a subset $S \\subseteq V(G)$ of size at most $k$ such that the graph induced on $V(G)\\setminus S$ is a block graph. In this paper we give an FPT algorithm with running time $4^kn^{O(1)}$ and a polynomial "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08154","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:28:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"snBYQ3eswWVjm3rVV1iRSJMVO18S433NnWz2ma2XPwqI72YltTsbI7kTaKfzdEm0HNKrPXTH38Mxd4CkGtcgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:39:03.576722Z"},"content_sha256":"e7a040ae562ad8508891556bd27e546aefc4e4f8ec8cf9eb570a34b285225639","schema_version":"1.0","event_id":"sha256:e7a040ae562ad8508891556bd27e546aefc4e4f8ec8cf9eb570a34b285225639"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4SYPFZDRLJW7VYIHMEL6LECIRC/bundle.json","state_url":"https://pith.science/pith/4SYPFZDRLJW7VYIHMEL6LECIRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4SYPFZDRLJW7VYIHMEL6LECIRC/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-31T09:39:03Z","links":{"resolver":"https://pith.science/pith/4SYPFZDRLJW7VYIHMEL6LECIRC","bundle":"https://pith.science/pith/4SYPFZDRLJW7VYIHMEL6LECIRC/bundle.json","state":"https://pith.science/pith/4SYPFZDRLJW7VYIHMEL6LECIRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4SYPFZDRLJW7VYIHMEL6LECIRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4SYPFZDRLJW7VYIHMEL6LECIRC","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":"23f460330f451448dbe5e6f8fa4019faa44ec5a1a6681f3f33014ce75c52ae41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-28T01:37:26Z","title_canon_sha256":"33bfc00b8d42c8719a713d553018f98ed81c9e041527e38f93c806c8a14e6298"},"schema_version":"1.0","source":{"id":"1510.08154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08154","created_at":"2026-05-18T01:28:37Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08154v1","created_at":"2026-05-18T01:28:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08154","created_at":"2026-05-18T01:28:37Z"},{"alias_kind":"pith_short_12","alias_value":"4SYPFZDRLJW7","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4SYPFZDRLJW7VYIH","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4SYPFZDR","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:e7a040ae562ad8508891556bd27e546aefc4e4f8ec8cf9eb570a34b285225639","target":"graph","created_at":"2026-05-18T01:28:37Z","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 graph $G$ is called a \\emph{block graph} if each maximal $2$-connected component of $G$ is a clique. In this paper we study the Block Graph Vertex Deletion from the perspective of fixed parameter tractable (FPT) and kernelization algorithm. In particular, an input to Block Graph Vertex Deletion consists of a graph $G$ and a positive integer $k$ and the objective to check whether there exists a subset $S \\subseteq V(G)$ of size at most $k$ such that the graph induced on $V(G)\\setminus S$ is a block graph. In this paper we give an FPT algorithm with running time $4^kn^{O(1)}$ and a polynomial ","authors_text":"Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Sudeshna Kolay","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-28T01:37:26Z","title":"A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08154","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:e0d56bfc8bb81d05fe36f7018edb19855091d1255e1154ebf831ffde1c2b0f15","target":"record","created_at":"2026-05-18T01:28:37Z","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":"23f460330f451448dbe5e6f8fa4019faa44ec5a1a6681f3f33014ce75c52ae41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-28T01:37:26Z","title_canon_sha256":"33bfc00b8d42c8719a713d553018f98ed81c9e041527e38f93c806c8a14e6298"},"schema_version":"1.0","source":{"id":"1510.08154","kind":"arxiv","version":1}},"canonical_sha256":"e4b0f2e4715a6dfae1076117e5904888a86a8f76e32c556724e0b1acc2c834f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4b0f2e4715a6dfae1076117e5904888a86a8f76e32c556724e0b1acc2c834f3","first_computed_at":"2026-05-18T01:28:37.165013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:37.165013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c5LfO46G1aBw5VoQEbXIDrfKy2T7F64TuTZYsItBO0UYf2Y6ZVtYhH1V+MbmaQLaGZ3unUkNRVqLZFKF3e6gBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:37.165523Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.08154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0d56bfc8bb81d05fe36f7018edb19855091d1255e1154ebf831ffde1c2b0f15","sha256:e7a040ae562ad8508891556bd27e546aefc4e4f8ec8cf9eb570a34b285225639"],"state_sha256":"3e7262fdddfe10a32cc7c75cdebc5dfba56eed591e7d1abba0fc1690b618fbe0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R5niZ22GkqIPUFvXCHWrRzeqNkXsAN9r0GZFCf7rW9p/uEa+1U1uWa1gd9QrJtMlLI4iQcHpmA3Kd9jTL89DAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:39:03.579998Z","bundle_sha256":"961364cf8225a4924af632fcc6e069ac06fd68ccc24dcb2b9ba34b66650090e3"}}