{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MICQGMSZXJKCA4YB6SEJAK5RNC","short_pith_number":"pith:MICQGMSZ","canonical_record":{"source":{"id":"1603.05945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-18T18:02:04Z","cross_cats_sorted":[],"title_canon_sha256":"66864a33a03a23eecc518cb1b589e8afa3a0850476b3dfa5670bd77828ba7469","abstract_canon_sha256":"11d7f6781c0aadf94dee3b0b6923c6651f221f5aa3f1550a4b9442e5c7cf2835"},"schema_version":"1.0"},"canonical_sha256":"6205033259ba54207301f488902bb168aa54ec85ddf4e098e7aa369422da1d06","source":{"kind":"arxiv","id":"1603.05945","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05945","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05945v1","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05945","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"MICQGMSZXJKC","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MICQGMSZXJKCA4YB","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MICQGMSZ","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MICQGMSZXJKCA4YB6SEJAK5RNC","target":"record","payload":{"canonical_record":{"source":{"id":"1603.05945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-18T18:02:04Z","cross_cats_sorted":[],"title_canon_sha256":"66864a33a03a23eecc518cb1b589e8afa3a0850476b3dfa5670bd77828ba7469","abstract_canon_sha256":"11d7f6781c0aadf94dee3b0b6923c6651f221f5aa3f1550a4b9442e5c7cf2835"},"schema_version":"1.0"},"canonical_sha256":"6205033259ba54207301f488902bb168aa54ec85ddf4e098e7aa369422da1d06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:53.226706Z","signature_b64":"EiMD4NdxXJdr18nXP+cNjMOdoZ5Ig5J50m/jya6bv6mjFlgLAHbe4wlO7ajHr+o4xrtdGuvY7VsBHFkvSV3eDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6205033259ba54207301f488902bb168aa54ec85ddf4e098e7aa369422da1d06","last_reissued_at":"2026-05-18T01:18:53.226246Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:53.226246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.05945","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:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xvUomJR6Oi04G/eHF9aYjfw8fGb3qiG2ES50HSy+sjeeiy+7OxGhxPvLpI+vyu7nAICDMUCAULey7ZWMPUpBBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T23:30:51.546858Z"},"content_sha256":"a622ecef012ae46e8930f8bce49853ca2ec684f8cfcf02d2bfd1ca25f69c7aed","schema_version":"1.0","event_id":"sha256:a622ecef012ae46e8930f8bce49853ca2ec684f8cfcf02d2bfd1ca25f69c7aed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MICQGMSZXJKCA4YB6SEJAK5RNC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized vertex deletion problems for hereditary graph classes with a block property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, \\'Edouard Bonnet, Nick Brettell, O-joung Kwon","submitted_at":"2016-03-18T18:02:04Z","abstract_excerpt":"For a class of graphs $\\mathcal{P}$, the Bounded $\\mathcal{P}$-Block Vertex Deletion problem asks, given a graph $G$ on $n$ vertices and positive integers $k$ and $d$, whether there is a set $S$ of at most $k$ vertices such that each block of $G-S$ has at most $d$ vertices and is in $\\mathcal{P}$. We show that when $\\mathcal{P}$ satisfies a natural hereditary property and is recognizable in polynomial time, Bounded $\\mathcal{P}$-Block Vertex Deletion can be solved in time $2^{O(k \\log d)}n^{O(1)}$. When $\\mathcal{P}$ contains all split graphs, we show that this running time is essentially opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05945","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:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4SyWta+g0p2XFegaaPENf1ZvyEcUc58p4MdEt/CKZsKGEgqz+c2I7eCi5hhFx9Pi4N7egUFsysVJ//P5b3imCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T23:30:51.547210Z"},"content_sha256":"c837fef23ba623873796a70bfdc719e4d78208ce1c860b515476767cefffcb56","schema_version":"1.0","event_id":"sha256:c837fef23ba623873796a70bfdc719e4d78208ce1c860b515476767cefffcb56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MICQGMSZXJKCA4YB6SEJAK5RNC/bundle.json","state_url":"https://pith.science/pith/MICQGMSZXJKCA4YB6SEJAK5RNC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MICQGMSZXJKCA4YB6SEJAK5RNC/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-08-21T23:30:51Z","links":{"resolver":"https://pith.science/pith/MICQGMSZXJKCA4YB6SEJAK5RNC","bundle":"https://pith.science/pith/MICQGMSZXJKCA4YB6SEJAK5RNC/bundle.json","state":"https://pith.science/pith/MICQGMSZXJKCA4YB6SEJAK5RNC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MICQGMSZXJKCA4YB6SEJAK5RNC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MICQGMSZXJKCA4YB6SEJAK5RNC","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":"11d7f6781c0aadf94dee3b0b6923c6651f221f5aa3f1550a4b9442e5c7cf2835","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-18T18:02:04Z","title_canon_sha256":"66864a33a03a23eecc518cb1b589e8afa3a0850476b3dfa5670bd77828ba7469"},"schema_version":"1.0","source":{"id":"1603.05945","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05945","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05945v1","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05945","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"MICQGMSZXJKC","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MICQGMSZXJKCA4YB","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MICQGMSZ","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:c837fef23ba623873796a70bfdc719e4d78208ce1c860b515476767cefffcb56","target":"graph","created_at":"2026-05-18T01:18:53Z","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 a class of graphs $\\mathcal{P}$, the Bounded $\\mathcal{P}$-Block Vertex Deletion problem asks, given a graph $G$ on $n$ vertices and positive integers $k$ and $d$, whether there is a set $S$ of at most $k$ vertices such that each block of $G-S$ has at most $d$ vertices and is in $\\mathcal{P}$. We show that when $\\mathcal{P}$ satisfies a natural hereditary property and is recognizable in polynomial time, Bounded $\\mathcal{P}$-Block Vertex Deletion can be solved in time $2^{O(k \\log d)}n^{O(1)}$. When $\\mathcal{P}$ contains all split graphs, we show that this running time is essentially opti","authors_text":"D\\'aniel Marx, \\'Edouard Bonnet, Nick Brettell, O-joung Kwon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-18T18:02:04Z","title":"Parameterized vertex deletion problems for hereditary graph classes with a block property"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05945","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:a622ecef012ae46e8930f8bce49853ca2ec684f8cfcf02d2bfd1ca25f69c7aed","target":"record","created_at":"2026-05-18T01:18:53Z","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":"11d7f6781c0aadf94dee3b0b6923c6651f221f5aa3f1550a4b9442e5c7cf2835","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-18T18:02:04Z","title_canon_sha256":"66864a33a03a23eecc518cb1b589e8afa3a0850476b3dfa5670bd77828ba7469"},"schema_version":"1.0","source":{"id":"1603.05945","kind":"arxiv","version":1}},"canonical_sha256":"6205033259ba54207301f488902bb168aa54ec85ddf4e098e7aa369422da1d06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6205033259ba54207301f488902bb168aa54ec85ddf4e098e7aa369422da1d06","first_computed_at":"2026-05-18T01:18:53.226246Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:53.226246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EiMD4NdxXJdr18nXP+cNjMOdoZ5Ig5J50m/jya6bv6mjFlgLAHbe4wlO7ajHr+o4xrtdGuvY7VsBHFkvSV3eDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:53.226706Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.05945","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a622ecef012ae46e8930f8bce49853ca2ec684f8cfcf02d2bfd1ca25f69c7aed","sha256:c837fef23ba623873796a70bfdc719e4d78208ce1c860b515476767cefffcb56"],"state_sha256":"c5a92b75604ce0e5862a4f0dee6c46a67e99825bc789770f6d9f008edf753307"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JEFL8Lq1o1XZsX1wnygHu0lRRLg34CWECniYFT984x84z5HCj8E/wCRZm4C3j/1zEErpiKjK0PhGwwWQJw2MBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T23:30:51.550331Z","bundle_sha256":"eac9144fd9a64e6f845b1c4c7faca1c519e927207d3e3472d0f4f841c679c6b3"}}