{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:P53BAKLZLFZ6NS42WSKIFONLUR","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":"3cd04e0933fe82f526969e2c366e2173c0f7e63a62b64a940d9c728684e3f8c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-15T13:07:07Z","title_canon_sha256":"099b2fb7f33be3dcc7582d646d4eb68b49ad2af28f385793694c6ae735a58f75"},"schema_version":"1.0","source":{"id":"1803.05718","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05718","created_at":"2026-05-18T00:02:53Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05718v2","created_at":"2026-05-18T00:02:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05718","created_at":"2026-05-18T00:02:53Z"},{"alias_kind":"pith_short_12","alias_value":"P53BAKLZLFZ6","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P53BAKLZLFZ6NS42","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P53BAKLZ","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:a80ce8728bd94e92934ef9b7a8bdb5039a4aab11a1b1289d1310fecc8da2eacc","target":"graph","created_at":"2026-05-18T00:02:53Z","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":"We consider the max-cut and max-$k$-cut problems under graph-based constraints. Our approach can handle any constraint specified using monadic second-order (MSO) logic on graphs of constant treewidth. We give a $\\frac{1}{2}$-approximation algorithm for this class of problems.","authors_text":"Jon Lee, Martin Kouteck\\'y, Viswanath Nagarajan, Xiangkun Shen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-15T13:07:07Z","title":"Approximating Max-Cut under Graph-MSO Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05718","kind":"arxiv","version":2},"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:b5bf85fd45084945d4adedc0fb350988b0ac084e3ef8d3f64d5b55211161fb7b","target":"record","created_at":"2026-05-18T00:02:53Z","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":"3cd04e0933fe82f526969e2c366e2173c0f7e63a62b64a940d9c728684e3f8c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-15T13:07:07Z","title_canon_sha256":"099b2fb7f33be3dcc7582d646d4eb68b49ad2af28f385793694c6ae735a58f75"},"schema_version":"1.0","source":{"id":"1803.05718","kind":"arxiv","version":2}},"canonical_sha256":"7f761029795973e6cb9ab49482b9aba448d87369afcefde5f4837580860563f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f761029795973e6cb9ab49482b9aba448d87369afcefde5f4837580860563f9","first_computed_at":"2026-05-18T00:02:53.279220Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:53.279220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PGGhNGpr2O4Vu8GVorwS5FNoOvj515Y4uOGfbBV9luFPFkFZKaVkCIdOOE+Thbdypb/jpsHg6UPZ/1U+6ar1DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:53.279904Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.05718","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5bf85fd45084945d4adedc0fb350988b0ac084e3ef8d3f64d5b55211161fb7b","sha256:a80ce8728bd94e92934ef9b7a8bdb5039a4aab11a1b1289d1310fecc8da2eacc"],"state_sha256":"06ba502f3a916d08025209ac31c03fa703edf51d4071a07f1e8d316e6f35c0a2"}