{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GD3IWGC7IIA7ZX5KOSY5NA62TL","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":"291b4bcb35ee1e765bce40ede1bad1f8146429b866b1b1f99c47e8e76ce30421","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-24T15:56:10Z","title_canon_sha256":"f4da19d0097cc281e66e7b9b039aba0ccb6f5da90f7c3be98877d12c79291a37"},"schema_version":"1.0","source":{"id":"1805.09747","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09747","created_at":"2026-05-18T00:15:02Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09747v1","created_at":"2026-05-18T00:15:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09747","created_at":"2026-05-18T00:15:02Z"},{"alias_kind":"pith_short_12","alias_value":"GD3IWGC7IIA7","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GD3IWGC7IIA7ZX5K","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GD3IWGC7","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:169c4e4d94ed686722bd7073cc836b43e6638c03414686ad7a26c7679348025f","target":"graph","created_at":"2026-05-18T00:15:02Z","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":"The problem of computing the vertex expansion of a graph is an NP-hard problem. The current best worst-case approximation guarantees for computing the vertex expansion of a graph are a $O(\\sqrt{\\log n})$-approximation algorithm due to Feige, Hajiaghayi and Lee [SIAM J. Comp., 2008], and $O(\\sqrt{OPT \\log d})$ bound in graphs having vertex degrees at most $d$, due to Louis, Raghavendra and Vempala [FOCS 2013].\n  We study a natural semi-random model of graphs with sparse vertex cuts. For certain ranges of parameters, we give an algorithm to recover the planted sparse vertex cut exactly. For a la","authors_text":"Anand Louis, Rakesh Venkat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-24T15:56:10Z","title":"Semi-Random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09747","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:770e09bdef7e8959010fc8d0518322a6ff50177e060ea3a5c7657af357d9160e","target":"record","created_at":"2026-05-18T00:15:02Z","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":"291b4bcb35ee1e765bce40ede1bad1f8146429b866b1b1f99c47e8e76ce30421","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-24T15:56:10Z","title_canon_sha256":"f4da19d0097cc281e66e7b9b039aba0ccb6f5da90f7c3be98877d12c79291a37"},"schema_version":"1.0","source":{"id":"1805.09747","kind":"arxiv","version":1}},"canonical_sha256":"30f68b185f4201fcdfaa74b1d683da9ad45572708b88794e260c45dee0e2102b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30f68b185f4201fcdfaa74b1d683da9ad45572708b88794e260c45dee0e2102b","first_computed_at":"2026-05-18T00:15:02.933818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:02.933818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XJ/1rjDUzWKd92gQF64qer4KFeSOO/eA8/GsGN2y5nMcucfFbqNi27I23IQeRMfZP4vg3wplpTJtWa4Y6J67Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:02.934629Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09747","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:770e09bdef7e8959010fc8d0518322a6ff50177e060ea3a5c7657af357d9160e","sha256:169c4e4d94ed686722bd7073cc836b43e6638c03414686ad7a26c7679348025f"],"state_sha256":"d5cf8ed93642b1d5e16066191723ed68721f8909c55cbf0815a0d9929e0ebd07"}