{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OIPJAAI4NADZA7E6GJNPGDD26B","short_pith_number":"pith:OIPJAAI4","schema_version":"1.0","canonical_sha256":"721e90011c6807907c9e325af30c7af04a819b92d6d1459ab9369a217a09a904","source":{"kind":"arxiv","id":"2606.25117","version":1},"attestation_state":"computed","paper":{"title":"Feasibility-driven QAOA with penalty scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniele Dragoni, Francesco Ferrari, Matteo Vandelli","submitted_at":"2026-06-23T19:44:00Z","abstract_excerpt":"Most available quantum algorithms address constrained optimization problems by treating constraints as soft penalty terms within a QUBO formulation. This approach requires careful adjustment of the penalty coefficients, which scales poorly with the number of constraints and lacks a proper strategy to balance feasibility and solution quality. In this work, we introduce two extensions of standard linear-ramp QAOA (lr-QAOA) tailored to problems with multiple heterogeneous constraints. We first construct $\\Lambda$-lr-QAOA, in which each penalty term is assigned its own linear-ramp schedule, promot"},"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":"2606.25117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-23T19:44:00Z","cross_cats_sorted":[],"title_canon_sha256":"d2339ac826cc7427bc2981d2ddb0e96ec6430c695f7129cab9ac1f93073a5939","abstract_canon_sha256":"a11d2b41f2328a14bd4e9215c97988b988390c5a5b91e00520c3108223f723ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T00:18:18.531724Z","signature_b64":"OrI9VvGTPp7k48tLxmjZK72qZs74CadgPVB9FhZfwdtsWtd66tRFTVBXMG6PLmBuYZlaaSSZ1NH/lFWqs3oTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"721e90011c6807907c9e325af30c7af04a819b92d6d1459ab9369a217a09a904","last_reissued_at":"2026-06-25T00:18:18.531338Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T00:18:18.531338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feasibility-driven QAOA with penalty scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniele Dragoni, Francesco Ferrari, Matteo Vandelli","submitted_at":"2026-06-23T19:44:00Z","abstract_excerpt":"Most available quantum algorithms address constrained optimization problems by treating constraints as soft penalty terms within a QUBO formulation. This approach requires careful adjustment of the penalty coefficients, which scales poorly with the number of constraints and lacks a proper strategy to balance feasibility and solution quality. In this work, we introduce two extensions of standard linear-ramp QAOA (lr-QAOA) tailored to problems with multiple heterogeneous constraints. We first construct $\\Lambda$-lr-QAOA, in which each penalty term is assigned its own linear-ramp schedule, promot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.25117","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/2606.25117/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":"2606.25117","created_at":"2026-06-25T00:18:18.531400+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.25117v1","created_at":"2026-06-25T00:18:18.531400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25117","created_at":"2026-06-25T00:18:18.531400+00:00"},{"alias_kind":"pith_short_12","alias_value":"OIPJAAI4NADZ","created_at":"2026-06-25T00:18:18.531400+00:00"},{"alias_kind":"pith_short_16","alias_value":"OIPJAAI4NADZA7E6","created_at":"2026-06-25T00:18:18.531400+00:00"},{"alias_kind":"pith_short_8","alias_value":"OIPJAAI4","created_at":"2026-06-25T00:18:18.531400+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OIPJAAI4NADZA7E6GJNPGDD26B","json":"https://pith.science/pith/OIPJAAI4NADZA7E6GJNPGDD26B.json","graph_json":"https://pith.science/api/pith-number/OIPJAAI4NADZA7E6GJNPGDD26B/graph.json","events_json":"https://pith.science/api/pith-number/OIPJAAI4NADZA7E6GJNPGDD26B/events.json","paper":"https://pith.science/paper/OIPJAAI4"},"agent_actions":{"view_html":"https://pith.science/pith/OIPJAAI4NADZA7E6GJNPGDD26B","download_json":"https://pith.science/pith/OIPJAAI4NADZA7E6GJNPGDD26B.json","view_paper":"https://pith.science/paper/OIPJAAI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.25117&json=true","fetch_graph":"https://pith.science/api/pith-number/OIPJAAI4NADZA7E6GJNPGDD26B/graph.json","fetch_events":"https://pith.science/api/pith-number/OIPJAAI4NADZA7E6GJNPGDD26B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OIPJAAI4NADZA7E6GJNPGDD26B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OIPJAAI4NADZA7E6GJNPGDD26B/action/storage_attestation","attest_author":"https://pith.science/pith/OIPJAAI4NADZA7E6GJNPGDD26B/action/author_attestation","sign_citation":"https://pith.science/pith/OIPJAAI4NADZA7E6GJNPGDD26B/action/citation_signature","submit_replication":"https://pith.science/pith/OIPJAAI4NADZA7E6GJNPGDD26B/action/replication_record"}},"created_at":"2026-06-25T00:18:18.531400+00:00","updated_at":"2026-06-25T00:18:18.531400+00:00"}