{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Q2Q2V7ZG5WNDEAEUQCWPC32IAR","short_pith_number":"pith:Q2Q2V7ZG","schema_version":"1.0","canonical_sha256":"86a1aaff26ed9a32009480acf16f48045c8a4f8874e863a7f34687871cb16efe","source":{"kind":"arxiv","id":"2401.08989","version":3},"attestation_state":"computed","paper":{"title":"Five Starter Problems: Solving Quadratic Unconstrained Binary Optimization Models on Quantum Computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Arul Mazumder, Sridhar Tayur","submitted_at":"2024-01-17T05:47:42Z","abstract_excerpt":"This tutorial offers a quick, hands-on introduction to solving Quadratic Unconstrained Binary Optimization (QUBO) models on currently available quantum computers and their simulators. We cover both IBM and D-Wave machines: IBM utilizes a gate-circuit architecture, and D-Wave is a quantum annealer. We provide examples of three canonical problems and two models from practical applications. The tutorial is structured to bridge the gap between theory and practice: we begin with an overview of QUBOs, explain their relevance and connection to quantum algorithms, introduce key quantum computing conce"},"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":"2401.08989","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-01-17T05:47:42Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b6ccc6a2de89b13099596bb46c0c3aab85ce648d1249e84ebc74736f05682dc0","abstract_canon_sha256":"da7ae0ea086770816444f0d0f7c2dc3eea9112b5429ec58f0ff6de23fa9d8080"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:29.584065Z","signature_b64":"mkroeEteT4gMufQYfWil4cRsrYiepNXm0U1qwSul3z6i9Ctj++j7obbyTyiPlJZFRmHkzHU2jJYPK45aE/V3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86a1aaff26ed9a32009480acf16f48045c8a4f8874e863a7f34687871cb16efe","last_reissued_at":"2026-07-05T11:22:29.583129Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:29.583129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Five Starter Problems: Solving Quadratic Unconstrained Binary Optimization Models on Quantum Computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Arul Mazumder, Sridhar Tayur","submitted_at":"2024-01-17T05:47:42Z","abstract_excerpt":"This tutorial offers a quick, hands-on introduction to solving Quadratic Unconstrained Binary Optimization (QUBO) models on currently available quantum computers and their simulators. We cover both IBM and D-Wave machines: IBM utilizes a gate-circuit architecture, and D-Wave is a quantum annealer. We provide examples of three canonical problems and two models from practical applications. The tutorial is structured to bridge the gap between theory and practice: we begin with an overview of QUBOs, explain their relevance and connection to quantum algorithms, introduce key quantum computing conce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.08989","kind":"arxiv","version":3},"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/2401.08989/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":"2401.08989","created_at":"2026-07-05T11:22:29.583610+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.08989v3","created_at":"2026-07-05T11:22:29.583610+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.08989","created_at":"2026-07-05T11:22:29.583610+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q2Q2V7ZG5WND","created_at":"2026-07-05T11:22:29.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q2Q2V7ZG5WNDEAEU","created_at":"2026-07-05T11:22:29.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q2Q2V7ZG","created_at":"2026-07-05T11:22:29.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.18265","citing_title":"Spectral Outer-Approximation Algorithms for Binary Semidefinite Problems","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q2Q2V7ZG5WNDEAEUQCWPC32IAR","json":"https://pith.science/pith/Q2Q2V7ZG5WNDEAEUQCWPC32IAR.json","graph_json":"https://pith.science/api/pith-number/Q2Q2V7ZG5WNDEAEUQCWPC32IAR/graph.json","events_json":"https://pith.science/api/pith-number/Q2Q2V7ZG5WNDEAEUQCWPC32IAR/events.json","paper":"https://pith.science/paper/Q2Q2V7ZG"},"agent_actions":{"view_html":"https://pith.science/pith/Q2Q2V7ZG5WNDEAEUQCWPC32IAR","download_json":"https://pith.science/pith/Q2Q2V7ZG5WNDEAEUQCWPC32IAR.json","view_paper":"https://pith.science/paper/Q2Q2V7ZG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.08989&json=true","fetch_graph":"https://pith.science/api/pith-number/Q2Q2V7ZG5WNDEAEUQCWPC32IAR/graph.json","fetch_events":"https://pith.science/api/pith-number/Q2Q2V7ZG5WNDEAEUQCWPC32IAR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q2Q2V7ZG5WNDEAEUQCWPC32IAR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q2Q2V7ZG5WNDEAEUQCWPC32IAR/action/storage_attestation","attest_author":"https://pith.science/pith/Q2Q2V7ZG5WNDEAEUQCWPC32IAR/action/author_attestation","sign_citation":"https://pith.science/pith/Q2Q2V7ZG5WNDEAEUQCWPC32IAR/action/citation_signature","submit_replication":"https://pith.science/pith/Q2Q2V7ZG5WNDEAEUQCWPC32IAR/action/replication_record"}},"created_at":"2026-07-05T11:22:29.583610+00:00","updated_at":"2026-07-05T11:22:29.583610+00:00"}