{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:EJZOLWPPURIBLFE5C5KX6RXR4K","short_pith_number":"pith:EJZOLWPP","canonical_record":{"source":{"id":"2309.08815","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-15T23:54:46Z","cross_cats_sorted":[],"title_canon_sha256":"8f3553706d89301431a8167775453a2a225917f580eead740ae62dd70223e1f4","abstract_canon_sha256":"6d21a9d367176ba6c83822e6a3af67c06905e64797d9043f0829a96a7ddceff6"},"schema_version":"1.0"},"canonical_sha256":"2272e5d9efa45015949d17557f46f1e2a6c2069a6503416c1ee06d1c969cde92","source":{"kind":"arxiv","id":"2309.08815","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.08815","created_at":"2026-07-05T06:52:50Z"},{"alias_kind":"arxiv_version","alias_value":"2309.08815v1","created_at":"2026-07-05T06:52:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.08815","created_at":"2026-07-05T06:52:50Z"},{"alias_kind":"pith_short_12","alias_value":"EJZOLWPPURIB","created_at":"2026-07-05T06:52:50Z"},{"alias_kind":"pith_short_16","alias_value":"EJZOLWPPURIBLFE5","created_at":"2026-07-05T06:52:50Z"},{"alias_kind":"pith_short_8","alias_value":"EJZOLWPP","created_at":"2026-07-05T06:52:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:EJZOLWPPURIBLFE5C5KX6RXR4K","target":"record","payload":{"canonical_record":{"source":{"id":"2309.08815","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-15T23:54:46Z","cross_cats_sorted":[],"title_canon_sha256":"8f3553706d89301431a8167775453a2a225917f580eead740ae62dd70223e1f4","abstract_canon_sha256":"6d21a9d367176ba6c83822e6a3af67c06905e64797d9043f0829a96a7ddceff6"},"schema_version":"1.0"},"canonical_sha256":"2272e5d9efa45015949d17557f46f1e2a6c2069a6503416c1ee06d1c969cde92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:52:50.021646Z","signature_b64":"Rge8LJuOznSaFaGCenNuRAIn2VLG7XSJF4GpeGJGxNaCGReUcRDaev/kJB3jFzHaAdXoC7jWpt8OffhFTcqRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2272e5d9efa45015949d17557f46f1e2a6c2069a6503416c1ee06d1c969cde92","last_reissued_at":"2026-07-05T06:52:50.021155Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:52:50.021155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2309.08815","source_version":1,"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:52:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bwZIuIZC7I8TB+Qgk1JSRLvIRXBpwNFLXvtDzoD5t4Uvy5hiCKf2wkpv9VXJS3N36sd5sPTVVaKkOcB/xb/zAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:03:08.966111Z"},"content_sha256":"c942c169b736799bb7290017e0b765df76f955d18ebde0a7bafe4ebebd0e0c1e","schema_version":"1.0","event_id":"sha256:c942c169b736799bb7290017e0b765df76f955d18ebde0a7bafe4ebebd0e0c1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:EJZOLWPPURIBLFE5C5KX6RXR4K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hybrid Quantum-Classical Multilevel Approach for Maximum Cuts on Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anthony Angone, Ilya Safro, Ruslan Shaydulin, Xioayuan Liu","submitted_at":"2023-09-15T23:54:46Z","abstract_excerpt":"Combinatorial optimization is one of the fields where near term quantum devices are being utilized with hybrid quantum-classical algorithms to demonstrate potentially practical applications of quantum computing. One of the most well studied problems in combinatorial optimization is the Max-Cut problem. The problem is also highly relevant to quantum and other types of \"post Moore\" architectures due to its similarity with the Ising model and other reasons. In this paper, we introduce a scalable hybrid multilevel approach to solve large instances of Max-Cut using both classical only solvers and q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.08815","kind":"arxiv","version":1},"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/2309.08815/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:52:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Db+qdZSAQSdlv/Vw+BgSp451o0PS+8KEpoxaq4+tM6jxWCKbd1ObzY5VNf2ubYyp0FrK0DYqroURIgkh/xiqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:03:08.966499Z"},"content_sha256":"a4089917738098b0c6c30b0542b909d7092904b3347937587191796659c95666","schema_version":"1.0","event_id":"sha256:a4089917738098b0c6c30b0542b909d7092904b3347937587191796659c95666"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EJZOLWPPURIBLFE5C5KX6RXR4K/bundle.json","state_url":"https://pith.science/pith/EJZOLWPPURIBLFE5C5KX6RXR4K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EJZOLWPPURIBLFE5C5KX6RXR4K/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-07-07T09:03:08Z","links":{"resolver":"https://pith.science/pith/EJZOLWPPURIBLFE5C5KX6RXR4K","bundle":"https://pith.science/pith/EJZOLWPPURIBLFE5C5KX6RXR4K/bundle.json","state":"https://pith.science/pith/EJZOLWPPURIBLFE5C5KX6RXR4K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EJZOLWPPURIBLFE5C5KX6RXR4K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:EJZOLWPPURIBLFE5C5KX6RXR4K","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":"6d21a9d367176ba6c83822e6a3af67c06905e64797d9043f0829a96a7ddceff6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-15T23:54:46Z","title_canon_sha256":"8f3553706d89301431a8167775453a2a225917f580eead740ae62dd70223e1f4"},"schema_version":"1.0","source":{"id":"2309.08815","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.08815","created_at":"2026-07-05T06:52:50Z"},{"alias_kind":"arxiv_version","alias_value":"2309.08815v1","created_at":"2026-07-05T06:52:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.08815","created_at":"2026-07-05T06:52:50Z"},{"alias_kind":"pith_short_12","alias_value":"EJZOLWPPURIB","created_at":"2026-07-05T06:52:50Z"},{"alias_kind":"pith_short_16","alias_value":"EJZOLWPPURIBLFE5","created_at":"2026-07-05T06:52:50Z"},{"alias_kind":"pith_short_8","alias_value":"EJZOLWPP","created_at":"2026-07-05T06:52:50Z"}],"graph_snapshots":[{"event_id":"sha256:a4089917738098b0c6c30b0542b909d7092904b3347937587191796659c95666","target":"graph","created_at":"2026-07-05T06:52:50Z","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/2309.08815/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Combinatorial optimization is one of the fields where near term quantum devices are being utilized with hybrid quantum-classical algorithms to demonstrate potentially practical applications of quantum computing. One of the most well studied problems in combinatorial optimization is the Max-Cut problem. The problem is also highly relevant to quantum and other types of \"post Moore\" architectures due to its similarity with the Ising model and other reasons. In this paper, we introduce a scalable hybrid multilevel approach to solve large instances of Max-Cut using both classical only solvers and q","authors_text":"Anthony Angone, Ilya Safro, Ruslan Shaydulin, Xioayuan Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-15T23:54:46Z","title":"Hybrid Quantum-Classical Multilevel Approach for Maximum Cuts on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.08815","kind":"arxiv","version":1},"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:c942c169b736799bb7290017e0b765df76f955d18ebde0a7bafe4ebebd0e0c1e","target":"record","created_at":"2026-07-05T06:52:50Z","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":"6d21a9d367176ba6c83822e6a3af67c06905e64797d9043f0829a96a7ddceff6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-15T23:54:46Z","title_canon_sha256":"8f3553706d89301431a8167775453a2a225917f580eead740ae62dd70223e1f4"},"schema_version":"1.0","source":{"id":"2309.08815","kind":"arxiv","version":1}},"canonical_sha256":"2272e5d9efa45015949d17557f46f1e2a6c2069a6503416c1ee06d1c969cde92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2272e5d9efa45015949d17557f46f1e2a6c2069a6503416c1ee06d1c969cde92","first_computed_at":"2026-07-05T06:52:50.021155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:52:50.021155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rge8LJuOznSaFaGCenNuRAIn2VLG7XSJF4GpeGJGxNaCGReUcRDaev/kJB3jFzHaAdXoC7jWpt8OffhFTcqRAw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:52:50.021646Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.08815","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c942c169b736799bb7290017e0b765df76f955d18ebde0a7bafe4ebebd0e0c1e","sha256:a4089917738098b0c6c30b0542b909d7092904b3347937587191796659c95666"],"state_sha256":"deb7bca5c0f5b292960f06dbe5cd3879817c8b3262a1ff860ce7fc22e0a7f4f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xtmF5eSuIDLRtnXXsl98CrIfWtYSxC6arwb+EZPpp1ZxmKTmoHTOITCXtA0yCRyTRbpJnfErcUePnJ+lOt0YBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T09:03:08.968473Z","bundle_sha256":"c68a9e7ac25e42040921f32acd36e6bde34af33c66f8c33fe01cd1725a7b064f"}}