{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TAGHTH7YQYI4Q7UZQHGT3ALWPK","short_pith_number":"pith:TAGHTH7Y","schema_version":"1.0","canonical_sha256":"980c799ff88611c87e9981cd3d81767a91cc16176d6d3e89d26f2c4748b3254b","source":{"kind":"arxiv","id":"2509.13528","version":2},"attestation_state":"computed","paper":{"title":"Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"quant-ph","authors_text":"Andreas B\\\"artschi, Elijah Pelofske, Lukasz Cincio, Marek Rams, Paolo Braccia, Piotr Czarnik, Stephan Eidenbenz","submitted_at":"2025-09-16T20:48:53Z","abstract_excerpt":"The emergent practical applicability of the Quantum Approximate Optimization Algorithm (QAOA) for approximate combinatorial optimization is a subject of considerable interest. One of the primary limitations of QAOA is the task of finding a set of good parameters. Parameter transfer is a phenomenon where QAOA angles trained on problem instances that are self-similar tend to perform well for other problem instances from that similar class. This suggests a potentially highly efficient and scalable non-variational learning method for QAOA angle finding. We systematically study QAOA parameter trans"},"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":"2509.13528","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-09-16T20:48:53Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"adcb1c2da810e1da173dddc3cb644531cfbbf352adc0d13b00f4d54f88615dd6","abstract_canon_sha256":"d2256675fcd98aa7226cb9cac0be92bb05d19439a05d7dfdd0398ede58d39355"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:17.525328Z","signature_b64":"4NLmw+ncnkJPnSG1qFS4Z32Ml7CgF/yaCrCsyKclJQF4k1yAadNV83GPB6DP+UU9Xnq3JoZ5YfmkIkD07lLYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"980c799ff88611c87e9981cd3d81767a91cc16176d6d3e89d26f2c4748b3254b","last_reissued_at":"2026-05-17T23:39:17.524664Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:17.524664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"quant-ph","authors_text":"Andreas B\\\"artschi, Elijah Pelofske, Lukasz Cincio, Marek Rams, Paolo Braccia, Piotr Czarnik, Stephan Eidenbenz","submitted_at":"2025-09-16T20:48:53Z","abstract_excerpt":"The emergent practical applicability of the Quantum Approximate Optimization Algorithm (QAOA) for approximate combinatorial optimization is a subject of considerable interest. One of the primary limitations of QAOA is the task of finding a set of good parameters. Parameter transfer is a phenomenon where QAOA angles trained on problem instances that are self-similar tend to perform well for other problem instances from that similar class. This suggests a potentially highly efficient and scalable non-variational learning method for QAOA angle finding. We systematically study QAOA parameter trans"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.13528","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":""},"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":"2509.13528","created_at":"2026-05-17T23:39:17.524751+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.13528v2","created_at":"2026-05-17T23:39:17.524751+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.13528","created_at":"2026-05-17T23:39:17.524751+00:00"},{"alias_kind":"pith_short_12","alias_value":"TAGHTH7YQYI4","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"TAGHTH7YQYI4Q7UZ","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"TAGHTH7Y","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.20180","citing_title":"Tensor network surrogate models for variational quantum computation","ref_index":51,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TAGHTH7YQYI4Q7UZQHGT3ALWPK","json":"https://pith.science/pith/TAGHTH7YQYI4Q7UZQHGT3ALWPK.json","graph_json":"https://pith.science/api/pith-number/TAGHTH7YQYI4Q7UZQHGT3ALWPK/graph.json","events_json":"https://pith.science/api/pith-number/TAGHTH7YQYI4Q7UZQHGT3ALWPK/events.json","paper":"https://pith.science/paper/TAGHTH7Y"},"agent_actions":{"view_html":"https://pith.science/pith/TAGHTH7YQYI4Q7UZQHGT3ALWPK","download_json":"https://pith.science/pith/TAGHTH7YQYI4Q7UZQHGT3ALWPK.json","view_paper":"https://pith.science/paper/TAGHTH7Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.13528&json=true","fetch_graph":"https://pith.science/api/pith-number/TAGHTH7YQYI4Q7UZQHGT3ALWPK/graph.json","fetch_events":"https://pith.science/api/pith-number/TAGHTH7YQYI4Q7UZQHGT3ALWPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TAGHTH7YQYI4Q7UZQHGT3ALWPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TAGHTH7YQYI4Q7UZQHGT3ALWPK/action/storage_attestation","attest_author":"https://pith.science/pith/TAGHTH7YQYI4Q7UZQHGT3ALWPK/action/author_attestation","sign_citation":"https://pith.science/pith/TAGHTH7YQYI4Q7UZQHGT3ALWPK/action/citation_signature","submit_replication":"https://pith.science/pith/TAGHTH7YQYI4Q7UZQHGT3ALWPK/action/replication_record"}},"created_at":"2026-05-17T23:39:17.524751+00:00","updated_at":"2026-05-17T23:39:17.524751+00:00"}