{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:OYD3ZNSK5PQ34RN5KCVMSSWEBA","short_pith_number":"pith:OYD3ZNSK","schema_version":"1.0","canonical_sha256":"7607bcb64aebe1be45bd50aac94ac4082d0978995687baddbb299730dc6ff0c6","source":{"kind":"arxiv","id":"2012.04984","version":2},"attestation_state":"computed","paper":{"title":"Hybrid Quantum Computing -- Tabu Search Algorithm for Partitioning Problems: preliminary study on the Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.ET","authors_text":"Aitor Moreno-Fernandez-de-Leceta, Eneko Osaba, Esther Villar-Rodriguez, Izaskun Oregi","submitted_at":"2020-12-09T11:21:50Z","abstract_excerpt":"Quantum Computing is considered as the next frontier in computing, and it is attracting a lot of attention from the current scientific community. This kind of computation provides to researchers with a revolutionary paradigm for addressing complex optimization problems, offering a significant speed advantage and an efficient search ability. Anyway, Quantum Computing is still in an incipient stage of development. For this reason, present architectures show certain limitations, which have motivated the carrying out of this paper. In this paper, we introduce a novel solving scheme coined as hybri"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2012.04984","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2020-12-09T11:21:50Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"4405e01d6c97a93fe9c874a0f3edc70b918f241d12149742a253457293c22ac6","abstract_canon_sha256":"65dcd4459d3c8c7c1f4f28ee3907811a4a4b79a2c5552724543bb2c3deb56408"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:31:02.564535Z","signature_b64":"Lu56MpZTwbVdvpPS2r+npd+uRpjNxvlKmG4fdVTkfHsIyLEODia+mwiY250ELDfpjvZZhCZHXwbGxPv6HCkEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7607bcb64aebe1be45bd50aac94ac4082d0978995687baddbb299730dc6ff0c6","last_reissued_at":"2026-07-05T02:31:02.564025Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:31:02.564025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybrid Quantum Computing -- Tabu Search Algorithm for Partitioning Problems: preliminary study on the Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.ET","authors_text":"Aitor Moreno-Fernandez-de-Leceta, Eneko Osaba, Esther Villar-Rodriguez, Izaskun Oregi","submitted_at":"2020-12-09T11:21:50Z","abstract_excerpt":"Quantum Computing is considered as the next frontier in computing, and it is attracting a lot of attention from the current scientific community. This kind of computation provides to researchers with a revolutionary paradigm for addressing complex optimization problems, offering a significant speed advantage and an efficient search ability. Anyway, Quantum Computing is still in an incipient stage of development. For this reason, present architectures show certain limitations, which have motivated the carrying out of this paper. In this paper, we introduce a novel solving scheme coined as hybri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.04984","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/2012.04984/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2012.04984","created_at":"2026-07-05T02:31:02.564090+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.04984v2","created_at":"2026-07-05T02:31:02.564090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.04984","created_at":"2026-07-05T02:31:02.564090+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYD3ZNSK5PQ3","created_at":"2026-07-05T02:31:02.564090+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYD3ZNSK5PQ34RN5","created_at":"2026-07-05T02:31:02.564090+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYD3ZNSK","created_at":"2026-07-05T02:31:02.564090+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30415","citing_title":"Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problems","ref_index":85,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OYD3ZNSK5PQ34RN5KCVMSSWEBA","json":"https://pith.science/pith/OYD3ZNSK5PQ34RN5KCVMSSWEBA.json","graph_json":"https://pith.science/api/pith-number/OYD3ZNSK5PQ34RN5KCVMSSWEBA/graph.json","events_json":"https://pith.science/api/pith-number/OYD3ZNSK5PQ34RN5KCVMSSWEBA/events.json","paper":"https://pith.science/paper/OYD3ZNSK"},"agent_actions":{"view_html":"https://pith.science/pith/OYD3ZNSK5PQ34RN5KCVMSSWEBA","download_json":"https://pith.science/pith/OYD3ZNSK5PQ34RN5KCVMSSWEBA.json","view_paper":"https://pith.science/paper/OYD3ZNSK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.04984&json=true","fetch_graph":"https://pith.science/api/pith-number/OYD3ZNSK5PQ34RN5KCVMSSWEBA/graph.json","fetch_events":"https://pith.science/api/pith-number/OYD3ZNSK5PQ34RN5KCVMSSWEBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYD3ZNSK5PQ34RN5KCVMSSWEBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYD3ZNSK5PQ34RN5KCVMSSWEBA/action/storage_attestation","attest_author":"https://pith.science/pith/OYD3ZNSK5PQ34RN5KCVMSSWEBA/action/author_attestation","sign_citation":"https://pith.science/pith/OYD3ZNSK5PQ34RN5KCVMSSWEBA/action/citation_signature","submit_replication":"https://pith.science/pith/OYD3ZNSK5PQ34RN5KCVMSSWEBA/action/replication_record"}},"created_at":"2026-07-05T02:31:02.564090+00:00","updated_at":"2026-07-05T02:31:02.564090+00:00"}