{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2LPGLF7J6UIYQYASPRSADDAWAB","short_pith_number":"pith:2LPGLF7J","schema_version":"1.0","canonical_sha256":"d2de6597e9f5118860127c64018c16007f986fc8f41ab8248f5fe99e2a3a4c03","source":{"kind":"arxiv","id":"2512.23026","version":3},"attestation_state":"computed","paper":{"title":"Applying Grover-mixer quantum alternating operator ansatz algorithm to higher-order unconstrained binary optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksey K. Fedorov, Elizaveta V. Krendeleva, Evgeniy O. Kiktenko","submitted_at":"2025-12-28T18:01:20Z","abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) is among the leading candidates for achieving quantum advantage on near-term processors. While typically implemented with a transverse-field mixer (XM-QAOA), the Grover-mixer variant (GM-QAOA) offers a compelling alternative due to its global search capabilities. This work investigates the application of GM-QAOA to higher-order unconstrained binary optimization (HUBO) problems, also known as polynomial unconstrained binary optimization (PUBO), which form a general class of combinatorial optimization problems involving multivariable interact"},"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":"2512.23026","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-12-28T18:01:20Z","cross_cats_sorted":[],"title_canon_sha256":"ada2425926eeb212215525a3d68a48f8a910a810b6d6bf494345594d40db878b","abstract_canon_sha256":"7a038f81db593c06056e44b31bdaf89b0a32408fc56aa97b401cfc53a1356993"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:08:38.814613Z","signature_b64":"DgXv6mQVMDf1ewogKm6DrUlIjXO09z2t1bPfitNtocqMVl+/9SnO2bnXKuJ6NS5SCuxhcC8//5xiSfr0mOfjAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2de6597e9f5118860127c64018c16007f986fc8f41ab8248f5fe99e2a3a4c03","last_reissued_at":"2026-06-04T01:08:38.813796Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:08:38.813796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Applying Grover-mixer quantum alternating operator ansatz algorithm to higher-order unconstrained binary optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksey K. Fedorov, Elizaveta V. Krendeleva, Evgeniy O. Kiktenko","submitted_at":"2025-12-28T18:01:20Z","abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) is among the leading candidates for achieving quantum advantage on near-term processors. While typically implemented with a transverse-field mixer (XM-QAOA), the Grover-mixer variant (GM-QAOA) offers a compelling alternative due to its global search capabilities. This work investigates the application of GM-QAOA to higher-order unconstrained binary optimization (HUBO) problems, also known as polynomial unconstrained binary optimization (PUBO), which form a general class of combinatorial optimization problems involving multivariable interact"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.23026","kind":"arxiv","version":3},"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/2512.23026/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":"2512.23026","created_at":"2026-06-04T01:08:38.813934+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.23026v3","created_at":"2026-06-04T01:08:38.813934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.23026","created_at":"2026-06-04T01:08:38.813934+00:00"},{"alias_kind":"pith_short_12","alias_value":"2LPGLF7J6UIY","created_at":"2026-06-04T01:08:38.813934+00:00"},{"alias_kind":"pith_short_16","alias_value":"2LPGLF7J6UIYQYAS","created_at":"2026-06-04T01:08:38.813934+00:00"},{"alias_kind":"pith_short_8","alias_value":"2LPGLF7J","created_at":"2026-06-04T01:08:38.813934+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.23382","citing_title":"Non-unitary extension of Grover's search algorithm","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2LPGLF7J6UIYQYASPRSADDAWAB","json":"https://pith.science/pith/2LPGLF7J6UIYQYASPRSADDAWAB.json","graph_json":"https://pith.science/api/pith-number/2LPGLF7J6UIYQYASPRSADDAWAB/graph.json","events_json":"https://pith.science/api/pith-number/2LPGLF7J6UIYQYASPRSADDAWAB/events.json","paper":"https://pith.science/paper/2LPGLF7J"},"agent_actions":{"view_html":"https://pith.science/pith/2LPGLF7J6UIYQYASPRSADDAWAB","download_json":"https://pith.science/pith/2LPGLF7J6UIYQYASPRSADDAWAB.json","view_paper":"https://pith.science/paper/2LPGLF7J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.23026&json=true","fetch_graph":"https://pith.science/api/pith-number/2LPGLF7J6UIYQYASPRSADDAWAB/graph.json","fetch_events":"https://pith.science/api/pith-number/2LPGLF7J6UIYQYASPRSADDAWAB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2LPGLF7J6UIYQYASPRSADDAWAB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2LPGLF7J6UIYQYASPRSADDAWAB/action/storage_attestation","attest_author":"https://pith.science/pith/2LPGLF7J6UIYQYASPRSADDAWAB/action/author_attestation","sign_citation":"https://pith.science/pith/2LPGLF7J6UIYQYASPRSADDAWAB/action/citation_signature","submit_replication":"https://pith.science/pith/2LPGLF7J6UIYQYASPRSADDAWAB/action/replication_record"}},"created_at":"2026-06-04T01:08:38.813934+00:00","updated_at":"2026-06-04T01:08:38.813934+00:00"}