{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:P53BAKLZLFZ6NS42WSKIFONLUR","short_pith_number":"pith:P53BAKLZ","schema_version":"1.0","canonical_sha256":"7f761029795973e6cb9ab49482b9aba448d87369afcefde5f4837580860563f9","source":{"kind":"arxiv","id":"1803.05718","version":2},"attestation_state":"computed","paper":{"title":"Approximating Max-Cut under Graph-MSO Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jon Lee, Martin Kouteck\\'y, Viswanath Nagarajan, Xiangkun Shen","submitted_at":"2018-03-15T13:07:07Z","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."},"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":"1803.05718","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-15T13:07:07Z","cross_cats_sorted":[],"title_canon_sha256":"099b2fb7f33be3dcc7582d646d4eb68b49ad2af28f385793694c6ae735a58f75","abstract_canon_sha256":"3cd04e0933fe82f526969e2c366e2173c0f7e63a62b64a940d9c728684e3f8c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:53.279904Z","signature_b64":"PGGhNGpr2O4Vu8GVorwS5FNoOvj515Y4uOGfbBV9luFPFkFZKaVkCIdOOE+Thbdypb/jpsHg6UPZ/1U+6ar1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f761029795973e6cb9ab49482b9aba448d87369afcefde5f4837580860563f9","last_reissued_at":"2026-05-18T00:02:53.279220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:53.279220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Max-Cut under Graph-MSO Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jon Lee, Martin Kouteck\\'y, Viswanath Nagarajan, Xiangkun Shen","submitted_at":"2018-03-15T13:07:07Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05718","kind":"arxiv","version":2},"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":"1803.05718","created_at":"2026-05-18T00:02:53.279329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.05718v2","created_at":"2026-05-18T00:02:53.279329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05718","created_at":"2026-05-18T00:02:53.279329+00:00"},{"alias_kind":"pith_short_12","alias_value":"P53BAKLZLFZ6","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"P53BAKLZLFZ6NS42","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"P53BAKLZ","created_at":"2026-05-18T12:32:43.782077+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/P53BAKLZLFZ6NS42WSKIFONLUR","json":"https://pith.science/pith/P53BAKLZLFZ6NS42WSKIFONLUR.json","graph_json":"https://pith.science/api/pith-number/P53BAKLZLFZ6NS42WSKIFONLUR/graph.json","events_json":"https://pith.science/api/pith-number/P53BAKLZLFZ6NS42WSKIFONLUR/events.json","paper":"https://pith.science/paper/P53BAKLZ"},"agent_actions":{"view_html":"https://pith.science/pith/P53BAKLZLFZ6NS42WSKIFONLUR","download_json":"https://pith.science/pith/P53BAKLZLFZ6NS42WSKIFONLUR.json","view_paper":"https://pith.science/paper/P53BAKLZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.05718&json=true","fetch_graph":"https://pith.science/api/pith-number/P53BAKLZLFZ6NS42WSKIFONLUR/graph.json","fetch_events":"https://pith.science/api/pith-number/P53BAKLZLFZ6NS42WSKIFONLUR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P53BAKLZLFZ6NS42WSKIFONLUR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P53BAKLZLFZ6NS42WSKIFONLUR/action/storage_attestation","attest_author":"https://pith.science/pith/P53BAKLZLFZ6NS42WSKIFONLUR/action/author_attestation","sign_citation":"https://pith.science/pith/P53BAKLZLFZ6NS42WSKIFONLUR/action/citation_signature","submit_replication":"https://pith.science/pith/P53BAKLZLFZ6NS42WSKIFONLUR/action/replication_record"}},"created_at":"2026-05-18T00:02:53.279329+00:00","updated_at":"2026-05-18T00:02:53.279329+00:00"}