{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:OBUMIFVQ6EUQOZE6LB2NINP37O","short_pith_number":"pith:OBUMIFVQ","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"},"canonical_sha256":"7068c416b0f12907649e5874d435fbfbae31c13ea690b12edd0bec185ef00114","source":{"kind":"arxiv","id":"2305.16644","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.16644","created_at":"2026-07-05T06:19:59Z"},{"alias_kind":"arxiv_version","alias_value":"2305.16644v2","created_at":"2026-07-05T06:19:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.16644","created_at":"2026-07-05T06:19:59Z"},{"alias_kind":"pith_short_12","alias_value":"OBUMIFVQ6EUQ","created_at":"2026-07-05T06:19:59Z"},{"alias_kind":"pith_short_16","alias_value":"OBUMIFVQ6EUQOZE6","created_at":"2026-07-05T06:19:59Z"},{"alias_kind":"pith_short_8","alias_value":"OBUMIFVQ","created_at":"2026-07-05T06:19:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:OBUMIFVQ6EUQOZE6LB2NINP37O","target":"record","payload":{"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"},"canonical_sha256":"7068c416b0f12907649e5874d435fbfbae31c13ea690b12edd0bec185ef00114","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"},"source_kind":"arxiv","source_id":"2305.16644","source_version":2,"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:19:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZrCm3IDRMsbZebndbLcbOE5E99jqZazWBOY/KyDCovV2/HpClnnuTSwnbU8aC3BGMqkM1c1pZ6NvUAYrcUyvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T01:09:46.556350Z"},"content_sha256":"331af955ea03d546357b1fe867d2e4d68fad3aaffafc160f8d70dd42383e1086","schema_version":"1.0","event_id":"sha256:331af955ea03d546357b1fe867d2e4d68fad3aaffafc160f8d70dd42383e1086"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:OBUMIFVQ6EUQOZE6LB2NINP37O","target":"graph","payload":{"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"},"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:19:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zdwle05U3NQ+MZDK+122oPX8XQ0wAVJe9rx8paxaTRLjX9c7atFDftXkWdHRuZyiTogk5m76k3TCXx7UELF/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T01:09:46.556758Z"},"content_sha256":"5f88d54b4155c7c60d1a67ed776e767186cfd962e2735bf069891d67951c0b59","schema_version":"1.0","event_id":"sha256:5f88d54b4155c7c60d1a67ed776e767186cfd962e2735bf069891d67951c0b59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OBUMIFVQ6EUQOZE6LB2NINP37O/bundle.json","state_url":"https://pith.science/pith/OBUMIFVQ6EUQOZE6LB2NINP37O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OBUMIFVQ6EUQOZE6LB2NINP37O/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-14T01:09:46Z","links":{"resolver":"https://pith.science/pith/OBUMIFVQ6EUQOZE6LB2NINP37O","bundle":"https://pith.science/pith/OBUMIFVQ6EUQOZE6LB2NINP37O/bundle.json","state":"https://pith.science/pith/OBUMIFVQ6EUQOZE6LB2NINP37O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OBUMIFVQ6EUQOZE6LB2NINP37O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:OBUMIFVQ6EUQOZE6LB2NINP37O","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":"d006c6fa44f2b97caad26a7934f0c998963cb5635a2c3311b7b1df11ea84788b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-05-26T05:31:25Z","title_canon_sha256":"fb0e5de70393eea056e7948b08da686f50924b2fde51aff4778a4b8d95e5d556"},"schema_version":"1.0","source":{"id":"2305.16644","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.16644","created_at":"2026-07-05T06:19:59Z"},{"alias_kind":"arxiv_version","alias_value":"2305.16644v2","created_at":"2026-07-05T06:19:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.16644","created_at":"2026-07-05T06:19:59Z"},{"alias_kind":"pith_short_12","alias_value":"OBUMIFVQ6EUQ","created_at":"2026-07-05T06:19:59Z"},{"alias_kind":"pith_short_16","alias_value":"OBUMIFVQ6EUQOZE6","created_at":"2026-07-05T06:19:59Z"},{"alias_kind":"pith_short_8","alias_value":"OBUMIFVQ","created_at":"2026-07-05T06:19:59Z"}],"graph_snapshots":[{"event_id":"sha256:5f88d54b4155c7c60d1a67ed776e767186cfd962e2735bf069891d67951c0b59","target":"graph","created_at":"2026-07-05T06:19:59Z","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/2305.16644/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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,","authors_text":"Athanasios V. Vasilakos, Ju-Chin Chen, Renata Wong, Weng-Long Chang, Wen-Yu Chung, Yu-Hao Chen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-05-26T05:31:25Z","title":"Quantum Speedup for the Maximum Cut Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.16644","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:331af955ea03d546357b1fe867d2e4d68fad3aaffafc160f8d70dd42383e1086","target":"record","created_at":"2026-07-05T06:19:59Z","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":"d006c6fa44f2b97caad26a7934f0c998963cb5635a2c3311b7b1df11ea84788b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-05-26T05:31:25Z","title_canon_sha256":"fb0e5de70393eea056e7948b08da686f50924b2fde51aff4778a4b8d95e5d556"},"schema_version":"1.0","source":{"id":"2305.16644","kind":"arxiv","version":2}},"canonical_sha256":"7068c416b0f12907649e5874d435fbfbae31c13ea690b12edd0bec185ef00114","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7068c416b0f12907649e5874d435fbfbae31c13ea690b12edd0bec185ef00114","first_computed_at":"2026-07-05T06:19:59.292659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:19:59.292659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dJceQX7tZ2WS3Ao5CVrZ7Cqh6MDHOLU+WFgT5cqjY2V71GkXh5CGnBklRuA8yvgojj7fheiw9NpVzNcEp1ycAA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:19:59.293065Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.16644","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:331af955ea03d546357b1fe867d2e4d68fad3aaffafc160f8d70dd42383e1086","sha256:5f88d54b4155c7c60d1a67ed776e767186cfd962e2735bf069891d67951c0b59"],"state_sha256":"a5b5b06e505b0f55270871ff8dd39c87ec3dcb73c8af4c9de373963fb05cb586"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bt4cM6DESRjjNxdHt7y3sjZn76LTimzEwBpwTI1kFUlPi6Jj+LBEmXZzqzpJu+ASDyeBM/P/UV1GL/3kr1eQBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T01:09:46.559244Z","bundle_sha256":"d03d87d51475f1d2441e10a66bdc9a736c28d554045b7c6c262a721caa4ba11e"}}