{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:OBUMIFVQ6EUQOZE6LB2NINP37O","short_pith_number":"pith:OBUMIFVQ","schema_version":"1.0","canonical_sha256":"7068c416b0f12907649e5874d435fbfbae31c13ea690b12edd0bec185ef00114","source":{"kind":"arxiv","id":"2305.16644","version":2},"attestation_state":"computed","paper":{"title":"Quantum Speedup for the Maximum Cut Problem","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Athanasios V. Vasilakos, Ju-Chin Chen, Renata Wong, Weng-Long Chang, Wen-Yu Chung, Yu-Hao Chen","submitted_at":"2023-05-26T05:31:25Z","abstract_excerpt":"Given an undirected, unweighted graph with $n$ vertices and $m$ edges, the maximum cut problem is to find a partition of the $n$ vertices into disjoint subsets $V_1$ and $V_2$ such that the number of edges between them is as large as possible. Classically, it is an NP-complete problem, which has potential applications ranging from circuit layout design, statistical physics, computer vision, machine learning and network science to clustering. In this paper, we propose a quantum algorithm to solve the maximum cut problem for any graph $G$ with a quadratic speedup over its classical counterparts,"},"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":"2305.16644","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-05-26T05:31:25Z","cross_cats_sorted":[],"title_canon_sha256":"fb0e5de70393eea056e7948b08da686f50924b2fde51aff4778a4b8d95e5d556","abstract_canon_sha256":"d006c6fa44f2b97caad26a7934f0c998963cb5635a2c3311b7b1df11ea84788b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:19:59.293065Z","signature_b64":"dJceQX7tZ2WS3Ao5CVrZ7Cqh6MDHOLU+WFgT5cqjY2V71GkXh5CGnBklRuA8yvgojj7fheiw9NpVzNcEp1ycAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7068c416b0f12907649e5874d435fbfbae31c13ea690b12edd0bec185ef00114","last_reissued_at":"2026-07-05T06:19:59.292659Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:19:59.292659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Speedup for the Maximum Cut Problem","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Athanasios V. Vasilakos, Ju-Chin Chen, Renata Wong, Weng-Long Chang, Wen-Yu Chung, Yu-Hao Chen","submitted_at":"2023-05-26T05:31:25Z","abstract_excerpt":"Given an undirected, unweighted graph with $n$ vertices and $m$ edges, the maximum cut problem is to find a partition of the $n$ vertices into disjoint subsets $V_1$ and $V_2$ such that the number of edges between them is as large as possible. Classically, it is an NP-complete problem, which has potential applications ranging from circuit layout design, statistical physics, computer vision, machine learning and network science to clustering. In this paper, we propose a quantum algorithm to solve the maximum cut problem for any graph $G$ with a quadratic speedup over its classical counterparts,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.16644","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.16644/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":"2305.16644","created_at":"2026-07-05T06:19:59.292714+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.16644v2","created_at":"2026-07-05T06:19:59.292714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.16644","created_at":"2026-07-05T06:19:59.292714+00:00"},{"alias_kind":"pith_short_12","alias_value":"OBUMIFVQ6EUQ","created_at":"2026-07-05T06:19:59.292714+00:00"},{"alias_kind":"pith_short_16","alias_value":"OBUMIFVQ6EUQOZE6","created_at":"2026-07-05T06:19:59.292714+00:00"},{"alias_kind":"pith_short_8","alias_value":"OBUMIFVQ","created_at":"2026-07-05T06:19:59.292714+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2508.00468","citing_title":"Inference of maximum parsimony phylogenetic trees with model-based classical and quantum methods","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OBUMIFVQ6EUQOZE6LB2NINP37O","json":"https://pith.science/pith/OBUMIFVQ6EUQOZE6LB2NINP37O.json","graph_json":"https://pith.science/api/pith-number/OBUMIFVQ6EUQOZE6LB2NINP37O/graph.json","events_json":"https://pith.science/api/pith-number/OBUMIFVQ6EUQOZE6LB2NINP37O/events.json","paper":"https://pith.science/paper/OBUMIFVQ"},"agent_actions":{"view_html":"https://pith.science/pith/OBUMIFVQ6EUQOZE6LB2NINP37O","download_json":"https://pith.science/pith/OBUMIFVQ6EUQOZE6LB2NINP37O.json","view_paper":"https://pith.science/paper/OBUMIFVQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.16644&json=true","fetch_graph":"https://pith.science/api/pith-number/OBUMIFVQ6EUQOZE6LB2NINP37O/graph.json","fetch_events":"https://pith.science/api/pith-number/OBUMIFVQ6EUQOZE6LB2NINP37O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OBUMIFVQ6EUQOZE6LB2NINP37O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OBUMIFVQ6EUQOZE6LB2NINP37O/action/storage_attestation","attest_author":"https://pith.science/pith/OBUMIFVQ6EUQOZE6LB2NINP37O/action/author_attestation","sign_citation":"https://pith.science/pith/OBUMIFVQ6EUQOZE6LB2NINP37O/action/citation_signature","submit_replication":"https://pith.science/pith/OBUMIFVQ6EUQOZE6LB2NINP37O/action/replication_record"}},"created_at":"2026-07-05T06:19:59.292714+00:00","updated_at":"2026-07-05T06:19:59.292714+00:00"}