{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UZNKIMYSQXYPSQ6PICZYW7K2VI","short_pith_number":"pith:UZNKIMYS","schema_version":"1.0","canonical_sha256":"a65aa4331285f0f943cf40b38b7d5aaa33dccdb52fa9c8e758d3d9ab9b266e77","source":{"kind":"arxiv","id":"1807.09898","version":1},"attestation_state":"computed","paper":{"title":"Mildly Exponential Time Approximation Algorithms for Vertex Cover, Uniform Sparsest Cut and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Luca Trevisan, Pasin Manurangsi","submitted_at":"2018-07-25T23:26:43Z","abstract_excerpt":"In this work, we study the trade-off between the running time of approximation algorithms and their approximation guarantees. By leveraging a structure of the `hard' instances of the Arora-Rao-Vazirani lemma [JACM'09], we show that the Sum-of-Squares hierarchy can be adapted to provide `fast', but still exponential time, approximation algorithms for several problems in the regime where they are believed to be NP-hard. Specifically, our framework yields the following algorithms; here $n$ denote the number of vertices of the graph and $r$ can be any positive real number greater than 1 (possibly "},"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":"1807.09898","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-25T23:26:43Z","cross_cats_sorted":[],"title_canon_sha256":"41eff3ca060e953bd11762e3f246a9a433b98231267eed8e5c9cc9d01ec82730","abstract_canon_sha256":"5c5520b93555bc615334a45c98699b9ceae3c5e17a1218ce969e551f6b745ca9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:46.206517Z","signature_b64":"6ac23wfFx299BzRWRUZAedics1RT6PqTsK99Q0MV8J9LLnA5sR8DkrMfR/86hrck1377Hnf4UWl4NcJTaXjfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a65aa4331285f0f943cf40b38b7d5aaa33dccdb52fa9c8e758d3d9ab9b266e77","last_reissued_at":"2026-05-18T00:09:46.205693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:46.205693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mildly Exponential Time Approximation Algorithms for Vertex Cover, Uniform Sparsest Cut and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Luca Trevisan, Pasin Manurangsi","submitted_at":"2018-07-25T23:26:43Z","abstract_excerpt":"In this work, we study the trade-off between the running time of approximation algorithms and their approximation guarantees. By leveraging a structure of the `hard' instances of the Arora-Rao-Vazirani lemma [JACM'09], we show that the Sum-of-Squares hierarchy can be adapted to provide `fast', but still exponential time, approximation algorithms for several problems in the regime where they are believed to be NP-hard. Specifically, our framework yields the following algorithms; here $n$ denote the number of vertices of the graph and $r$ can be any positive real number greater than 1 (possibly "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09898","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":"1807.09898","created_at":"2026-05-18T00:09:46.205815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.09898v1","created_at":"2026-05-18T00:09:46.205815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09898","created_at":"2026-05-18T00:09:46.205815+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZNKIMYSQXYP","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZNKIMYSQXYPSQ6P","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZNKIMYS","created_at":"2026-05-18T12:32:56.356000+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/UZNKIMYSQXYPSQ6PICZYW7K2VI","json":"https://pith.science/pith/UZNKIMYSQXYPSQ6PICZYW7K2VI.json","graph_json":"https://pith.science/api/pith-number/UZNKIMYSQXYPSQ6PICZYW7K2VI/graph.json","events_json":"https://pith.science/api/pith-number/UZNKIMYSQXYPSQ6PICZYW7K2VI/events.json","paper":"https://pith.science/paper/UZNKIMYS"},"agent_actions":{"view_html":"https://pith.science/pith/UZNKIMYSQXYPSQ6PICZYW7K2VI","download_json":"https://pith.science/pith/UZNKIMYSQXYPSQ6PICZYW7K2VI.json","view_paper":"https://pith.science/paper/UZNKIMYS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.09898&json=true","fetch_graph":"https://pith.science/api/pith-number/UZNKIMYSQXYPSQ6PICZYW7K2VI/graph.json","fetch_events":"https://pith.science/api/pith-number/UZNKIMYSQXYPSQ6PICZYW7K2VI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZNKIMYSQXYPSQ6PICZYW7K2VI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZNKIMYSQXYPSQ6PICZYW7K2VI/action/storage_attestation","attest_author":"https://pith.science/pith/UZNKIMYSQXYPSQ6PICZYW7K2VI/action/author_attestation","sign_citation":"https://pith.science/pith/UZNKIMYSQXYPSQ6PICZYW7K2VI/action/citation_signature","submit_replication":"https://pith.science/pith/UZNKIMYSQXYPSQ6PICZYW7K2VI/action/replication_record"}},"created_at":"2026-05-18T00:09:46.205815+00:00","updated_at":"2026-05-18T00:09:46.205815+00:00"}