{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MPSPV675P5CKWMUMTL77WAZDFB","short_pith_number":"pith:MPSPV675","schema_version":"1.0","canonical_sha256":"63e4fafbfd7f44ab328c9afffb03232853a3e5dd021c57be87df542355472480","source":{"kind":"arxiv","id":"1511.08152","version":1},"attestation_state":"computed","paper":{"title":"Max-Cut under Graph Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jon Lee, Viswanath Nagarajan, Xiangkun Shen","submitted_at":"2015-11-25T19:01:05Z","abstract_excerpt":"An instance of the graph-constrained max-cut (GCMC) problem consists of (i) an undirected graph G and (ii) edge-weights on a complete undirected graph on the same vertex set. The objective is to find a subset of vertices satisfying some graph-based constraint in G that maximizes the total weight of edges in the cut. The types of graph constraints we can handle include independent set, vertex cover, dominating set and connectivity. Our main results are for the case when G is a graph with bounded treewidth, where we obtain a 0.5-approximation algorithm. Our algorithm uses an LP relaxation based "},"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":"1511.08152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-25T19:01:05Z","cross_cats_sorted":[],"title_canon_sha256":"6f6a47e83a1d6bd7aafb79094831d03f1bfb36495f59419e46348011a83c9ed2","abstract_canon_sha256":"0003a557202d4f8bece26bf85b4e563836a32e03552738830d93cb0cbe30aa43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:00.622356Z","signature_b64":"+39u0EsmgzBk9h900VjrkHrGJQsKGkCY4wKL1IgaF40ON4FtP8zO8yd17QIoV/kQaiRDeA1EXdU7frSIYNofAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63e4fafbfd7f44ab328c9afffb03232853a3e5dd021c57be87df542355472480","last_reissued_at":"2026-05-18T00:03:00.621741Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:00.621741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Max-Cut under Graph Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jon Lee, Viswanath Nagarajan, Xiangkun Shen","submitted_at":"2015-11-25T19:01:05Z","abstract_excerpt":"An instance of the graph-constrained max-cut (GCMC) problem consists of (i) an undirected graph G and (ii) edge-weights on a complete undirected graph on the same vertex set. The objective is to find a subset of vertices satisfying some graph-based constraint in G that maximizes the total weight of edges in the cut. The types of graph constraints we can handle include independent set, vertex cover, dominating set and connectivity. Our main results are for the case when G is a graph with bounded treewidth, where we obtain a 0.5-approximation algorithm. Our algorithm uses an LP relaxation based "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08152","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":"1511.08152","created_at":"2026-05-18T00:03:00.621845+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.08152v1","created_at":"2026-05-18T00:03:00.621845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08152","created_at":"2026-05-18T00:03:00.621845+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPSPV675P5CK","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPSPV675P5CKWMUM","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPSPV675","created_at":"2026-05-18T12:29:32.376354+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/MPSPV675P5CKWMUMTL77WAZDFB","json":"https://pith.science/pith/MPSPV675P5CKWMUMTL77WAZDFB.json","graph_json":"https://pith.science/api/pith-number/MPSPV675P5CKWMUMTL77WAZDFB/graph.json","events_json":"https://pith.science/api/pith-number/MPSPV675P5CKWMUMTL77WAZDFB/events.json","paper":"https://pith.science/paper/MPSPV675"},"agent_actions":{"view_html":"https://pith.science/pith/MPSPV675P5CKWMUMTL77WAZDFB","download_json":"https://pith.science/pith/MPSPV675P5CKWMUMTL77WAZDFB.json","view_paper":"https://pith.science/paper/MPSPV675","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.08152&json=true","fetch_graph":"https://pith.science/api/pith-number/MPSPV675P5CKWMUMTL77WAZDFB/graph.json","fetch_events":"https://pith.science/api/pith-number/MPSPV675P5CKWMUMTL77WAZDFB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPSPV675P5CKWMUMTL77WAZDFB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPSPV675P5CKWMUMTL77WAZDFB/action/storage_attestation","attest_author":"https://pith.science/pith/MPSPV675P5CKWMUMTL77WAZDFB/action/author_attestation","sign_citation":"https://pith.science/pith/MPSPV675P5CKWMUMTL77WAZDFB/action/citation_signature","submit_replication":"https://pith.science/pith/MPSPV675P5CKWMUMTL77WAZDFB/action/replication_record"}},"created_at":"2026-05-18T00:03:00.621845+00:00","updated_at":"2026-05-18T00:03:00.621845+00:00"}