{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:B5GFLYMX2ROGZ5ZFTGS7BE3BPI","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":"978a9c1e73709ebeae1f37f0a11c234f710d4525605953f4715a4a112891c59e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-31T02:43:27Z","title_canon_sha256":"78a7f8bcb8449700d0822391876fd8009d3c7c29875ab8e5b8b9b7a2d91e08c2"},"schema_version":"1.0","source":{"id":"2208.00345","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.00345","created_at":"2026-07-05T04:44:50Z"},{"alias_kind":"arxiv_version","alias_value":"2208.00345v1","created_at":"2026-07-05T04:44:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.00345","created_at":"2026-07-05T04:44:50Z"},{"alias_kind":"pith_short_12","alias_value":"B5GFLYMX2ROG","created_at":"2026-07-05T04:44:50Z"},{"alias_kind":"pith_short_16","alias_value":"B5GFLYMX2ROGZ5ZF","created_at":"2026-07-05T04:44:50Z"},{"alias_kind":"pith_short_8","alias_value":"B5GFLYMX","created_at":"2026-07-05T04:44:50Z"}],"graph_snapshots":[{"event_id":"sha256:0e12d0819c816fce289975d178ab073a6f39e51231c3cd02e37d4a379cd48020","target":"graph","created_at":"2026-07-05T04:44:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2208.00345/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recently, we proposed a class of inequalities called lifted bilinear cover inequalities, which are second-order cone representable convex inequalities, and are valid for a set described by a separable bilinear constraint together with bounds on variables. In this paper, we study the computational potential of these inequalities for separable bilinear optimization problems. We first prove that the semi-definite programming relaxation provides no benefit over the McCormick relaxation for such problems. We then design a simple randomized separation heuristic for lifted bilinear cover inequalities","authors_text":"Jean-Philippe P. Richard, Santanu S. Dey, Xiaoyi Gu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-31T02:43:27Z","title":"Solving sparse separable bilinear programs using lifted bilinear cover inequalities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.00345","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:acff04a3154b01b2d2ea80d92efd0c1d368b19c96570d691808871e37a1c5d32","target":"record","created_at":"2026-07-05T04:44:50Z","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":"978a9c1e73709ebeae1f37f0a11c234f710d4525605953f4715a4a112891c59e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-31T02:43:27Z","title_canon_sha256":"78a7f8bcb8449700d0822391876fd8009d3c7c29875ab8e5b8b9b7a2d91e08c2"},"schema_version":"1.0","source":{"id":"2208.00345","kind":"arxiv","version":1}},"canonical_sha256":"0f4c55e197d45c6cf72599a5f093617a374346d4afd60e6cdbe7a1b08340f97c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f4c55e197d45c6cf72599a5f093617a374346d4afd60e6cdbe7a1b08340f97c","first_computed_at":"2026-07-05T04:44:50.372559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:44:50.372559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gNu8vC70xmfa9BsCPPv2ZRBDOmERbqwY0P1X22AdXYyjJb44owTBPjAZ7kgXaF+4zoJpVVUfnIERMd2r9TN+DA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:44:50.372956Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.00345","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acff04a3154b01b2d2ea80d92efd0c1d368b19c96570d691808871e37a1c5d32","sha256:0e12d0819c816fce289975d178ab073a6f39e51231c3cd02e37d4a379cd48020"],"state_sha256":"791878e03554545c32c6ce232664fe3c49597b84a3e88fcb05f10a39d1b5182d"}