{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OHCD3ZQQ623TAR4NSASIGCD3BI","short_pith_number":"pith:OHCD3ZQQ","canonical_record":{"source":{"id":"1712.05872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-15T22:57:46Z","cross_cats_sorted":[],"title_canon_sha256":"cdefdda447006a9e19760b13aead081ec084400fef8aa1df5905a4bbe1237a92","abstract_canon_sha256":"65bdbfb9cc9af8c1c6ecadbeb345507bf5b4bbd4d16948044d92c990a8cd23c7"},"schema_version":"1.0"},"canonical_sha256":"71c43de610f6b730478d902483087b0a0f8832486a2a69f3df18059afa951dec","source":{"kind":"arxiv","id":"1712.05872","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05872","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05872v1","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05872","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"pith_short_12","alias_value":"OHCD3ZQQ623T","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OHCD3ZQQ623TAR4N","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OHCD3ZQQ","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OHCD3ZQQ623TAR4NSASIGCD3BI","target":"record","payload":{"canonical_record":{"source":{"id":"1712.05872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-15T22:57:46Z","cross_cats_sorted":[],"title_canon_sha256":"cdefdda447006a9e19760b13aead081ec084400fef8aa1df5905a4bbe1237a92","abstract_canon_sha256":"65bdbfb9cc9af8c1c6ecadbeb345507bf5b4bbd4d16948044d92c990a8cd23c7"},"schema_version":"1.0"},"canonical_sha256":"71c43de610f6b730478d902483087b0a0f8832486a2a69f3df18059afa951dec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:51.686681Z","signature_b64":"iCV7ilOMZmibTykHl1KgomKotLDV2V/JAbUPM56Al2Q4OjGS46D2fJ5SuIfG1QAP/s1RhQduvJskxlE7NFyABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71c43de610f6b730478d902483087b0a0f8832486a2a69f3df18059afa951dec","last_reissued_at":"2026-05-18T00:27:51.686003Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:51.686003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.05872","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:27:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jvl7TJePywVLEKTkFesdT3SEEWaPCI4ZBn+YWEQnRFOQ4S/8cD/TH3ze7vK24Xhv4lVg+Rh8j4uzHQMg+6aCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:35:10.492558Z"},"content_sha256":"3b4e7a0b7e416ba070dd613ef6e7b9f9337d597286615bc086e02e842943792e","schema_version":"1.0","event_id":"sha256:3b4e7a0b7e416ba070dd613ef6e7b9f9337d597286615bc086e02e842943792e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OHCD3ZQQ623TAR4NSASIGCD3BI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compact Linearization for Binary Quadratic Problems subject to Linear Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Sven Mallach","submitted_at":"2017-12-15T22:57:46Z","abstract_excerpt":"In this paper it is shown that the compact linearization approach, that has been previously proposed only for binary quadratic problems with assignment constraints, can be generalized to arbitrary linear equations with positive coefficients which considerably enlarges its applicability. We discuss special cases of prominent quadratic combinatorial optimization problems where the obtained compact linearization yields a continuous relaxation that is provably as least as strong as the one obtained with an ordinary linearization."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05872","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:27:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JVqLGtCztjxAMrNexbbIV9lNU1arUzDwYrL/T+5TJ4OFqcZBEedi9D/c7lJ3/ZtN2Od/g6kyk44EuEy4swY0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:35:10.492973Z"},"content_sha256":"1e9a31582132898a8561213d28ab958f4942543338fdb962759f03db2a8a6f38","schema_version":"1.0","event_id":"sha256:1e9a31582132898a8561213d28ab958f4942543338fdb962759f03db2a8a6f38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OHCD3ZQQ623TAR4NSASIGCD3BI/bundle.json","state_url":"https://pith.science/pith/OHCD3ZQQ623TAR4NSASIGCD3BI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OHCD3ZQQ623TAR4NSASIGCD3BI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T22:35:10Z","links":{"resolver":"https://pith.science/pith/OHCD3ZQQ623TAR4NSASIGCD3BI","bundle":"https://pith.science/pith/OHCD3ZQQ623TAR4NSASIGCD3BI/bundle.json","state":"https://pith.science/pith/OHCD3ZQQ623TAR4NSASIGCD3BI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OHCD3ZQQ623TAR4NSASIGCD3BI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OHCD3ZQQ623TAR4NSASIGCD3BI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"65bdbfb9cc9af8c1c6ecadbeb345507bf5b4bbd4d16948044d92c990a8cd23c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-15T22:57:46Z","title_canon_sha256":"cdefdda447006a9e19760b13aead081ec084400fef8aa1df5905a4bbe1237a92"},"schema_version":"1.0","source":{"id":"1712.05872","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05872","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05872v1","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05872","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"pith_short_12","alias_value":"OHCD3ZQQ623T","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OHCD3ZQQ623TAR4N","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OHCD3ZQQ","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:1e9a31582132898a8561213d28ab958f4942543338fdb962759f03db2a8a6f38","target":"graph","created_at":"2026-05-18T00:27:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper it is shown that the compact linearization approach, that has been previously proposed only for binary quadratic problems with assignment constraints, can be generalized to arbitrary linear equations with positive coefficients which considerably enlarges its applicability. We discuss special cases of prominent quadratic combinatorial optimization problems where the obtained compact linearization yields a continuous relaxation that is provably as least as strong as the one obtained with an ordinary linearization.","authors_text":"Sven Mallach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-15T22:57:46Z","title":"Compact Linearization for Binary Quadratic Problems subject to Linear Equations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05872","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3b4e7a0b7e416ba070dd613ef6e7b9f9337d597286615bc086e02e842943792e","target":"record","created_at":"2026-05-18T00:27:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"65bdbfb9cc9af8c1c6ecadbeb345507bf5b4bbd4d16948044d92c990a8cd23c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-15T22:57:46Z","title_canon_sha256":"cdefdda447006a9e19760b13aead081ec084400fef8aa1df5905a4bbe1237a92"},"schema_version":"1.0","source":{"id":"1712.05872","kind":"arxiv","version":1}},"canonical_sha256":"71c43de610f6b730478d902483087b0a0f8832486a2a69f3df18059afa951dec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71c43de610f6b730478d902483087b0a0f8832486a2a69f3df18059afa951dec","first_computed_at":"2026-05-18T00:27:51.686003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:51.686003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iCV7ilOMZmibTykHl1KgomKotLDV2V/JAbUPM56Al2Q4OjGS46D2fJ5SuIfG1QAP/s1RhQduvJskxlE7NFyABQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:51.686681Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.05872","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b4e7a0b7e416ba070dd613ef6e7b9f9337d597286615bc086e02e842943792e","sha256:1e9a31582132898a8561213d28ab958f4942543338fdb962759f03db2a8a6f38"],"state_sha256":"865c76a8d57a3266bdee4af9ade2c514304e9e9586bfc0243558d485f3619276"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"frTfbWj2V9JORlrpkYX5R2qsYHQUflPDA4HHHRftsUuV//FPpY/Jx9oMZAoI1S8naX2ymmqxbegZ+vui5pM5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:35:10.497308Z","bundle_sha256":"7c7e92a3f84e11676a8707edc9ab4933d2e12b008022e3ba8ac9f2bb3fef72f1"}}