{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:U6ZYSWVYA3QCCOXV75WMZ7GYER","short_pith_number":"pith:U6ZYSWVY","canonical_record":{"source":{"id":"2607.27509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-29T22:54:13Z","cross_cats_sorted":[],"title_canon_sha256":"e4a435115eb1b22eb604d299c6337bbe47c5981d7fc78407d2db8c0d11ccf108","abstract_canon_sha256":"a406cc017e99ab6a13d331e6db44390289d8222f677aa36c62d68a3bb4bd7a35"},"schema_version":"1.0"},"canonical_sha256":"a7b3895ab806e0213af5ff6cccfcd82460c83691d86780eb3fa744f799429f9e","source":{"kind":"arxiv","id":"2607.27509","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27509","created_at":"2026-07-31T01:24:40Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27509v1","created_at":"2026-07-31T01:24:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27509","created_at":"2026-07-31T01:24:40Z"},{"alias_kind":"pith_short_12","alias_value":"U6ZYSWVYA3QC","created_at":"2026-07-31T01:24:40Z"},{"alias_kind":"pith_short_16","alias_value":"U6ZYSWVYA3QCCOXV","created_at":"2026-07-31T01:24:40Z"},{"alias_kind":"pith_short_8","alias_value":"U6ZYSWVY","created_at":"2026-07-31T01:24:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:U6ZYSWVYA3QCCOXV75WMZ7GYER","target":"record","payload":{"canonical_record":{"source":{"id":"2607.27509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-29T22:54:13Z","cross_cats_sorted":[],"title_canon_sha256":"e4a435115eb1b22eb604d299c6337bbe47c5981d7fc78407d2db8c0d11ccf108","abstract_canon_sha256":"a406cc017e99ab6a13d331e6db44390289d8222f677aa36c62d68a3bb4bd7a35"},"schema_version":"1.0"},"canonical_sha256":"a7b3895ab806e0213af5ff6cccfcd82460c83691d86780eb3fa744f799429f9e","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7b3895ab806e0213af5ff6cccfcd82460c83691d86780eb3fa744f799429f9e","last_reissued_at":"2026-07-31T01:24:40.595566Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:24:40.595566Z"},"source_kind":"arxiv","source_id":"2607.27509","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-31T01:24:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GrZJBi+tSsc4ak7STVL6/f4EXBKDCIMK/s4aEtLae5hk+1ozMh1XLqpgBpH1rFge378mM9PZFA93xkUEqn7KBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T12:11:20.741595Z"},"content_sha256":"843cf0921d744f983496f6a876ff422ae11421aeeaaa769ed23ff20dafa56be2","schema_version":"1.0","event_id":"sha256:843cf0921d744f983496f6a876ff422ae11421aeeaaa769ed23ff20dafa56be2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:U6ZYSWVYA3QCCOXV75WMZ7GYER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Interference as a Proposal Mechanism for Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Donald J. Jacobs","submitted_at":"2026-07-29T22:54:13Z","abstract_excerpt":"Quantum Interference Proposal Search (QIPS) uses seed-conditioned quantum circuits to generate localized interference patterns as finite-shot proposal distributions for QUBO/Ising optimization. Candidate $n_b$-bit strings are sampled from these distributions, scored classically and used to update an elite frontier of low-energy solutions. QIPS uses a fixed two-layer gate-based circuit architecture with 100 shots per circuit while the Hilbert-space dimension grows as $2^{n_b}$. Across six benchmark families with $18 \\le n_b \\le 29$, QIPS maintains competitive progress relative to a matched clas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27509","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/2607.27509/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-31T01:24:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pd8/QegwLnYSN5M93HqLKd7nHM9MMGvrtm1qQe1aqxN4WCkGbc5FF6aI0YPufN9UvJcbLkkC9q32Oz0AaRWSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T12:11:20.742175Z"},"content_sha256":"ce343121b3c4410f4302d7853a49059b67c1ffd561fbc6553b5eb1c8454d181a","schema_version":"1.0","event_id":"sha256:ce343121b3c4410f4302d7853a49059b67c1ffd561fbc6553b5eb1c8454d181a"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:U6ZYSWVYA3QCCOXV75WMZ7GYER","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/TQE.2024.3443660) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Wurtz, J., Sack, S.H., Wang, S.-T.: Solving Nonnative Combinatorial Optimiza- tion Problems Using Hybrid Quantum–Classical Algorithms. IEEE Transactions on Quantum Engineering5, 1–14 (2024) https://doi.org/10.1109/TQE.2024. 3443660","arxiv_id":"2607.27509","detector":"doi_compliance","evidence":{"ref_index":22,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1109/tqe.2024","reconstructed_doi":"10.1109/TQE.2024.3443660"},"severity":"advisory","ref_index":22,"audited_at":"2026-08-01T06:48:05.088582Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/TQE.2024.3443660","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"9378a92d087f3d2984e4d575ace9aec787346f9aef152de21a339eb2e2372f64","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15317,"payload_sha256":"53594cc826dcffd641cba19bf51b68c2e7a3389752735dfb32053fad839950fe","signature_b64":"SnWDglrhkLNb2KkkIaaT1c1i0zhlmZjwbu3FCRKv3fBpLP+kDltfIl/c1zjZuicT5a4AmN8J3ThhABJI5QFfDg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T06:48:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+23/VTTpmXvzdZs3lqKAnMmHk/Q4y9X1gudPzT/oOYl6SKVjbdYCkqi0rG8ebtBASbnV3gowJOgGSGznzqNxAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T12:11:20.749590Z"},"content_sha256":"40cf10b9c5101662c508773e720718b50b7707c5f2da2834b5cf92d5d780f9bb","schema_version":"1.0","event_id":"sha256:40cf10b9c5101662c508773e720718b50b7707c5f2da2834b5cf92d5d780f9bb"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:U6ZYSWVYA3QCCOXV75WMZ7GYER","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1103/PhysRevResearch.4.033029 resolves to 'Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer'. A reader following the printed text alone cannot reach it.","snippet":"Zhu, L., Tang, H.L., Barron, G.S., Calderon-Vargas, F.A., Mayhall, N.J., Barnes, E., Economou, S.E.: Adaptive quantum approximate optimization algo- rithm for solving combinatorial problems on a quantum computer. Physical Review Research4(3","arxiv_id":"2607.27509","detector":"doi_compliance","evidence":{"ref_index":17,"verdict_class":"incontrovertible","resolved_title":"Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer","printed_excerpt":"10.1103/physrevresearch","reconstructed_doi":"10.1103/PhysRevResearch.4.033029"},"severity":"advisory","ref_index":17,"audited_at":"2026-08-01T06:48:05.088582Z","event_type":"pith.integrity.v1","detected_doi":"10.1103/PhysRevResearch.4.033029","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"842b9c9e292fe1139fff7152c6de93af3d4ab0943ae7935668d461fdc4858500","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15316,"payload_sha256":"90ab73875099157a3a94c2bed2000c432a9ad70716fdf61acb0aeb66fcee4b92","signature_b64":"ZnIa2jh/HYaRulD+USKkyROyFErNtKTvtVlL3MEV2F3uCYv2J0lKM0bPeDTzaINciGTOJGMEzHZOTk5tkW0dCQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T06:48:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ELoc7JAYtyenABwzcGa5d530Tx3LydJkq6XACaKHsFaG+Zp4/bjuIgz0zztMkE81/YbsVqcyXiwrFgaGUfNBBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T12:11:20.750128Z"},"content_sha256":"0206941a3b61fa8cd00a94f83749a95bd3e1a5a726aba0014b5f0caef29f15f7","schema_version":"1.0","event_id":"sha256:0206941a3b61fa8cd00a94f83749a95bd3e1a5a726aba0014b5f0caef29f15f7"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:U6ZYSWVYA3QCCOXV75WMZ7GYER","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/TQE.2025.3602404) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Shirai, T., Togawa, N.: Compressed Space Quantum Approximate Optimiza- tion Algorithm for Constrained Combinatorial Optimization. IEEE Transactions on Quantum Engineering6, 1–14 (2025) https://doi.org/10.1109/TQE.2025. 3602404","arxiv_id":"2607.27509","detector":"doi_compliance","evidence":{"ref_index":15,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1109/tqe.2025","reconstructed_doi":"10.1109/TQE.2025.3602404"},"severity":"advisory","ref_index":15,"audited_at":"2026-08-01T06:48:05.088582Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/TQE.2025.3602404","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"5f9663c05682826049304c2edd6724551f23b85ec818c52f58e7329c76c84878","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15315,"payload_sha256":"540df556e13d952319430a8982e5174606526e98f3f4fb3de3a9112dc39a6bee","signature_b64":"Yow45EcG7PkOGl42JL2O2vWWcoIWxcVqJgPjVoCd9NA4SeLtkGD28UcpKVwFHuN69SMSy9GLPHr8TChshlzhCQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T06:48:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"paCYVWVIr1SXqETtf7z8qdVMkHOsGyBaqXF0oRyHVpMaIsMlZ10NDO5aZ3vQukL7G10325Vd2wAn+oHLhkcLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T12:11:20.750645Z"},"content_sha256":"84c122a948ed934957c773f0d2e8411fd299da14480de546a83212437587a1cc","schema_version":"1.0","event_id":"sha256:84c122a948ed934957c773f0d2e8411fd299da14480de546a83212437587a1cc"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:U6ZYSWVYA3QCCOXV75WMZ7GYER","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.physrep.2024.03.002 resolves to 'A review on Quantum Approximate Optimization Algorithm and its variants'. A reader following the printed text alone cannot reach it.","snippet":"Blekos, K., Brand, D., Ceschini, A., Chou, C.-H., Li, R.-H., Pandya, K., Summer, A.: A review on Quantum Approximate Optimization Algorithm and its variants. Physics Reports1068, 1–66 (2024) https://doi.org/10.1016/j.physrep.2024.03. 002","arxiv_id":"2607.27509","detector":"doi_compliance","evidence":{"ref_index":12,"verdict_class":"incontrovertible","resolved_title":"A review on Quantum Approximate Optimization Algorithm and its variants","printed_excerpt":"10.1016/j.physrep.2024.03","reconstructed_doi":"10.1016/j.physrep.2024.03.002"},"severity":"advisory","ref_index":12,"audited_at":"2026-08-01T06:48:05.088582Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.physrep.2024.03.002","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"c0dc13e137e7749945fc109874609ca6900cc6c4868a68540039495847210d02","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"A review on Quantum Approximate Optimization Algorithm and its variants","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15314,"payload_sha256":"a5286da004f7d9b5a7ee77572f7a0bf3dfca3861c111b3bd1036f61612208b14","signature_b64":"uF+xQj7V1MK0UT/llbpQ8sNsqtcYAEdsO5XeQ/G2F7MI5JbVQ4zta03JOSMVHX4MuWobQyLgp4VEDaEK0C50DA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T06:48:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JfQGU3Ry6GQ5czq8UahC4dyP75czrktd46Aw3vYhp42ZyTdf25murAOzPzcLNZDGOWqmozggS8TfJmD70ZhiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T12:11:20.751184Z"},"content_sha256":"164cd8d7d6ae4dcffb413ba24e7f0dbd37fcfe74e4f632f366127b3bc9181851","schema_version":"1.0","event_id":"sha256:164cd8d7d6ae4dcffb413ba24e7f0dbd37fcfe74e4f632f366127b3bc9181851"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U6ZYSWVYA3QCCOXV75WMZ7GYER/bundle.json","state_url":"https://pith.science/pith/U6ZYSWVYA3QCCOXV75WMZ7GYER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U6ZYSWVYA3QCCOXV75WMZ7GYER/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-14T12:11:20Z","links":{"resolver":"https://pith.science/pith/U6ZYSWVYA3QCCOXV75WMZ7GYER","bundle":"https://pith.science/pith/U6ZYSWVYA3QCCOXV75WMZ7GYER/bundle.json","state":"https://pith.science/pith/U6ZYSWVYA3QCCOXV75WMZ7GYER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U6ZYSWVYA3QCCOXV75WMZ7GYER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:U6ZYSWVYA3QCCOXV75WMZ7GYER","merge_version":"pith-open-graph-merge-v1","event_count":6,"valid_event_count":6,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a406cc017e99ab6a13d331e6db44390289d8222f677aa36c62d68a3bb4bd7a35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-29T22:54:13Z","title_canon_sha256":"e4a435115eb1b22eb604d299c6337bbe47c5981d7fc78407d2db8c0d11ccf108"},"schema_version":"1.0","source":{"id":"2607.27509","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27509","created_at":"2026-07-31T01:24:40Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27509v1","created_at":"2026-07-31T01:24:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27509","created_at":"2026-07-31T01:24:40Z"},{"alias_kind":"pith_short_12","alias_value":"U6ZYSWVYA3QC","created_at":"2026-07-31T01:24:40Z"},{"alias_kind":"pith_short_16","alias_value":"U6ZYSWVYA3QCCOXV","created_at":"2026-07-31T01:24:40Z"},{"alias_kind":"pith_short_8","alias_value":"U6ZYSWVY","created_at":"2026-07-31T01:24:40Z"}],"graph_snapshots":[{"event_id":"sha256:ce343121b3c4410f4302d7853a49059b67c1ffd561fbc6553b5eb1c8454d181a","target":"graph","created_at":"2026-07-31T01:24:40Z","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/2607.27509/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum Interference Proposal Search (QIPS) uses seed-conditioned quantum circuits to generate localized interference patterns as finite-shot proposal distributions for QUBO/Ising optimization. Candidate $n_b$-bit strings are sampled from these distributions, scored classically and used to update an elite frontier of low-energy solutions. QIPS uses a fixed two-layer gate-based circuit architecture with 100 shots per circuit while the Hilbert-space dimension grows as $2^{n_b}$. Across six benchmark families with $18 \\le n_b \\le 29$, QIPS maintains competitive progress relative to a matched clas","authors_text":"Donald J. Jacobs","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-29T22:54:13Z","title":"Quantum Interference as a Proposal Mechanism for Combinatorial Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27509","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:843cf0921d744f983496f6a876ff422ae11421aeeaaa769ed23ff20dafa56be2","target":"record","created_at":"2026-07-31T01:24:40Z","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":"a406cc017e99ab6a13d331e6db44390289d8222f677aa36c62d68a3bb4bd7a35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-29T22:54:13Z","title_canon_sha256":"e4a435115eb1b22eb604d299c6337bbe47c5981d7fc78407d2db8c0d11ccf108"},"schema_version":"1.0","source":{"id":"2607.27509","kind":"arxiv","version":1}},"canonical_sha256":"a7b3895ab806e0213af5ff6cccfcd82460c83691d86780eb3fa744f799429f9e","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7b3895ab806e0213af5ff6cccfcd82460c83691d86780eb3fa744f799429f9e","first_computed_at":"2026-07-31T01:24:40.595566Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:24:40.595566Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.27509","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:0206941a3b61fa8cd00a94f83749a95bd3e1a5a726aba0014b5f0caef29f15f7","sha256:164cd8d7d6ae4dcffb413ba24e7f0dbd37fcfe74e4f632f366127b3bc9181851","sha256:40cf10b9c5101662c508773e720718b50b7707c5f2da2834b5cf92d5d780f9bb","sha256:84c122a948ed934957c773f0d2e8411fd299da14480de546a83212437587a1cc"]}],"invalid_events":[],"applied_event_ids":["sha256:843cf0921d744f983496f6a876ff422ae11421aeeaaa769ed23ff20dafa56be2","sha256:ce343121b3c4410f4302d7853a49059b67c1ffd561fbc6553b5eb1c8454d181a"],"state_sha256":"7b6b9122cec0ff12a04f905d1ed8292e470d57596abadb2ff13f060fdc4ec3df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CrA8S8KzD3BOjyjBzMETpRhuZ844vFCs7Yo3KGLUuUZmxg5U3SyD+Z1g1kz414J3YAuRuzpgOooSOG7Vq16dCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T12:11:20.756836Z","bundle_sha256":"aa907a236044d551a73c9b25bf26ea57c06df52e72efc0847750ea664e9b0950"}}