{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FFQZASDSQ2Z7PW55WNLHUFXCXU","short_pith_number":"pith:FFQZASDS","schema_version":"1.0","canonical_sha256":"296190487286b3f7dbbdb3567a16e2bd106543682e6cbfe48e482c3d9ebef6cf","source":{"kind":"arxiv","id":"1504.08352","version":1},"attestation_state":"computed","paper":{"title":"ETH Hardness for Densest-$k$-Subgraph with Perfect Completeness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Aviad Rubinstein, Mark Braverman, Omri Weinstein, Young Kun Ko","submitted_at":"2015-04-30T19:31:16Z","abstract_excerpt":"We show that, assuming the (deterministic) Exponential Time Hypothesis, distinguishing between a graph with an induced $k$-clique and a graph in which all k-subgraphs have density at most $1-\\epsilon$, requires $n^{\\tilde \\Omega(log n)}$ time. Our result essentially matches the quasi-polynomial algorithms of Feige and Seltser [FS97] and Barman [Bar15] for this problem, and is the first one to rule out an additive PTAS for Densest $k$-Subgraph. We further strengthen this result by showing that our lower bound continues to hold when, in the soundness case, even subgraphs smaller by a near-polyno"},"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":"1504.08352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-30T19:31:16Z","cross_cats_sorted":[],"title_canon_sha256":"2077dde6f110e4e9ade69e5e5b0e2cec53302db33353234b2435fde47a1fb2cc","abstract_canon_sha256":"7701efe39eb67556866173fd72b0b8c6cfeddfe8b073f8db8523c788c52b504d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:22.314056Z","signature_b64":"B4nG7RJ+TBwMZvnesJC5FNyoi01eToWb6sTBhO3MoYSO6y8Uy4V9aBbBVspeG3Kr1yPETch5/ybTl8Tp22R7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"296190487286b3f7dbbdb3567a16e2bd106543682e6cbfe48e482c3d9ebef6cf","last_reissued_at":"2026-05-18T02:17:22.313349Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:22.313349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ETH Hardness for Densest-$k$-Subgraph with Perfect Completeness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Aviad Rubinstein, Mark Braverman, Omri Weinstein, Young Kun Ko","submitted_at":"2015-04-30T19:31:16Z","abstract_excerpt":"We show that, assuming the (deterministic) Exponential Time Hypothesis, distinguishing between a graph with an induced $k$-clique and a graph in which all k-subgraphs have density at most $1-\\epsilon$, requires $n^{\\tilde \\Omega(log n)}$ time. Our result essentially matches the quasi-polynomial algorithms of Feige and Seltser [FS97] and Barman [Bar15] for this problem, and is the first one to rule out an additive PTAS for Densest $k$-Subgraph. We further strengthen this result by showing that our lower bound continues to hold when, in the soundness case, even subgraphs smaller by a near-polyno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08352","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":""},"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":"1504.08352","created_at":"2026-05-18T02:17:22.313478+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.08352v1","created_at":"2026-05-18T02:17:22.313478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08352","created_at":"2026-05-18T02:17:22.313478+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFQZASDSQ2Z7","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFQZASDSQ2Z7PW55","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFQZASDS","created_at":"2026-05-18T12:29:19.899920+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/FFQZASDSQ2Z7PW55WNLHUFXCXU","json":"https://pith.science/pith/FFQZASDSQ2Z7PW55WNLHUFXCXU.json","graph_json":"https://pith.science/api/pith-number/FFQZASDSQ2Z7PW55WNLHUFXCXU/graph.json","events_json":"https://pith.science/api/pith-number/FFQZASDSQ2Z7PW55WNLHUFXCXU/events.json","paper":"https://pith.science/paper/FFQZASDS"},"agent_actions":{"view_html":"https://pith.science/pith/FFQZASDSQ2Z7PW55WNLHUFXCXU","download_json":"https://pith.science/pith/FFQZASDSQ2Z7PW55WNLHUFXCXU.json","view_paper":"https://pith.science/paper/FFQZASDS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.08352&json=true","fetch_graph":"https://pith.science/api/pith-number/FFQZASDSQ2Z7PW55WNLHUFXCXU/graph.json","fetch_events":"https://pith.science/api/pith-number/FFQZASDSQ2Z7PW55WNLHUFXCXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFQZASDSQ2Z7PW55WNLHUFXCXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFQZASDSQ2Z7PW55WNLHUFXCXU/action/storage_attestation","attest_author":"https://pith.science/pith/FFQZASDSQ2Z7PW55WNLHUFXCXU/action/author_attestation","sign_citation":"https://pith.science/pith/FFQZASDSQ2Z7PW55WNLHUFXCXU/action/citation_signature","submit_replication":"https://pith.science/pith/FFQZASDSQ2Z7PW55WNLHUFXCXU/action/replication_record"}},"created_at":"2026-05-18T02:17:22.313478+00:00","updated_at":"2026-05-18T02:17:22.313478+00:00"}