{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KRSZJG6IPY6W6YGMYPLCNYXDBD","short_pith_number":"pith:KRSZJG6I","schema_version":"1.0","canonical_sha256":"5465949bc87e3d6f60ccc3d626e2e308fbdcb31271b10227e98429a17adb4f65","source":{"kind":"arxiv","id":"1808.08806","version":1},"attestation_state":"computed","paper":{"title":"Compact Linearization for Binary Quadratic Problems Comprising Linear Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Sven Mallach","submitted_at":"2018-08-23T18:33:36Z","abstract_excerpt":"In this paper, the compact linearization approach originally proposed for binary quadratic programs with assignment constraints is generalized to such programs with arbitrary linear equations and inequalities that have positive coefficients and right hand sides. Quadratic constraints may exist in addition, and the technique may as well be applied if these impose the only nonlinearities, i.e., the objective function is linear. We present special cases of linear constraints (along with prominent combinatorial optimization problems where these occur) such that the associated compact linearization"},"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":"1808.08806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-23T18:33:36Z","cross_cats_sorted":[],"title_canon_sha256":"81d1ed85172e5efa6ea5738fd40f05f2d010a670b816a11cb457e56b665447f9","abstract_canon_sha256":"e9a762be0e9c4ec7cd161de51fca141932725bfaf0ca60733fa19c97b7288d4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:13.179555Z","signature_b64":"qZRsrFn28ZfbfulaYZA+PvgNg85FKJmyjAnKXbmf0KN8Y0wj+TuLfJlsrm/AEXGtw/ZHhoM8Db7FheA7bW21DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5465949bc87e3d6f60ccc3d626e2e308fbdcb31271b10227e98429a17adb4f65","last_reissued_at":"2026-05-18T00:07:13.178957Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:13.178957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compact Linearization for Binary Quadratic Problems Comprising Linear Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Sven Mallach","submitted_at":"2018-08-23T18:33:36Z","abstract_excerpt":"In this paper, the compact linearization approach originally proposed for binary quadratic programs with assignment constraints is generalized to such programs with arbitrary linear equations and inequalities that have positive coefficients and right hand sides. Quadratic constraints may exist in addition, and the technique may as well be applied if these impose the only nonlinearities, i.e., the objective function is linear. We present special cases of linear constraints (along with prominent combinatorial optimization problems where these occur) such that the associated compact linearization"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08806","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":"1808.08806","created_at":"2026-05-18T00:07:13.179034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.08806v1","created_at":"2026-05-18T00:07:13.179034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08806","created_at":"2026-05-18T00:07:13.179034+00:00"},{"alias_kind":"pith_short_12","alias_value":"KRSZJG6IPY6W","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KRSZJG6IPY6W6YGM","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KRSZJG6I","created_at":"2026-05-18T12:32:33.847187+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/KRSZJG6IPY6W6YGMYPLCNYXDBD","json":"https://pith.science/pith/KRSZJG6IPY6W6YGMYPLCNYXDBD.json","graph_json":"https://pith.science/api/pith-number/KRSZJG6IPY6W6YGMYPLCNYXDBD/graph.json","events_json":"https://pith.science/api/pith-number/KRSZJG6IPY6W6YGMYPLCNYXDBD/events.json","paper":"https://pith.science/paper/KRSZJG6I"},"agent_actions":{"view_html":"https://pith.science/pith/KRSZJG6IPY6W6YGMYPLCNYXDBD","download_json":"https://pith.science/pith/KRSZJG6IPY6W6YGMYPLCNYXDBD.json","view_paper":"https://pith.science/paper/KRSZJG6I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.08806&json=true","fetch_graph":"https://pith.science/api/pith-number/KRSZJG6IPY6W6YGMYPLCNYXDBD/graph.json","fetch_events":"https://pith.science/api/pith-number/KRSZJG6IPY6W6YGMYPLCNYXDBD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KRSZJG6IPY6W6YGMYPLCNYXDBD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KRSZJG6IPY6W6YGMYPLCNYXDBD/action/storage_attestation","attest_author":"https://pith.science/pith/KRSZJG6IPY6W6YGMYPLCNYXDBD/action/author_attestation","sign_citation":"https://pith.science/pith/KRSZJG6IPY6W6YGMYPLCNYXDBD/action/citation_signature","submit_replication":"https://pith.science/pith/KRSZJG6IPY6W6YGMYPLCNYXDBD/action/replication_record"}},"created_at":"2026-05-18T00:07:13.179034+00:00","updated_at":"2026-05-18T00:07:13.179034+00:00"}