{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FL7NXYAT643CNPVNWZUFZZTSLQ","short_pith_number":"pith:FL7NXYAT","schema_version":"1.0","canonical_sha256":"2afedbe013f73626beadb6685ce6725c2a588e014b65db655f1b4095a87b66b9","source":{"kind":"arxiv","id":"1210.3684","version":2},"attestation_state":"computed","paper":{"title":"Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Abraham P. Punnen, Daniel Karapetyan","submitted_at":"2012-10-13T07:43:38Z","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"},"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":"1210.3684","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-13T07:43:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4e98481fb44be273c17f61ef29fb805028fe110b9a179b582ea5ae543d2f21dc","abstract_canon_sha256":"cc39707ae74c264d395bbd452371c53477d47c17fde3ce5d8c8fa7d3890035e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:57.146427Z","signature_b64":"XmKP3tGGx2r8BRaO12ESHZw9fBWofz/ZiM5WHif3P/sWBIpZt3EBHdOEhyHaNd7+btt3ruxVsd5QdiEIH1yzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2afedbe013f73626beadb6685ce6725c2a588e014b65db655f1b4095a87b66b9","last_reissued_at":"2026-05-18T03:17:57.145812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:57.145812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Abraham P. Punnen, Daniel Karapetyan","submitted_at":"2012-10-13T07:43:38Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3684","kind":"arxiv","version":2},"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":"1210.3684","created_at":"2026-05-18T03:17:57.145912+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.3684v2","created_at":"2026-05-18T03:17:57.145912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3684","created_at":"2026-05-18T03:17:57.145912+00:00"},{"alias_kind":"pith_short_12","alias_value":"FL7NXYAT643C","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FL7NXYAT643CNPVN","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FL7NXYAT","created_at":"2026-05-18T12:27:06.952714+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/FL7NXYAT643CNPVNWZUFZZTSLQ","json":"https://pith.science/pith/FL7NXYAT643CNPVNWZUFZZTSLQ.json","graph_json":"https://pith.science/api/pith-number/FL7NXYAT643CNPVNWZUFZZTSLQ/graph.json","events_json":"https://pith.science/api/pith-number/FL7NXYAT643CNPVNWZUFZZTSLQ/events.json","paper":"https://pith.science/paper/FL7NXYAT"},"agent_actions":{"view_html":"https://pith.science/pith/FL7NXYAT643CNPVNWZUFZZTSLQ","download_json":"https://pith.science/pith/FL7NXYAT643CNPVNWZUFZZTSLQ.json","view_paper":"https://pith.science/paper/FL7NXYAT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.3684&json=true","fetch_graph":"https://pith.science/api/pith-number/FL7NXYAT643CNPVNWZUFZZTSLQ/graph.json","fetch_events":"https://pith.science/api/pith-number/FL7NXYAT643CNPVNWZUFZZTSLQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FL7NXYAT643CNPVNWZUFZZTSLQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FL7NXYAT643CNPVNWZUFZZTSLQ/action/storage_attestation","attest_author":"https://pith.science/pith/FL7NXYAT643CNPVNWZUFZZTSLQ/action/author_attestation","sign_citation":"https://pith.science/pith/FL7NXYAT643CNPVNWZUFZZTSLQ/action/citation_signature","submit_replication":"https://pith.science/pith/FL7NXYAT643CNPVNWZUFZZTSLQ/action/replication_record"}},"created_at":"2026-05-18T03:17:57.145912+00:00","updated_at":"2026-05-18T03:17:57.145912+00:00"}