{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UZNKIMYSQXYPSQ6PICZYW7K2VI","short_pith_number":"pith:UZNKIMYS","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"},"canonical_sha256":"a65aa4331285f0f943cf40b38b7d5aaa33dccdb52fa9c8e758d3d9ab9b266e77","source":{"kind":"arxiv","id":"1807.09898","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09898","created_at":"2026-05-18T00:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09898v1","created_at":"2026-05-18T00:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09898","created_at":"2026-05-18T00:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"UZNKIMYSQXYP","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UZNKIMYSQXYPSQ6P","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UZNKIMYS","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UZNKIMYSQXYPSQ6PICZYW7K2VI","target":"record","payload":{"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"},"canonical_sha256":"a65aa4331285f0f943cf40b38b7d5aaa33dccdb52fa9c8e758d3d9ab9b266e77","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"},"source_kind":"arxiv","source_id":"1807.09898","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V455veifBKOgaMC8YWAHvVLVnlTWzne2RQNnfg85Z5uVWrJSMeAMKjVW+N2yvzMsGEAOuOXSdU4JCiSwhjZPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:29:33.983257Z"},"content_sha256":"230a2ad965033b170cd07249c97a7124e2b101a1d08da58780fbdca14af6607f","schema_version":"1.0","event_id":"sha256:230a2ad965033b170cd07249c97a7124e2b101a1d08da58780fbdca14af6607f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UZNKIMYSQXYPSQ6PICZYW7K2VI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4uaYV7Y23TQ76ENYQzT04x9LYRuh0vm/pPZryYZCHfJu897VjKagpYxWnbnkehjdUTb2w+E9g59rDjBpA5EdCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:29:33.983612Z"},"content_sha256":"a7c319a47f91b365bcd5da82614bd8e357ed38213092c7b25bda36d269ab7096","schema_version":"1.0","event_id":"sha256:a7c319a47f91b365bcd5da82614bd8e357ed38213092c7b25bda36d269ab7096"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UZNKIMYSQXYPSQ6PICZYW7K2VI/bundle.json","state_url":"https://pith.science/pith/UZNKIMYSQXYPSQ6PICZYW7K2VI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UZNKIMYSQXYPSQ6PICZYW7K2VI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T15:29:33Z","links":{"resolver":"https://pith.science/pith/UZNKIMYSQXYPSQ6PICZYW7K2VI","bundle":"https://pith.science/pith/UZNKIMYSQXYPSQ6PICZYW7K2VI/bundle.json","state":"https://pith.science/pith/UZNKIMYSQXYPSQ6PICZYW7K2VI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UZNKIMYSQXYPSQ6PICZYW7K2VI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UZNKIMYSQXYPSQ6PICZYW7K2VI","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":"5c5520b93555bc615334a45c98699b9ceae3c5e17a1218ce969e551f6b745ca9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-25T23:26:43Z","title_canon_sha256":"41eff3ca060e953bd11762e3f246a9a433b98231267eed8e5c9cc9d01ec82730"},"schema_version":"1.0","source":{"id":"1807.09898","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09898","created_at":"2026-05-18T00:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09898v1","created_at":"2026-05-18T00:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09898","created_at":"2026-05-18T00:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"UZNKIMYSQXYP","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UZNKIMYSQXYPSQ6P","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UZNKIMYS","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:a7c319a47f91b365bcd5da82614bd8e357ed38213092c7b25bda36d269ab7096","target":"graph","created_at":"2026-05-18T00:09:46Z","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":"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 ","authors_text":"Luca Trevisan, Pasin Manurangsi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-25T23:26:43Z","title":"Mildly Exponential Time Approximation Algorithms for Vertex Cover, Uniform Sparsest Cut and Related Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09898","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:230a2ad965033b170cd07249c97a7124e2b101a1d08da58780fbdca14af6607f","target":"record","created_at":"2026-05-18T00:09:46Z","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":"5c5520b93555bc615334a45c98699b9ceae3c5e17a1218ce969e551f6b745ca9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-25T23:26:43Z","title_canon_sha256":"41eff3ca060e953bd11762e3f246a9a433b98231267eed8e5c9cc9d01ec82730"},"schema_version":"1.0","source":{"id":"1807.09898","kind":"arxiv","version":1}},"canonical_sha256":"a65aa4331285f0f943cf40b38b7d5aaa33dccdb52fa9c8e758d3d9ab9b266e77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a65aa4331285f0f943cf40b38b7d5aaa33dccdb52fa9c8e758d3d9ab9b266e77","first_computed_at":"2026-05-18T00:09:46.205693Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:46.205693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6ac23wfFx299BzRWRUZAedics1RT6PqTsK99Q0MV8J9LLnA5sR8DkrMfR/86hrck1377Hnf4UWl4NcJTaXjfAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:46.206517Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.09898","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:230a2ad965033b170cd07249c97a7124e2b101a1d08da58780fbdca14af6607f","sha256:a7c319a47f91b365bcd5da82614bd8e357ed38213092c7b25bda36d269ab7096"],"state_sha256":"515357340268392847044ee755c0cd7cee66af89c7b36ddfdcb32141f7ccd8d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FbVVMFh5UxL25aEVeC/MnP+5YJmSztRxKygJX+bnPAcN/Si6RAWiSwf/oa9mRySQKNvmwnsYMcA0eioWp1cAAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:29:33.985425Z","bundle_sha256":"3cd8358c04e25ddac91d86eee59383abee8c698a84893005d8933aaf16c09391"}}