{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5LSGUKI2NUKCWSNKSN6IARX4CO","short_pith_number":"pith:5LSGUKI2","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"},"canonical_sha256":"eae46a291a6d142b49aa937c8046fc13920143819bbe922b5131d94ce31fb17f","source":{"kind":"arxiv","id":"2605.25464","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5LSGUKI2NUKCWSNKSN6IARX4CO","target":"record","payload":{"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"},"canonical_sha256":"eae46a291a6d142b49aa937c8046fc13920143819bbe922b5131d94ce31fb17f","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"},"source_kind":"arxiv","source_id":"2605.25464","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-05-26T02:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eu15j1if9Q3KiyxOL3jpV9qa4kbO70x8Un4nqTQfB83hpJz4O6xcxTwbAyC+QkGK0IEK3uR8enn/CA2oDI9iBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:25:59.093021Z"},"content_sha256":"0ab45273dda86aaff7b2d7c6fcb85227d02c945eaabfbdb4c18cbc344aab7b54","schema_version":"1.0","event_id":"sha256:0ab45273dda86aaff7b2d7c6fcb85227d02c945eaabfbdb4c18cbc344aab7b54"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5LSGUKI2NUKCWSNKSN6IARX4CO","target":"graph","payload":{"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"},"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-05-26T02:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dL5PzRf7KWLG6Y0RpuiaP/d1BitsC7F8gd4GwtE7cCykZgo0lXXch6VxaYYXh3MpEEvWZ1lf2t5KOIXhdrLaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:25:59.093425Z"},"content_sha256":"853837dd1d79f417eca18a54e70b3b3ee0f5b8a3cade488b035363c6cbc793c6","schema_version":"1.0","event_id":"sha256:853837dd1d79f417eca18a54e70b3b3ee0f5b8a3cade488b035363c6cbc793c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5LSGUKI2NUKCWSNKSN6IARX4CO/bundle.json","state_url":"https://pith.science/pith/5LSGUKI2NUKCWSNKSN6IARX4CO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5LSGUKI2NUKCWSNKSN6IARX4CO/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-06-01T13:25:59Z","links":{"resolver":"https://pith.science/pith/5LSGUKI2NUKCWSNKSN6IARX4CO","bundle":"https://pith.science/pith/5LSGUKI2NUKCWSNKSN6IARX4CO/bundle.json","state":"https://pith.science/pith/5LSGUKI2NUKCWSNKSN6IARX4CO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5LSGUKI2NUKCWSNKSN6IARX4CO/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EgSuLLcfifLrhbkehst795XI8ML1QDtRlp/krs88AmIpR+H1c09Eyiu/kYzV8e7BQ5pKTrgn/26clxXDfakcCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:25:59.095542Z","bundle_sha256":"47a0693b5eb5f3f2d1ed1877f7f232cc23836115f771b5dec0ea20ce847938bf"}}