{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:4L2QHS5QJXVLFIQHM4M6QSOYUD","short_pith_number":"pith:4L2QHS5Q","canonical_record":{"source":{"id":"2107.03845","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2021-07-08T13:50:51Z","cross_cats_sorted":[],"title_canon_sha256":"87102eaacea2845922aaa6d6e4c8447a28f4dadb55af298646d7217c4e9d7247","abstract_canon_sha256":"41b2f02d08851d8717718f8efa9dc94de64b74ac84c1a083398da485f2ab70b6"},"schema_version":"1.0"},"canonical_sha256":"e2f503cbb04deab2a2076719e849d8a0f18b2956632e5444e1ac94e767434651","source":{"kind":"arxiv","id":"2107.03845","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.03845","created_at":"2026-07-05T04:35:56Z"},{"alias_kind":"arxiv_version","alias_value":"2107.03845v2","created_at":"2026-07-05T04:35:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.03845","created_at":"2026-07-05T04:35:56Z"},{"alias_kind":"pith_short_12","alias_value":"4L2QHS5QJXVL","created_at":"2026-07-05T04:35:56Z"},{"alias_kind":"pith_short_16","alias_value":"4L2QHS5QJXVLFIQH","created_at":"2026-07-05T04:35:56Z"},{"alias_kind":"pith_short_8","alias_value":"4L2QHS5Q","created_at":"2026-07-05T04:35:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:4L2QHS5QJXVLFIQHM4M6QSOYUD","target":"record","payload":{"canonical_record":{"source":{"id":"2107.03845","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2021-07-08T13:50:51Z","cross_cats_sorted":[],"title_canon_sha256":"87102eaacea2845922aaa6d6e4c8447a28f4dadb55af298646d7217c4e9d7247","abstract_canon_sha256":"41b2f02d08851d8717718f8efa9dc94de64b74ac84c1a083398da485f2ab70b6"},"schema_version":"1.0"},"canonical_sha256":"e2f503cbb04deab2a2076719e849d8a0f18b2956632e5444e1ac94e767434651","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:35:56.597245Z","signature_b64":"EJ4BXNS/YoEfOH0JjIKhAwXRudFsRmPFNC74K6/0tg2u/rLKb3ursnjZp9hT7+vk0erWPrvOXsaD6re2Gtq2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2f503cbb04deab2a2076719e849d8a0f18b2956632e5444e1ac94e767434651","last_reissued_at":"2026-07-05T04:35:56.596833Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:35:56.596833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.03845","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-05T04:35:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PiDFLs1ABz+4l86jJbbopVtcFnZYCNGnorZGTB4jW7Kkk5LAufZNgqfLq6vLZHvNgRokgZ8A3gKebxqnxOpPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-16T03:18:09.607231Z"},"content_sha256":"7428343ae840b768e1203632589811f93765e643001c1ede8b42f180f24b23b1","schema_version":"1.0","event_id":"sha256:7428343ae840b768e1203632589811f93765e643001c1ede8b42f180f24b23b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:4L2QHS5QJXVLFIQHM4M6QSOYUD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Implementable Hybrid Quantum Ant Colony Optimization Algorithm","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Javier Echanobe, Mikel Garcia de Andoin","submitted_at":"2021-07-08T13:50:51Z","abstract_excerpt":"We propose a new hybrid quantum algorithm based on the classical Ant Colony Optimization algorithm to produce approximate solutions for NP-hard problems, in particular optimization problems. First, we discuss some previously proposed Quantum Ant Colony Optimization algorithms, and based on them, we develop an improved algorithm that can be truly implemented on near-term quantum computers. Our iterative algorithm codifies only the information about the pheromones and the exploration parameter in the quantum state, while subrogating the calculation of the numerical result to a classical computer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.03845","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/2107.03845/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-05T04:35:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6nWqlDw4pANsP7LSPlnt1HjOVSsPC7Xg5SuBmRjABSdnf8huq+8oHlvtKrTHn5uejym5yaPHmmpqlYkWee40Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-16T03:18:09.607627Z"},"content_sha256":"dfde5948c4c8968d2c99ab1824cb4719c0e6b278e40f8d120ef5befb893f0f80","schema_version":"1.0","event_id":"sha256:dfde5948c4c8968d2c99ab1824cb4719c0e6b278e40f8d120ef5befb893f0f80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4L2QHS5QJXVLFIQHM4M6QSOYUD/bundle.json","state_url":"https://pith.science/pith/4L2QHS5QJXVLFIQHM4M6QSOYUD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4L2QHS5QJXVLFIQHM4M6QSOYUD/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-16T03:18:09Z","links":{"resolver":"https://pith.science/pith/4L2QHS5QJXVLFIQHM4M6QSOYUD","bundle":"https://pith.science/pith/4L2QHS5QJXVLFIQHM4M6QSOYUD/bundle.json","state":"https://pith.science/pith/4L2QHS5QJXVLFIQHM4M6QSOYUD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4L2QHS5QJXVLFIQHM4M6QSOYUD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:4L2QHS5QJXVLFIQHM4M6QSOYUD","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":"41b2f02d08851d8717718f8efa9dc94de64b74ac84c1a083398da485f2ab70b6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2021-07-08T13:50:51Z","title_canon_sha256":"87102eaacea2845922aaa6d6e4c8447a28f4dadb55af298646d7217c4e9d7247"},"schema_version":"1.0","source":{"id":"2107.03845","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.03845","created_at":"2026-07-05T04:35:56Z"},{"alias_kind":"arxiv_version","alias_value":"2107.03845v2","created_at":"2026-07-05T04:35:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.03845","created_at":"2026-07-05T04:35:56Z"},{"alias_kind":"pith_short_12","alias_value":"4L2QHS5QJXVL","created_at":"2026-07-05T04:35:56Z"},{"alias_kind":"pith_short_16","alias_value":"4L2QHS5QJXVLFIQH","created_at":"2026-07-05T04:35:56Z"},{"alias_kind":"pith_short_8","alias_value":"4L2QHS5Q","created_at":"2026-07-05T04:35:56Z"}],"graph_snapshots":[{"event_id":"sha256:dfde5948c4c8968d2c99ab1824cb4719c0e6b278e40f8d120ef5befb893f0f80","target":"graph","created_at":"2026-07-05T04:35: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/2107.03845/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a new hybrid quantum algorithm based on the classical Ant Colony Optimization algorithm to produce approximate solutions for NP-hard problems, in particular optimization problems. First, we discuss some previously proposed Quantum Ant Colony Optimization algorithms, and based on them, we develop an improved algorithm that can be truly implemented on near-term quantum computers. Our iterative algorithm codifies only the information about the pheromones and the exploration parameter in the quantum state, while subrogating the calculation of the numerical result to a classical computer","authors_text":"Javier Echanobe, Mikel Garcia de Andoin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2021-07-08T13:50:51Z","title":"Implementable Hybrid Quantum Ant Colony Optimization Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.03845","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:7428343ae840b768e1203632589811f93765e643001c1ede8b42f180f24b23b1","target":"record","created_at":"2026-07-05T04:35: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":"41b2f02d08851d8717718f8efa9dc94de64b74ac84c1a083398da485f2ab70b6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2021-07-08T13:50:51Z","title_canon_sha256":"87102eaacea2845922aaa6d6e4c8447a28f4dadb55af298646d7217c4e9d7247"},"schema_version":"1.0","source":{"id":"2107.03845","kind":"arxiv","version":2}},"canonical_sha256":"e2f503cbb04deab2a2076719e849d8a0f18b2956632e5444e1ac94e767434651","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2f503cbb04deab2a2076719e849d8a0f18b2956632e5444e1ac94e767434651","first_computed_at":"2026-07-05T04:35:56.596833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:35:56.596833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EJ4BXNS/YoEfOH0JjIKhAwXRudFsRmPFNC74K6/0tg2u/rLKb3ursnjZp9hT7+vk0erWPrvOXsaD6re2Gtq2DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:35:56.597245Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.03845","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7428343ae840b768e1203632589811f93765e643001c1ede8b42f180f24b23b1","sha256:dfde5948c4c8968d2c99ab1824cb4719c0e6b278e40f8d120ef5befb893f0f80"],"state_sha256":"05010a786abc7f78bcc1ca4fca367ca1d0f16fd8ed486d04694985680f81ad8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LOzCfiATmciQzwDvLAiZHopeXm+RcjBlDm8+IGHAtJXMjNzI2HLaVOZUsfvrVqXcPkEjoMOoxRh7fLVXGfAWCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-16T03:18:09.609815Z","bundle_sha256":"39863e6fd968216b9e8285e6feb39de83bdde6dc382766010efefa5febc713f5"}}