{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4ZWOTRSS2FZE6HFUUK5BSTIJ75","short_pith_number":"pith:4ZWOTRSS","schema_version":"1.0","canonical_sha256":"e66ce9c652d1724f1cb4a2ba194d09ff6fbd6f9f78ac7dbed07bb54deda1011e","source":{"kind":"arxiv","id":"1306.1202","version":2},"attestation_state":"computed","paper":{"title":"A note on QUBO instances defined on Chimera graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","quant-ph"],"primary_cat":"math.OC","authors_text":"Sanjeeb Dash","submitted_at":"2013-06-05T18:42:50Z","abstract_excerpt":"McGeoch and Wang (2013) recently obtained optimal or near-optimal solutions to some quadratic unconstrained boolean optimization (QUBO) problem instances using a 439 qubit D-Wave Two quantum computing system in much less time than with the IBM ILOG CPLEX mixed-integer quadratic programming (MIQP) solver. The problems studied by McGeoch and Wang are defined on subgraphs -- with up to 439 nodes -- of Chimera graphs. We observe that after a standard reformulation of the QUBO problem as a mixed-integer linear program (MILP), the specific instances used by McGeoch and Wang can be solved to optimali"},"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":"1306.1202","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-05T18:42:50Z","cross_cats_sorted":["cs.DS","quant-ph"],"title_canon_sha256":"22099d428f2024c227e35ab863e35f69e99527afa225b59e8ca4762ef5870b6a","abstract_canon_sha256":"af233f5bd5ecb748bb8dbdd31c21844f2d399cdf856def54d195c743c03b0acb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:55.012211Z","signature_b64":"kewFf4PY+KV0K2Zix4pMiPQka5URMvJvZG5tGsjq8+i54wX2yqeIpyUVm2cWOcrFmLPrV4RyoMTDO3fALZh1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e66ce9c652d1724f1cb4a2ba194d09ff6fbd6f9f78ac7dbed07bb54deda1011e","last_reissued_at":"2026-05-18T01:27:55.011670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:55.011670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on QUBO instances defined on Chimera graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","quant-ph"],"primary_cat":"math.OC","authors_text":"Sanjeeb Dash","submitted_at":"2013-06-05T18:42:50Z","abstract_excerpt":"McGeoch and Wang (2013) recently obtained optimal or near-optimal solutions to some quadratic unconstrained boolean optimization (QUBO) problem instances using a 439 qubit D-Wave Two quantum computing system in much less time than with the IBM ILOG CPLEX mixed-integer quadratic programming (MIQP) solver. The problems studied by McGeoch and Wang are defined on subgraphs -- with up to 439 nodes -- of Chimera graphs. We observe that after a standard reformulation of the QUBO problem as a mixed-integer linear program (MILP), the specific instances used by McGeoch and Wang can be solved to optimali"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1202","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":""},"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":"1306.1202","created_at":"2026-05-18T01:27:55.011741+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.1202v2","created_at":"2026-05-18T01:27:55.011741+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1202","created_at":"2026-05-18T01:27:55.011741+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZWOTRSS2FZE","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZWOTRSS2FZE6HFU","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZWOTRSS","created_at":"2026-05-18T12:27:34.582898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.15572","citing_title":"Classical Combinatorial Optimization Scaling for Random Ising Models on 2D Heavy-Hex Graphs","ref_index":52,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4ZWOTRSS2FZE6HFUUK5BSTIJ75","json":"https://pith.science/pith/4ZWOTRSS2FZE6HFUUK5BSTIJ75.json","graph_json":"https://pith.science/api/pith-number/4ZWOTRSS2FZE6HFUUK5BSTIJ75/graph.json","events_json":"https://pith.science/api/pith-number/4ZWOTRSS2FZE6HFUUK5BSTIJ75/events.json","paper":"https://pith.science/paper/4ZWOTRSS"},"agent_actions":{"view_html":"https://pith.science/pith/4ZWOTRSS2FZE6HFUUK5BSTIJ75","download_json":"https://pith.science/pith/4ZWOTRSS2FZE6HFUUK5BSTIJ75.json","view_paper":"https://pith.science/paper/4ZWOTRSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.1202&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZWOTRSS2FZE6HFUUK5BSTIJ75/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZWOTRSS2FZE6HFUUK5BSTIJ75/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZWOTRSS2FZE6HFUUK5BSTIJ75/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZWOTRSS2FZE6HFUUK5BSTIJ75/action/storage_attestation","attest_author":"https://pith.science/pith/4ZWOTRSS2FZE6HFUUK5BSTIJ75/action/author_attestation","sign_citation":"https://pith.science/pith/4ZWOTRSS2FZE6HFUUK5BSTIJ75/action/citation_signature","submit_replication":"https://pith.science/pith/4ZWOTRSS2FZE6HFUUK5BSTIJ75/action/replication_record"}},"created_at":"2026-05-18T01:27:55.011741+00:00","updated_at":"2026-05-18T01:27:55.011741+00:00"}