{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FFQZASDSQ2Z7PW55WNLHUFXCXU","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":"7701efe39eb67556866173fd72b0b8c6cfeddfe8b073f8db8523c788c52b504d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-30T19:31:16Z","title_canon_sha256":"2077dde6f110e4e9ade69e5e5b0e2cec53302db33353234b2435fde47a1fb2cc"},"schema_version":"1.0","source":{"id":"1504.08352","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.08352","created_at":"2026-05-18T02:17:22Z"},{"alias_kind":"arxiv_version","alias_value":"1504.08352v1","created_at":"2026-05-18T02:17:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08352","created_at":"2026-05-18T02:17:22Z"},{"alias_kind":"pith_short_12","alias_value":"FFQZASDSQ2Z7","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FFQZASDSQ2Z7PW55","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FFQZASDS","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:ba4dff771b9f9d9f58fa2e4ae78082d2debadff10e579f7ad24a23bc76bd008e","target":"graph","created_at":"2026-05-18T02:17:22Z","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"},"paper":{"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","authors_text":"Aviad Rubinstein, Mark Braverman, Omri Weinstein, Young Kun Ko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-30T19:31:16Z","title":"ETH Hardness for Densest-$k$-Subgraph with Perfect Completeness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08352","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:3dafd284524cc936d283f26d8893cae8607e9e88ba501fc005c8614f1d5516b9","target":"record","created_at":"2026-05-18T02:17:22Z","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":"7701efe39eb67556866173fd72b0b8c6cfeddfe8b073f8db8523c788c52b504d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-30T19:31:16Z","title_canon_sha256":"2077dde6f110e4e9ade69e5e5b0e2cec53302db33353234b2435fde47a1fb2cc"},"schema_version":"1.0","source":{"id":"1504.08352","kind":"arxiv","version":1}},"canonical_sha256":"296190487286b3f7dbbdb3567a16e2bd106543682e6cbfe48e482c3d9ebef6cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"296190487286b3f7dbbdb3567a16e2bd106543682e6cbfe48e482c3d9ebef6cf","first_computed_at":"2026-05-18T02:17:22.313349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:22.313349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B4nG7RJ+TBwMZvnesJC5FNyoi01eToWb6sTBhO3MoYSO6y8Uy4V9aBbBVspeG3Kr1yPETch5/ybTl8Tp22R7Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:22.314056Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.08352","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3dafd284524cc936d283f26d8893cae8607e9e88ba501fc005c8614f1d5516b9","sha256:ba4dff771b9f9d9f58fa2e4ae78082d2debadff10e579f7ad24a23bc76bd008e"],"state_sha256":"1cbde770c2b4fc75924d7d56f9686e2b74947bad3060728982257a9ea85537ee"}