{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:C3LDULVJHCTNMNL5DENPVW3C6C","short_pith_number":"pith:C3LDULVJ","canonical_record":{"source":{"id":"2503.10077","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-03-13T05:57:40Z","cross_cats_sorted":[],"title_canon_sha256":"fbf5fdc0ff87f5d4cceab49e4bd6778d4571163cda3ea71420eb7e9663b1bb14","abstract_canon_sha256":"ca98024872370efc4e924fc23bb61178ba9d88f45ff6f9f1ff3fb4ebd34adceb"},"schema_version":"1.0"},"canonical_sha256":"16d63a2ea938a6d6357d191afadb62f099d6a99f4252dc46c208f999ea13e4b2","source":{"kind":"arxiv","id":"2503.10077","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.10077","created_at":"2026-07-05T10:31:56Z"},{"alias_kind":"arxiv_version","alias_value":"2503.10077v2","created_at":"2026-07-05T10:31:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.10077","created_at":"2026-07-05T10:31:56Z"},{"alias_kind":"pith_short_12","alias_value":"C3LDULVJHCTN","created_at":"2026-07-05T10:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"C3LDULVJHCTNMNL5","created_at":"2026-07-05T10:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"C3LDULVJ","created_at":"2026-07-05T10:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:C3LDULVJHCTNMNL5DENPVW3C6C","target":"record","payload":{"canonical_record":{"source":{"id":"2503.10077","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-03-13T05:57:40Z","cross_cats_sorted":[],"title_canon_sha256":"fbf5fdc0ff87f5d4cceab49e4bd6778d4571163cda3ea71420eb7e9663b1bb14","abstract_canon_sha256":"ca98024872370efc4e924fc23bb61178ba9d88f45ff6f9f1ff3fb4ebd34adceb"},"schema_version":"1.0"},"canonical_sha256":"16d63a2ea938a6d6357d191afadb62f099d6a99f4252dc46c208f999ea13e4b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:31:56.855273Z","signature_b64":"ZL/Eygdww+lyTYREVxK1Sx6WQNhMITO4yFzWK/RoEYWm2PSiMTFsm2EFxbu+ZxsjhtKgWmSbWl6Txf2Kzhc2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16d63a2ea938a6d6357d191afadb62f099d6a99f4252dc46c208f999ea13e4b2","last_reissued_at":"2026-07-05T10:31:56.854758Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:31:56.854758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.10077","source_version":2,"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-07-05T10:31:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g3ndVb0L84k23waHTbCH4KkT6Ru8wmrXAWLHGh7KJRJWnFC5fRGTxATt8c9whOCpHjCLYFDy9wcq3j72jwmcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:32:08.706059Z"},"content_sha256":"5759ee2de4af652c749a939d58729041159507a7dd8ddeb33f1b87b557f01edb","schema_version":"1.0","event_id":"sha256:5759ee2de4af652c749a939d58729041159507a7dd8ddeb33f1b87b557f01edb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:C3LDULVJHCTNMNL5DENPVW3C6C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Art of Avoiding Constraints: A Penalty-free Approach to Constrained Combinatorial Optimization with QAOA","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Danylo Lykov, Hausi M\\\"uller, Prashanti Priya Angara, Ulrike Stege, Yuri Alexeev","submitted_at":"2025-03-13T05:57:40Z","abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) is designed to determine optimum and near optimum solutions of quadratic (and higher order) unconstrained binary optimization (QUBO or HUBO) problems, which in turn accurately model unconstrained combinatorial optimization problems. While the solution space of an unconstrained combinatorial optimization problem consists of all possible combinations of the objective function's decision variables, for a constrained combinatorial optimization problem, the solution space consists only of solutions that satisfy the problem constraints. While sol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.10077","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/2503.10077/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-07-05T10:31:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K5dLNTwbONKqhrqxDpiGQE5fYY6JF0UXPWfohiWNaMHwmKqP+FIEmEsOCP0C+CxvHPbL5lVYxz5GrLBybujrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:32:08.706710Z"},"content_sha256":"997de98a13abade1861a15a916dc2346f57d0ba3a72fd429e9da4ee04398b2d5","schema_version":"1.0","event_id":"sha256:997de98a13abade1861a15a916dc2346f57d0ba3a72fd429e9da4ee04398b2d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C3LDULVJHCTNMNL5DENPVW3C6C/bundle.json","state_url":"https://pith.science/pith/C3LDULVJHCTNMNL5DENPVW3C6C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C3LDULVJHCTNMNL5DENPVW3C6C/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-07-07T07:32:08Z","links":{"resolver":"https://pith.science/pith/C3LDULVJHCTNMNL5DENPVW3C6C","bundle":"https://pith.science/pith/C3LDULVJHCTNMNL5DENPVW3C6C/bundle.json","state":"https://pith.science/pith/C3LDULVJHCTNMNL5DENPVW3C6C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C3LDULVJHCTNMNL5DENPVW3C6C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:C3LDULVJHCTNMNL5DENPVW3C6C","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":"ca98024872370efc4e924fc23bb61178ba9d88f45ff6f9f1ff3fb4ebd34adceb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-03-13T05:57:40Z","title_canon_sha256":"fbf5fdc0ff87f5d4cceab49e4bd6778d4571163cda3ea71420eb7e9663b1bb14"},"schema_version":"1.0","source":{"id":"2503.10077","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.10077","created_at":"2026-07-05T10:31:56Z"},{"alias_kind":"arxiv_version","alias_value":"2503.10077v2","created_at":"2026-07-05T10:31:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.10077","created_at":"2026-07-05T10:31:56Z"},{"alias_kind":"pith_short_12","alias_value":"C3LDULVJHCTN","created_at":"2026-07-05T10:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"C3LDULVJHCTNMNL5","created_at":"2026-07-05T10:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"C3LDULVJ","created_at":"2026-07-05T10:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:997de98a13abade1861a15a916dc2346f57d0ba3a72fd429e9da4ee04398b2d5","target":"graph","created_at":"2026-07-05T10:31:56Z","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/2503.10077/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) is designed to determine optimum and near optimum solutions of quadratic (and higher order) unconstrained binary optimization (QUBO or HUBO) problems, which in turn accurately model unconstrained combinatorial optimization problems. While the solution space of an unconstrained combinatorial optimization problem consists of all possible combinations of the objective function's decision variables, for a constrained combinatorial optimization problem, the solution space consists only of solutions that satisfy the problem constraints. While sol","authors_text":"Danylo Lykov, Hausi M\\\"uller, Prashanti Priya Angara, Ulrike Stege, Yuri Alexeev","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-03-13T05:57:40Z","title":"The Art of Avoiding Constraints: A Penalty-free Approach to Constrained Combinatorial Optimization with QAOA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.10077","kind":"arxiv","version":2},"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:5759ee2de4af652c749a939d58729041159507a7dd8ddeb33f1b87b557f01edb","target":"record","created_at":"2026-07-05T10:31:56Z","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":"ca98024872370efc4e924fc23bb61178ba9d88f45ff6f9f1ff3fb4ebd34adceb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-03-13T05:57:40Z","title_canon_sha256":"fbf5fdc0ff87f5d4cceab49e4bd6778d4571163cda3ea71420eb7e9663b1bb14"},"schema_version":"1.0","source":{"id":"2503.10077","kind":"arxiv","version":2}},"canonical_sha256":"16d63a2ea938a6d6357d191afadb62f099d6a99f4252dc46c208f999ea13e4b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16d63a2ea938a6d6357d191afadb62f099d6a99f4252dc46c208f999ea13e4b2","first_computed_at":"2026-07-05T10:31:56.854758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:31:56.854758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZL/Eygdww+lyTYREVxK1Sx6WQNhMITO4yFzWK/RoEYWm2PSiMTFsm2EFxbu+ZxsjhtKgWmSbWl6Txf2Kzhc2Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:31:56.855273Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.10077","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5759ee2de4af652c749a939d58729041159507a7dd8ddeb33f1b87b557f01edb","sha256:997de98a13abade1861a15a916dc2346f57d0ba3a72fd429e9da4ee04398b2d5"],"state_sha256":"d1bee822fa136018d3e04ba9b4e45c2b76b7acc935db463dba9573e6d30924a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dRRKgL3Oa2BQ+l4mWXAzrR6O+V8Ax/fmOPp00aPfGHjJyKngjdf6wseFNgFMUa7ho0JUb2H7BfDfL2cO5RldCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T07:32:08.709932Z","bundle_sha256":"71358474060b112c7ba2ce87470acdcbd5e839cad4f430cb3ad4b78c401c6e6a"}}