{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:XACZLMHIASCR5Y7EOLSBTRAJMC","short_pith_number":"pith:XACZLMHI","canonical_record":{"source":{"id":"2502.02245","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-02-04T11:44:34Z","cross_cats_sorted":[],"title_canon_sha256":"ca92e702c0e645b4398a54999fa74794e4362073cb05f46dbf0b23bacb2097fe","abstract_canon_sha256":"32a304b63a1b9cb94d9f570eb4a292fb805d50c0eacb5736dc51a39601645474"},"schema_version":"1.0"},"canonical_sha256":"b80595b0e804851ee3e472e419c40960a7c070a9ec974aa7b9afc9136857bf57","source":{"kind":"arxiv","id":"2502.02245","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.02245","created_at":"2026-07-05T10:09:25Z"},{"alias_kind":"arxiv_version","alias_value":"2502.02245v1","created_at":"2026-07-05T10:09:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02245","created_at":"2026-07-05T10:09:25Z"},{"alias_kind":"pith_short_12","alias_value":"XACZLMHIASCR","created_at":"2026-07-05T10:09:25Z"},{"alias_kind":"pith_short_16","alias_value":"XACZLMHIASCR5Y7E","created_at":"2026-07-05T10:09:25Z"},{"alias_kind":"pith_short_8","alias_value":"XACZLMHI","created_at":"2026-07-05T10:09:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:XACZLMHIASCR5Y7EOLSBTRAJMC","target":"record","payload":{"canonical_record":{"source":{"id":"2502.02245","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-02-04T11:44:34Z","cross_cats_sorted":[],"title_canon_sha256":"ca92e702c0e645b4398a54999fa74794e4362073cb05f46dbf0b23bacb2097fe","abstract_canon_sha256":"32a304b63a1b9cb94d9f570eb4a292fb805d50c0eacb5736dc51a39601645474"},"schema_version":"1.0"},"canonical_sha256":"b80595b0e804851ee3e472e419c40960a7c070a9ec974aa7b9afc9136857bf57","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:09:25.942162Z","signature_b64":"tlx5bYPt6zmGMEa+S0vitco9ZbDeh4LEQo28SqRYEXhOwbAU1ORe8ZVF4eGR57ZxOijBpRSzR2/uGu8zMVUKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b80595b0e804851ee3e472e419c40960a7c070a9ec974aa7b9afc9136857bf57","last_reissued_at":"2026-07-05T10:09:25.941776Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:09:25.941776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.02245","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:09:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"USrZpEXNzW2CySqf8T8kFkbkRKYBlDPYdYpJTu4UPzmXMGL+CkKpixPHUk+ziRZJhKB14xh8jTL4r3I0zsHLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T12:16:06.073642Z"},"content_sha256":"cbad3d167d4c4ade8f6c6d63bb10c7e327d872dd99ea34871a94d64e45747138","schema_version":"1.0","event_id":"sha256:cbad3d167d4c4ade8f6c6d63bb10c7e327d872dd99ea34871a94d64e45747138"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:XACZLMHIASCR5Y7EOLSBTRAJMC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Qubit-efficient quantum local search for combinatorial optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"M. Podobrii, M. R. Perelshtein, M. Veshchezerova, V. Kuzmin, V. Voloshinov","submitted_at":"2025-02-04T11:44:34Z","abstract_excerpt":"An essential component of many sophisticated metaheuristics for solving combinatorial optimization problems is some variation of a local search routine that iteratively searches for a better solution within a chosen set of immediate neighbors. The size $l$ of this set is limited due to the computational costs required to run the method on classical processing units. We present a qubit-efficient variational quantum algorithm that implements a quantum version of local search with only $\\lceil \\log_2 l \\rceil$ qubits and, therefore, can potentially work with classically intractable neighborhood s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02245","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/2502.02245/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:09:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ck18VLtJVWr561CfmgrhgaffdfbElKt0zZpucvZoGCQLxakD6sOVidfI7QYIYD8V33inF13uXQgInqKTNHK/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T12:16:06.073937Z"},"content_sha256":"f53fa8ed2f0313f1910b25a279ab53eda052274670d6d80e9762e0e4ca005fcd","schema_version":"1.0","event_id":"sha256:f53fa8ed2f0313f1910b25a279ab53eda052274670d6d80e9762e0e4ca005fcd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XACZLMHIASCR5Y7EOLSBTRAJMC/bundle.json","state_url":"https://pith.science/pith/XACZLMHIASCR5Y7EOLSBTRAJMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XACZLMHIASCR5Y7EOLSBTRAJMC/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-05T12:16:06Z","links":{"resolver":"https://pith.science/pith/XACZLMHIASCR5Y7EOLSBTRAJMC","bundle":"https://pith.science/pith/XACZLMHIASCR5Y7EOLSBTRAJMC/bundle.json","state":"https://pith.science/pith/XACZLMHIASCR5Y7EOLSBTRAJMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XACZLMHIASCR5Y7EOLSBTRAJMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XACZLMHIASCR5Y7EOLSBTRAJMC","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":"32a304b63a1b9cb94d9f570eb4a292fb805d50c0eacb5736dc51a39601645474","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-02-04T11:44:34Z","title_canon_sha256":"ca92e702c0e645b4398a54999fa74794e4362073cb05f46dbf0b23bacb2097fe"},"schema_version":"1.0","source":{"id":"2502.02245","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.02245","created_at":"2026-07-05T10:09:25Z"},{"alias_kind":"arxiv_version","alias_value":"2502.02245v1","created_at":"2026-07-05T10:09:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02245","created_at":"2026-07-05T10:09:25Z"},{"alias_kind":"pith_short_12","alias_value":"XACZLMHIASCR","created_at":"2026-07-05T10:09:25Z"},{"alias_kind":"pith_short_16","alias_value":"XACZLMHIASCR5Y7E","created_at":"2026-07-05T10:09:25Z"},{"alias_kind":"pith_short_8","alias_value":"XACZLMHI","created_at":"2026-07-05T10:09:25Z"}],"graph_snapshots":[{"event_id":"sha256:f53fa8ed2f0313f1910b25a279ab53eda052274670d6d80e9762e0e4ca005fcd","target":"graph","created_at":"2026-07-05T10:09:25Z","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/2502.02245/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An essential component of many sophisticated metaheuristics for solving combinatorial optimization problems is some variation of a local search routine that iteratively searches for a better solution within a chosen set of immediate neighbors. The size $l$ of this set is limited due to the computational costs required to run the method on classical processing units. We present a qubit-efficient variational quantum algorithm that implements a quantum version of local search with only $\\lceil \\log_2 l \\rceil$ qubits and, therefore, can potentially work with classically intractable neighborhood s","authors_text":"M. Podobrii, M. R. Perelshtein, M. Veshchezerova, V. Kuzmin, V. Voloshinov","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02245","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:cbad3d167d4c4ade8f6c6d63bb10c7e327d872dd99ea34871a94d64e45747138","target":"record","created_at":"2026-07-05T10:09:25Z","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":"32a304b63a1b9cb94d9f570eb4a292fb805d50c0eacb5736dc51a39601645474","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-02-04T11:44:34Z","title_canon_sha256":"ca92e702c0e645b4398a54999fa74794e4362073cb05f46dbf0b23bacb2097fe"},"schema_version":"1.0","source":{"id":"2502.02245","kind":"arxiv","version":1}},"canonical_sha256":"b80595b0e804851ee3e472e419c40960a7c070a9ec974aa7b9afc9136857bf57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b80595b0e804851ee3e472e419c40960a7c070a9ec974aa7b9afc9136857bf57","first_computed_at":"2026-07-05T10:09:25.941776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:09:25.941776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tlx5bYPt6zmGMEa+S0vitco9ZbDeh4LEQo28SqRYEXhOwbAU1ORe8ZVF4eGR57ZxOijBpRSzR2/uGu8zMVUKDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:09:25.942162Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.02245","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbad3d167d4c4ade8f6c6d63bb10c7e327d872dd99ea34871a94d64e45747138","sha256:f53fa8ed2f0313f1910b25a279ab53eda052274670d6d80e9762e0e4ca005fcd"],"state_sha256":"6787106fbdc631cb7a8c7ef46f95fe3cb29573e9540837263a9e89a9bf563cbc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c6NiP2p/Fs7WhSvpsiuh3jn56QZDMUWXBMo8N6X0CPQclOodvI6us9oFR0uDFFBkCG/xJaeYt9PQC5KOPYI7BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T12:16:06.077656Z","bundle_sha256":"50d55c4324ba0a7bd4ed03890a2926341419842809f27058fa63a925d8c56c28"}}