{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZI6A4ODMEJJMA2ZCSTAFWVQMLO","short_pith_number":"pith:ZI6A4ODM","schema_version":"1.0","canonical_sha256":"ca3c0e386c2252c06b2294c05b560c5ba01a806773a05991b8848a3a46f591bb","source":{"kind":"arxiv","id":"2303.17215","version":3},"attestation_state":"computed","paper":{"title":"Stabilizer Approximation III: Maximum Cut","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.CO","math.OC"],"primary_cat":"quant-ph","authors_text":"Chuixiong Wu, Fen Zuo, Jianan Wang","submitted_at":"2023-03-30T08:18:01Z","abstract_excerpt":"We apply the stabilizer formalism to the Maximum Cut problem, and obtain a new greedy construction heuristic. It turns out to be an elegant synthesis of the edge-contraction and differencing edge-contraction approaches. Utilizing the relation between the Maximum Cut problem and the Ising model, the approximation ratio of the heuristic is easily found to be at least $1/2$. Moreover, numerical results show that the heuristic has very nice performance for graphs with about 100 vertices."},"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":"2303.17215","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-03-30T08:18:01Z","cross_cats_sorted":["math.CO","math.OC"],"title_canon_sha256":"85495ff44c5f2e1e26291e64597ede415e0df54fc37dc254e761ff292dd93f1c","abstract_canon_sha256":"b5c96041f071ab154663ab2cf2ca3889544544af02237fa8ebbe902137c90d0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:14:41.888939Z","signature_b64":"QCA5YCrdUSmAjg2yotfzCfR9LdGCLj/+PkWlqxXEUDNLR8KAjgEcvGVnZJKc2bMVIO3PxQd70jdXc2PZPLzCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca3c0e386c2252c06b2294c05b560c5ba01a806773a05991b8848a3a46f591bb","last_reissued_at":"2026-07-05T06:14:41.888526Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:14:41.888526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stabilizer Approximation III: Maximum Cut","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.CO","math.OC"],"primary_cat":"quant-ph","authors_text":"Chuixiong Wu, Fen Zuo, Jianan Wang","submitted_at":"2023-03-30T08:18:01Z","abstract_excerpt":"We apply the stabilizer formalism to the Maximum Cut problem, and obtain a new greedy construction heuristic. It turns out to be an elegant synthesis of the edge-contraction and differencing edge-contraction approaches. Utilizing the relation between the Maximum Cut problem and the Ising model, the approximation ratio of the heuristic is easily found to be at least $1/2$. Moreover, numerical results show that the heuristic has very nice performance for graphs with about 100 vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.17215","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.17215/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2303.17215","created_at":"2026-07-05T06:14:41.888602+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.17215v3","created_at":"2026-07-05T06:14:41.888602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.17215","created_at":"2026-07-05T06:14:41.888602+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZI6A4ODMEJJM","created_at":"2026-07-05T06:14:41.888602+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZI6A4ODMEJJMA2ZC","created_at":"2026-07-05T06:14:41.888602+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZI6A4ODM","created_at":"2026-07-05T06:14:41.888602+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.06320","citing_title":"Improving stabilizer approximation with quantum strategy","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZI6A4ODMEJJMA2ZCSTAFWVQMLO","json":"https://pith.science/pith/ZI6A4ODMEJJMA2ZCSTAFWVQMLO.json","graph_json":"https://pith.science/api/pith-number/ZI6A4ODMEJJMA2ZCSTAFWVQMLO/graph.json","events_json":"https://pith.science/api/pith-number/ZI6A4ODMEJJMA2ZCSTAFWVQMLO/events.json","paper":"https://pith.science/paper/ZI6A4ODM"},"agent_actions":{"view_html":"https://pith.science/pith/ZI6A4ODMEJJMA2ZCSTAFWVQMLO","download_json":"https://pith.science/pith/ZI6A4ODMEJJMA2ZCSTAFWVQMLO.json","view_paper":"https://pith.science/paper/ZI6A4ODM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.17215&json=true","fetch_graph":"https://pith.science/api/pith-number/ZI6A4ODMEJJMA2ZCSTAFWVQMLO/graph.json","fetch_events":"https://pith.science/api/pith-number/ZI6A4ODMEJJMA2ZCSTAFWVQMLO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZI6A4ODMEJJMA2ZCSTAFWVQMLO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZI6A4ODMEJJMA2ZCSTAFWVQMLO/action/storage_attestation","attest_author":"https://pith.science/pith/ZI6A4ODMEJJMA2ZCSTAFWVQMLO/action/author_attestation","sign_citation":"https://pith.science/pith/ZI6A4ODMEJJMA2ZCSTAFWVQMLO/action/citation_signature","submit_replication":"https://pith.science/pith/ZI6A4ODMEJJMA2ZCSTAFWVQMLO/action/replication_record"}},"created_at":"2026-07-05T06:14:41.888602+00:00","updated_at":"2026-07-05T06:14:41.888602+00:00"}