{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IXQXVXFGDJJQQ4I5RM3PNWPRNI","short_pith_number":"pith:IXQXVXFG","schema_version":"1.0","canonical_sha256":"45e17adca61a5308711d8b36f6d9f16a2a42356e4c06095a472e410a45ef47e9","source":{"kind":"arxiv","id":"1711.02419","version":2},"attestation_state":"computed","paper":{"title":"A Max-Cut approximation using a graph based MBO scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AP","authors_text":"Blaine Keetch, Yves van Gennip","submitted_at":"2017-11-07T11:57:07Z","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"},"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":"1711.02419","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2017-11-07T11:57:07Z","cross_cats_sorted":[],"title_canon_sha256":"669cd4ef144138ef1fb3b4b30ec2e7b04c684f0bb44257896b78313d467bcd05","abstract_canon_sha256":"962520a1aa0e218741042b5a2c226ae3b18574042763ebe3a43a362076f18384"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:01.430701Z","signature_b64":"RTM0AdzZnzOS4vDibE5KTy+wkl5/mAS+u0AeAXMczVnf3Wz2aHObiwVuZYlt5TcmdZQqlvfSQqlk6uWnHf8MCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45e17adca61a5308711d8b36f6d9f16a2a42356e4c06095a472e410a45ef47e9","last_reissued_at":"2026-05-17T23:41:01.430067Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:01.430067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Max-Cut approximation using a graph based MBO scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AP","authors_text":"Blaine Keetch, Yves van Gennip","submitted_at":"2017-11-07T11:57:07Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02419","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":"1711.02419","created_at":"2026-05-17T23:41:01.430174+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02419v2","created_at":"2026-05-17T23:41:01.430174+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02419","created_at":"2026-05-17T23:41:01.430174+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXQXVXFGDJJQ","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXQXVXFGDJJQQ4I5","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXQXVXFG","created_at":"2026-05-18T12:31:21.493067+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/IXQXVXFGDJJQQ4I5RM3PNWPRNI","json":"https://pith.science/pith/IXQXVXFGDJJQQ4I5RM3PNWPRNI.json","graph_json":"https://pith.science/api/pith-number/IXQXVXFGDJJQQ4I5RM3PNWPRNI/graph.json","events_json":"https://pith.science/api/pith-number/IXQXVXFGDJJQQ4I5RM3PNWPRNI/events.json","paper":"https://pith.science/paper/IXQXVXFG"},"agent_actions":{"view_html":"https://pith.science/pith/IXQXVXFGDJJQQ4I5RM3PNWPRNI","download_json":"https://pith.science/pith/IXQXVXFGDJJQQ4I5RM3PNWPRNI.json","view_paper":"https://pith.science/paper/IXQXVXFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02419&json=true","fetch_graph":"https://pith.science/api/pith-number/IXQXVXFGDJJQQ4I5RM3PNWPRNI/graph.json","fetch_events":"https://pith.science/api/pith-number/IXQXVXFGDJJQQ4I5RM3PNWPRNI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXQXVXFGDJJQQ4I5RM3PNWPRNI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXQXVXFGDJJQQ4I5RM3PNWPRNI/action/storage_attestation","attest_author":"https://pith.science/pith/IXQXVXFGDJJQQ4I5RM3PNWPRNI/action/author_attestation","sign_citation":"https://pith.science/pith/IXQXVXFGDJJQQ4I5RM3PNWPRNI/action/citation_signature","submit_replication":"https://pith.science/pith/IXQXVXFGDJJQQ4I5RM3PNWPRNI/action/replication_record"}},"created_at":"2026-05-17T23:41:01.430174+00:00","updated_at":"2026-05-17T23:41:01.430174+00:00"}