{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:SCZBFHOXNOCTIBW2OTBA42LOLF","short_pith_number":"pith:SCZBFHOX","canonical_record":{"source":{"id":"2404.08599","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-12T16:53:09Z","cross_cats_sorted":[],"title_canon_sha256":"f7bcd180ae7d869a5f4797ce85e0e23dd33e0391c24871a99ab5cbf8e31e6c6e","abstract_canon_sha256":"1c278f8fb24e925d96938178f115a855182042c6aa2cce18051bcae7219efedb"},"schema_version":"1.0"},"canonical_sha256":"90b2129dd76b853406da74c20e696e596ba5ef267c19771a3c0f6c813d348522","source":{"kind":"arxiv","id":"2404.08599","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.08599","created_at":"2026-07-05T08:07:24Z"},{"alias_kind":"arxiv_version","alias_value":"2404.08599v1","created_at":"2026-07-05T08:07:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.08599","created_at":"2026-07-05T08:07:24Z"},{"alias_kind":"pith_short_12","alias_value":"SCZBFHOXNOCT","created_at":"2026-07-05T08:07:24Z"},{"alias_kind":"pith_short_16","alias_value":"SCZBFHOXNOCTIBW2","created_at":"2026-07-05T08:07:24Z"},{"alias_kind":"pith_short_8","alias_value":"SCZBFHOX","created_at":"2026-07-05T08:07:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:SCZBFHOXNOCTIBW2OTBA42LOLF","target":"record","payload":{"canonical_record":{"source":{"id":"2404.08599","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-12T16:53:09Z","cross_cats_sorted":[],"title_canon_sha256":"f7bcd180ae7d869a5f4797ce85e0e23dd33e0391c24871a99ab5cbf8e31e6c6e","abstract_canon_sha256":"1c278f8fb24e925d96938178f115a855182042c6aa2cce18051bcae7219efedb"},"schema_version":"1.0"},"canonical_sha256":"90b2129dd76b853406da74c20e696e596ba5ef267c19771a3c0f6c813d348522","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:07:24.048402Z","signature_b64":"SRBzRRX1Cdp89+3RbNT9sGdu9y7Jx+sFmfLxU3dGgldPXkEuYCbaBaXxg5rlGrZ4+oKPEVQn60QzbLak8NOQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90b2129dd76b853406da74c20e696e596ba5ef267c19771a3c0f6c813d348522","last_reissued_at":"2026-07-05T08:07:24.047885Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:07:24.047885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.08599","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-07-05T08:07:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cUqaMp474yBeWdyG/SZPyMJZxqrSZAECtF0HzpXC/Cw5pS5c8U/4T4Gmc/vWelft6CgVKGPHHIffJjBSKJuKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:16:15.669468Z"},"content_sha256":"0a193b77963b33d65acabb21da15cfc81ce990edf80be397c034cfdcf25ab77a","schema_version":"1.0","event_id":"sha256:0a193b77963b33d65acabb21da15cfc81ce990edf80be397c034cfdcf25ab77a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:SCZBFHOXNOCTIBW2OTBA42LOLF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Destroying Densest Subgraphs is Hard","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, Cristina Bazgan, Sofia Vazquez Alferez","submitted_at":"2024-04-12T16:53:09Z","abstract_excerpt":"We analyze the computational complexity of the following computational problems called Bounded-Density Edge Deletion and Bounded-Density Vertex Deletion: Given a graph $G$, a budget $k$ and a target density $\\tau_\\rho$, are there $k$ edges ($k$ vertices) whose removal from $G$ results in a graph where the densest subgraph has density at most $\\tau_\\rho$? Here, the density of a graph is the number of its edges divided by the number of its vertices. We prove that both problems are polynomial-time solvable on trees and cliques but are NP-complete on planar bipartite graphs and split graphs. From "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.08599","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/2404.08599/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-05T08:07:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K3ypb5kgBmvAX7BBiyyOF+toWu1U73bX1ABqqpkaeSnO5ItF+qrniyvmh2dgjQLq+pT7S3gqSwqMdWHUj49YCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:16:15.669891Z"},"content_sha256":"e7f51b33db188d66a531b0112ab98f73d11d90d565069cd1129d987990d702e5","schema_version":"1.0","event_id":"sha256:e7f51b33db188d66a531b0112ab98f73d11d90d565069cd1129d987990d702e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SCZBFHOXNOCTIBW2OTBA42LOLF/bundle.json","state_url":"https://pith.science/pith/SCZBFHOXNOCTIBW2OTBA42LOLF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SCZBFHOXNOCTIBW2OTBA42LOLF/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-06T19:16:15Z","links":{"resolver":"https://pith.science/pith/SCZBFHOXNOCTIBW2OTBA42LOLF","bundle":"https://pith.science/pith/SCZBFHOXNOCTIBW2OTBA42LOLF/bundle.json","state":"https://pith.science/pith/SCZBFHOXNOCTIBW2OTBA42LOLF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SCZBFHOXNOCTIBW2OTBA42LOLF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SCZBFHOXNOCTIBW2OTBA42LOLF","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":"1c278f8fb24e925d96938178f115a855182042c6aa2cce18051bcae7219efedb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-12T16:53:09Z","title_canon_sha256":"f7bcd180ae7d869a5f4797ce85e0e23dd33e0391c24871a99ab5cbf8e31e6c6e"},"schema_version":"1.0","source":{"id":"2404.08599","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.08599","created_at":"2026-07-05T08:07:24Z"},{"alias_kind":"arxiv_version","alias_value":"2404.08599v1","created_at":"2026-07-05T08:07:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.08599","created_at":"2026-07-05T08:07:24Z"},{"alias_kind":"pith_short_12","alias_value":"SCZBFHOXNOCT","created_at":"2026-07-05T08:07:24Z"},{"alias_kind":"pith_short_16","alias_value":"SCZBFHOXNOCTIBW2","created_at":"2026-07-05T08:07:24Z"},{"alias_kind":"pith_short_8","alias_value":"SCZBFHOX","created_at":"2026-07-05T08:07:24Z"}],"graph_snapshots":[{"event_id":"sha256:e7f51b33db188d66a531b0112ab98f73d11d90d565069cd1129d987990d702e5","target":"graph","created_at":"2026-07-05T08:07:24Z","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/2404.08599/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We analyze the computational complexity of the following computational problems called Bounded-Density Edge Deletion and Bounded-Density Vertex Deletion: Given a graph $G$, a budget $k$ and a target density $\\tau_\\rho$, are there $k$ edges ($k$ vertices) whose removal from $G$ results in a graph where the densest subgraph has density at most $\\tau_\\rho$? Here, the density of a graph is the number of its edges divided by the number of its vertices. We prove that both problems are polynomial-time solvable on trees and cliques but are NP-complete on planar bipartite graphs and split graphs. From ","authors_text":"Andr\\'e Nichterlein, Cristina Bazgan, Sofia Vazquez Alferez","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-12T16:53:09Z","title":"Destroying Densest Subgraphs is Hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.08599","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:0a193b77963b33d65acabb21da15cfc81ce990edf80be397c034cfdcf25ab77a","target":"record","created_at":"2026-07-05T08:07:24Z","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":"1c278f8fb24e925d96938178f115a855182042c6aa2cce18051bcae7219efedb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-12T16:53:09Z","title_canon_sha256":"f7bcd180ae7d869a5f4797ce85e0e23dd33e0391c24871a99ab5cbf8e31e6c6e"},"schema_version":"1.0","source":{"id":"2404.08599","kind":"arxiv","version":1}},"canonical_sha256":"90b2129dd76b853406da74c20e696e596ba5ef267c19771a3c0f6c813d348522","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90b2129dd76b853406da74c20e696e596ba5ef267c19771a3c0f6c813d348522","first_computed_at":"2026-07-05T08:07:24.047885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:07:24.047885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SRBzRRX1Cdp89+3RbNT9sGdu9y7Jx+sFmfLxU3dGgldPXkEuYCbaBaXxg5rlGrZ4+oKPEVQn60QzbLak8NOQCw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:07:24.048402Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.08599","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a193b77963b33d65acabb21da15cfc81ce990edf80be397c034cfdcf25ab77a","sha256:e7f51b33db188d66a531b0112ab98f73d11d90d565069cd1129d987990d702e5"],"state_sha256":"d859ee3f3986e4607f6e228c3c95ad647dca4bc0d29c160ed90ce2e31ab814e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aHJFSnGBCFDPeCRfmC3DuVWrXtT6KJlbeta6YICm9oHqR49CAkjYdyMl1X7WmuYVoICFrP71F29MVRIa9YiJAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T19:16:15.671896Z","bundle_sha256":"289d69fff50b44f16807e6b0f229a50ec13fbe1d336b50ba6402c2199b27851d"}}