{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:B5GFLYMX2ROGZ5ZFTGS7BE3BPI","short_pith_number":"pith:B5GFLYMX","schema_version":"1.0","canonical_sha256":"0f4c55e197d45c6cf72599a5f093617a374346d4afd60e6cdbe7a1b08340f97c","source":{"kind":"arxiv","id":"2208.00345","version":1},"attestation_state":"computed","paper":{"title":"Solving sparse separable bilinear programs using lifted bilinear cover inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jean-Philippe P. Richard, Santanu S. Dey, Xiaoyi Gu","submitted_at":"2022-07-31T02:43:27Z","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"},"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":"2208.00345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-31T02:43:27Z","cross_cats_sorted":[],"title_canon_sha256":"78a7f8bcb8449700d0822391876fd8009d3c7c29875ab8e5b8b9b7a2d91e08c2","abstract_canon_sha256":"978a9c1e73709ebeae1f37f0a11c234f710d4525605953f4715a4a112891c59e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:44:50.372956Z","signature_b64":"gNu8vC70xmfa9BsCPPv2ZRBDOmERbqwY0P1X22AdXYyjJb44owTBPjAZ7kgXaF+4zoJpVVUfnIERMd2r9TN+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f4c55e197d45c6cf72599a5f093617a374346d4afd60e6cdbe7a1b08340f97c","last_reissued_at":"2026-07-05T04:44:50.372559Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:44:50.372559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving sparse separable bilinear programs using lifted bilinear cover inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jean-Philippe P. Richard, Santanu S. Dey, Xiaoyi Gu","submitted_at":"2022-07-31T02:43:27Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.00345","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.00345/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2208.00345","created_at":"2026-07-05T04:44:50.372615+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.00345v1","created_at":"2026-07-05T04:44:50.372615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.00345","created_at":"2026-07-05T04:44:50.372615+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5GFLYMX2ROG","created_at":"2026-07-05T04:44:50.372615+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5GFLYMX2ROGZ5ZF","created_at":"2026-07-05T04:44:50.372615+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5GFLYMX","created_at":"2026-07-05T04:44:50.372615+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/B5GFLYMX2ROGZ5ZFTGS7BE3BPI","json":"https://pith.science/pith/B5GFLYMX2ROGZ5ZFTGS7BE3BPI.json","graph_json":"https://pith.science/api/pith-number/B5GFLYMX2ROGZ5ZFTGS7BE3BPI/graph.json","events_json":"https://pith.science/api/pith-number/B5GFLYMX2ROGZ5ZFTGS7BE3BPI/events.json","paper":"https://pith.science/paper/B5GFLYMX"},"agent_actions":{"view_html":"https://pith.science/pith/B5GFLYMX2ROGZ5ZFTGS7BE3BPI","download_json":"https://pith.science/pith/B5GFLYMX2ROGZ5ZFTGS7BE3BPI.json","view_paper":"https://pith.science/paper/B5GFLYMX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.00345&json=true","fetch_graph":"https://pith.science/api/pith-number/B5GFLYMX2ROGZ5ZFTGS7BE3BPI/graph.json","fetch_events":"https://pith.science/api/pith-number/B5GFLYMX2ROGZ5ZFTGS7BE3BPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5GFLYMX2ROGZ5ZFTGS7BE3BPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5GFLYMX2ROGZ5ZFTGS7BE3BPI/action/storage_attestation","attest_author":"https://pith.science/pith/B5GFLYMX2ROGZ5ZFTGS7BE3BPI/action/author_attestation","sign_citation":"https://pith.science/pith/B5GFLYMX2ROGZ5ZFTGS7BE3BPI/action/citation_signature","submit_replication":"https://pith.science/pith/B5GFLYMX2ROGZ5ZFTGS7BE3BPI/action/replication_record"}},"created_at":"2026-07-05T04:44:50.372615+00:00","updated_at":"2026-07-05T04:44:50.372615+00:00"}