{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ZI6A4ODMEJJMA2ZCSTAFWVQMLO","short_pith_number":"pith:ZI6A4ODM","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"},"canonical_sha256":"ca3c0e386c2252c06b2294c05b560c5ba01a806773a05991b8848a3a46f591bb","source":{"kind":"arxiv","id":"2303.17215","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.17215","created_at":"2026-07-05T06:14:41Z"},{"alias_kind":"arxiv_version","alias_value":"2303.17215v3","created_at":"2026-07-05T06:14:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.17215","created_at":"2026-07-05T06:14:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZI6A4ODMEJJM","created_at":"2026-07-05T06:14:41Z"},{"alias_kind":"pith_short_16","alias_value":"ZI6A4ODMEJJMA2ZC","created_at":"2026-07-05T06:14:41Z"},{"alias_kind":"pith_short_8","alias_value":"ZI6A4ODM","created_at":"2026-07-05T06:14:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ZI6A4ODMEJJMA2ZCSTAFWVQMLO","target":"record","payload":{"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"},"canonical_sha256":"ca3c0e386c2252c06b2294c05b560c5ba01a806773a05991b8848a3a46f591bb","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"},"source_kind":"arxiv","source_id":"2303.17215","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:14:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NZl6LB68eygGjDJPIWrGyTxvF7ywOE7oKwRXwxtERrRNwhBlN6PQYDyGmlt8uUanrNQC88rmEk1P1OnXjAXbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T10:50:17.940435Z"},"content_sha256":"b3a68cd6b64e521b91ddacebb5d644514693aca04c42f3d8966ec161b8634835","schema_version":"1.0","event_id":"sha256:b3a68cd6b64e521b91ddacebb5d644514693aca04c42f3d8966ec161b8634835"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ZI6A4ODMEJJMA2ZCSTAFWVQMLO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:14:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GfiZujdS2267O0VndgX2woFUEYy2ZAui+TnjHSW9pMTO2MX0oi8p5yItmn7Dd0GOP3W6PDfaT4qeYsr/MRWjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T10:50:17.941247Z"},"content_sha256":"cfcf85615f2131b9b5b7a10b5201f360d03cfad673d5438dd1124998be25ef4e","schema_version":"1.0","event_id":"sha256:cfcf85615f2131b9b5b7a10b5201f360d03cfad673d5438dd1124998be25ef4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZI6A4ODMEJJMA2ZCSTAFWVQMLO/bundle.json","state_url":"https://pith.science/pith/ZI6A4ODMEJJMA2ZCSTAFWVQMLO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZI6A4ODMEJJMA2ZCSTAFWVQMLO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-12T10:50:17Z","links":{"resolver":"https://pith.science/pith/ZI6A4ODMEJJMA2ZCSTAFWVQMLO","bundle":"https://pith.science/pith/ZI6A4ODMEJJMA2ZCSTAFWVQMLO/bundle.json","state":"https://pith.science/pith/ZI6A4ODMEJJMA2ZCSTAFWVQMLO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZI6A4ODMEJJMA2ZCSTAFWVQMLO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ZI6A4ODMEJJMA2ZCSTAFWVQMLO","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":"b5c96041f071ab154663ab2cf2ca3889544544af02237fa8ebbe902137c90d0a","cross_cats_sorted":["math.CO","math.OC"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-03-30T08:18:01Z","title_canon_sha256":"85495ff44c5f2e1e26291e64597ede415e0df54fc37dc254e761ff292dd93f1c"},"schema_version":"1.0","source":{"id":"2303.17215","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.17215","created_at":"2026-07-05T06:14:41Z"},{"alias_kind":"arxiv_version","alias_value":"2303.17215v3","created_at":"2026-07-05T06:14:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.17215","created_at":"2026-07-05T06:14:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZI6A4ODMEJJM","created_at":"2026-07-05T06:14:41Z"},{"alias_kind":"pith_short_16","alias_value":"ZI6A4ODMEJJMA2ZC","created_at":"2026-07-05T06:14:41Z"},{"alias_kind":"pith_short_8","alias_value":"ZI6A4ODM","created_at":"2026-07-05T06:14:41Z"}],"graph_snapshots":[{"event_id":"sha256:cfcf85615f2131b9b5b7a10b5201f360d03cfad673d5438dd1124998be25ef4e","target":"graph","created_at":"2026-07-05T06:14:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2303.17215/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Chuixiong Wu, Fen Zuo, Jianan Wang","cross_cats":["math.CO","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-03-30T08:18:01Z","title":"Stabilizer Approximation III: Maximum Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.17215","kind":"arxiv","version":3},"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:b3a68cd6b64e521b91ddacebb5d644514693aca04c42f3d8966ec161b8634835","target":"record","created_at":"2026-07-05T06:14:41Z","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":"b5c96041f071ab154663ab2cf2ca3889544544af02237fa8ebbe902137c90d0a","cross_cats_sorted":["math.CO","math.OC"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-03-30T08:18:01Z","title_canon_sha256":"85495ff44c5f2e1e26291e64597ede415e0df54fc37dc254e761ff292dd93f1c"},"schema_version":"1.0","source":{"id":"2303.17215","kind":"arxiv","version":3}},"canonical_sha256":"ca3c0e386c2252c06b2294c05b560c5ba01a806773a05991b8848a3a46f591bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca3c0e386c2252c06b2294c05b560c5ba01a806773a05991b8848a3a46f591bb","first_computed_at":"2026-07-05T06:14:41.888526Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:14:41.888526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QCA5YCrdUSmAjg2yotfzCfR9LdGCLj/+PkWlqxXEUDNLR8KAjgEcvGVnZJKc2bMVIO3PxQd70jdXc2PZPLzCAg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:14:41.888939Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.17215","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3a68cd6b64e521b91ddacebb5d644514693aca04c42f3d8966ec161b8634835","sha256:cfcf85615f2131b9b5b7a10b5201f360d03cfad673d5438dd1124998be25ef4e"],"state_sha256":"d8edfd6fb905990a2bd71d8c0f593ff7366be2058080309dc48282ab82987a61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gTKnoSy5o1RfByd/MWtEoXGttyxDqqXuW/094v11drxWdQalPPGUFecHgphnMjs3XYjUIS2puoFBlSwC4cbUDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T10:50:17.948239Z","bundle_sha256":"49e208ca4a9cc4c64ba1b5f6e60cb147cd2d4df234ccc321ef27ea9cb7152dfe"}}