{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:HCPIKPSAZBYVN3QAF5DJHA6WA5","short_pith_number":"pith:HCPIKPSA","canonical_record":{"source":{"id":"2308.10383","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-20T23:06:18Z","cross_cats_sorted":[],"title_canon_sha256":"70a2d3291613c409322233d34018efda54aa8a6a2e215c1248ed918bda1421d5","abstract_canon_sha256":"bc5374bda5790c5292ca457b9d79a46a00416edc3899f6e75b373b5cd4483995"},"schema_version":"1.0"},"canonical_sha256":"389e853e40c87156ee002f469383d6074ad9b394952a6157d342eb3a4e2ea9ed","source":{"kind":"arxiv","id":"2308.10383","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.10383","created_at":"2026-07-05T07:15:58Z"},{"alias_kind":"arxiv_version","alias_value":"2308.10383v2","created_at":"2026-07-05T07:15:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.10383","created_at":"2026-07-05T07:15:58Z"},{"alias_kind":"pith_short_12","alias_value":"HCPIKPSAZBYV","created_at":"2026-07-05T07:15:58Z"},{"alias_kind":"pith_short_16","alias_value":"HCPIKPSAZBYVN3QA","created_at":"2026-07-05T07:15:58Z"},{"alias_kind":"pith_short_8","alias_value":"HCPIKPSA","created_at":"2026-07-05T07:15:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:HCPIKPSAZBYVN3QAF5DJHA6WA5","target":"record","payload":{"canonical_record":{"source":{"id":"2308.10383","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-20T23:06:18Z","cross_cats_sorted":[],"title_canon_sha256":"70a2d3291613c409322233d34018efda54aa8a6a2e215c1248ed918bda1421d5","abstract_canon_sha256":"bc5374bda5790c5292ca457b9d79a46a00416edc3899f6e75b373b5cd4483995"},"schema_version":"1.0"},"canonical_sha256":"389e853e40c87156ee002f469383d6074ad9b394952a6157d342eb3a4e2ea9ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:15:58.918982Z","signature_b64":"s37PojV6rvRwwvdnXVZeoJpbfC7MO2Zx0PqzRJfL6fTCCirm0HQySgRxi+N41C2lZwZCx1go/tPQYjCTrptSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"389e853e40c87156ee002f469383d6074ad9b394952a6157d342eb3a4e2ea9ed","last_reissued_at":"2026-07-05T07:15:58.918467Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:15:58.918467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.10383","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-05T07:15:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YOVbs4+8zrnOV6/kk5QUopZyt7EZ8BWldOly7BZUsivE4+95daVugjBfxQWALvr8eWuAug/cPNRJ26R/bSsjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T19:05:03.545057Z"},"content_sha256":"2ffcc1802c42b40ab82e439194140624b6641d28661b2b7ff6e89d09c996908c","schema_version":"1.0","event_id":"sha256:2ffcc1802c42b40ab82e439194140624b6641d28661b2b7ff6e89d09c996908c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:HCPIKPSAZBYVN3QAF5DJHA6WA5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Variational Qubit-Efficient MaxCut Heuristic Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adi Makmal, Ohad Lev, Tomer Kelman, Yovav Tene-Cohen","submitted_at":"2023-08-20T23:06:18Z","abstract_excerpt":"MaxCut is a key NP-Hard combinatorial optimization graph problem with extensive theoretical and industrial applications, including the Ising model and chip design. While quantum computing offers new solutions for such combinatorial challenges which are potentially better than classical schemes, with the Quantum Approximate Optimization Algorithm (QAOA) being a state-of-the-art example, its performance is currently hindered by hardware noise and limited qubit number. Here, we present a new variational Qubit-Efficient MaxCut (QEMC) algorithm that requires a logarithmic number of qubits with resp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.10383","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/2308.10383/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-05T07:15:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"39N/GZ2/+x2A184jlLID3HMEUEi6zqU3QQfFH2akg+5EzOxfeHJBO89tYDtORu3eGrm3Lw9ntHRqgEycRJA0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T19:05:03.545723Z"},"content_sha256":"094515b07e21f4e62e432715c5531811e715c8a14f1007191e2e561ba777a68f","schema_version":"1.0","event_id":"sha256:094515b07e21f4e62e432715c5531811e715c8a14f1007191e2e561ba777a68f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HCPIKPSAZBYVN3QAF5DJHA6WA5/bundle.json","state_url":"https://pith.science/pith/HCPIKPSAZBYVN3QAF5DJHA6WA5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HCPIKPSAZBYVN3QAF5DJHA6WA5/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-10T19:05:03Z","links":{"resolver":"https://pith.science/pith/HCPIKPSAZBYVN3QAF5DJHA6WA5","bundle":"https://pith.science/pith/HCPIKPSAZBYVN3QAF5DJHA6WA5/bundle.json","state":"https://pith.science/pith/HCPIKPSAZBYVN3QAF5DJHA6WA5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HCPIKPSAZBYVN3QAF5DJHA6WA5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:HCPIKPSAZBYVN3QAF5DJHA6WA5","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":"bc5374bda5790c5292ca457b9d79a46a00416edc3899f6e75b373b5cd4483995","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-20T23:06:18Z","title_canon_sha256":"70a2d3291613c409322233d34018efda54aa8a6a2e215c1248ed918bda1421d5"},"schema_version":"1.0","source":{"id":"2308.10383","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.10383","created_at":"2026-07-05T07:15:58Z"},{"alias_kind":"arxiv_version","alias_value":"2308.10383v2","created_at":"2026-07-05T07:15:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.10383","created_at":"2026-07-05T07:15:58Z"},{"alias_kind":"pith_short_12","alias_value":"HCPIKPSAZBYV","created_at":"2026-07-05T07:15:58Z"},{"alias_kind":"pith_short_16","alias_value":"HCPIKPSAZBYVN3QA","created_at":"2026-07-05T07:15:58Z"},{"alias_kind":"pith_short_8","alias_value":"HCPIKPSA","created_at":"2026-07-05T07:15:58Z"}],"graph_snapshots":[{"event_id":"sha256:094515b07e21f4e62e432715c5531811e715c8a14f1007191e2e561ba777a68f","target":"graph","created_at":"2026-07-05T07:15:58Z","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/2308.10383/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"MaxCut is a key NP-Hard combinatorial optimization graph problem with extensive theoretical and industrial applications, including the Ising model and chip design. While quantum computing offers new solutions for such combinatorial challenges which are potentially better than classical schemes, with the Quantum Approximate Optimization Algorithm (QAOA) being a state-of-the-art example, its performance is currently hindered by hardware noise and limited qubit number. Here, we present a new variational Qubit-Efficient MaxCut (QEMC) algorithm that requires a logarithmic number of qubits with resp","authors_text":"Adi Makmal, Ohad Lev, Tomer Kelman, Yovav Tene-Cohen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-20T23:06:18Z","title":"A Variational Qubit-Efficient MaxCut Heuristic Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.10383","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:2ffcc1802c42b40ab82e439194140624b6641d28661b2b7ff6e89d09c996908c","target":"record","created_at":"2026-07-05T07:15:58Z","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":"bc5374bda5790c5292ca457b9d79a46a00416edc3899f6e75b373b5cd4483995","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-20T23:06:18Z","title_canon_sha256":"70a2d3291613c409322233d34018efda54aa8a6a2e215c1248ed918bda1421d5"},"schema_version":"1.0","source":{"id":"2308.10383","kind":"arxiv","version":2}},"canonical_sha256":"389e853e40c87156ee002f469383d6074ad9b394952a6157d342eb3a4e2ea9ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"389e853e40c87156ee002f469383d6074ad9b394952a6157d342eb3a4e2ea9ed","first_computed_at":"2026-07-05T07:15:58.918467Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:15:58.918467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s37PojV6rvRwwvdnXVZeoJpbfC7MO2Zx0PqzRJfL6fTCCirm0HQySgRxi+N41C2lZwZCx1go/tPQYjCTrptSAg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:15:58.918982Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.10383","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ffcc1802c42b40ab82e439194140624b6641d28661b2b7ff6e89d09c996908c","sha256:094515b07e21f4e62e432715c5531811e715c8a14f1007191e2e561ba777a68f"],"state_sha256":"dc2236b05ff3243c693c2a2d641dd91565a5af767904cde68e837e41fb90d874"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+0BvF5dpfiNjyEfa5IFgEeMKnWcr2dttvnE0PWppMaGmuafE27qfyqwSGG2DakI8OLZOS6xJCl5kzZaIhElnCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T19:05:03.551388Z","bundle_sha256":"5606854ee2267289f45c94fe6a4e5f354fa85863f76ced019a66b7a6b302c3e8"}}