{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IXQXVXFGDJJQQ4I5RM3PNWPRNI","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":"962520a1aa0e218741042b5a2c226ae3b18574042763ebe3a43a362076f18384","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2017-11-07T11:57:07Z","title_canon_sha256":"669cd4ef144138ef1fb3b4b30ec2e7b04c684f0bb44257896b78313d467bcd05"},"schema_version":"1.0","source":{"id":"1711.02419","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02419","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02419v2","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02419","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"IXQXVXFGDJJQ","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IXQXVXFGDJJQQ4I5","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IXQXVXFG","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:ce2c5dc60c61d9521263d500733a0e38b94a71cec810b757224ba182b2cace73","target":"graph","created_at":"2026-05-17T23:41:01Z","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":"The Max-Cut problem is a well known combinatorial optimization problem. In this paper we describe a fast approximation method. Given a graph G, we want to find a cut whose size is maximal among all possible cuts. A cut is a partition of the vertex set of G into two disjoint subsets. For an unweighted graph, the size of the cut is the number of edges that have one vertex on either side of the partition; we also consider a weighted version of the problem where each edge contributes a nonnegative weight to the cut. We introduce the signless Ginzburg-Landau functional and prove that this functiona","authors_text":"Blaine Keetch, Yves van Gennip","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2017-11-07T11:57:07Z","title":"A Max-Cut approximation using a graph based MBO scheme"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02419","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:37dbfc20014e7471f8ab715bfc49d4135780ba3557f37fbaa5d7d1f56c65820d","target":"record","created_at":"2026-05-17T23:41:01Z","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":"962520a1aa0e218741042b5a2c226ae3b18574042763ebe3a43a362076f18384","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2017-11-07T11:57:07Z","title_canon_sha256":"669cd4ef144138ef1fb3b4b30ec2e7b04c684f0bb44257896b78313d467bcd05"},"schema_version":"1.0","source":{"id":"1711.02419","kind":"arxiv","version":2}},"canonical_sha256":"45e17adca61a5308711d8b36f6d9f16a2a42356e4c06095a472e410a45ef47e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45e17adca61a5308711d8b36f6d9f16a2a42356e4c06095a472e410a45ef47e9","first_computed_at":"2026-05-17T23:41:01.430067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:01.430067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RTM0AdzZnzOS4vDibE5KTy+wkl5/mAS+u0AeAXMczVnf3Wz2aHObiwVuZYlt5TcmdZQqlvfSQqlk6uWnHf8MCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:01.430701Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02419","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37dbfc20014e7471f8ab715bfc49d4135780ba3557f37fbaa5d7d1f56c65820d","sha256:ce2c5dc60c61d9521263d500733a0e38b94a71cec810b757224ba182b2cace73"],"state_sha256":"807855b75335e8f6a264ef827795a7dbbd9451e279ec05b037180999137f0b8e"}