{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:UTSIHLDU6R3QAJXJQHOQRXKGAY","short_pith_number":"pith:UTSIHLDU","schema_version":"1.0","canonical_sha256":"a4e483ac74f4770026e981dd08dd4606023a09687e5f96e8c6f0861f1e97e579","source":{"kind":"arxiv","id":"2201.11785","version":2},"attestation_state":"computed","paper":{"title":"Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"James Ostrowski, Jeffrey Larson, Phillip C. Lotshaw, Ruslan Shaydulin, Travis S. Humble","submitted_at":"2022-01-27T19:54:00Z","abstract_excerpt":"Finding high-quality parameters is a central obstacle to using the quantum approximate optimization algorithm (QAOA). Previous work partially addresses this issue for QAOA on unweighted MaxCut problems by leveraging similarities in the objective landscape among different problem instances. However, we show that the more general weighted MaxCut problem has significantly modified objective landscapes, with a proliferation of poor local optima. Our main contribution is a simple rescaling scheme that overcomes these deleterious effects of weights. We show that for a given QAOA depth, a single \"typ"},"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":"2201.11785","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-01-27T19:54:00Z","cross_cats_sorted":[],"title_canon_sha256":"13f9fd95e3470187b49d7829fe789f674147700cfc652033f43352634d6a87a1","abstract_canon_sha256":"838129294a581d9f7aed7efb852fba14d2218354c2acaf805489d4beb31fa4f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:39:24.445391Z","signature_b64":"GdgvSBVWx9dEYSrHjK6A43GyOondal0OZZcO+qpv+6fgBAIQ+dVOw1CVCq4QzJWIeWY7vizLqsKs8xJJiIqDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4e483ac74f4770026e981dd08dd4606023a09687e5f96e8c6f0861f1e97e579","last_reissued_at":"2026-07-05T07:39:24.444931Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:39:24.444931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"James Ostrowski, Jeffrey Larson, Phillip C. Lotshaw, Ruslan Shaydulin, Travis S. Humble","submitted_at":"2022-01-27T19:54:00Z","abstract_excerpt":"Finding high-quality parameters is a central obstacle to using the quantum approximate optimization algorithm (QAOA). Previous work partially addresses this issue for QAOA on unweighted MaxCut problems by leveraging similarities in the objective landscape among different problem instances. However, we show that the more general weighted MaxCut problem has significantly modified objective landscapes, with a proliferation of poor local optima. Our main contribution is a simple rescaling scheme that overcomes these deleterious effects of weights. We show that for a given QAOA depth, a single \"typ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.11785","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2201.11785/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":"2201.11785","created_at":"2026-07-05T07:39:24.444989+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.11785v2","created_at":"2026-07-05T07:39:24.444989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.11785","created_at":"2026-07-05T07:39:24.444989+00:00"},{"alias_kind":"pith_short_12","alias_value":"UTSIHLDU6R3Q","created_at":"2026-07-05T07:39:24.444989+00:00"},{"alias_kind":"pith_short_16","alias_value":"UTSIHLDU6R3QAJXJ","created_at":"2026-07-05T07:39:24.444989+00:00"},{"alias_kind":"pith_short_8","alias_value":"UTSIHLDU","created_at":"2026-07-05T07:39:24.444989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.13528","citing_title":"Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UTSIHLDU6R3QAJXJQHOQRXKGAY","json":"https://pith.science/pith/UTSIHLDU6R3QAJXJQHOQRXKGAY.json","graph_json":"https://pith.science/api/pith-number/UTSIHLDU6R3QAJXJQHOQRXKGAY/graph.json","events_json":"https://pith.science/api/pith-number/UTSIHLDU6R3QAJXJQHOQRXKGAY/events.json","paper":"https://pith.science/paper/UTSIHLDU"},"agent_actions":{"view_html":"https://pith.science/pith/UTSIHLDU6R3QAJXJQHOQRXKGAY","download_json":"https://pith.science/pith/UTSIHLDU6R3QAJXJQHOQRXKGAY.json","view_paper":"https://pith.science/paper/UTSIHLDU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.11785&json=true","fetch_graph":"https://pith.science/api/pith-number/UTSIHLDU6R3QAJXJQHOQRXKGAY/graph.json","fetch_events":"https://pith.science/api/pith-number/UTSIHLDU6R3QAJXJQHOQRXKGAY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UTSIHLDU6R3QAJXJQHOQRXKGAY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UTSIHLDU6R3QAJXJQHOQRXKGAY/action/storage_attestation","attest_author":"https://pith.science/pith/UTSIHLDU6R3QAJXJQHOQRXKGAY/action/author_attestation","sign_citation":"https://pith.science/pith/UTSIHLDU6R3QAJXJQHOQRXKGAY/action/citation_signature","submit_replication":"https://pith.science/pith/UTSIHLDU6R3QAJXJQHOQRXKGAY/action/replication_record"}},"created_at":"2026-07-05T07:39:24.444989+00:00","updated_at":"2026-07-05T07:39:24.444989+00:00"}