{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GF2E7BPCJSO2QEYRKO3KDN45UA","short_pith_number":"pith:GF2E7BPC","canonical_record":{"source":{"id":"2606.26012","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-24T16:31:03Z","cross_cats_sorted":[],"title_canon_sha256":"ed924bdaa0ea0c74688d0dc3cdde1499faf2b1a2f63177b6bcb470a374d463dd","abstract_canon_sha256":"ac8a48afadd55fca7831236d4a3ce834b9841ccb4639656f0dc88b80c7e8f20c"},"schema_version":"1.0"},"canonical_sha256":"31744f85e24c9da8131153b6a1b79da038db5cb8fcfead09dce0d81157fd75d3","source":{"kind":"arxiv","id":"2606.26012","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.26012","created_at":"2026-06-25T01:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"2606.26012v1","created_at":"2026-06-25T01:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26012","created_at":"2026-06-25T01:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"GF2E7BPCJSO2","created_at":"2026-06-25T01:18:45Z"},{"alias_kind":"pith_short_16","alias_value":"GF2E7BPCJSO2QEYR","created_at":"2026-06-25T01:18:45Z"},{"alias_kind":"pith_short_8","alias_value":"GF2E7BPC","created_at":"2026-06-25T01:18:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GF2E7BPCJSO2QEYRKO3KDN45UA","target":"record","payload":{"canonical_record":{"source":{"id":"2606.26012","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-24T16:31:03Z","cross_cats_sorted":[],"title_canon_sha256":"ed924bdaa0ea0c74688d0dc3cdde1499faf2b1a2f63177b6bcb470a374d463dd","abstract_canon_sha256":"ac8a48afadd55fca7831236d4a3ce834b9841ccb4639656f0dc88b80c7e8f20c"},"schema_version":"1.0"},"canonical_sha256":"31744f85e24c9da8131153b6a1b79da038db5cb8fcfead09dce0d81157fd75d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T01:18:45.837312Z","signature_b64":"70YEdiNmrJwes1S2AOjMxuz/gH3yfJ9uW1JeJ62cIAO8ALdsiAPVVGhKKe+wGw0aRmpSYhSzIppmRdXw1wd/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31744f85e24c9da8131153b6a1b79da038db5cb8fcfead09dce0d81157fd75d3","last_reissued_at":"2026-06-25T01:18:45.836903Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T01:18:45.836903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.26012","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-06-25T01:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"66axbNiE1rwEjU90R49B2Nrzlu34sNnFdU5I3znZkgHN5mAxMfcVP7a51R7/5sWXMJGYMEmg2cGYo0j3HDxZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:00:55.210621Z"},"content_sha256":"1c7d21adb4c01fb242d6084197cb785f5d20c6ad815d59cc5cb1235efbde2b6c","schema_version":"1.0","event_id":"sha256:1c7d21adb4c01fb242d6084197cb785f5d20c6ad815d59cc5cb1235efbde2b6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GF2E7BPCJSO2QEYRKO3KDN45UA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Parameterized Complexity of Bounded-Density Vertex Deletion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, Anton Herrmann, Jakob Raupach, Tom-Lukas Breitkopf","submitted_at":"2026-06-24T16:31:03Z","abstract_excerpt":"We explore the parameterized complexity of Bounded Density Vertex Deletion (BDVD): given a graph $G$, an integer budget $k$, and a target density $\\tau_\\rho$, the task is to determine whether the density (i.e. number of edges divided by number of vertices) of the densest subgraph of $G$ can be reduced to at most $\\tau_\\rho$ by deleting at most $k$ vertices. Our primary focus is on structural graph parameters related to treewidth, as the parameterized complexity of BDVD with respect to treewidth was left as open question by Bazgan et al. [JCSS, 2025]. We resolve this question by showing W[1]-ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26012","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.26012/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-06-25T01:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5G3ML5U3XokdBiPQY/s9lX5BCQILS8MIVm7oey9QqWGEOTmlr9v9pou0RTlRRDab8E52EhnosOAyzzXZRMmrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:00:55.210988Z"},"content_sha256":"45d056d9e450f8636d70be2c01a5698f7a1e0d6690e9884e62a5dcb7df335bd8","schema_version":"1.0","event_id":"sha256:45d056d9e450f8636d70be2c01a5698f7a1e0d6690e9884e62a5dcb7df335bd8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GF2E7BPCJSO2QEYRKO3KDN45UA/bundle.json","state_url":"https://pith.science/pith/GF2E7BPCJSO2QEYRKO3KDN45UA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GF2E7BPCJSO2QEYRKO3KDN45UA/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-07T09:00:55Z","links":{"resolver":"https://pith.science/pith/GF2E7BPCJSO2QEYRKO3KDN45UA","bundle":"https://pith.science/pith/GF2E7BPCJSO2QEYRKO3KDN45UA/bundle.json","state":"https://pith.science/pith/GF2E7BPCJSO2QEYRKO3KDN45UA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GF2E7BPCJSO2QEYRKO3KDN45UA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GF2E7BPCJSO2QEYRKO3KDN45UA","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":"ac8a48afadd55fca7831236d4a3ce834b9841ccb4639656f0dc88b80c7e8f20c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-24T16:31:03Z","title_canon_sha256":"ed924bdaa0ea0c74688d0dc3cdde1499faf2b1a2f63177b6bcb470a374d463dd"},"schema_version":"1.0","source":{"id":"2606.26012","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.26012","created_at":"2026-06-25T01:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"2606.26012v1","created_at":"2026-06-25T01:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26012","created_at":"2026-06-25T01:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"GF2E7BPCJSO2","created_at":"2026-06-25T01:18:45Z"},{"alias_kind":"pith_short_16","alias_value":"GF2E7BPCJSO2QEYR","created_at":"2026-06-25T01:18:45Z"},{"alias_kind":"pith_short_8","alias_value":"GF2E7BPC","created_at":"2026-06-25T01:18:45Z"}],"graph_snapshots":[{"event_id":"sha256:45d056d9e450f8636d70be2c01a5698f7a1e0d6690e9884e62a5dcb7df335bd8","target":"graph","created_at":"2026-06-25T01:18:45Z","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/2606.26012/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We explore the parameterized complexity of Bounded Density Vertex Deletion (BDVD): given a graph $G$, an integer budget $k$, and a target density $\\tau_\\rho$, the task is to determine whether the density (i.e. number of edges divided by number of vertices) of the densest subgraph of $G$ can be reduced to at most $\\tau_\\rho$ by deleting at most $k$ vertices. Our primary focus is on structural graph parameters related to treewidth, as the parameterized complexity of BDVD with respect to treewidth was left as open question by Bazgan et al. [JCSS, 2025]. We resolve this question by showing W[1]-ha","authors_text":"Andr\\'e Nichterlein, Anton Herrmann, Jakob Raupach, Tom-Lukas Breitkopf","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-24T16:31:03Z","title":"On the Parameterized Complexity of Bounded-Density Vertex Deletion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26012","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:1c7d21adb4c01fb242d6084197cb785f5d20c6ad815d59cc5cb1235efbde2b6c","target":"record","created_at":"2026-06-25T01:18:45Z","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":"ac8a48afadd55fca7831236d4a3ce834b9841ccb4639656f0dc88b80c7e8f20c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-24T16:31:03Z","title_canon_sha256":"ed924bdaa0ea0c74688d0dc3cdde1499faf2b1a2f63177b6bcb470a374d463dd"},"schema_version":"1.0","source":{"id":"2606.26012","kind":"arxiv","version":1}},"canonical_sha256":"31744f85e24c9da8131153b6a1b79da038db5cb8fcfead09dce0d81157fd75d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31744f85e24c9da8131153b6a1b79da038db5cb8fcfead09dce0d81157fd75d3","first_computed_at":"2026-06-25T01:18:45.836903Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T01:18:45.836903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"70YEdiNmrJwes1S2AOjMxuz/gH3yfJ9uW1JeJ62cIAO8ALdsiAPVVGhKKe+wGw0aRmpSYhSzIppmRdXw1wd/BQ==","signature_status":"signed_v1","signed_at":"2026-06-25T01:18:45.837312Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.26012","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c7d21adb4c01fb242d6084197cb785f5d20c6ad815d59cc5cb1235efbde2b6c","sha256:45d056d9e450f8636d70be2c01a5698f7a1e0d6690e9884e62a5dcb7df335bd8"],"state_sha256":"080eeb3e4816a433aec3cd6b0238d5496554c6a962a8f4827f051fa54c45a0b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JPCzjfgxunL06JXYVOKEQ6qIYZiqTLPVcqmaJFkJ4nGXe3YOAqoXBsTRStGvapsTjz9C5xiParnbFPDUF2T+BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T09:00:55.213153Z","bundle_sha256":"b104abf90da317ce82527d11a3b4d4f8e47617a51e21cb8f0a83cceffc9a76e8"}}