{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CTG7VIJIRWHNQQOLNAYDE3UCR3","short_pith_number":"pith:CTG7VIJI","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"},"canonical_sha256":"14cdfaa1288d8ed841cb6830326e828ed9bd434286736e204469c1a547561e8d","source":{"kind":"arxiv","id":"1705.07338","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07338","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07338v1","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07338","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"CTG7VIJIRWHN","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CTG7VIJIRWHNQQOL","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CTG7VIJI","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CTG7VIJIRWHNQQOLNAYDE3UCR3","target":"record","payload":{"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"},"canonical_sha256":"14cdfaa1288d8ed841cb6830326e828ed9bd434286736e204469c1a547561e8d","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"},"source_kind":"arxiv","source_id":"1705.07338","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:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9pDxKlf7woXNkpBC8W3pPoZc5hUn30loDHWvewAzg+HPDEayMorTpXVGZPKMmQDk5tFcs85WAkruaRC1mZaGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:38:35.467497Z"},"content_sha256":"c524e4f1f9e95b71497357b3ef6628d2575bc8c6dcfb41f7f76bea9d6e59e4de","schema_version":"1.0","event_id":"sha256:c524e4f1f9e95b71497357b3ef6628d2575bc8c6dcfb41f7f76bea9d6e59e4de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CTG7VIJIRWHNQQOLNAYDE3UCR3","target":"graph","payload":{"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"},"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:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KUqB2wb1bSOJsvDnvlNsuD5H+N+LpOjdOd3ZDlqW76efhumiZFScHbjoN4CUmVukHmutyrTFYZnJ4VRY9orHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:38:35.467853Z"},"content_sha256":"c5854dec6191f90c89d89ce6260109fff89ee8b346f3bb18094d5027fa883eda","schema_version":"1.0","event_id":"sha256:c5854dec6191f90c89d89ce6260109fff89ee8b346f3bb18094d5027fa883eda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CTG7VIJIRWHNQQOLNAYDE3UCR3/bundle.json","state_url":"https://pith.science/pith/CTG7VIJIRWHNQQOLNAYDE3UCR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CTG7VIJIRWHNQQOLNAYDE3UCR3/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-01T21:38:35Z","links":{"resolver":"https://pith.science/pith/CTG7VIJIRWHNQQOLNAYDE3UCR3","bundle":"https://pith.science/pith/CTG7VIJIRWHNQQOLNAYDE3UCR3/bundle.json","state":"https://pith.science/pith/CTG7VIJIRWHNQQOLNAYDE3UCR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CTG7VIJIRWHNQQOLNAYDE3UCR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CTG7VIJIRWHNQQOLNAYDE3UCR3","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":"d5e5eeda6a8e23892b205c463b9b17acdd984f2f2ebe226483b4d4a5893f6e9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-20T17:41:27Z","title_canon_sha256":"1ccd6fa298e981201f6e76dff0f6f0cfae0344f5cb1c4cab8acb4663d79e1f58"},"schema_version":"1.0","source":{"id":"1705.07338","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07338","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07338v1","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07338","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"CTG7VIJIRWHN","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CTG7VIJIRWHNQQOL","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CTG7VIJI","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:c5854dec6191f90c89d89ce6260109fff89ee8b346f3bb18094d5027fa883eda","target":"graph","created_at":"2026-05-18T00:44:05Z","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":"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","authors_text":"Andr\\'e Rossi, Jin-Kao Hao, Yi Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-20T17:41:27Z","title":"Towards Effective Exact Algorithms for the Maximum Balanced Biclique Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07338","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:c524e4f1f9e95b71497357b3ef6628d2575bc8c6dcfb41f7f76bea9d6e59e4de","target":"record","created_at":"2026-05-18T00:44:05Z","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":"d5e5eeda6a8e23892b205c463b9b17acdd984f2f2ebe226483b4d4a5893f6e9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-20T17:41:27Z","title_canon_sha256":"1ccd6fa298e981201f6e76dff0f6f0cfae0344f5cb1c4cab8acb4663d79e1f58"},"schema_version":"1.0","source":{"id":"1705.07338","kind":"arxiv","version":1}},"canonical_sha256":"14cdfaa1288d8ed841cb6830326e828ed9bd434286736e204469c1a547561e8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14cdfaa1288d8ed841cb6830326e828ed9bd434286736e204469c1a547561e8d","first_computed_at":"2026-05-18T00:44:05.881750Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:05.881750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ekKOFCMFP4c+Dbmu8m3xZgF9jjAsScu9FDL6UF+eC2tnO3LiCFYMepo+e/hvDZf9L9XWtR4X3sQjytfrSJpBAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:05.882293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07338","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c524e4f1f9e95b71497357b3ef6628d2575bc8c6dcfb41f7f76bea9d6e59e4de","sha256:c5854dec6191f90c89d89ce6260109fff89ee8b346f3bb18094d5027fa883eda"],"state_sha256":"b866385f948944b984520437ee667886d37ca95f6238eef5bdf8bb7f52fa4b49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wn0l79aV/lFq55qKHyM2RD6nUhoGjzZMk+zkz4ZfNqr2wIEZGnKn8RSKvUnBYlziUQFGbV8XazqiTIh1lCZOCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:38:35.469817Z","bundle_sha256":"6965a6f58c9a41adcbc99a3098d0e8b63375ce3d8b479c281a7060ac15767938"}}