{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JGTLFRP2Q3QX2SF3QNLH63OOGZ","short_pith_number":"pith:JGTLFRP2","schema_version":"1.0","canonical_sha256":"49a6b2c5fa86e17d48bb83567f6dce3663d08887ede134a0d6a81bc609dd58eb","source":{"kind":"arxiv","id":"2504.21135","version":1},"attestation_state":"computed","paper":{"title":"QAOA Parameter Transferability for Maximum Independent Set using Graph Attention Networks","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Alex Pothen, Hanjing Xu, Ilya Safro, Xiaoyuan Liu","submitted_at":"2025-04-29T19:41:05Z","abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) is one of the promising variational approaches of quantum computing to solve combinatorial optimization problems. In QAOA, variational parameters need to be optimized by solving a series of nonlinear, nonconvex optimization programs. In this work, we propose a QAOA parameter transfer scheme using Graph Attention Networks (GAT) to solve Maximum Independent Set (MIS) problems. We prepare optimized parameters for graphs of 12 and 14 vertices and use GATs to transfer their parameters to larger graphs. Additionally, we design a hybrid distribute"},"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":"2504.21135","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-29T19:41:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9209a4987946bf1c88977cf0b51791b186d527114380584fdb2662bdc1fb3716","abstract_canon_sha256":"e00330ef0fff349a83a1173b046f510692611b11dadead055c3756fe72e8444b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:57.804240Z","signature_b64":"QmiJUAzh4t43Oinr1zIRXOdFVM3e74/wuJFl+b8DGMGQ2l89lDuOyRHPovz0Z+b0yKuIjRx4EPppxxy8+5qxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49a6b2c5fa86e17d48bb83567f6dce3663d08887ede134a0d6a81bc609dd58eb","last_reissued_at":"2026-07-05T10:55:57.803755Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:57.803755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QAOA Parameter Transferability for Maximum Independent Set using Graph Attention Networks","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Alex Pothen, Hanjing Xu, Ilya Safro, Xiaoyuan Liu","submitted_at":"2025-04-29T19:41:05Z","abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) is one of the promising variational approaches of quantum computing to solve combinatorial optimization problems. In QAOA, variational parameters need to be optimized by solving a series of nonlinear, nonconvex optimization programs. In this work, we propose a QAOA parameter transfer scheme using Graph Attention Networks (GAT) to solve Maximum Independent Set (MIS) problems. We prepare optimized parameters for graphs of 12 and 14 vertices and use GATs to transfer their parameters to larger graphs. Additionally, we design a hybrid distribute"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.21135","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/2504.21135/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":"2504.21135","created_at":"2026-07-05T10:55:57.803814+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.21135v1","created_at":"2026-07-05T10:55:57.803814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21135","created_at":"2026-07-05T10:55:57.803814+00:00"},{"alias_kind":"pith_short_12","alias_value":"JGTLFRP2Q3QX","created_at":"2026-07-05T10:55:57.803814+00:00"},{"alias_kind":"pith_short_16","alias_value":"JGTLFRP2Q3QX2SF3","created_at":"2026-07-05T10:55:57.803814+00:00"},{"alias_kind":"pith_short_8","alias_value":"JGTLFRP2","created_at":"2026-07-05T10:55:57.803814+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28866","citing_title":"Quantum Variational Approaches to the Maximum Independent Set Problem at Utility Scale","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05311","citing_title":"Setting angles in quantum approximate optimization at utility-scale","ref_index":108,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28866","citing_title":"Quantum Variational Approaches to the Maximum Independent Set Problem at Utility Scale","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26040","citing_title":"QAOA Parameter Transfer for Hypergraphs","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JGTLFRP2Q3QX2SF3QNLH63OOGZ","json":"https://pith.science/pith/JGTLFRP2Q3QX2SF3QNLH63OOGZ.json","graph_json":"https://pith.science/api/pith-number/JGTLFRP2Q3QX2SF3QNLH63OOGZ/graph.json","events_json":"https://pith.science/api/pith-number/JGTLFRP2Q3QX2SF3QNLH63OOGZ/events.json","paper":"https://pith.science/paper/JGTLFRP2"},"agent_actions":{"view_html":"https://pith.science/pith/JGTLFRP2Q3QX2SF3QNLH63OOGZ","download_json":"https://pith.science/pith/JGTLFRP2Q3QX2SF3QNLH63OOGZ.json","view_paper":"https://pith.science/paper/JGTLFRP2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.21135&json=true","fetch_graph":"https://pith.science/api/pith-number/JGTLFRP2Q3QX2SF3QNLH63OOGZ/graph.json","fetch_events":"https://pith.science/api/pith-number/JGTLFRP2Q3QX2SF3QNLH63OOGZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JGTLFRP2Q3QX2SF3QNLH63OOGZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JGTLFRP2Q3QX2SF3QNLH63OOGZ/action/storage_attestation","attest_author":"https://pith.science/pith/JGTLFRP2Q3QX2SF3QNLH63OOGZ/action/author_attestation","sign_citation":"https://pith.science/pith/JGTLFRP2Q3QX2SF3QNLH63OOGZ/action/citation_signature","submit_replication":"https://pith.science/pith/JGTLFRP2Q3QX2SF3QNLH63OOGZ/action/replication_record"}},"created_at":"2026-07-05T10:55:57.803814+00:00","updated_at":"2026-07-05T10:55:57.803814+00:00"}