{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PSH57D3NJVVZAHYF7HAME6IY4P","short_pith_number":"pith:PSH57D3N","schema_version":"1.0","canonical_sha256":"7c8fdf8f6d4d6b901f05f9c0c27918e3ee841e7d79fb5a453592ff870a986336","source":{"kind":"arxiv","id":"1705.09844","version":1},"attestation_state":"computed","paper":{"title":"Quadratic Unconstrained Binary Optimization Problem Preprocessing: Theory and Empirical Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fred Glover, Mark Lewis","submitted_at":"2017-05-27T17:09:56Z","abstract_excerpt":"The Quadratic Unconstrained Binary Optimization problem (QUBO) has become a unifying model for representing a wide range of combinatorial optimization problems, and for linking a variety of disciplines that face these problems. A new class of quantum annealing computer that maps QUBO onto a physical qubit network structure with specific size and edge density restrictions is generating a growing interest in ways to transform the underlying QUBO structure into an equivalent graph having fewer nodes and edges. In this paper we present rules for reducing the size of the QUBO matrix by identifying "},"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":"1705.09844","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-27T17:09:56Z","cross_cats_sorted":[],"title_canon_sha256":"f827637eabb9cf04188865e1c7ec232bc7cb566a0ba7667679991de4803c5b48","abstract_canon_sha256":"113d99b409e879e56df18486ce4132437d24d4b3a444cfe4ff5a17f2f41c72c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:34.393150Z","signature_b64":"Ia4ve0a6ASRpYDeNYnHUPLzNWZtywmy5lsOzPBzkwna9Y5PPcfj87yTzY9iYVZigSK5L2yMdCoG5i1vhwT6gBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c8fdf8f6d4d6b901f05f9c0c27918e3ee841e7d79fb5a453592ff870a986336","last_reissued_at":"2026-05-18T00:43:34.392751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:34.392751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quadratic Unconstrained Binary Optimization Problem Preprocessing: Theory and Empirical Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fred Glover, Mark Lewis","submitted_at":"2017-05-27T17:09:56Z","abstract_excerpt":"The Quadratic Unconstrained Binary Optimization problem (QUBO) has become a unifying model for representing a wide range of combinatorial optimization problems, and for linking a variety of disciplines that face these problems. A new class of quantum annealing computer that maps QUBO onto a physical qubit network structure with specific size and edge density restrictions is generating a growing interest in ways to transform the underlying QUBO structure into an equivalent graph having fewer nodes and edges. In this paper we present rules for reducing the size of the QUBO matrix by identifying "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09844","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":"1705.09844","created_at":"2026-05-18T00:43:34.392818+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09844v1","created_at":"2026-05-18T00:43:34.392818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09844","created_at":"2026-05-18T00:43:34.392818+00:00"},{"alias_kind":"pith_short_12","alias_value":"PSH57D3NJVVZ","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PSH57D3NJVVZAHYF","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PSH57D3N","created_at":"2026-05-18T12:31:37.085036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PSH57D3NJVVZAHYF7HAME6IY4P","json":"https://pith.science/pith/PSH57D3NJVVZAHYF7HAME6IY4P.json","graph_json":"https://pith.science/api/pith-number/PSH57D3NJVVZAHYF7HAME6IY4P/graph.json","events_json":"https://pith.science/api/pith-number/PSH57D3NJVVZAHYF7HAME6IY4P/events.json","paper":"https://pith.science/paper/PSH57D3N"},"agent_actions":{"view_html":"https://pith.science/pith/PSH57D3NJVVZAHYF7HAME6IY4P","download_json":"https://pith.science/pith/PSH57D3NJVVZAHYF7HAME6IY4P.json","view_paper":"https://pith.science/paper/PSH57D3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09844&json=true","fetch_graph":"https://pith.science/api/pith-number/PSH57D3NJVVZAHYF7HAME6IY4P/graph.json","fetch_events":"https://pith.science/api/pith-number/PSH57D3NJVVZAHYF7HAME6IY4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PSH57D3NJVVZAHYF7HAME6IY4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PSH57D3NJVVZAHYF7HAME6IY4P/action/storage_attestation","attest_author":"https://pith.science/pith/PSH57D3NJVVZAHYF7HAME6IY4P/action/author_attestation","sign_citation":"https://pith.science/pith/PSH57D3NJVVZAHYF7HAME6IY4P/action/citation_signature","submit_replication":"https://pith.science/pith/PSH57D3NJVVZAHYF7HAME6IY4P/action/replication_record"}},"created_at":"2026-05-18T00:43:34.392818+00:00","updated_at":"2026-05-18T00:43:34.392818+00:00"}