{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5LSGUKI2NUKCWSNKSN6IARX4CO","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":"4989c44b377249835383f0c446e0454e7864786a2fca6c8eafde001270475d1c","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-25T06:14:39Z","title_canon_sha256":"04da49d29a0523c83799aff06342bb3ddbeba6247790feea67183a985b3f740b"},"schema_version":"1.0","source":{"id":"2605.25464","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.25464","created_at":"2026-05-26T02:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"2605.25464v1","created_at":"2026-05-26T02:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25464","created_at":"2026-05-26T02:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"5LSGUKI2NUKC","created_at":"2026-05-26T02:04:37Z"},{"alias_kind":"pith_short_16","alias_value":"5LSGUKI2NUKCWSNK","created_at":"2026-05-26T02:04:37Z"},{"alias_kind":"pith_short_8","alias_value":"5LSGUKI2","created_at":"2026-05-26T02:04:37Z"}],"graph_snapshots":[{"event_id":"sha256:853837dd1d79f417eca18a54e70b3b3ee0f5b8a3cade488b035363c6cbc793c6","target":"graph","created_at":"2026-05-26T02:04:37Z","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/2605.25464/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bundit Laekhanukit, Ohad Trabelsi, Pasin Manurangsi","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-25T06:14:39Z","title":"A Note on Approximability of Densest At-Least-k-Subgraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25464","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:0ab45273dda86aaff7b2d7c6fcb85227d02c945eaabfbdb4c18cbc344aab7b54","target":"record","created_at":"2026-05-26T02:04:37Z","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":"4989c44b377249835383f0c446e0454e7864786a2fca6c8eafde001270475d1c","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-25T06:14:39Z","title_canon_sha256":"04da49d29a0523c83799aff06342bb3ddbeba6247790feea67183a985b3f740b"},"schema_version":"1.0","source":{"id":"2605.25464","kind":"arxiv","version":1}},"canonical_sha256":"eae46a291a6d142b49aa937c8046fc13920143819bbe922b5131d94ce31fb17f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eae46a291a6d142b49aa937c8046fc13920143819bbe922b5131d94ce31fb17f","first_computed_at":"2026-05-26T02:04:37.269094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T02:04:37.269094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OkFO0dM84BW3b2JKOIRoMtaHlju6g5rfhxdgvUqNk1oVL7rTehbLiaLM5w+1U+7v9ywf45ZC3eKDy2J2wQPxCA==","signature_status":"signed_v1","signed_at":"2026-05-26T02:04:37.269679Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.25464","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ab45273dda86aaff7b2d7c6fcb85227d02c945eaabfbdb4c18cbc344aab7b54","sha256:853837dd1d79f417eca18a54e70b3b3ee0f5b8a3cade488b035363c6cbc793c6"],"state_sha256":"f46c27953202efcce5412197cd3ea60ee8984401d5e363e1bb953f99d3c688b3"}