{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3N3GUDK4VK73V4UHWUH5BZRSPF","short_pith_number":"pith:3N3GUDK4","schema_version":"1.0","canonical_sha256":"db766a0d5caabfbaf287b50fd0e632796f7e0ce3cbf0756345132bb45a67a33a","source":{"kind":"arxiv","id":"1708.05294","version":1},"attestation_state":"computed","paper":{"title":"Combinatorial Optimization on Gate Model Quantum Computers: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"quant-ph","authors_text":"Arman Zaribafiyan, Ehsan Zahedinejad","submitted_at":"2017-08-16T00:13:13Z","abstract_excerpt":"The advent of quantum computing processors with possibility to scale beyond experimental capacities magnifies the importance of studying their applications. Combinatorial optimization problems can be one of the promising applications of these new devices. These problems are recurrent in industrial applications and they are in general difficult for classical computing hardware. In this work, we provide a survey of the approaches to solving different types of combinatorial optimization problems, in particular quadratic unconstrained binary optimization (QUBO) problems on a gate model quantum com"},"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":"1708.05294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-08-16T00:13:13Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"961d47e6311b31d23e6dbe0747351cad6c014ded0ffd7b933e90ecc4d607df90","abstract_canon_sha256":"343334e7f8f7ca7c5708ef1bc18b67d6caa0a6fb1bcb27e448768d8ef84d2020"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:53.338924Z","signature_b64":"v7BI+EvJuazHG2S6xraUivjzQGckByodIlPRVFNVIZzibKQkkC+g2hzBMKAujLovWg+ah6qkuJn8URVZmHTPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db766a0d5caabfbaf287b50fd0e632796f7e0ce3cbf0756345132bb45a67a33a","last_reissued_at":"2026-05-18T00:37:53.338480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:53.338480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Optimization on Gate Model Quantum Computers: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"quant-ph","authors_text":"Arman Zaribafiyan, Ehsan Zahedinejad","submitted_at":"2017-08-16T00:13:13Z","abstract_excerpt":"The advent of quantum computing processors with possibility to scale beyond experimental capacities magnifies the importance of studying their applications. Combinatorial optimization problems can be one of the promising applications of these new devices. These problems are recurrent in industrial applications and they are in general difficult for classical computing hardware. In this work, we provide a survey of the approaches to solving different types of combinatorial optimization problems, in particular quadratic unconstrained binary optimization (QUBO) problems on a gate model quantum com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05294","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":""},"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":"1708.05294","created_at":"2026-05-18T00:37:53.338546+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.05294v1","created_at":"2026-05-18T00:37:53.338546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05294","created_at":"2026-05-18T00:37:53.338546+00:00"},{"alias_kind":"pith_short_12","alias_value":"3N3GUDK4VK73","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3N3GUDK4VK73V4UH","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3N3GUDK4","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12139","citing_title":"BoolXLLM: LLM-Assisted Explainability for Boolean Models","ref_index":78,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3N3GUDK4VK73V4UHWUH5BZRSPF","json":"https://pith.science/pith/3N3GUDK4VK73V4UHWUH5BZRSPF.json","graph_json":"https://pith.science/api/pith-number/3N3GUDK4VK73V4UHWUH5BZRSPF/graph.json","events_json":"https://pith.science/api/pith-number/3N3GUDK4VK73V4UHWUH5BZRSPF/events.json","paper":"https://pith.science/paper/3N3GUDK4"},"agent_actions":{"view_html":"https://pith.science/pith/3N3GUDK4VK73V4UHWUH5BZRSPF","download_json":"https://pith.science/pith/3N3GUDK4VK73V4UHWUH5BZRSPF.json","view_paper":"https://pith.science/paper/3N3GUDK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.05294&json=true","fetch_graph":"https://pith.science/api/pith-number/3N3GUDK4VK73V4UHWUH5BZRSPF/graph.json","fetch_events":"https://pith.science/api/pith-number/3N3GUDK4VK73V4UHWUH5BZRSPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3N3GUDK4VK73V4UHWUH5BZRSPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3N3GUDK4VK73V4UHWUH5BZRSPF/action/storage_attestation","attest_author":"https://pith.science/pith/3N3GUDK4VK73V4UHWUH5BZRSPF/action/author_attestation","sign_citation":"https://pith.science/pith/3N3GUDK4VK73V4UHWUH5BZRSPF/action/citation_signature","submit_replication":"https://pith.science/pith/3N3GUDK4VK73V4UHWUH5BZRSPF/action/replication_record"}},"created_at":"2026-05-18T00:37:53.338546+00:00","updated_at":"2026-05-18T00:37:53.338546+00:00"}