{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5LSGUKI2NUKCWSNKSN6IARX4CO","short_pith_number":"pith:5LSGUKI2","schema_version":"1.0","canonical_sha256":"eae46a291a6d142b49aa937c8046fc13920143819bbe922b5131d94ce31fb17f","source":{"kind":"arxiv","id":"2605.25464","version":1},"attestation_state":"computed","paper":{"title":"A Note on Approximability of Densest At-Least-k-Subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Ohad Trabelsi, Pasin Manurangsi","submitted_at":"2026-05-25T06:14:39Z","abstract_excerpt":"We study the Densest At-Least-$k$-Subgraph (DAL$k$S) problem, in which we are given an undirected graph $G$ and an integer $k$, and the goal is to find a subgraph of $G$ with at least $k$ vertices with maximum density. The best-known algorithm, independently discovered by Khuller and Saha (2009) and by Andersen (2007), yields a 2-approximation for DAL$k$S in polynomial time.\n  In this note, we provide a (simple) reduction from Densest $k$-Subgraph (D$k$S) to Densest At-Least-$k$-Subgraph, which shows that, if D$k$S is hard to approximate to within any constant factor, then DAL$k$S is hard to a"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.25464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-25T06:14:39Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"04da49d29a0523c83799aff06342bb3ddbeba6247790feea67183a985b3f740b","abstract_canon_sha256":"4989c44b377249835383f0c446e0454e7864786a2fca6c8eafde001270475d1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:04:37.269679Z","signature_b64":"OkFO0dM84BW3b2JKOIRoMtaHlju6g5rfhxdgvUqNk1oVL7rTehbLiaLM5w+1U+7v9ywf45ZC3eKDy2J2wQPxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eae46a291a6d142b49aa937c8046fc13920143819bbe922b5131d94ce31fb17f","last_reissued_at":"2026-05-26T02:04:37.269094Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:04:37.269094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Approximability of Densest At-Least-k-Subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Ohad Trabelsi, Pasin Manurangsi","submitted_at":"2026-05-25T06:14:39Z","abstract_excerpt":"We study the Densest At-Least-$k$-Subgraph (DAL$k$S) problem, in which we are given an undirected graph $G$ and an integer $k$, and the goal is to find a subgraph of $G$ with at least $k$ vertices with maximum density. The best-known algorithm, independently discovered by Khuller and Saha (2009) and by Andersen (2007), yields a 2-approximation for DAL$k$S in polynomial time.\n  In this note, we provide a (simple) reduction from Densest $k$-Subgraph (D$k$S) to Densest At-Least-$k$-Subgraph, which shows that, if D$k$S is hard to approximate to within any constant factor, then DAL$k$S is hard to a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25464","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/2605.25464/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.25464","created_at":"2026-05-26T02:04:37.269195+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.25464v1","created_at":"2026-05-26T02:04:37.269195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25464","created_at":"2026-05-26T02:04:37.269195+00:00"},{"alias_kind":"pith_short_12","alias_value":"5LSGUKI2NUKC","created_at":"2026-05-26T02:04:37.269195+00:00"},{"alias_kind":"pith_short_16","alias_value":"5LSGUKI2NUKCWSNK","created_at":"2026-05-26T02:04:37.269195+00:00"},{"alias_kind":"pith_short_8","alias_value":"5LSGUKI2","created_at":"2026-05-26T02:04:37.269195+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5LSGUKI2NUKCWSNKSN6IARX4CO","json":"https://pith.science/pith/5LSGUKI2NUKCWSNKSN6IARX4CO.json","graph_json":"https://pith.science/api/pith-number/5LSGUKI2NUKCWSNKSN6IARX4CO/graph.json","events_json":"https://pith.science/api/pith-number/5LSGUKI2NUKCWSNKSN6IARX4CO/events.json","paper":"https://pith.science/paper/5LSGUKI2"},"agent_actions":{"view_html":"https://pith.science/pith/5LSGUKI2NUKCWSNKSN6IARX4CO","download_json":"https://pith.science/pith/5LSGUKI2NUKCWSNKSN6IARX4CO.json","view_paper":"https://pith.science/paper/5LSGUKI2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.25464&json=true","fetch_graph":"https://pith.science/api/pith-number/5LSGUKI2NUKCWSNKSN6IARX4CO/graph.json","fetch_events":"https://pith.science/api/pith-number/5LSGUKI2NUKCWSNKSN6IARX4CO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5LSGUKI2NUKCWSNKSN6IARX4CO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5LSGUKI2NUKCWSNKSN6IARX4CO/action/storage_attestation","attest_author":"https://pith.science/pith/5LSGUKI2NUKCWSNKSN6IARX4CO/action/author_attestation","sign_citation":"https://pith.science/pith/5LSGUKI2NUKCWSNKSN6IARX4CO/action/citation_signature","submit_replication":"https://pith.science/pith/5LSGUKI2NUKCWSNKSN6IARX4CO/action/replication_record"}},"created_at":"2026-05-26T02:04:37.269195+00:00","updated_at":"2026-05-26T02:04:37.269195+00:00"}