{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:XPIGC3ZILZGC3Q4KH27HW22WIS","short_pith_number":"pith:XPIGC3ZI","canonical_record":{"source":{"id":"2504.15367","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-21T18:19:19Z","cross_cats_sorted":[],"title_canon_sha256":"9ad12239baaeff891120a4c14f1d27ca1e7c0d9afb48e001cd59780c678a088b","abstract_canon_sha256":"02aa0370ca4052dcbeebe1f53e53c9dd5a543dd453c09f783a416f60646fa973"},"schema_version":"1.0"},"canonical_sha256":"bbd0616f285e4c2dc38a3ebe7b6b5644866ff34cd0b651c70339121a2f8c0eaf","source":{"kind":"arxiv","id":"2504.15367","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.15367","created_at":"2026-07-05T10:52:01Z"},{"alias_kind":"arxiv_version","alias_value":"2504.15367v1","created_at":"2026-07-05T10:52:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15367","created_at":"2026-07-05T10:52:01Z"},{"alias_kind":"pith_short_12","alias_value":"XPIGC3ZILZGC","created_at":"2026-07-05T10:52:01Z"},{"alias_kind":"pith_short_16","alias_value":"XPIGC3ZILZGC3Q4K","created_at":"2026-07-05T10:52:01Z"},{"alias_kind":"pith_short_8","alias_value":"XPIGC3ZI","created_at":"2026-07-05T10:52:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:XPIGC3ZILZGC3Q4KH27HW22WIS","target":"record","payload":{"canonical_record":{"source":{"id":"2504.15367","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-21T18:19:19Z","cross_cats_sorted":[],"title_canon_sha256":"9ad12239baaeff891120a4c14f1d27ca1e7c0d9afb48e001cd59780c678a088b","abstract_canon_sha256":"02aa0370ca4052dcbeebe1f53e53c9dd5a543dd453c09f783a416f60646fa973"},"schema_version":"1.0"},"canonical_sha256":"bbd0616f285e4c2dc38a3ebe7b6b5644866ff34cd0b651c70339121a2f8c0eaf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:01.576962Z","signature_b64":"ZC1Wsau0KgueDUQGDvpVfErDLY5Gfsoibl4n7NoJZnW8f6yP9CbMSiDjfxF/FsK0AUVVnwAZKqLKzydRMSqcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbd0616f285e4c2dc38a3ebe7b6b5644866ff34cd0b651c70339121a2f8c0eaf","last_reissued_at":"2026-07-05T10:52:01.576478Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:01.576478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.15367","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-07-05T10:52:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"231bJVrhCHJ839LZrpBx43BaK9yqQ+djuN8HdG4vV7Vez1CjoJuPx/FYIrBXgqfkmTglXirTkrwClT1Welc3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T18:35:10.248306Z"},"content_sha256":"1bcabe01afce93775cf0f768f7ea7a07940e00f31901c8180b20d231aa9941a5","schema_version":"1.0","event_id":"sha256:1bcabe01afce93775cf0f768f7ea7a07940e00f31901c8180b20d231aa9941a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:XPIGC3ZILZGC3Q4KH27HW22WIS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Branch-and-bound digitized counterdiabatic quantum optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alejandro Gomez Cadavid, Anton Simen, Enrique Solano, Narendra N. Hegade, Sebasti\\'an V. Romero","submitted_at":"2025-04-21T18:19:19Z","abstract_excerpt":"Branch-and-bound algorithms effectively solve combinatorial optimization problems, relying on the relaxation of the objective function to obtain tight lower bounds. While this is straightforward for convex objective functions, higher-order formulations pose challenges due to their inherent non-convexity. In this work, we propose branch-and-bound digitized counterdiabatic quantum optimization (BB-DCQO), a quantum algorithm that addresses the relaxation difficulties in higher-order unconstrained binary optimization (HUBO) problems. By employing bias fields as approximate solutions to the relaxed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15367","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.15367/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:52:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fUB7itsFLZUC9UPoeymY9qVkK0RNuNdyNEk+HjoVHFeffcOoihFsyDPB2ArTeEU10fAnbnwXfm5giCLKjO6/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T18:35:10.249228Z"},"content_sha256":"a12676b253c770ef939838321191872ff3be75482d40ac6d0b935940a88a0ced","schema_version":"1.0","event_id":"sha256:a12676b253c770ef939838321191872ff3be75482d40ac6d0b935940a88a0ced"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XPIGC3ZILZGC3Q4KH27HW22WIS/bundle.json","state_url":"https://pith.science/pith/XPIGC3ZILZGC3Q4KH27HW22WIS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XPIGC3ZILZGC3Q4KH27HW22WIS/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-08-07T18:35:10Z","links":{"resolver":"https://pith.science/pith/XPIGC3ZILZGC3Q4KH27HW22WIS","bundle":"https://pith.science/pith/XPIGC3ZILZGC3Q4KH27HW22WIS/bundle.json","state":"https://pith.science/pith/XPIGC3ZILZGC3Q4KH27HW22WIS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XPIGC3ZILZGC3Q4KH27HW22WIS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XPIGC3ZILZGC3Q4KH27HW22WIS","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":"02aa0370ca4052dcbeebe1f53e53c9dd5a543dd453c09f783a416f60646fa973","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-21T18:19:19Z","title_canon_sha256":"9ad12239baaeff891120a4c14f1d27ca1e7c0d9afb48e001cd59780c678a088b"},"schema_version":"1.0","source":{"id":"2504.15367","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.15367","created_at":"2026-07-05T10:52:01Z"},{"alias_kind":"arxiv_version","alias_value":"2504.15367v1","created_at":"2026-07-05T10:52:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15367","created_at":"2026-07-05T10:52:01Z"},{"alias_kind":"pith_short_12","alias_value":"XPIGC3ZILZGC","created_at":"2026-07-05T10:52:01Z"},{"alias_kind":"pith_short_16","alias_value":"XPIGC3ZILZGC3Q4K","created_at":"2026-07-05T10:52:01Z"},{"alias_kind":"pith_short_8","alias_value":"XPIGC3ZI","created_at":"2026-07-05T10:52:01Z"}],"graph_snapshots":[{"event_id":"sha256:a12676b253c770ef939838321191872ff3be75482d40ac6d0b935940a88a0ced","target":"graph","created_at":"2026-07-05T10:52:01Z","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/2504.15367/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Branch-and-bound algorithms effectively solve combinatorial optimization problems, relying on the relaxation of the objective function to obtain tight lower bounds. While this is straightforward for convex objective functions, higher-order formulations pose challenges due to their inherent non-convexity. In this work, we propose branch-and-bound digitized counterdiabatic quantum optimization (BB-DCQO), a quantum algorithm that addresses the relaxation difficulties in higher-order unconstrained binary optimization (HUBO) problems. By employing bias fields as approximate solutions to the relaxed","authors_text":"Alejandro Gomez Cadavid, Anton Simen, Enrique Solano, Narendra N. Hegade, Sebasti\\'an V. Romero","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-21T18:19:19Z","title":"Branch-and-bound digitized counterdiabatic quantum optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15367","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:1bcabe01afce93775cf0f768f7ea7a07940e00f31901c8180b20d231aa9941a5","target":"record","created_at":"2026-07-05T10:52:01Z","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":"02aa0370ca4052dcbeebe1f53e53c9dd5a543dd453c09f783a416f60646fa973","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-21T18:19:19Z","title_canon_sha256":"9ad12239baaeff891120a4c14f1d27ca1e7c0d9afb48e001cd59780c678a088b"},"schema_version":"1.0","source":{"id":"2504.15367","kind":"arxiv","version":1}},"canonical_sha256":"bbd0616f285e4c2dc38a3ebe7b6b5644866ff34cd0b651c70339121a2f8c0eaf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbd0616f285e4c2dc38a3ebe7b6b5644866ff34cd0b651c70339121a2f8c0eaf","first_computed_at":"2026-07-05T10:52:01.576478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:52:01.576478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZC1Wsau0KgueDUQGDvpVfErDLY5Gfsoibl4n7NoJZnW8f6yP9CbMSiDjfxF/FsK0AUVVnwAZKqLKzydRMSqcBg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:52:01.576962Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.15367","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bcabe01afce93775cf0f768f7ea7a07940e00f31901c8180b20d231aa9941a5","sha256:a12676b253c770ef939838321191872ff3be75482d40ac6d0b935940a88a0ced"],"state_sha256":"89cd5db6fac39b3062a65f231ff93e59c5a0cf8b9794d0ac3a17710156fd6d4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u/RVM57aSuwCHANnmjGIM+Gag0bLkuk/AEXAFGhfTM3l+rYLMbTsrZ+8kOv6kaOAYfEUBJz1JgNvDscQTB7xAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T18:35:10.254259Z","bundle_sha256":"c616fa28f7195381d2c1b9256bf129bd510f67560217729d57b572175e914a90"}}