{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:43W7J4IHAJBN5FHQQVQN3VBFF6","short_pith_number":"pith:43W7J4IH","schema_version":"1.0","canonical_sha256":"e6edf4f1070242de94f08560ddd4252fbdcf6ee4579bf842b6248399a99c6101","source":{"kind":"arxiv","id":"2506.10531","version":1},"attestation_state":"computed","paper":{"title":"GPU-Accelerated Distributed QAOA on Large-scale HPC Ecosystems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Amir Shehata, Ang Li, Frank Mueller, In-Saeng Suh, Seongmin Kim, Srikar Chundury, Tengfei Luo, Xinyi Li, Zhihao Xu","submitted_at":"2025-06-12T09:55:19Z","abstract_excerpt":"Quantum computing holds great potential to accelerate the process of solving complex combinatorial optimization problems. The Distributed Quantum Approximate Optimization Algorithm (DQAOA) addresses high-dimensional, dense problems using current quantum computing techniques and high-performance computing (HPC) systems. In this work, we improve the scalability and efficiency of DQAOA through advanced problem decomposition and parallel execution using message passing on the Frontier CPU/GPU supercomputer. Our approach ensures efficient quantum-classical workload management by distributing large "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2506.10531","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-06-12T09:55:19Z","cross_cats_sorted":[],"title_canon_sha256":"5f4a1c6a227f12b0607f5e431e8ece0a9db755401aabe2cd91db54272857ac94","abstract_canon_sha256":"00f634501ed541b6b2743b57fbb5016b39faa6ef08e7ad87b6765cf5d2d0ab7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:25.637388Z","signature_b64":"f3KpfkG5qIWLiUFD1XwcH5xNtZFLAEWcc0Yh8CJtkXAQBbvYB1x9XVDwg4mDnTpjNLSPc1zTrLpIh341hcOPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6edf4f1070242de94f08560ddd4252fbdcf6ee4579bf842b6248399a99c6101","last_reissued_at":"2026-07-05T11:20:25.636882Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:25.636882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GPU-Accelerated Distributed QAOA on Large-scale HPC Ecosystems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Amir Shehata, Ang Li, Frank Mueller, In-Saeng Suh, Seongmin Kim, Srikar Chundury, Tengfei Luo, Xinyi Li, Zhihao Xu","submitted_at":"2025-06-12T09:55:19Z","abstract_excerpt":"Quantum computing holds great potential to accelerate the process of solving complex combinatorial optimization problems. The Distributed Quantum Approximate Optimization Algorithm (DQAOA) addresses high-dimensional, dense problems using current quantum computing techniques and high-performance computing (HPC) systems. In this work, we improve the scalability and efficiency of DQAOA through advanced problem decomposition and parallel execution using message passing on the Frontier CPU/GPU supercomputer. Our approach ensures efficient quantum-classical workload management by distributing large "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.10531","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/2506.10531/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.10531","created_at":"2026-07-05T11:20:25.636945+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.10531v1","created_at":"2026-07-05T11:20:25.636945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.10531","created_at":"2026-07-05T11:20:25.636945+00:00"},{"alias_kind":"pith_short_12","alias_value":"43W7J4IHAJBN","created_at":"2026-07-05T11:20:25.636945+00:00"},{"alias_kind":"pith_short_16","alias_value":"43W7J4IHAJBN5FHQ","created_at":"2026-07-05T11:20:25.636945+00:00"},{"alias_kind":"pith_short_8","alias_value":"43W7J4IH","created_at":"2026-07-05T11:20:25.636945+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11375","citing_title":"TuniQ: Autotuning Compilation Passes for Quantum Workloads at Scale for Effectiveness and Efficiency","ref_index":81,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/43W7J4IHAJBN5FHQQVQN3VBFF6","json":"https://pith.science/pith/43W7J4IHAJBN5FHQQVQN3VBFF6.json","graph_json":"https://pith.science/api/pith-number/43W7J4IHAJBN5FHQQVQN3VBFF6/graph.json","events_json":"https://pith.science/api/pith-number/43W7J4IHAJBN5FHQQVQN3VBFF6/events.json","paper":"https://pith.science/paper/43W7J4IH"},"agent_actions":{"view_html":"https://pith.science/pith/43W7J4IHAJBN5FHQQVQN3VBFF6","download_json":"https://pith.science/pith/43W7J4IHAJBN5FHQQVQN3VBFF6.json","view_paper":"https://pith.science/paper/43W7J4IH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.10531&json=true","fetch_graph":"https://pith.science/api/pith-number/43W7J4IHAJBN5FHQQVQN3VBFF6/graph.json","fetch_events":"https://pith.science/api/pith-number/43W7J4IHAJBN5FHQQVQN3VBFF6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43W7J4IHAJBN5FHQQVQN3VBFF6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43W7J4IHAJBN5FHQQVQN3VBFF6/action/storage_attestation","attest_author":"https://pith.science/pith/43W7J4IHAJBN5FHQQVQN3VBFF6/action/author_attestation","sign_citation":"https://pith.science/pith/43W7J4IHAJBN5FHQQVQN3VBFF6/action/citation_signature","submit_replication":"https://pith.science/pith/43W7J4IHAJBN5FHQQVQN3VBFF6/action/replication_record"}},"created_at":"2026-07-05T11:20:25.636945+00:00","updated_at":"2026-07-05T11:20:25.636945+00:00"}