{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OBLHD6YMWXE26OIDMYIWGHTLXA","short_pith_number":"pith:OBLHD6YM","canonical_record":{"source":{"id":"1912.12277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-12-27T18:37:30Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8caa90eccaabfa3fc87ce6ed3c3b829e7ce38d77b7caa37cf47186885dafa9a8","abstract_canon_sha256":"d8aa0b5f79b41893d408e839746be2122ebd1f44bfd4f3594ef26426aa09be69"},"schema_version":"1.0"},"canonical_sha256":"705671fb0cb5c9af39036611631e6bb82999dc0e73b5869b7aa20944b7335ca0","source":{"kind":"arxiv","id":"1912.12277","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.12277","created_at":"2026-07-05T00:28:58Z"},{"alias_kind":"arxiv_version","alias_value":"1912.12277v2","created_at":"2026-07-05T00:28:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.12277","created_at":"2026-07-05T00:28:58Z"},{"alias_kind":"pith_short_12","alias_value":"OBLHD6YMWXE2","created_at":"2026-07-05T00:28:58Z"},{"alias_kind":"pith_short_16","alias_value":"OBLHD6YMWXE26OID","created_at":"2026-07-05T00:28:58Z"},{"alias_kind":"pith_short_8","alias_value":"OBLHD6YM","created_at":"2026-07-05T00:28:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OBLHD6YMWXE26OIDMYIWGHTLXA","target":"record","payload":{"canonical_record":{"source":{"id":"1912.12277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-12-27T18:37:30Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8caa90eccaabfa3fc87ce6ed3c3b829e7ce38d77b7caa37cf47186885dafa9a8","abstract_canon_sha256":"d8aa0b5f79b41893d408e839746be2122ebd1f44bfd4f3594ef26426aa09be69"},"schema_version":"1.0"},"canonical_sha256":"705671fb0cb5c9af39036611631e6bb82999dc0e73b5869b7aa20944b7335ca0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:28:58.369577Z","signature_b64":"D8jqdoa64lzIsMY800fKd5HXcMJ6bpP2BGOQkPujZvma3eDgzyiTw5ld6BT/zcUV2WfVo9P3aFL/BfW6CxURCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"705671fb0cb5c9af39036611631e6bb82999dc0e73b5869b7aa20944b7335ca0","last_reissued_at":"2026-07-05T00:28:58.369194Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:28:58.369194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1912.12277","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-05T00:28:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2YVv3ykcm+TNoEE2tIprlYQOCshcJAjlkumFIc/mf3IQpI2tiFxwiMZweHy2m/UPJ/CG5KC1v+L7CwB/8XnMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T20:31:14.727000Z"},"content_sha256":"1676f6c02d29f52a0f828dceabb993cc429c9683c8aaf8bfeb0c62767f909fa0","schema_version":"1.0","event_id":"sha256:1676f6c02d29f52a0f828dceabb993cc429c9683c8aaf8bfeb0c62767f909fa0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OBLHD6YMWXE26OIDMYIWGHTLXA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"What do QAOA energies reveal about graphs?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"quant-ph","authors_text":"Mario Szegedy","submitted_at":"2019-12-27T18:37:30Z","abstract_excerpt":"Quantum Approximate Optimization Algorithm (QAOA) is a hybrid classical-quantum algorithm to approximately solve NP optimization problems such as MAX-CUT. We describe a new application area of QAOA circuits: graph structure discovery. We omit the time-consuming parameter-optimization phase and utilize the dependence of QAOA energy on the graph structure for randomly or judiciously chosen parameters to learn about graphs. In the first part, Following up on Wang et. al. and Brandao et. al. we give explicit formulas. We show that the layer-one QAOA energy for the MAX-CUT problem for three regular"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.12277","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/1912.12277/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-05T00:28:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pfAZha1LRD66DrQXAqBpCX2Mn+hPXosHMsinvhSc/VL6UC/96jJaw7PvwJvTlZjmvx9IF10OxLMVaEyGch8bAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T20:31:14.727540Z"},"content_sha256":"e6abc3704014fd0b72f9bcadd640f5297b604654605b7838de1ae9a659cc8049","schema_version":"1.0","event_id":"sha256:e6abc3704014fd0b72f9bcadd640f5297b604654605b7838de1ae9a659cc8049"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OBLHD6YMWXE26OIDMYIWGHTLXA/bundle.json","state_url":"https://pith.science/pith/OBLHD6YMWXE26OIDMYIWGHTLXA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OBLHD6YMWXE26OIDMYIWGHTLXA/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-19T20:31:14Z","links":{"resolver":"https://pith.science/pith/OBLHD6YMWXE26OIDMYIWGHTLXA","bundle":"https://pith.science/pith/OBLHD6YMWXE26OIDMYIWGHTLXA/bundle.json","state":"https://pith.science/pith/OBLHD6YMWXE26OIDMYIWGHTLXA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OBLHD6YMWXE26OIDMYIWGHTLXA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OBLHD6YMWXE26OIDMYIWGHTLXA","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":"d8aa0b5f79b41893d408e839746be2122ebd1f44bfd4f3594ef26426aa09be69","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-12-27T18:37:30Z","title_canon_sha256":"8caa90eccaabfa3fc87ce6ed3c3b829e7ce38d77b7caa37cf47186885dafa9a8"},"schema_version":"1.0","source":{"id":"1912.12277","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.12277","created_at":"2026-07-05T00:28:58Z"},{"alias_kind":"arxiv_version","alias_value":"1912.12277v2","created_at":"2026-07-05T00:28:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.12277","created_at":"2026-07-05T00:28:58Z"},{"alias_kind":"pith_short_12","alias_value":"OBLHD6YMWXE2","created_at":"2026-07-05T00:28:58Z"},{"alias_kind":"pith_short_16","alias_value":"OBLHD6YMWXE26OID","created_at":"2026-07-05T00:28:58Z"},{"alias_kind":"pith_short_8","alias_value":"OBLHD6YM","created_at":"2026-07-05T00:28:58Z"}],"graph_snapshots":[{"event_id":"sha256:e6abc3704014fd0b72f9bcadd640f5297b604654605b7838de1ae9a659cc8049","target":"graph","created_at":"2026-07-05T00:28: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/1912.12277/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum Approximate Optimization Algorithm (QAOA) is a hybrid classical-quantum algorithm to approximately solve NP optimization problems such as MAX-CUT. We describe a new application area of QAOA circuits: graph structure discovery. We omit the time-consuming parameter-optimization phase and utilize the dependence of QAOA energy on the graph structure for randomly or judiciously chosen parameters to learn about graphs. In the first part, Following up on Wang et. al. and Brandao et. al. we give explicit formulas. We show that the layer-one QAOA energy for the MAX-CUT problem for three regular","authors_text":"Mario Szegedy","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-12-27T18:37:30Z","title":"What do QAOA energies reveal about graphs?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.12277","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:1676f6c02d29f52a0f828dceabb993cc429c9683c8aaf8bfeb0c62767f909fa0","target":"record","created_at":"2026-07-05T00:28: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":"d8aa0b5f79b41893d408e839746be2122ebd1f44bfd4f3594ef26426aa09be69","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-12-27T18:37:30Z","title_canon_sha256":"8caa90eccaabfa3fc87ce6ed3c3b829e7ce38d77b7caa37cf47186885dafa9a8"},"schema_version":"1.0","source":{"id":"1912.12277","kind":"arxiv","version":2}},"canonical_sha256":"705671fb0cb5c9af39036611631e6bb82999dc0e73b5869b7aa20944b7335ca0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"705671fb0cb5c9af39036611631e6bb82999dc0e73b5869b7aa20944b7335ca0","first_computed_at":"2026-07-05T00:28:58.369194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:28:58.369194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D8jqdoa64lzIsMY800fKd5HXcMJ6bpP2BGOQkPujZvma3eDgzyiTw5ld6BT/zcUV2WfVo9P3aFL/BfW6CxURCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:28:58.369577Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.12277","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1676f6c02d29f52a0f828dceabb993cc429c9683c8aaf8bfeb0c62767f909fa0","sha256:e6abc3704014fd0b72f9bcadd640f5297b604654605b7838de1ae9a659cc8049"],"state_sha256":"d9dd5220ecbf3a3199809d91b12a0b11c3ed4e5ebb0768655e77b2b4b631399f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V/+Ssfq8h7m9DZ0SyAnWbr1NZxhU+t+nSS137qFVGuRuauxcTQCeBvWSrpMZGRwON9qxLd8LU2Fdie4W1gBXAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T20:31:14.735552Z","bundle_sha256":"e7e36eb8e13c6b3bca84343ef246c0c4c5a4d7819cb52119f930a9190b74feb0"}}