{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TRSIJM6ZQBBV2NGL4TNENWAGWA","short_pith_number":"pith:TRSIJM6Z","schema_version":"1.0","canonical_sha256":"9c6484b3d980435d34cbe4da46d806b015d0e86360cd2e564c8c8aa3e91e7c48","source":{"kind":"arxiv","id":"2504.19934","version":1},"attestation_state":"computed","paper":{"title":"Warm-Starting QAOA with XY Mixers: A Novel Approach for Quantum-Enhanced Vehicle Routing Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Felipe F. Fanchini, Jo\\~ao Paulo Papa, Marcos C. S. Santana, Rafael S. do Carmo, Victor Hugo C. de Albuquerque","submitted_at":"2025-04-28T16:08:38Z","abstract_excerpt":"Quantum optimization algorithms, such as the Quantum Approximate Optimization Algorithm, are emerging as promising heuristics for solving complex combinatorial problems. To improve performance, several extensions to the standard QAOA framework have been proposed in recent years. Two notable directions include: warm-starting techniques, which incorporate classical approximate solutions to guide the quantum evolution, and custom mixer Hamiltonians, such as XY mixers, which constrain the search to feasible subspaces aligned with the structure of the problem. In this work, we propose an approach t"},"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.19934","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-28T16:08:38Z","cross_cats_sorted":[],"title_canon_sha256":"9881097f11fe68dc24249d79bfa1876b7eea30c991a6728b8daba52a1fd167fb","abstract_canon_sha256":"8833a8b7bf214bb1d27346d14673b944d05d5495b995ccdfe6a68080e567884c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:06.578768Z","signature_b64":"2Pk+dMFvY7vso+ruGx9nfRcjhyHf7M/K4OfxaWumvtZF28F0t7Mlxm4MBobJJrzvR7A0exUfUxeKkH9WJLzzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c6484b3d980435d34cbe4da46d806b015d0e86360cd2e564c8c8aa3e91e7c48","last_reissued_at":"2026-07-05T10:55:06.578227Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:06.578227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Warm-Starting QAOA with XY Mixers: A Novel Approach for Quantum-Enhanced Vehicle Routing Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Felipe F. Fanchini, Jo\\~ao Paulo Papa, Marcos C. S. Santana, Rafael S. do Carmo, Victor Hugo C. de Albuquerque","submitted_at":"2025-04-28T16:08:38Z","abstract_excerpt":"Quantum optimization algorithms, such as the Quantum Approximate Optimization Algorithm, are emerging as promising heuristics for solving complex combinatorial problems. To improve performance, several extensions to the standard QAOA framework have been proposed in recent years. Two notable directions include: warm-starting techniques, which incorporate classical approximate solutions to guide the quantum evolution, and custom mixer Hamiltonians, such as XY mixers, which constrain the search to feasible subspaces aligned with the structure of the problem. In this work, we propose an approach t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.19934","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.19934/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.19934","created_at":"2026-07-05T10:55:06.578304+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.19934v1","created_at":"2026-07-05T10:55:06.578304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.19934","created_at":"2026-07-05T10:55:06.578304+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRSIJM6ZQBBV","created_at":"2026-07-05T10:55:06.578304+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRSIJM6ZQBBV2NGL","created_at":"2026-07-05T10:55:06.578304+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRSIJM6Z","created_at":"2026-07-05T10:55:06.578304+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.17259","citing_title":"Fundamental Limitations of QAOA on Constrained Problems and a Route to Exponential Enhancement","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07218","citing_title":"Improving Feasibility in Quantum Approximate Optimization Algorithm for Vehicle Routing via Constraint-Aware Initialization and Hybrid XY-X Mixing","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05776","citing_title":"A Nested Amplitude Amplification Protocol for the Binary Knapsack Problem","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TRSIJM6ZQBBV2NGL4TNENWAGWA","json":"https://pith.science/pith/TRSIJM6ZQBBV2NGL4TNENWAGWA.json","graph_json":"https://pith.science/api/pith-number/TRSIJM6ZQBBV2NGL4TNENWAGWA/graph.json","events_json":"https://pith.science/api/pith-number/TRSIJM6ZQBBV2NGL4TNENWAGWA/events.json","paper":"https://pith.science/paper/TRSIJM6Z"},"agent_actions":{"view_html":"https://pith.science/pith/TRSIJM6ZQBBV2NGL4TNENWAGWA","download_json":"https://pith.science/pith/TRSIJM6ZQBBV2NGL4TNENWAGWA.json","view_paper":"https://pith.science/paper/TRSIJM6Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.19934&json=true","fetch_graph":"https://pith.science/api/pith-number/TRSIJM6ZQBBV2NGL4TNENWAGWA/graph.json","fetch_events":"https://pith.science/api/pith-number/TRSIJM6ZQBBV2NGL4TNENWAGWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRSIJM6ZQBBV2NGL4TNENWAGWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRSIJM6ZQBBV2NGL4TNENWAGWA/action/storage_attestation","attest_author":"https://pith.science/pith/TRSIJM6ZQBBV2NGL4TNENWAGWA/action/author_attestation","sign_citation":"https://pith.science/pith/TRSIJM6ZQBBV2NGL4TNENWAGWA/action/citation_signature","submit_replication":"https://pith.science/pith/TRSIJM6ZQBBV2NGL4TNENWAGWA/action/replication_record"}},"created_at":"2026-07-05T10:55:06.578304+00:00","updated_at":"2026-07-05T10:55:06.578304+00:00"}