{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YYCQIJX4QQ5DUCAMBURYMCKA3Q","short_pith_number":"pith:YYCQIJX4","schema_version":"1.0","canonical_sha256":"c6050426fc843a3a080c0d23860940dc13ae753127ef9ad12bcaf1348cbbe9f5","source":{"kind":"arxiv","id":"1605.02038","version":2},"attestation_state":"computed","paper":{"title":"Markov Chain methods for the bipartite Boolean quadratic programming problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Abraham P. Punnen, Andrew J. Parkes, Daniel Karapetyan","submitted_at":"2016-05-06T19:06:56Z","abstract_excerpt":"We study the Bipartite Boolean Quadratic Programming Problem (BBQP) which is an extension of the well known Boolean Quadratic Programming Problem (BQP). Applications of the BBQP include mining discrete patterns from binary data, approximating matrices by rank-one binary matrices, computing the cut-norm of a matrix, and solving optimisation problems such as maximum weight biclique, bipartite maximum weight cut, maximum weight induced sub-graph of a bipartite graph, etc. For the BBQP, we first present several algorithmic components, specifically, hill climbers and mutations, and then show how to"},"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":"1605.02038","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-06T19:06:56Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"590fcf6770464cf9131e5f504a620b6debb4b79ccbf1eddf4ede7727400538cc","abstract_canon_sha256":"3433440d3ad218d2b0fbe6c147d8f7b634ba3040f1c4db674442e1648b7bb047"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:31.099490Z","signature_b64":"hZm208gkzH7ucJyLnpkJMxBpHQ3MaScKJDhub3qTXXuBpX18fndOtH7C17N4xQESPZiVViFeascrosNl3TRHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6050426fc843a3a080c0d23860940dc13ae753127ef9ad12bcaf1348cbbe9f5","last_reissued_at":"2026-05-18T01:01:31.099029Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:31.099029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Markov Chain methods for the bipartite Boolean quadratic programming problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Abraham P. Punnen, Andrew J. Parkes, Daniel Karapetyan","submitted_at":"2016-05-06T19:06:56Z","abstract_excerpt":"We study the Bipartite Boolean Quadratic Programming Problem (BBQP) which is an extension of the well known Boolean Quadratic Programming Problem (BQP). Applications of the BBQP include mining discrete patterns from binary data, approximating matrices by rank-one binary matrices, computing the cut-norm of a matrix, and solving optimisation problems such as maximum weight biclique, bipartite maximum weight cut, maximum weight induced sub-graph of a bipartite graph, etc. For the BBQP, we first present several algorithmic components, specifically, hill climbers and mutations, and then show how to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02038","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":"1605.02038","created_at":"2026-05-18T01:01:31.099096+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.02038v2","created_at":"2026-05-18T01:01:31.099096+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02038","created_at":"2026-05-18T01:01:31.099096+00:00"},{"alias_kind":"pith_short_12","alias_value":"YYCQIJX4QQ5D","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YYCQIJX4QQ5DUCAM","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YYCQIJX4","created_at":"2026-05-18T12:30:53.716459+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/YYCQIJX4QQ5DUCAMBURYMCKA3Q","json":"https://pith.science/pith/YYCQIJX4QQ5DUCAMBURYMCKA3Q.json","graph_json":"https://pith.science/api/pith-number/YYCQIJX4QQ5DUCAMBURYMCKA3Q/graph.json","events_json":"https://pith.science/api/pith-number/YYCQIJX4QQ5DUCAMBURYMCKA3Q/events.json","paper":"https://pith.science/paper/YYCQIJX4"},"agent_actions":{"view_html":"https://pith.science/pith/YYCQIJX4QQ5DUCAMBURYMCKA3Q","download_json":"https://pith.science/pith/YYCQIJX4QQ5DUCAMBURYMCKA3Q.json","view_paper":"https://pith.science/paper/YYCQIJX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.02038&json=true","fetch_graph":"https://pith.science/api/pith-number/YYCQIJX4QQ5DUCAMBURYMCKA3Q/graph.json","fetch_events":"https://pith.science/api/pith-number/YYCQIJX4QQ5DUCAMBURYMCKA3Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YYCQIJX4QQ5DUCAMBURYMCKA3Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YYCQIJX4QQ5DUCAMBURYMCKA3Q/action/storage_attestation","attest_author":"https://pith.science/pith/YYCQIJX4QQ5DUCAMBURYMCKA3Q/action/author_attestation","sign_citation":"https://pith.science/pith/YYCQIJX4QQ5DUCAMBURYMCKA3Q/action/citation_signature","submit_replication":"https://pith.science/pith/YYCQIJX4QQ5DUCAMBURYMCKA3Q/action/replication_record"}},"created_at":"2026-05-18T01:01:31.099096+00:00","updated_at":"2026-05-18T01:01:31.099096+00:00"}