{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TU2V567U5XICNI625JYDJNOATY","short_pith_number":"pith:TU2V567U","schema_version":"1.0","canonical_sha256":"9d355efbf4edd026a3daea7034b5c09e19d000c30b5fad77fc3362556f1408d3","source":{"kind":"arxiv","id":"2407.12242","version":4},"attestation_state":"computed","paper":{"title":"Conditional Diffusion-based Parameter Generation for Quantum Approximate Optimization Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fanxu Meng, Pengcheng Zhu, Xiangzhen Zhou, Yu Luo","submitted_at":"2024-07-17T01:18:27Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm that shows promise in efficiently solving the MaxCut problem, a representative example of combinatorial optimization. However, its effectiveness heavily depends on the parameter optimization pipeline, where the parameter initialization strategy is nontrivial due to the non-convex and complex optimization landscapes characterized by issues with low-quality local minima. Recent inspiration comes from the diffusion of classical neural network parameters, which has demonstrated that neural network trainin"},"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":"2407.12242","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-07-17T01:18:27Z","cross_cats_sorted":[],"title_canon_sha256":"2542db14086b80eacc789ed315028c80966dc4e8f678565b0bb49267a8670ee9","abstract_canon_sha256":"5b54dd7fd4cd5ffa7f1bfe749579fbc9fd1769cb5cd14ef35262e3a5ad921e65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:02:23.700357Z","signature_b64":"QrQFMdHcZcCJCVi5uQKajDiRw1ZUnCyFZTOVhpt6rDhzKmqVq70bcXrIoBcTalCtg40TIQvYnm/flo79gbvbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d355efbf4edd026a3daea7034b5c09e19d000c30b5fad77fc3362556f1408d3","last_reissued_at":"2026-07-05T10:02:23.699924Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:02:23.699924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conditional Diffusion-based Parameter Generation for Quantum Approximate Optimization Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fanxu Meng, Pengcheng Zhu, Xiangzhen Zhou, Yu Luo","submitted_at":"2024-07-17T01:18:27Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm that shows promise in efficiently solving the MaxCut problem, a representative example of combinatorial optimization. However, its effectiveness heavily depends on the parameter optimization pipeline, where the parameter initialization strategy is nontrivial due to the non-convex and complex optimization landscapes characterized by issues with low-quality local minima. Recent inspiration comes from the diffusion of classical neural network parameters, which has demonstrated that neural network trainin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.12242","kind":"arxiv","version":4},"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.12242/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":"2407.12242","created_at":"2026-07-05T10:02:23.699983+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.12242v4","created_at":"2026-07-05T10:02:23.699983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.12242","created_at":"2026-07-05T10:02:23.699983+00:00"},{"alias_kind":"pith_short_12","alias_value":"TU2V567U5XIC","created_at":"2026-07-05T10:02:23.699983+00:00"},{"alias_kind":"pith_short_16","alias_value":"TU2V567U5XICNI62","created_at":"2026-07-05T10:02:23.699983+00:00"},{"alias_kind":"pith_short_8","alias_value":"TU2V567U","created_at":"2026-07-05T10:02:23.699983+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05311","citing_title":"Setting angles in quantum approximate optimization at utility-scale","ref_index":105,"is_internal_anchor":false},{"citing_arxiv_id":"2506.06790","citing_title":"Benchmarking Swarm Optimization Algorithms for Parameter Initialization in the Quantum Approximate Optimization Algorithm","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TU2V567U5XICNI625JYDJNOATY","json":"https://pith.science/pith/TU2V567U5XICNI625JYDJNOATY.json","graph_json":"https://pith.science/api/pith-number/TU2V567U5XICNI625JYDJNOATY/graph.json","events_json":"https://pith.science/api/pith-number/TU2V567U5XICNI625JYDJNOATY/events.json","paper":"https://pith.science/paper/TU2V567U"},"agent_actions":{"view_html":"https://pith.science/pith/TU2V567U5XICNI625JYDJNOATY","download_json":"https://pith.science/pith/TU2V567U5XICNI625JYDJNOATY.json","view_paper":"https://pith.science/paper/TU2V567U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.12242&json=true","fetch_graph":"https://pith.science/api/pith-number/TU2V567U5XICNI625JYDJNOATY/graph.json","fetch_events":"https://pith.science/api/pith-number/TU2V567U5XICNI625JYDJNOATY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TU2V567U5XICNI625JYDJNOATY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TU2V567U5XICNI625JYDJNOATY/action/storage_attestation","attest_author":"https://pith.science/pith/TU2V567U5XICNI625JYDJNOATY/action/author_attestation","sign_citation":"https://pith.science/pith/TU2V567U5XICNI625JYDJNOATY/action/citation_signature","submit_replication":"https://pith.science/pith/TU2V567U5XICNI625JYDJNOATY/action/replication_record"}},"created_at":"2026-07-05T10:02:23.699983+00:00","updated_at":"2026-07-05T10:02:23.699983+00:00"}