{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KH2544AH3SA2733DPM4ZYZ5ZY7","short_pith_number":"pith:KH2544AH","schema_version":"1.0","canonical_sha256":"51f5de7007dc81afef637b399c67b9c7e690c8bf464af2c5187e25f53ac874a5","source":{"kind":"arxiv","id":"1811.11538","version":6},"attestation_state":"computed","paper":{"title":"A Tutorial on Formulating and Using QUBO Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC","quant-ph"],"primary_cat":"cs.DS","authors_text":"Fred Glover, Gary Kochenberger, Yu Du","submitted_at":"2018-11-13T18:38:34Z","abstract_excerpt":"The Quadratic Unconstrained Binary Optimization (QUBO) model has gained prominence in recent years with the discovery that it unifies a rich variety of combinatorial optimization problems. By its association with the Ising problem in physics, the QUBO model has emerged as an underpinning of the quantum computing area known as quantum annealing and has become a subject of study in neuromorphic computing. Through these connections, QUBO models lie at the heart of experimentation carried out with quantum computers developed by D-Wave Systems and neuromorphic computers developed by IBM. Computatio"},"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":"1811.11538","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-13T18:38:34Z","cross_cats_sorted":["cs.DM","math.OC","quant-ph"],"title_canon_sha256":"ae9493ceb3edff583ce9e921aa381babe4a8d5a901a289c2798a4be740586912","abstract_canon_sha256":"c5370ad1b27109cb0801ab19414b9067fa74d50186bc2f7c155d99b3830f5d93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:49.290460Z","signature_b64":"b7PYfuD0DFaXPOaOuaSlgJ0nM/ReC2pgpiXQ/HcVLowPPMlmxvep5aOB3RaQmYcgBg1dZUxgxg2sPjYzmJjQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51f5de7007dc81afef637b399c67b9c7e690c8bf464af2c5187e25f53ac874a5","last_reissued_at":"2026-07-05T00:16:49.290032Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:49.290032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tutorial on Formulating and Using QUBO Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC","quant-ph"],"primary_cat":"cs.DS","authors_text":"Fred Glover, Gary Kochenberger, Yu Du","submitted_at":"2018-11-13T18:38:34Z","abstract_excerpt":"The Quadratic Unconstrained Binary Optimization (QUBO) model has gained prominence in recent years with the discovery that it unifies a rich variety of combinatorial optimization problems. By its association with the Ising problem in physics, the QUBO model has emerged as an underpinning of the quantum computing area known as quantum annealing and has become a subject of study in neuromorphic computing. Through these connections, QUBO models lie at the heart of experimentation carried out with quantum computers developed by D-Wave Systems and neuromorphic computers developed by IBM. Computatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11538","kind":"arxiv","version":6},"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/1811.11538/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":"1811.11538","created_at":"2026-07-05T00:16:49.290097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.11538v6","created_at":"2026-07-05T00:16:49.290097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11538","created_at":"2026-07-05T00:16:49.290097+00:00"},{"alias_kind":"pith_short_12","alias_value":"KH2544AH3SA2","created_at":"2026-07-05T00:16:49.290097+00:00"},{"alias_kind":"pith_short_16","alias_value":"KH2544AH3SA2733D","created_at":"2026-07-05T00:16:49.290097+00:00"},{"alias_kind":"pith_short_8","alias_value":"KH2544AH","created_at":"2026-07-05T00:16:49.290097+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":28,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25117","citing_title":"Feasibility-driven QAOA with penalty scheduling","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25129","citing_title":"Blocked Gibbs meets Diffusion Transformers: Unsupervised Learning for Constraint Optimization","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25350","citing_title":"An Empirical Evaluation of Quantum-Inspired QUBO Methods for Heterogeneous HPC Workflow Mapping and Scheduling","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23138","citing_title":"Classical State Preparation for Variational Quantum Algorithms via Reinforcement Learning","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2409.07501","citing_title":"A compact QUBO encoding of computational logic formulae demonstrated on cryptography constructions","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2410.15272","citing_title":"Performance-Driven QUBO for Recommender Systems on Quantum Annealers","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2508.01958","citing_title":"Introduction to QUDO, Tensor QUDO and HOBO formulations: Qudits, Equivalences, Knapsack Problem, Traveling Salesman Problem and Combinatorial Games","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01127","citing_title":"Impact-Driven Quantum Decomposition for Traffic Zone Partitioning: A Hybrid Gate-Model Framework","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16202","citing_title":"Performance Gains in Quantum SAT Solvers Using ESOP Encoding","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20163","citing_title":"Pauli Correlation Encoding for mRNA Secondary Structure Prediction: Problem-Aware Decoding for Dense-Constraint QUBOs","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15899","citing_title":"Solving Classical and Quantum Spin Glasses with Deep Boltzmann Quantum States","ref_index":83,"is_internal_anchor":false},{"citing_arxiv_id":"2509.09148","citing_title":"A penalty-free quantum algorithm to find energy eigenstates","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2510.02430","citing_title":"Mitigating the barren plateau problem in linear optics","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2604.02661","citing_title":"Quantum Optimisation for Transport Vulnerability Identification","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03565","citing_title":"Neural optimization for quantum architectures: graph embedding problems with Distance Encoder Networks","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03524","citing_title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26459","citing_title":"Solve Crude Oil Scheduling Problems by Using Quantum-Classical Hybrid Algorithms","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09032","citing_title":"A Quantum Inspired Variational Kernel and Explainable AI Framework for Cross Region Solar and Wind Energy Forecasting","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22194","citing_title":"Qubit-Scalable CVRP via Lagrangian Knapsack Decomposition and Noise-Aware Quantum Execution","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04736","citing_title":"Neural-powered unit disk graph embedding: qubits connectivity for some QUBO problems","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01127","citing_title":"Impact-Driven Quantum Decomposition for Traffic Zone Partitioning: A Hybrid Gate-Model Framework","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KH2544AH3SA2733DPM4ZYZ5ZY7","json":"https://pith.science/pith/KH2544AH3SA2733DPM4ZYZ5ZY7.json","graph_json":"https://pith.science/api/pith-number/KH2544AH3SA2733DPM4ZYZ5ZY7/graph.json","events_json":"https://pith.science/api/pith-number/KH2544AH3SA2733DPM4ZYZ5ZY7/events.json","paper":"https://pith.science/paper/KH2544AH"},"agent_actions":{"view_html":"https://pith.science/pith/KH2544AH3SA2733DPM4ZYZ5ZY7","download_json":"https://pith.science/pith/KH2544AH3SA2733DPM4ZYZ5ZY7.json","view_paper":"https://pith.science/paper/KH2544AH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.11538&json=true","fetch_graph":"https://pith.science/api/pith-number/KH2544AH3SA2733DPM4ZYZ5ZY7/graph.json","fetch_events":"https://pith.science/api/pith-number/KH2544AH3SA2733DPM4ZYZ5ZY7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KH2544AH3SA2733DPM4ZYZ5ZY7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KH2544AH3SA2733DPM4ZYZ5ZY7/action/storage_attestation","attest_author":"https://pith.science/pith/KH2544AH3SA2733DPM4ZYZ5ZY7/action/author_attestation","sign_citation":"https://pith.science/pith/KH2544AH3SA2733DPM4ZYZ5ZY7/action/citation_signature","submit_replication":"https://pith.science/pith/KH2544AH3SA2733DPM4ZYZ5ZY7/action/replication_record"}},"created_at":"2026-07-05T00:16:49.290097+00:00","updated_at":"2026-07-05T00:16:49.290097+00:00"}