{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:C4V4HJ3K5D2RHGV3Y3KOSJ4HK4","short_pith_number":"pith:C4V4HJ3K","schema_version":"1.0","canonical_sha256":"172bc3a76ae8f5139abbc6d4e9278757318899a9b5de166d265b62ba77b377ef","source":{"kind":"arxiv","id":"1611.05991","version":2},"attestation_state":"computed","paper":{"title":"Almost-Polynomial Ratio ETH-Hardness of Approximating Densest $k$-Subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Pasin Manurangsi","submitted_at":"2016-11-18T07:05:00Z","abstract_excerpt":"In the Densest $k$-Subgraph problem, given an undirected graph $G$ and an integer $k$, the goal is to find a subgraph of $G$ on $k$ vertices that contains maximum number of edges. Even though the state-of-the-art algorithm for the problem achieves only $O(n^{1/4 + \\varepsilon})$ approximation ratio (Bhaskara et al., 2010), previous attempts at proving hardness of approximation, including those under average case assumptions, fail to achieve a polynomial ratio; the best ratios ruled out under any worst case assumption and any average case assumption are only any constant (Raghavendra and Steure"},"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":"1611.05991","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-18T07:05:00Z","cross_cats_sorted":[],"title_canon_sha256":"57f029812f2b2cb4a7397cace7e965b98762ff5f9648fc5af1f6c3eb0b7e9e44","abstract_canon_sha256":"b8da14f5a16c397b34d7a106740252c9cd325bb7bcbfcbf9924b589c354f7f60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:48.801413Z","signature_b64":"TwgLcQmXM4oGpccvZv2M4438vjb7M9jcliiNfMByp1iHLPq0jZWnkGQ1U15D1Y6XsZ4TcCa1KycFdst5vsD/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"172bc3a76ae8f5139abbc6d4e9278757318899a9b5de166d265b62ba77b377ef","last_reissued_at":"2026-05-18T00:46:48.800774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:48.800774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost-Polynomial Ratio ETH-Hardness of Approximating Densest $k$-Subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Pasin Manurangsi","submitted_at":"2016-11-18T07:05:00Z","abstract_excerpt":"In the Densest $k$-Subgraph problem, given an undirected graph $G$ and an integer $k$, the goal is to find a subgraph of $G$ on $k$ vertices that contains maximum number of edges. Even though the state-of-the-art algorithm for the problem achieves only $O(n^{1/4 + \\varepsilon})$ approximation ratio (Bhaskara et al., 2010), previous attempts at proving hardness of approximation, including those under average case assumptions, fail to achieve a polynomial ratio; the best ratios ruled out under any worst case assumption and any average case assumption are only any constant (Raghavendra and Steure"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05991","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1611.05991","created_at":"2026-05-18T00:46:48.800861+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.05991v2","created_at":"2026-05-18T00:46:48.800861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05991","created_at":"2026-05-18T00:46:48.800861+00:00"},{"alias_kind":"pith_short_12","alias_value":"C4V4HJ3K5D2R","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"C4V4HJ3K5D2RHGV3","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"C4V4HJ3K","created_at":"2026-05-18T12:30:09.641336+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/C4V4HJ3K5D2RHGV3Y3KOSJ4HK4","json":"https://pith.science/pith/C4V4HJ3K5D2RHGV3Y3KOSJ4HK4.json","graph_json":"https://pith.science/api/pith-number/C4V4HJ3K5D2RHGV3Y3KOSJ4HK4/graph.json","events_json":"https://pith.science/api/pith-number/C4V4HJ3K5D2RHGV3Y3KOSJ4HK4/events.json","paper":"https://pith.science/paper/C4V4HJ3K"},"agent_actions":{"view_html":"https://pith.science/pith/C4V4HJ3K5D2RHGV3Y3KOSJ4HK4","download_json":"https://pith.science/pith/C4V4HJ3K5D2RHGV3Y3KOSJ4HK4.json","view_paper":"https://pith.science/paper/C4V4HJ3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.05991&json=true","fetch_graph":"https://pith.science/api/pith-number/C4V4HJ3K5D2RHGV3Y3KOSJ4HK4/graph.json","fetch_events":"https://pith.science/api/pith-number/C4V4HJ3K5D2RHGV3Y3KOSJ4HK4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C4V4HJ3K5D2RHGV3Y3KOSJ4HK4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C4V4HJ3K5D2RHGV3Y3KOSJ4HK4/action/storage_attestation","attest_author":"https://pith.science/pith/C4V4HJ3K5D2RHGV3Y3KOSJ4HK4/action/author_attestation","sign_citation":"https://pith.science/pith/C4V4HJ3K5D2RHGV3Y3KOSJ4HK4/action/citation_signature","submit_replication":"https://pith.science/pith/C4V4HJ3K5D2RHGV3Y3KOSJ4HK4/action/replication_record"}},"created_at":"2026-05-18T00:46:48.800861+00:00","updated_at":"2026-05-18T00:46:48.800861+00:00"}