{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:R3DNZHJTXKEEUGFHLKJCKSO4HX","short_pith_number":"pith:R3DNZHJT","schema_version":"1.0","canonical_sha256":"8ec6dc9d33ba884a18a75a922549dc3dd70aa13b0f6e0288870338434c127789","source":{"kind":"arxiv","id":"cs/0702032","version":1},"attestation_state":"computed","paper":{"title":"Finding large and small dense subgraphs","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Reid Andersen","submitted_at":"2007-02-05T19:29:38Z","abstract_excerpt":"We consider two optimization problems related to finding dense subgraphs. The densest at-least-k-subgraph problem (DalkS) is to find an induced subgraph of highest average degree among all subgraphs with at least k vertices, and the densest at-most-k-subgraph problem (DamkS) is defined similarly. These problems are related to the well-known densest k-subgraph problem (DkS), which is to find the densest subgraph on exactly k vertices. We show that DalkS can be approximated efficiently, while DamkS is nearly as hard to approximate as the densest k-subgraph problem."},"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":"cs/0702032","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2007-02-05T19:29:38Z","cross_cats_sorted":[],"title_canon_sha256":"cf55a7dce8792c939bafc409529d18cf346f4e62929ab34edf9a7486b084b84d","abstract_canon_sha256":"ffb41876d99bdfcf270c0c0500fad57265615993d6d5f94ce112a0cc1ab4df14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:59:14.551919Z","signature_b64":"7w2JfNIYglqd9vBmreTRkOtsvpNvpGwMg5Y/PVLk8TjIQl7fvAg7JvG76DRapFfMI9/bNgvGMwa+nP5QIHZMCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ec6dc9d33ba884a18a75a922549dc3dd70aa13b0f6e0288870338434c127789","last_reissued_at":"2026-07-04T14:59:14.551575Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:59:14.551575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding large and small dense subgraphs","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Reid Andersen","submitted_at":"2007-02-05T19:29:38Z","abstract_excerpt":"We consider two optimization problems related to finding dense subgraphs. The densest at-least-k-subgraph problem (DalkS) is to find an induced subgraph of highest average degree among all subgraphs with at least k vertices, and the densest at-most-k-subgraph problem (DamkS) is defined similarly. These problems are related to the well-known densest k-subgraph problem (DkS), which is to find the densest subgraph on exactly k vertices. We show that DalkS can be approximated efficiently, while DamkS is nearly as hard to approximate as the densest k-subgraph problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0702032","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/cs/0702032/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":"cs/0702032","created_at":"2026-07-04T14:59:14.551637+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0702032v1","created_at":"2026-07-04T14:59:14.551637+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0702032","created_at":"2026-07-04T14:59:14.551637+00:00"},{"alias_kind":"pith_short_12","alias_value":"R3DNZHJTXKEE","created_at":"2026-07-04T14:59:14.551637+00:00"},{"alias_kind":"pith_short_16","alias_value":"R3DNZHJTXKEEUGFH","created_at":"2026-07-04T14:59:14.551637+00:00"},{"alias_kind":"pith_short_8","alias_value":"R3DNZHJT","created_at":"2026-07-04T14:59:14.551637+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.25464","citing_title":"A Note on Approximability of Densest At-Least-k-Subgraph","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2505.12600","citing_title":"Fast and Simple Densest Subgraph with Predictions","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R3DNZHJTXKEEUGFHLKJCKSO4HX","json":"https://pith.science/pith/R3DNZHJTXKEEUGFHLKJCKSO4HX.json","graph_json":"https://pith.science/api/pith-number/R3DNZHJTXKEEUGFHLKJCKSO4HX/graph.json","events_json":"https://pith.science/api/pith-number/R3DNZHJTXKEEUGFHLKJCKSO4HX/events.json","paper":"https://pith.science/paper/R3DNZHJT"},"agent_actions":{"view_html":"https://pith.science/pith/R3DNZHJTXKEEUGFHLKJCKSO4HX","download_json":"https://pith.science/pith/R3DNZHJTXKEEUGFHLKJCKSO4HX.json","view_paper":"https://pith.science/paper/R3DNZHJT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0702032&json=true","fetch_graph":"https://pith.science/api/pith-number/R3DNZHJTXKEEUGFHLKJCKSO4HX/graph.json","fetch_events":"https://pith.science/api/pith-number/R3DNZHJTXKEEUGFHLKJCKSO4HX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R3DNZHJTXKEEUGFHLKJCKSO4HX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R3DNZHJTXKEEUGFHLKJCKSO4HX/action/storage_attestation","attest_author":"https://pith.science/pith/R3DNZHJTXKEEUGFHLKJCKSO4HX/action/author_attestation","sign_citation":"https://pith.science/pith/R3DNZHJTXKEEUGFHLKJCKSO4HX/action/citation_signature","submit_replication":"https://pith.science/pith/R3DNZHJTXKEEUGFHLKJCKSO4HX/action/replication_record"}},"created_at":"2026-07-04T14:59:14.551637+00:00","updated_at":"2026-07-04T14:59:14.551637+00:00"}