{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RFDL5MKWLDJFU3DVL2HR2EV776","short_pith_number":"pith:RFDL5MKW","schema_version":"1.0","canonical_sha256":"8946beb15658d25a6c755e8f1d12bfff965af4de2b19843dd6fe849d6e8fa118","source":{"kind":"arxiv","id":"1803.09266","version":1},"attestation_state":"computed","paper":{"title":"New SOCP relaxation and branching rule for bipartite bilinear programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Asteroide Santana, Santanu S. Dey, Yang Wang","submitted_at":"2018-03-25T14:38:46Z","abstract_excerpt":"A bipartite bilinear program (BBP) is a quadratically constrained quadratic optimization problem where the variables can be partitioned into two sets such that fixing the variables in any one of the sets results in a linear program. We propose a new second order cone representable (SOCP) relaxation for BBP, which we show is stronger than the standard SDP relaxation intersected with the boolean quadratic polytope. We then propose a new branching rule inspired by the construction of the SOCP relaxation. We describe a new application of BBP called as the finite element model updating problem, whi"},"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":"1803.09266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-25T14:38:46Z","cross_cats_sorted":[],"title_canon_sha256":"7d60c6ba677941209fcdc0452eeb3fbed0b2827db58a20a40308391507359992","abstract_canon_sha256":"20f4a00ee0c9b9fdd56b557f293a766dc69c010b8917e5171d5c14b911388a2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:12.134569Z","signature_b64":"COo7JtFGcWXWneaIFEBjU87iGKs4Ly0eODpYxUYnbhjsU8wWht5bEsk3iFurSoTC0eDXddOF9uwYQjqEOhrfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8946beb15658d25a6c755e8f1d12bfff965af4de2b19843dd6fe849d6e8fa118","last_reissued_at":"2026-05-18T00:20:12.133958Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:12.133958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New SOCP relaxation and branching rule for bipartite bilinear programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Asteroide Santana, Santanu S. Dey, Yang Wang","submitted_at":"2018-03-25T14:38:46Z","abstract_excerpt":"A bipartite bilinear program (BBP) is a quadratically constrained quadratic optimization problem where the variables can be partitioned into two sets such that fixing the variables in any one of the sets results in a linear program. We propose a new second order cone representable (SOCP) relaxation for BBP, which we show is stronger than the standard SDP relaxation intersected with the boolean quadratic polytope. We then propose a new branching rule inspired by the construction of the SOCP relaxation. We describe a new application of BBP called as the finite element model updating problem, whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09266","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":"1803.09266","created_at":"2026-05-18T00:20:12.134043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.09266v1","created_at":"2026-05-18T00:20:12.134043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09266","created_at":"2026-05-18T00:20:12.134043+00:00"},{"alias_kind":"pith_short_12","alias_value":"RFDL5MKWLDJF","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RFDL5MKWLDJFU3DV","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RFDL5MKW","created_at":"2026-05-18T12:32:50.500415+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/RFDL5MKWLDJFU3DVL2HR2EV776","json":"https://pith.science/pith/RFDL5MKWLDJFU3DVL2HR2EV776.json","graph_json":"https://pith.science/api/pith-number/RFDL5MKWLDJFU3DVL2HR2EV776/graph.json","events_json":"https://pith.science/api/pith-number/RFDL5MKWLDJFU3DVL2HR2EV776/events.json","paper":"https://pith.science/paper/RFDL5MKW"},"agent_actions":{"view_html":"https://pith.science/pith/RFDL5MKWLDJFU3DVL2HR2EV776","download_json":"https://pith.science/pith/RFDL5MKWLDJFU3DVL2HR2EV776.json","view_paper":"https://pith.science/paper/RFDL5MKW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.09266&json=true","fetch_graph":"https://pith.science/api/pith-number/RFDL5MKWLDJFU3DVL2HR2EV776/graph.json","fetch_events":"https://pith.science/api/pith-number/RFDL5MKWLDJFU3DVL2HR2EV776/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RFDL5MKWLDJFU3DVL2HR2EV776/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RFDL5MKWLDJFU3DVL2HR2EV776/action/storage_attestation","attest_author":"https://pith.science/pith/RFDL5MKWLDJFU3DVL2HR2EV776/action/author_attestation","sign_citation":"https://pith.science/pith/RFDL5MKWLDJFU3DVL2HR2EV776/action/citation_signature","submit_replication":"https://pith.science/pith/RFDL5MKWLDJFU3DVL2HR2EV776/action/replication_record"}},"created_at":"2026-05-18T00:20:12.134043+00:00","updated_at":"2026-05-18T00:20:12.134043+00:00"}