{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FL7NXYAT643CNPVNWZUFZZTSLQ","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":"cc39707ae74c264d395bbd452371c53477d47c17fde3ce5d8c8fa7d3890035e5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-13T07:43:38Z","title_canon_sha256":"4e98481fb44be273c17f61ef29fb805028fe110b9a179b582ea5ae543d2f21dc"},"schema_version":"1.0","source":{"id":"1210.3684","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3684","created_at":"2026-05-18T03:17:57Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3684v2","created_at":"2026-05-18T03:17:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3684","created_at":"2026-05-18T03:17:57Z"},{"alias_kind":"pith_short_12","alias_value":"FL7NXYAT643C","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FL7NXYAT643CNPVN","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FL7NXYAT","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:28cd26f872c2c8c5e46fd378f158e179b8406e7a00b40238dcff3c7c984130b3","target":"graph","created_at":"2026-05-18T03:17:57Z","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":"We study the Bipartite Unconstrained 0-1 Quadratic Programming Problem (BQP) which is a relaxation of the Unconstrained 0-1 Quadratic Programming Problem (QP). Applications of the BQP include mining discrete patterns from binary data, approximating matrices by rank-one binary matrices, computing cut-norm of a matrix, and solving optimization problems such as maximum weight biclique, bipartite maximum weight cut, maximum weight induced subgraph of a bipartite graph, etc. We propose several classes of heuristic approaches to solve the BQP and discuss a number of construction algorithms, local se","authors_text":"Abraham P. Punnen, Daniel Karapetyan","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-13T07:43:38Z","title":"Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3684","kind":"arxiv","version":2},"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:c904f7ad0e01ed3b94a0350593da789bf0ffc149baaade3a7ef2bb03d03fcb39","target":"record","created_at":"2026-05-18T03:17:57Z","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":"cc39707ae74c264d395bbd452371c53477d47c17fde3ce5d8c8fa7d3890035e5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-13T07:43:38Z","title_canon_sha256":"4e98481fb44be273c17f61ef29fb805028fe110b9a179b582ea5ae543d2f21dc"},"schema_version":"1.0","source":{"id":"1210.3684","kind":"arxiv","version":2}},"canonical_sha256":"2afedbe013f73626beadb6685ce6725c2a588e014b65db655f1b4095a87b66b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2afedbe013f73626beadb6685ce6725c2a588e014b65db655f1b4095a87b66b9","first_computed_at":"2026-05-18T03:17:57.145812Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:57.145812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XmKP3tGGx2r8BRaO12ESHZw9fBWofz/ZiM5WHif3P/sWBIpZt3EBHdOEhyHaNd7+btt3ruxVsd5QdiEIH1yzBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:57.146427Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.3684","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c904f7ad0e01ed3b94a0350593da789bf0ffc149baaade3a7ef2bb03d03fcb39","sha256:28cd26f872c2c8c5e46fd378f158e179b8406e7a00b40238dcff3c7c984130b3"],"state_sha256":"8f082bd9933132d1f699062f59bc6e0957e199c816bfb7b5a86b0e9219e4e42c"}