{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:HM6JHKWOEJZ5UIYB6K5O7GIV3Z","short_pith_number":"pith:HM6JHKWO","canonical_record":{"source":{"id":"2407.14490","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-07-19T17:44:29Z","cross_cats_sorted":[],"title_canon_sha256":"d8c790a61cde88aab1339ef16ffc52f7be30dbc340c22555487ef78cbbec57c4","abstract_canon_sha256":"dfd52b9ea0783cae284fbf2641cf1d3f2c861f52ce83c7baaa256410de8976e8"},"schema_version":"1.0"},"canonical_sha256":"3b3c93aace2273da2301f2baef9915de7dad5bb63169ad365da08cd41850a08b","source":{"kind":"arxiv","id":"2407.14490","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.14490","created_at":"2026-07-05T08:46:28Z"},{"alias_kind":"arxiv_version","alias_value":"2407.14490v2","created_at":"2026-07-05T08:46:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.14490","created_at":"2026-07-05T08:46:28Z"},{"alias_kind":"pith_short_12","alias_value":"HM6JHKWOEJZ5","created_at":"2026-07-05T08:46:28Z"},{"alias_kind":"pith_short_16","alias_value":"HM6JHKWOEJZ5UIYB","created_at":"2026-07-05T08:46:28Z"},{"alias_kind":"pith_short_8","alias_value":"HM6JHKWO","created_at":"2026-07-05T08:46:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:HM6JHKWOEJZ5UIYB6K5O7GIV3Z","target":"record","payload":{"canonical_record":{"source":{"id":"2407.14490","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-07-19T17:44:29Z","cross_cats_sorted":[],"title_canon_sha256":"d8c790a61cde88aab1339ef16ffc52f7be30dbc340c22555487ef78cbbec57c4","abstract_canon_sha256":"dfd52b9ea0783cae284fbf2641cf1d3f2c861f52ce83c7baaa256410de8976e8"},"schema_version":"1.0"},"canonical_sha256":"3b3c93aace2273da2301f2baef9915de7dad5bb63169ad365da08cd41850a08b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:46:28.573303Z","signature_b64":"qrhvOTcLgiaAelBTinipW8z7nMLWmJS1o9kHW47Q1149yBa+IW5YwONLGSgWNm4B5dpB/SX7L/VyLC2Su95TCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b3c93aace2273da2301f2baef9915de7dad5bb63169ad365da08cd41850a08b","last_reissued_at":"2026-07-05T08:46:28.572902Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:46:28.572902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.14490","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-05T08:46:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ic7ReewLupeHsbE7b1hZuUqA93/RC3RTt/YCOw52ODu7/bBDWqeOuAGzOdL5EYKKhGXGp9dIxzJeb9XIxhkAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T19:30:07.869971Z"},"content_sha256":"05d0cb69042c013662c72f1b4b159ee984366e8d46c218f27d001c17ff967ce9","schema_version":"1.0","event_id":"sha256:05d0cb69042c013662c72f1b4b159ee984366e8d46c218f27d001c17ff967ce9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:HM6JHKWOEJZ5UIYB6K5O7GIV3Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Red-QAOA: Efficient Variational Optimization through Circuit Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ang Li, Bo Fang, Meng Wang, Prashant Nair","submitted_at":"2024-07-19T17:44:29Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) addresses combinatorial optimization challenges by converting inputs to graphs. However, the optimal parameter searching process of QAOA is greatly affected by noise. Larger problems yield bigger graphs, requiring more qubits and making their outcomes highly noise-sensitive. This paper introduces Red-QAOA, leveraging energy landscape concentration via a simulated annealing-based graph reduction.\n  Red-QAOA creates a smaller (distilled) graph with nearly identical parameters to the original graph. The distilled graph produces a smaller quant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.14490","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/2407.14490/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-05T08:46:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YOZspBMKYqz3u+Xt+WdqFlLSPn0nfJ9gbB4xFOlSvUzuSzIz9Nc186aVwGXSeWHWybIBVzwvoNL6M7Rx7My7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T19:30:07.870453Z"},"content_sha256":"d26f1b4f69fded53bc5a2f106ffd00c3584351fb8ba1d6b6858617266193a4c7","schema_version":"1.0","event_id":"sha256:d26f1b4f69fded53bc5a2f106ffd00c3584351fb8ba1d6b6858617266193a4c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HM6JHKWOEJZ5UIYB6K5O7GIV3Z/bundle.json","state_url":"https://pith.science/pith/HM6JHKWOEJZ5UIYB6K5O7GIV3Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HM6JHKWOEJZ5UIYB6K5O7GIV3Z/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-04T19:30:07Z","links":{"resolver":"https://pith.science/pith/HM6JHKWOEJZ5UIYB6K5O7GIV3Z","bundle":"https://pith.science/pith/HM6JHKWOEJZ5UIYB6K5O7GIV3Z/bundle.json","state":"https://pith.science/pith/HM6JHKWOEJZ5UIYB6K5O7GIV3Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HM6JHKWOEJZ5UIYB6K5O7GIV3Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:HM6JHKWOEJZ5UIYB6K5O7GIV3Z","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":"dfd52b9ea0783cae284fbf2641cf1d3f2c861f52ce83c7baaa256410de8976e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-07-19T17:44:29Z","title_canon_sha256":"d8c790a61cde88aab1339ef16ffc52f7be30dbc340c22555487ef78cbbec57c4"},"schema_version":"1.0","source":{"id":"2407.14490","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.14490","created_at":"2026-07-05T08:46:28Z"},{"alias_kind":"arxiv_version","alias_value":"2407.14490v2","created_at":"2026-07-05T08:46:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.14490","created_at":"2026-07-05T08:46:28Z"},{"alias_kind":"pith_short_12","alias_value":"HM6JHKWOEJZ5","created_at":"2026-07-05T08:46:28Z"},{"alias_kind":"pith_short_16","alias_value":"HM6JHKWOEJZ5UIYB","created_at":"2026-07-05T08:46:28Z"},{"alias_kind":"pith_short_8","alias_value":"HM6JHKWO","created_at":"2026-07-05T08:46:28Z"}],"graph_snapshots":[{"event_id":"sha256:d26f1b4f69fded53bc5a2f106ffd00c3584351fb8ba1d6b6858617266193a4c7","target":"graph","created_at":"2026-07-05T08:46:28Z","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/2407.14490/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) addresses combinatorial optimization challenges by converting inputs to graphs. However, the optimal parameter searching process of QAOA is greatly affected by noise. Larger problems yield bigger graphs, requiring more qubits and making their outcomes highly noise-sensitive. This paper introduces Red-QAOA, leveraging energy landscape concentration via a simulated annealing-based graph reduction.\n  Red-QAOA creates a smaller (distilled) graph with nearly identical parameters to the original graph. The distilled graph produces a smaller quant","authors_text":"Ang Li, Bo Fang, Meng Wang, Prashant Nair","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-07-19T17:44:29Z","title":"Red-QAOA: Efficient Variational Optimization through Circuit Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.14490","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:05d0cb69042c013662c72f1b4b159ee984366e8d46c218f27d001c17ff967ce9","target":"record","created_at":"2026-07-05T08:46:28Z","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":"dfd52b9ea0783cae284fbf2641cf1d3f2c861f52ce83c7baaa256410de8976e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-07-19T17:44:29Z","title_canon_sha256":"d8c790a61cde88aab1339ef16ffc52f7be30dbc340c22555487ef78cbbec57c4"},"schema_version":"1.0","source":{"id":"2407.14490","kind":"arxiv","version":2}},"canonical_sha256":"3b3c93aace2273da2301f2baef9915de7dad5bb63169ad365da08cd41850a08b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b3c93aace2273da2301f2baef9915de7dad5bb63169ad365da08cd41850a08b","first_computed_at":"2026-07-05T08:46:28.572902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:46:28.572902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qrhvOTcLgiaAelBTinipW8z7nMLWmJS1o9kHW47Q1149yBa+IW5YwONLGSgWNm4B5dpB/SX7L/VyLC2Su95TCw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:46:28.573303Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.14490","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05d0cb69042c013662c72f1b4b159ee984366e8d46c218f27d001c17ff967ce9","sha256:d26f1b4f69fded53bc5a2f106ffd00c3584351fb8ba1d6b6858617266193a4c7"],"state_sha256":"0a8897e6c9120f6ee9b00bccd901da254ce5fc80dd1a0865e9eb0875060277d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UNW9tGL8QGHc/kcK1MBlmvDF8oLTQ+KUhcutItFNRc+FBb205ubj1fgzxTaNxQzUHhTf9/c8t2MNUQ9prPVjDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T19:30:07.874447Z","bundle_sha256":"36af015a9c6e79206bc33fac3083f98d60365689f75f4e10a4972f3f69d74499"}}