{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2JS4OKQL4H4TGLVBVKDEZIEFCJ","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":"1b4feac1a9b4fa99b371cc5251af3e6031539909fddba434381452c742cae53d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-02T16:20:13Z","title_canon_sha256":"e4c4a6b9c0fada20e6046bd0a6c27883c7c3617ca3e896184b77fd10dfabef0a"},"schema_version":"1.0","source":{"id":"1507.00648","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00648","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00648v1","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00648","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"pith_short_12","alias_value":"2JS4OKQL4H4T","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2JS4OKQL4H4TGLVB","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2JS4OKQL","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:7141e82c2f2e639c206f1458770c06f9cd176a62e21b048a30b3bf70d3eb9fdc","target":"graph","created_at":"2026-05-18T01:37:24Z","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":"An instance of the Connected Maximum Cut problem consists of an undirected graph G = (V, E) and the goal is to find a subset of vertices S $\\subseteq$ V that maximizes the number of edges in the cut \\delta(S) such that the induced graph G[S] is connected. We present the first non-trivial \\Omega(1/log n) approximation algorithm for the connected maximum cut problem in general graphs using novel techniques. We then extend our algorithm to an edge weighted case and obtain a poly-logarithmic approximation algorithm. Interestingly, in stark contrast to the classical max-cut problem, we show that th","authors_text":"Guy Kortsarz, Kanthi Sarpatwar, Manish Purohit, MohammadTaghi Hajiaghayi, Robert MacDavid","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-02T16:20:13Z","title":"Approximation Algorithms for Connected Maximum Cut and Related Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00648","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:9fd3c4e3ca03893fbc8fcf0279ed726f548187af07032aa00330ecc2362e50cc","target":"record","created_at":"2026-05-18T01:37:24Z","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":"1b4feac1a9b4fa99b371cc5251af3e6031539909fddba434381452c742cae53d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-02T16:20:13Z","title_canon_sha256":"e4c4a6b9c0fada20e6046bd0a6c27883c7c3617ca3e896184b77fd10dfabef0a"},"schema_version":"1.0","source":{"id":"1507.00648","kind":"arxiv","version":1}},"canonical_sha256":"d265c72a0be1f9332ea1aa864ca0851249f0e2cdced19062f73ae2ae34cb3490","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d265c72a0be1f9332ea1aa864ca0851249f0e2cdced19062f73ae2ae34cb3490","first_computed_at":"2026-05-18T01:37:24.008281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:24.008281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W9NTlMvNr6cDhSox7CC1KgSkF23Y6Z1vt9c3ArtSEoV62ychZhLlul54/q+lUow9bKgE9vVz4l/v/77teMI6Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:24.008761Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.00648","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fd3c4e3ca03893fbc8fcf0279ed726f548187af07032aa00330ecc2362e50cc","sha256:7141e82c2f2e639c206f1458770c06f9cd176a62e21b048a30b3bf70d3eb9fdc"],"state_sha256":"63f5e3b441252b6ad4f3982503d140df9b29c43960a29bc8716489a965c73da5"}