{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CTG7VIJIRWHNQQOLNAYDE3UCR3","short_pith_number":"pith:CTG7VIJI","schema_version":"1.0","canonical_sha256":"14cdfaa1288d8ed841cb6830326e828ed9bd434286736e204469c1a547561e8d","source":{"kind":"arxiv","id":"1705.07338","version":1},"attestation_state":"computed","paper":{"title":"Towards Effective Exact Algorithms for the Maximum Balanced Biclique Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andr\\'e Rossi, Jin-Kao Hao, Yi Zhou","submitted_at":"2017-05-20T17:41:27Z","abstract_excerpt":"The Maximum Balanced Biclique Problem (MBBP) is a prominent model with numerous applications. Yet, the problem is NP-hard and thus computationally challenging. We propose novel ideas for designing effective exact algorithms for MBBP. Firstly, we introduce an Upper Bound Propagation procedure to pre-compute an upper bound involving each vertex. Then we extend an existing branch-and-bound algorithm by integrating the pre-computed upper bounds. We also present a set of new valid inequalities induced from the upper bounds to tighten an existing mathematical formulation for MBBP. Lastly, we investi"},"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":"1705.07338","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-20T17:41:27Z","cross_cats_sorted":[],"title_canon_sha256":"1ccd6fa298e981201f6e76dff0f6f0cfae0344f5cb1c4cab8acb4663d79e1f58","abstract_canon_sha256":"d5e5eeda6a8e23892b205c463b9b17acdd984f2f2ebe226483b4d4a5893f6e9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:05.882293Z","signature_b64":"ekKOFCMFP4c+Dbmu8m3xZgF9jjAsScu9FDL6UF+eC2tnO3LiCFYMepo+e/hvDZf9L9XWtR4X3sQjytfrSJpBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14cdfaa1288d8ed841cb6830326e828ed9bd434286736e204469c1a547561e8d","last_reissued_at":"2026-05-18T00:44:05.881750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:05.881750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Effective Exact Algorithms for the Maximum Balanced Biclique Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andr\\'e Rossi, Jin-Kao Hao, Yi Zhou","submitted_at":"2017-05-20T17:41:27Z","abstract_excerpt":"The Maximum Balanced Biclique Problem (MBBP) is a prominent model with numerous applications. Yet, the problem is NP-hard and thus computationally challenging. We propose novel ideas for designing effective exact algorithms for MBBP. Firstly, we introduce an Upper Bound Propagation procedure to pre-compute an upper bound involving each vertex. Then we extend an existing branch-and-bound algorithm by integrating the pre-computed upper bounds. We also present a set of new valid inequalities induced from the upper bounds to tighten an existing mathematical formulation for MBBP. Lastly, we investi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07338","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":"1705.07338","created_at":"2026-05-18T00:44:05.881838+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07338v1","created_at":"2026-05-18T00:44:05.881838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07338","created_at":"2026-05-18T00:44:05.881838+00:00"},{"alias_kind":"pith_short_12","alias_value":"CTG7VIJIRWHN","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CTG7VIJIRWHNQQOL","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CTG7VIJI","created_at":"2026-05-18T12:31:10.602751+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/CTG7VIJIRWHNQQOLNAYDE3UCR3","json":"https://pith.science/pith/CTG7VIJIRWHNQQOLNAYDE3UCR3.json","graph_json":"https://pith.science/api/pith-number/CTG7VIJIRWHNQQOLNAYDE3UCR3/graph.json","events_json":"https://pith.science/api/pith-number/CTG7VIJIRWHNQQOLNAYDE3UCR3/events.json","paper":"https://pith.science/paper/CTG7VIJI"},"agent_actions":{"view_html":"https://pith.science/pith/CTG7VIJIRWHNQQOLNAYDE3UCR3","download_json":"https://pith.science/pith/CTG7VIJIRWHNQQOLNAYDE3UCR3.json","view_paper":"https://pith.science/paper/CTG7VIJI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07338&json=true","fetch_graph":"https://pith.science/api/pith-number/CTG7VIJIRWHNQQOLNAYDE3UCR3/graph.json","fetch_events":"https://pith.science/api/pith-number/CTG7VIJIRWHNQQOLNAYDE3UCR3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CTG7VIJIRWHNQQOLNAYDE3UCR3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CTG7VIJIRWHNQQOLNAYDE3UCR3/action/storage_attestation","attest_author":"https://pith.science/pith/CTG7VIJIRWHNQQOLNAYDE3UCR3/action/author_attestation","sign_citation":"https://pith.science/pith/CTG7VIJIRWHNQQOLNAYDE3UCR3/action/citation_signature","submit_replication":"https://pith.science/pith/CTG7VIJIRWHNQQOLNAYDE3UCR3/action/replication_record"}},"created_at":"2026-05-18T00:44:05.881838+00:00","updated_at":"2026-05-18T00:44:05.881838+00:00"}