{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:CB4LV723NYEEVAM74YZ2QK3C65","short_pith_number":"pith:CB4LV723","canonical_record":{"source":{"id":"2308.00501","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-01T12:35:20Z","cross_cats_sorted":[],"title_canon_sha256":"758a849aa89a13d84b4fe64196d42cecffdfb36f72b4794e1b81dd20a42ea42f","abstract_canon_sha256":"57ccfbdbbaf70cc14f745fadad004ba821c98ea6d8b8fa29f26323ef2697346b"},"schema_version":"1.0"},"canonical_sha256":"1078baff5b6e084a819fe633a82b62f742dde092d0b846c28f042eb2316fe9d4","source":{"kind":"arxiv","id":"2308.00501","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.00501","created_at":"2026-07-05T09:37:32Z"},{"alias_kind":"arxiv_version","alias_value":"2308.00501v3","created_at":"2026-07-05T09:37:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.00501","created_at":"2026-07-05T09:37:32Z"},{"alias_kind":"pith_short_12","alias_value":"CB4LV723NYEE","created_at":"2026-07-05T09:37:32Z"},{"alias_kind":"pith_short_16","alias_value":"CB4LV723NYEEVAM7","created_at":"2026-07-05T09:37:32Z"},{"alias_kind":"pith_short_8","alias_value":"CB4LV723","created_at":"2026-07-05T09:37:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:CB4LV723NYEEVAM74YZ2QK3C65","target":"record","payload":{"canonical_record":{"source":{"id":"2308.00501","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-01T12:35:20Z","cross_cats_sorted":[],"title_canon_sha256":"758a849aa89a13d84b4fe64196d42cecffdfb36f72b4794e1b81dd20a42ea42f","abstract_canon_sha256":"57ccfbdbbaf70cc14f745fadad004ba821c98ea6d8b8fa29f26323ef2697346b"},"schema_version":"1.0"},"canonical_sha256":"1078baff5b6e084a819fe633a82b62f742dde092d0b846c28f042eb2316fe9d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:37:32.292516Z","signature_b64":"+fQpuUJHYRqP3qojoO0MelCl/2qnfkY3Lw8aRXx+q/Z8S/vd9Jg3VVlERZp40LIc5WTwaqw1VUa0XpgfYj6EAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1078baff5b6e084a819fe633a82b62f742dde092d0b846c28f042eb2316fe9d4","last_reissued_at":"2026-07-05T09:37:32.292156Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:37:32.292156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.00501","source_version":3,"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-07-05T09:37:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XafEP6Lp/fBu183YE/satf0jOexrQX7Z1PrMvxtwZDahN70nohOoW9TSI77HbVL0UohvBfJ/krCFHOX8jiEJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:40:07.667305Z"},"content_sha256":"e5c25e816a1a3d976706a8abad7f96a8102eac79a623850a2ab22eae92ad868f","schema_version":"1.0","event_id":"sha256:e5c25e816a1a3d976706a8abad7f96a8102eac79a623850a2ab22eae92ad868f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:CB4LV723NYEEVAM74YZ2QK3C65","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structural Parameterizations of the Biclique-Free Vertex Deletion Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Leon Kellerhals, Lito Goldmann, Tomohiro Koana","submitted_at":"2023-08-01T12:35:20Z","abstract_excerpt":"In this work, we study the Biclique-Free Vertex Deletion problem: Given a graph $G$ and integers $k$ and $i \\le j$, find a set of at most $k$ vertices that intersects every (not necessarily induced) biclique $K_{i, j}$ in $G$. This is a natural generalization of the Bounded-Degree Deletion problem, wherein one asks whether there is a set of at most $k$ vertices whose deletion results in a graph of a given maximum degree $r$. The two problems coincide when $i = 1$ and $j = r + 1$. We show that Biclique-Free Vertex Deletion is fixed-parameter tractable with respect to $k + d$ for the degeneracy "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.00501","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.00501/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:37:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p6Ie44i3gf2ZWbdKqwncs/Nfw1GfCVkwNQWkNxvazQkRsblR2ItxBmXiFpb9uuzxtG+uLhxXy3nEi2kGLxxRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:40:07.667686Z"},"content_sha256":"9d52cf31a37ba2b033631993aefaef39ce6f418fd86cbb98e5f7d53253409f6e","schema_version":"1.0","event_id":"sha256:9d52cf31a37ba2b033631993aefaef39ce6f418fd86cbb98e5f7d53253409f6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CB4LV723NYEEVAM74YZ2QK3C65/bundle.json","state_url":"https://pith.science/pith/CB4LV723NYEEVAM74YZ2QK3C65/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CB4LV723NYEEVAM74YZ2QK3C65/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-07-07T08:40:07Z","links":{"resolver":"https://pith.science/pith/CB4LV723NYEEVAM74YZ2QK3C65","bundle":"https://pith.science/pith/CB4LV723NYEEVAM74YZ2QK3C65/bundle.json","state":"https://pith.science/pith/CB4LV723NYEEVAM74YZ2QK3C65/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CB4LV723NYEEVAM74YZ2QK3C65/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:CB4LV723NYEEVAM74YZ2QK3C65","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":"57ccfbdbbaf70cc14f745fadad004ba821c98ea6d8b8fa29f26323ef2697346b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-01T12:35:20Z","title_canon_sha256":"758a849aa89a13d84b4fe64196d42cecffdfb36f72b4794e1b81dd20a42ea42f"},"schema_version":"1.0","source":{"id":"2308.00501","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.00501","created_at":"2026-07-05T09:37:32Z"},{"alias_kind":"arxiv_version","alias_value":"2308.00501v3","created_at":"2026-07-05T09:37:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.00501","created_at":"2026-07-05T09:37:32Z"},{"alias_kind":"pith_short_12","alias_value":"CB4LV723NYEE","created_at":"2026-07-05T09:37:32Z"},{"alias_kind":"pith_short_16","alias_value":"CB4LV723NYEEVAM7","created_at":"2026-07-05T09:37:32Z"},{"alias_kind":"pith_short_8","alias_value":"CB4LV723","created_at":"2026-07-05T09:37:32Z"}],"graph_snapshots":[{"event_id":"sha256:9d52cf31a37ba2b033631993aefaef39ce6f418fd86cbb98e5f7d53253409f6e","target":"graph","created_at":"2026-07-05T09:37:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.00501/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we study the Biclique-Free Vertex Deletion problem: Given a graph $G$ and integers $k$ and $i \\le j$, find a set of at most $k$ vertices that intersects every (not necessarily induced) biclique $K_{i, j}$ in $G$. This is a natural generalization of the Bounded-Degree Deletion problem, wherein one asks whether there is a set of at most $k$ vertices whose deletion results in a graph of a given maximum degree $r$. The two problems coincide when $i = 1$ and $j = r + 1$. We show that Biclique-Free Vertex Deletion is fixed-parameter tractable with respect to $k + d$ for the degeneracy ","authors_text":"Leon Kellerhals, Lito Goldmann, Tomohiro Koana","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-01T12:35:20Z","title":"Structural Parameterizations of the Biclique-Free Vertex Deletion Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.00501","kind":"arxiv","version":3},"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:e5c25e816a1a3d976706a8abad7f96a8102eac79a623850a2ab22eae92ad868f","target":"record","created_at":"2026-07-05T09:37:32Z","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":"57ccfbdbbaf70cc14f745fadad004ba821c98ea6d8b8fa29f26323ef2697346b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-01T12:35:20Z","title_canon_sha256":"758a849aa89a13d84b4fe64196d42cecffdfb36f72b4794e1b81dd20a42ea42f"},"schema_version":"1.0","source":{"id":"2308.00501","kind":"arxiv","version":3}},"canonical_sha256":"1078baff5b6e084a819fe633a82b62f742dde092d0b846c28f042eb2316fe9d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1078baff5b6e084a819fe633a82b62f742dde092d0b846c28f042eb2316fe9d4","first_computed_at":"2026-07-05T09:37:32.292156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:37:32.292156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+fQpuUJHYRqP3qojoO0MelCl/2qnfkY3Lw8aRXx+q/Z8S/vd9Jg3VVlERZp40LIc5WTwaqw1VUa0XpgfYj6EAA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:37:32.292516Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.00501","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5c25e816a1a3d976706a8abad7f96a8102eac79a623850a2ab22eae92ad868f","sha256:9d52cf31a37ba2b033631993aefaef39ce6f418fd86cbb98e5f7d53253409f6e"],"state_sha256":"fb85cf191dd30663b4ebdf5fc02d73ff523b4239b152b93de4a28a95eada51b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bw8H1f+VMTl9YG/T6aEciHE7C8oZEbV7By9wLSh/gxfuccOgMaq1Jsruv7/mDoom0Rhzj3YLFwGXin1ox1bgBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:40:07.669652Z","bundle_sha256":"fe76f33c20a1508321c55263b474f8540eb0ade6a8623d70cb774f7ea16bd4ce"}}