{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DLCFKOZUVYFCIDU6LXPQA4SR62","short_pith_number":"pith:DLCFKOZU","canonical_record":{"source":{"id":"2412.15572","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-20T05:09:30Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"04f87fa28cb2b04de7ba3d07df0906147bc14bad65fcce080859613855c3ca72","abstract_canon_sha256":"0ae10c9be7da2804d54d4981eef40d3579d5f756aef09d3f50b1b21ef90687ec"},"schema_version":"1.0"},"canonical_sha256":"1ac4553b34ae0a240e9e5ddf007251f6b78b29579da3bee9585bd2dff3433657","source":{"kind":"arxiv","id":"2412.15572","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.15572","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"2412.15572v2","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.15572","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"DLCFKOZUVYFC","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"DLCFKOZUVYFCIDU6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"DLCFKOZU","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DLCFKOZUVYFCIDU6LXPQA4SR62","target":"record","payload":{"canonical_record":{"source":{"id":"2412.15572","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-20T05:09:30Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"04f87fa28cb2b04de7ba3d07df0906147bc14bad65fcce080859613855c3ca72","abstract_canon_sha256":"0ae10c9be7da2804d54d4981eef40d3579d5f756aef09d3f50b1b21ef90687ec"},"schema_version":"1.0"},"canonical_sha256":"1ac4553b34ae0a240e9e5ddf007251f6b78b29579da3bee9585bd2dff3433657","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:18.262240Z","signature_b64":"EraWZ0hdB1pAfgaRWcRoxrgSKVSH6K8+AD2isV/VigQRAxx0SOcaK1byeVG5PFyW2ltr1FXHpqYCoABDk5a9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ac4553b34ae0a240e9e5ddf007251f6b78b29579da3bee9585bd2dff3433657","last_reissued_at":"2026-05-17T23:39:18.261557Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:18.261557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.15572","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-05-17T23:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u9HaqAp+ReKlDc19s4ORzif0n1HzFPLyaMKRFUuDKyDRI7f6bLozO8hMu5Np15gWS8pG7JnuiAiXSy0Z6gGqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:04:51.390486Z"},"content_sha256":"9c0e3fef536955db827e15f5514b386d0ad0211fb48c75fd555019f88016deea","schema_version":"1.0","event_id":"sha256:9c0e3fef536955db827e15f5514b386d0ad0211fb48c75fd555019f88016deea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DLCFKOZUVYFCIDU6LXPQA4SR62","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Classical Combinatorial Optimization Scaling for Random Ising Models on 2D Heavy-Hex Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.OC","authors_text":"Andreas B\\\"artschi, Elijah Pelofske, Stephan Eidenbenz","submitted_at":"2024-12-20T05:09:30Z","abstract_excerpt":"Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the Quantum Approximate Optimization Algorithm (QAOA). In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.15572","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":""},"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-05-17T23:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C2YWwWO3JkmdQNgUCKKbWYvYrKbSL8nNgi40BvSXH042hS3fsoOY5dA/0V9MAYcuaJOTP+hdR7rapbzy+W9vAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:04:51.391152Z"},"content_sha256":"78c7bc32f438e54ad7f1dbd52ffd9f369a208860577a43f322ae3674679888c1","schema_version":"1.0","event_id":"sha256:78c7bc32f438e54ad7f1dbd52ffd9f369a208860577a43f322ae3674679888c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DLCFKOZUVYFCIDU6LXPQA4SR62/bundle.json","state_url":"https://pith.science/pith/DLCFKOZUVYFCIDU6LXPQA4SR62/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DLCFKOZUVYFCIDU6LXPQA4SR62/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-05-25T08:04:51Z","links":{"resolver":"https://pith.science/pith/DLCFKOZUVYFCIDU6LXPQA4SR62","bundle":"https://pith.science/pith/DLCFKOZUVYFCIDU6LXPQA4SR62/bundle.json","state":"https://pith.science/pith/DLCFKOZUVYFCIDU6LXPQA4SR62/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DLCFKOZUVYFCIDU6LXPQA4SR62/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DLCFKOZUVYFCIDU6LXPQA4SR62","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":"0ae10c9be7da2804d54d4981eef40d3579d5f756aef09d3f50b1b21ef90687ec","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-20T05:09:30Z","title_canon_sha256":"04f87fa28cb2b04de7ba3d07df0906147bc14bad65fcce080859613855c3ca72"},"schema_version":"1.0","source":{"id":"2412.15572","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.15572","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"2412.15572v2","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.15572","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"DLCFKOZUVYFC","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"DLCFKOZUVYFCIDU6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"DLCFKOZU","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:78c7bc32f438e54ad7f1dbd52ffd9f369a208860577a43f322ae3674679888c1","target":"graph","created_at":"2026-05-17T23:39:18Z","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"},"paper":{"abstract_excerpt":"Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the Quantum Approximate Optimization Algorithm (QAOA). In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation ","authors_text":"Andreas B\\\"artschi, Elijah Pelofske, Stephan Eidenbenz","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-20T05:09:30Z","title":"Classical Combinatorial Optimization Scaling for Random Ising Models on 2D Heavy-Hex Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.15572","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:9c0e3fef536955db827e15f5514b386d0ad0211fb48c75fd555019f88016deea","target":"record","created_at":"2026-05-17T23:39:18Z","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":"0ae10c9be7da2804d54d4981eef40d3579d5f756aef09d3f50b1b21ef90687ec","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-20T05:09:30Z","title_canon_sha256":"04f87fa28cb2b04de7ba3d07df0906147bc14bad65fcce080859613855c3ca72"},"schema_version":"1.0","source":{"id":"2412.15572","kind":"arxiv","version":2}},"canonical_sha256":"1ac4553b34ae0a240e9e5ddf007251f6b78b29579da3bee9585bd2dff3433657","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ac4553b34ae0a240e9e5ddf007251f6b78b29579da3bee9585bd2dff3433657","first_computed_at":"2026-05-17T23:39:18.261557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:18.261557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EraWZ0hdB1pAfgaRWcRoxrgSKVSH6K8+AD2isV/VigQRAxx0SOcaK1byeVG5PFyW2ltr1FXHpqYCoABDk5a9BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:18.262240Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.15572","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c0e3fef536955db827e15f5514b386d0ad0211fb48c75fd555019f88016deea","sha256:78c7bc32f438e54ad7f1dbd52ffd9f369a208860577a43f322ae3674679888c1"],"state_sha256":"c2e7688b755638465eba689c967cd8a593f211a1ba70907d6080f0ce9487ad99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PwcRwcTHyewDEt9fTOxPLSepgETXdnk5c9m/391rD8jywWRZyDwrXeh8DzNscX9tJtPtWBR0pR07y7LHwrxCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:04:51.394937Z","bundle_sha256":"bbb6ca6f51f833a8e6c1754b1302c4b4307fa787227507dafc2bc85d0b05541c"}}