{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MWP2FJ3TLIXALSAWMVFULSQOAN","short_pith_number":"pith:MWP2FJ3T","canonical_record":{"source":{"id":"1705.07339","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-20T17:47:31Z","cross_cats_sorted":[],"title_canon_sha256":"320f5f29800e18c068d45d986ba87603d9998d46e7990bd1e4ad51e4d17c6182","abstract_canon_sha256":"f187a7b269a3baa8fb5c81aa963ea660e34789ddda4823ed54e55f41c651fabb"},"schema_version":"1.0"},"canonical_sha256":"659fa2a7735a2e05c816654b45ca0e03438b86cca081a872d766b3c6216673ad","source":{"kind":"arxiv","id":"1705.07339","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07339","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07339v1","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07339","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"MWP2FJ3TLIXA","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MWP2FJ3TLIXALSAW","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MWP2FJ3T","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MWP2FJ3TLIXALSAWMVFULSQOAN","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07339","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-20T17:47:31Z","cross_cats_sorted":[],"title_canon_sha256":"320f5f29800e18c068d45d986ba87603d9998d46e7990bd1e4ad51e4d17c6182","abstract_canon_sha256":"f187a7b269a3baa8fb5c81aa963ea660e34789ddda4823ed54e55f41c651fabb"},"schema_version":"1.0"},"canonical_sha256":"659fa2a7735a2e05c816654b45ca0e03438b86cca081a872d766b3c6216673ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:05.874745Z","signature_b64":"OoZBaHsK9i22Mn6cvo0I6b22fKQ87tD/S+Ih6NVuNlvyKutssAZXl1nYGvwBUV9kxHAVRtLTlpWBPDKS8kTbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"659fa2a7735a2e05c816654b45ca0e03438b86cca081a872d766b3c6216673ad","last_reissued_at":"2026-05-18T00:44:05.874281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:05.874281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07339","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":"F6PSXf7JtGw1T1ldayIB/4vIxiRCqbmYTt2QzFjkwXf9D3qbt8vE2bNGH/mN8vzXBTIGOXTlGCbtTir3P8i2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:47:37.546579Z"},"content_sha256":"d07f102092829261ce01feddc3d03091d51f575b8bbbfb7f74557d4de73b1691","schema_version":"1.0","event_id":"sha256:d07f102092829261ce01feddc3d03091d51f575b8bbbfb7f74557d4de73b1691"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MWP2FJ3TLIXALSAWMVFULSQOAN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combining tabu search and graph reduction to solve the maximum balanced biclique problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jin-Kao Hao, Yi Zhou","submitted_at":"2017-05-20T17:47:31Z","abstract_excerpt":"The Maximum Balanced Biclique Problem is a well-known graph model with relevant applications in diverse domains. This paper introduces a novel algorithm, which combines an effective constraint-based tabu search procedure and two dedicated graph reduction techniques. We verify the effectiveness of the algorithm on 30 classical random benchmark graphs and 25 very large real-life sparse graphs from the popular Koblenz Network Collection (KONECT). The results show that the algorithm improves the best-known results (new lower bounds) for 10 classical benchmarks and obtains the optimal solutions for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07339","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":"Wgr/b6LJGVyfOGfc7ZHjSMWwxX5j/N0RzdQW1awbYtKgN03VlgZ1NSD8q2/yjlf7nYcr3RqjyAV4C93Bz05LAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:47:37.546925Z"},"content_sha256":"5a909f5e512eade500634724c09e6b091da87f8e3fb4472b132ce49eee7585a0","schema_version":"1.0","event_id":"sha256:5a909f5e512eade500634724c09e6b091da87f8e3fb4472b132ce49eee7585a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MWP2FJ3TLIXALSAWMVFULSQOAN/bundle.json","state_url":"https://pith.science/pith/MWP2FJ3TLIXALSAWMVFULSQOAN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MWP2FJ3TLIXALSAWMVFULSQOAN/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-03T17:47:37Z","links":{"resolver":"https://pith.science/pith/MWP2FJ3TLIXALSAWMVFULSQOAN","bundle":"https://pith.science/pith/MWP2FJ3TLIXALSAWMVFULSQOAN/bundle.json","state":"https://pith.science/pith/MWP2FJ3TLIXALSAWMVFULSQOAN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MWP2FJ3TLIXALSAWMVFULSQOAN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MWP2FJ3TLIXALSAWMVFULSQOAN","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":"f187a7b269a3baa8fb5c81aa963ea660e34789ddda4823ed54e55f41c651fabb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-20T17:47:31Z","title_canon_sha256":"320f5f29800e18c068d45d986ba87603d9998d46e7990bd1e4ad51e4d17c6182"},"schema_version":"1.0","source":{"id":"1705.07339","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07339","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07339v1","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07339","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"MWP2FJ3TLIXA","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MWP2FJ3TLIXALSAW","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MWP2FJ3T","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:5a909f5e512eade500634724c09e6b091da87f8e3fb4472b132ce49eee7585a0","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 is a well-known graph model with relevant applications in diverse domains. This paper introduces a novel algorithm, which combines an effective constraint-based tabu search procedure and two dedicated graph reduction techniques. We verify the effectiveness of the algorithm on 30 classical random benchmark graphs and 25 very large real-life sparse graphs from the popular Koblenz Network Collection (KONECT). The results show that the algorithm improves the best-known results (new lower bounds) for 10 classical benchmarks and obtains the optimal solutions for","authors_text":"Jin-Kao Hao, Yi Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-20T17:47:31Z","title":"Combining tabu search and graph reduction to solve the maximum balanced biclique problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07339","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:d07f102092829261ce01feddc3d03091d51f575b8bbbfb7f74557d4de73b1691","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":"f187a7b269a3baa8fb5c81aa963ea660e34789ddda4823ed54e55f41c651fabb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-20T17:47:31Z","title_canon_sha256":"320f5f29800e18c068d45d986ba87603d9998d46e7990bd1e4ad51e4d17c6182"},"schema_version":"1.0","source":{"id":"1705.07339","kind":"arxiv","version":1}},"canonical_sha256":"659fa2a7735a2e05c816654b45ca0e03438b86cca081a872d766b3c6216673ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"659fa2a7735a2e05c816654b45ca0e03438b86cca081a872d766b3c6216673ad","first_computed_at":"2026-05-18T00:44:05.874281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:05.874281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OoZBaHsK9i22Mn6cvo0I6b22fKQ87tD/S+Ih6NVuNlvyKutssAZXl1nYGvwBUV9kxHAVRtLTlpWBPDKS8kTbCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:05.874745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07339","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d07f102092829261ce01feddc3d03091d51f575b8bbbfb7f74557d4de73b1691","sha256:5a909f5e512eade500634724c09e6b091da87f8e3fb4472b132ce49eee7585a0"],"state_sha256":"4c077425084df0dd9ae4705b758300b31bb6bec867a1acc3de2aa66576a3c51a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bpidgOBD40lIq3vWCyK0IU33e0fD4HFycfC7iWaeXQZ1wLo+PimgOX8abRg8LZ5668VhyPZxRHZ14GURW9JECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:47:37.548980Z","bundle_sha256":"1235c34891a009c05c0ad28beb1a55410e3edc213f0198435031b9691f681985"}}