{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:OIPJAAI4NADZA7E6GJNPGDD26B","short_pith_number":"pith:OIPJAAI4","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"},"canonical_sha256":"721e90011c6807907c9e325af30c7af04a819b92d6d1459ab9369a217a09a904","source":{"kind":"arxiv","id":"2606.25117","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.25117","created_at":"2026-06-25T00:18:18Z"},{"alias_kind":"arxiv_version","alias_value":"2606.25117v1","created_at":"2026-06-25T00:18:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25117","created_at":"2026-06-25T00:18:18Z"},{"alias_kind":"pith_short_12","alias_value":"OIPJAAI4NADZ","created_at":"2026-06-25T00:18:18Z"},{"alias_kind":"pith_short_16","alias_value":"OIPJAAI4NADZA7E6","created_at":"2026-06-25T00:18:18Z"},{"alias_kind":"pith_short_8","alias_value":"OIPJAAI4","created_at":"2026-06-25T00:18:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:OIPJAAI4NADZA7E6GJNPGDD26B","target":"record","payload":{"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"},"canonical_sha256":"721e90011c6807907c9e325af30c7af04a819b92d6d1459ab9369a217a09a904","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"},"source_kind":"arxiv","source_id":"2606.25117","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-25T00:18:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4VtrInVW4A+J3aOkSr77Y/zcBscS2f5viNfxdiASSKvtrV1Vslj1+/Aym7UT5tbRR7d4uC9tH+8/GNkkban1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T19:21:35.055950Z"},"content_sha256":"0b4ae03c416306a24dabdbe2ea14e9b9b863728881fb2e12535891b6da98124b","schema_version":"1.0","event_id":"sha256:0b4ae03c416306a24dabdbe2ea14e9b9b863728881fb2e12535891b6da98124b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:OIPJAAI4NADZA7E6GJNPGDD26B","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-25T00:18:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ZlK3QI/6GskJ6Ls0pxz+KWGYAjPQUEyHldXJe0eeUSoRfVH+p3hB+iKmulLG9HOwfX1VWBTBq7cKxPf6XtbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T19:21:35.056309Z"},"content_sha256":"b8183b5ef71bf33d01814ee74d21dc100d25436a98d764dbfc53e5e3c8bb5615","schema_version":"1.0","event_id":"sha256:b8183b5ef71bf33d01814ee74d21dc100d25436a98d764dbfc53e5e3c8bb5615"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OIPJAAI4NADZA7E6GJNPGDD26B/bundle.json","state_url":"https://pith.science/pith/OIPJAAI4NADZA7E6GJNPGDD26B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OIPJAAI4NADZA7E6GJNPGDD26B/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T19:21:35Z","links":{"resolver":"https://pith.science/pith/OIPJAAI4NADZA7E6GJNPGDD26B","bundle":"https://pith.science/pith/OIPJAAI4NADZA7E6GJNPGDD26B/bundle.json","state":"https://pith.science/pith/OIPJAAI4NADZA7E6GJNPGDD26B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OIPJAAI4NADZA7E6GJNPGDD26B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OIPJAAI4NADZA7E6GJNPGDD26B","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a11d2b41f2328a14bd4e9215c97988b988390c5a5b91e00520c3108223f723ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-23T19:44:00Z","title_canon_sha256":"d2339ac826cc7427bc2981d2ddb0e96ec6430c695f7129cab9ac1f93073a5939"},"schema_version":"1.0","source":{"id":"2606.25117","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.25117","created_at":"2026-06-25T00:18:18Z"},{"alias_kind":"arxiv_version","alias_value":"2606.25117v1","created_at":"2026-06-25T00:18:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25117","created_at":"2026-06-25T00:18:18Z"},{"alias_kind":"pith_short_12","alias_value":"OIPJAAI4NADZ","created_at":"2026-06-25T00:18:18Z"},{"alias_kind":"pith_short_16","alias_value":"OIPJAAI4NADZA7E6","created_at":"2026-06-25T00:18:18Z"},{"alias_kind":"pith_short_8","alias_value":"OIPJAAI4","created_at":"2026-06-25T00:18:18Z"}],"graph_snapshots":[{"event_id":"sha256:b8183b5ef71bf33d01814ee74d21dc100d25436a98d764dbfc53e5e3c8bb5615","target":"graph","created_at":"2026-06-25T00:18:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.25117/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Daniele Dragoni, Francesco Ferrari, Matteo Vandelli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-23T19:44:00Z","title":"Feasibility-driven QAOA with penalty scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.25117","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0b4ae03c416306a24dabdbe2ea14e9b9b863728881fb2e12535891b6da98124b","target":"record","created_at":"2026-06-25T00:18:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a11d2b41f2328a14bd4e9215c97988b988390c5a5b91e00520c3108223f723ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-23T19:44:00Z","title_canon_sha256":"d2339ac826cc7427bc2981d2ddb0e96ec6430c695f7129cab9ac1f93073a5939"},"schema_version":"1.0","source":{"id":"2606.25117","kind":"arxiv","version":1}},"canonical_sha256":"721e90011c6807907c9e325af30c7af04a819b92d6d1459ab9369a217a09a904","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"721e90011c6807907c9e325af30c7af04a819b92d6d1459ab9369a217a09a904","first_computed_at":"2026-06-25T00:18:18.531338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T00:18:18.531338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OrI9VvGTPp7k48tLxmjZK72qZs74CadgPVB9FhZfwdtsWtd66tRFTVBXMG6PLmBuYZlaaSSZ1NH/lFWqs3oTCA==","signature_status":"signed_v1","signed_at":"2026-06-25T00:18:18.531724Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.25117","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b4ae03c416306a24dabdbe2ea14e9b9b863728881fb2e12535891b6da98124b","sha256:b8183b5ef71bf33d01814ee74d21dc100d25436a98d764dbfc53e5e3c8bb5615"],"state_sha256":"d6eab759da77a288ceee90d8ae19d671c9e432c86c60d66cc74036d0edcb4ece"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Db2bWKZ9Wz1/JmmWz/arLNUj8SKeWsO8hvuyG7RQhgmnvARTDIJE6SRwFB27bbZQlGrKMSZMsn9cLz9kOsuvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T19:21:35.058345Z","bundle_sha256":"7769ca188fab816f34a981901c9db784e1d6ec9c3423bdaa60e6193532a920af"}}