{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2JS4OKQL4H4TGLVBVKDEZIEFCJ","short_pith_number":"pith:2JS4OKQL","schema_version":"1.0","canonical_sha256":"d265c72a0be1f9332ea1aa864ca0851249f0e2cdced19062f73ae2ae34cb3490","source":{"kind":"arxiv","id":"1507.00648","version":1},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for Connected Maximum Cut and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Kortsarz, Kanthi Sarpatwar, Manish Purohit, MohammadTaghi Hajiaghayi, Robert MacDavid","submitted_at":"2015-07-02T16:20:13Z","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"},"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":"1507.00648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-02T16:20:13Z","cross_cats_sorted":[],"title_canon_sha256":"e4c4a6b9c0fada20e6046bd0a6c27883c7c3617ca3e896184b77fd10dfabef0a","abstract_canon_sha256":"1b4feac1a9b4fa99b371cc5251af3e6031539909fddba434381452c742cae53d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:24.008761Z","signature_b64":"W9NTlMvNr6cDhSox7CC1KgSkF23Y6Z1vt9c3ArtSEoV62ychZhLlul54/q+lUow9bKgE9vVz4l/v/77teMI6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d265c72a0be1f9332ea1aa864ca0851249f0e2cdced19062f73ae2ae34cb3490","last_reissued_at":"2026-05-18T01:37:24.008281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:24.008281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Connected Maximum Cut and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Kortsarz, Kanthi Sarpatwar, Manish Purohit, MohammadTaghi Hajiaghayi, Robert MacDavid","submitted_at":"2015-07-02T16:20:13Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00648","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":"1507.00648","created_at":"2026-05-18T01:37:24.008356+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00648v1","created_at":"2026-05-18T01:37:24.008356+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00648","created_at":"2026-05-18T01:37:24.008356+00:00"},{"alias_kind":"pith_short_12","alias_value":"2JS4OKQL4H4T","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2JS4OKQL4H4TGLVB","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2JS4OKQL","created_at":"2026-05-18T12:28:59.999130+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/2JS4OKQL4H4TGLVBVKDEZIEFCJ","json":"https://pith.science/pith/2JS4OKQL4H4TGLVBVKDEZIEFCJ.json","graph_json":"https://pith.science/api/pith-number/2JS4OKQL4H4TGLVBVKDEZIEFCJ/graph.json","events_json":"https://pith.science/api/pith-number/2JS4OKQL4H4TGLVBVKDEZIEFCJ/events.json","paper":"https://pith.science/paper/2JS4OKQL"},"agent_actions":{"view_html":"https://pith.science/pith/2JS4OKQL4H4TGLVBVKDEZIEFCJ","download_json":"https://pith.science/pith/2JS4OKQL4H4TGLVBVKDEZIEFCJ.json","view_paper":"https://pith.science/paper/2JS4OKQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00648&json=true","fetch_graph":"https://pith.science/api/pith-number/2JS4OKQL4H4TGLVBVKDEZIEFCJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2JS4OKQL4H4TGLVBVKDEZIEFCJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2JS4OKQL4H4TGLVBVKDEZIEFCJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2JS4OKQL4H4TGLVBVKDEZIEFCJ/action/storage_attestation","attest_author":"https://pith.science/pith/2JS4OKQL4H4TGLVBVKDEZIEFCJ/action/author_attestation","sign_citation":"https://pith.science/pith/2JS4OKQL4H4TGLVBVKDEZIEFCJ/action/citation_signature","submit_replication":"https://pith.science/pith/2JS4OKQL4H4TGLVBVKDEZIEFCJ/action/replication_record"}},"created_at":"2026-05-18T01:37:24.008356+00:00","updated_at":"2026-05-18T01:37:24.008356+00:00"}