{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WXKRGC4NWOXWCDAKD3IVSQWXGE","short_pith_number":"pith:WXKRGC4N","schema_version":"1.0","canonical_sha256":"b5d5130b8db3af610c0a1ed15942d7310823d7e52a1b102c52dfdb2799568581","source":{"kind":"arxiv","id":"2410.15626","version":1},"attestation_state":"computed","paper":{"title":"Hybrid Quantum-HPC Solutions for Max-Cut: Bridging Classical and Quantum Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.ET"],"primary_cat":"quant-ph","authors_text":"Akhil Akkapelli, Ishan Patwardhan","submitted_at":"2024-10-21T04:10:54Z","abstract_excerpt":"This research explores the integration of the Quantum Approximate Optimization Algorithm (QAOA) into Hybrid Quantum-HPC systems for solving the Max-Cut problem, comparing its performance with classical algorithms like brute-force search and greedy heuristics. We develop a theoretical model to analyze the time complexity, scalability, and communication overhead in hybrid systems. Using simulations, we evaluate QAOA's performance on small-scale Max-Cut instances, benchmarking its runtime, solution accuracy, and resource utilization. The study also investigates the scalability of QAOA with increa"},"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":"2410.15626","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-21T04:10:54Z","cross_cats_sorted":["cs.DC","cs.ET"],"title_canon_sha256":"57c0ab7a3183a5195ca046d0b9650c97b3077db24c00fb98847e844682c69ebc","abstract_canon_sha256":"1a233c67c7fbe225e0b41a2f9c9391e46865ed1c1507052bd7e908b88fdb0fa9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:23:22.346173Z","signature_b64":"4GMhXMhFfUVLdvUvxNRVVfqj0qFPEwpwFxATBiC4PG+PdeuaaRNFmYof8/IeD0wX1FvwwZ6Dj2IR3wll8AjzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5d5130b8db3af610c0a1ed15942d7310823d7e52a1b102c52dfdb2799568581","last_reissued_at":"2026-07-05T09:23:22.345734Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:23:22.345734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybrid Quantum-HPC Solutions for Max-Cut: Bridging Classical and Quantum Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.ET"],"primary_cat":"quant-ph","authors_text":"Akhil Akkapelli, Ishan Patwardhan","submitted_at":"2024-10-21T04:10:54Z","abstract_excerpt":"This research explores the integration of the Quantum Approximate Optimization Algorithm (QAOA) into Hybrid Quantum-HPC systems for solving the Max-Cut problem, comparing its performance with classical algorithms like brute-force search and greedy heuristics. We develop a theoretical model to analyze the time complexity, scalability, and communication overhead in hybrid systems. Using simulations, we evaluate QAOA's performance on small-scale Max-Cut instances, benchmarking its runtime, solution accuracy, and resource utilization. The study also investigates the scalability of QAOA with increa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.15626","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/2410.15626/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":"2410.15626","created_at":"2026-07-05T09:23:22.345791+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.15626v1","created_at":"2026-07-05T09:23:22.345791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.15626","created_at":"2026-07-05T09:23:22.345791+00:00"},{"alias_kind":"pith_short_12","alias_value":"WXKRGC4NWOXW","created_at":"2026-07-05T09:23:22.345791+00:00"},{"alias_kind":"pith_short_16","alias_value":"WXKRGC4NWOXWCDAK","created_at":"2026-07-05T09:23:22.345791+00:00"},{"alias_kind":"pith_short_8","alias_value":"WXKRGC4N","created_at":"2026-07-05T09:23:22.345791+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.08367","citing_title":"Per-Shot Evaluation of QAOA on Max-Cut: A Black-Box Implementation Comparison with Goemans-Williamson","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WXKRGC4NWOXWCDAKD3IVSQWXGE","json":"https://pith.science/pith/WXKRGC4NWOXWCDAKD3IVSQWXGE.json","graph_json":"https://pith.science/api/pith-number/WXKRGC4NWOXWCDAKD3IVSQWXGE/graph.json","events_json":"https://pith.science/api/pith-number/WXKRGC4NWOXWCDAKD3IVSQWXGE/events.json","paper":"https://pith.science/paper/WXKRGC4N"},"agent_actions":{"view_html":"https://pith.science/pith/WXKRGC4NWOXWCDAKD3IVSQWXGE","download_json":"https://pith.science/pith/WXKRGC4NWOXWCDAKD3IVSQWXGE.json","view_paper":"https://pith.science/paper/WXKRGC4N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.15626&json=true","fetch_graph":"https://pith.science/api/pith-number/WXKRGC4NWOXWCDAKD3IVSQWXGE/graph.json","fetch_events":"https://pith.science/api/pith-number/WXKRGC4NWOXWCDAKD3IVSQWXGE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WXKRGC4NWOXWCDAKD3IVSQWXGE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WXKRGC4NWOXWCDAKD3IVSQWXGE/action/storage_attestation","attest_author":"https://pith.science/pith/WXKRGC4NWOXWCDAKD3IVSQWXGE/action/author_attestation","sign_citation":"https://pith.science/pith/WXKRGC4NWOXWCDAKD3IVSQWXGE/action/citation_signature","submit_replication":"https://pith.science/pith/WXKRGC4NWOXWCDAKD3IVSQWXGE/action/replication_record"}},"created_at":"2026-07-05T09:23:22.345791+00:00","updated_at":"2026-07-05T09:23:22.345791+00:00"}