{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QDM72CVEGF46VNLXEVNL6XYGWG","short_pith_number":"pith:QDM72CVE","schema_version":"1.0","canonical_sha256":"80d9fd0aa43179eab577255abf5f06b189e237e61162ea3b21b14c320f50bcf2","source":{"kind":"arxiv","id":"1212.3736","version":3},"attestation_state":"computed","paper":{"title":"The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.OC","authors_text":"Abraham P. Punnen, Daniel Karapetyan, Piyashat Sripratak","submitted_at":"2012-12-15T22:34:10Z","abstract_excerpt":"We consider the bipartite unconstrained 0-1 quadratic programming problem (BQP01) which is a generalization of the well studied unconstrained 0-1 quadratic programming problem (QP01). BQP01 has numerous applications and the problem is known to be MAX SNP hard. We show that if the rank of an associated $m\\times n$ cost matrix $Q=(q_{ij})$ is fixed, then BQP01 can be solved in polynomial time. When $Q$ is of rank one, we provide an $O(n\\log n)$ algorithm and this complexity reduces to $O(n)$ with additional assumptions. Further, if $q_{ij}=a_i+b_j$ for some $a_i$ and $b_j$, then BQP01 is shown t"},"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":"1212.3736","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-15T22:34:10Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"81b53ee06c45aa139150ac8ab4def5760a21d9ade1cb5ba511c52efe7e5026f3","abstract_canon_sha256":"2f59516bdec479fac666befc972fb9f30d4b6d1c16f6257e36fa0df695d5a095"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:15.463729Z","signature_b64":"FqlHl3ERlTBnCgrSgFUjrIzxHaAGP/nBiQaIbqLOY/YuFs1YOr/6bO9kMpjMjugqGWwIRLbE6tqXly9RoWf9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80d9fd0aa43179eab577255abf5f06b189e237e61162ea3b21b14c320f50bcf2","last_reissued_at":"2026-05-18T02:53:15.463034Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:15.463034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.OC","authors_text":"Abraham P. Punnen, Daniel Karapetyan, Piyashat Sripratak","submitted_at":"2012-12-15T22:34:10Z","abstract_excerpt":"We consider the bipartite unconstrained 0-1 quadratic programming problem (BQP01) which is a generalization of the well studied unconstrained 0-1 quadratic programming problem (QP01). BQP01 has numerous applications and the problem is known to be MAX SNP hard. We show that if the rank of an associated $m\\times n$ cost matrix $Q=(q_{ij})$ is fixed, then BQP01 can be solved in polynomial time. When $Q$ is of rank one, we provide an $O(n\\log n)$ algorithm and this complexity reduces to $O(n)$ with additional assumptions. Further, if $q_{ij}=a_i+b_j$ for some $a_i$ and $b_j$, then BQP01 is shown t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3736","kind":"arxiv","version":3},"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":"1212.3736","created_at":"2026-05-18T02:53:15.463156+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.3736v3","created_at":"2026-05-18T02:53:15.463156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3736","created_at":"2026-05-18T02:53:15.463156+00:00"},{"alias_kind":"pith_short_12","alias_value":"QDM72CVEGF46","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QDM72CVEGF46VNLX","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QDM72CVE","created_at":"2026-05-18T12:27:18.751474+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/QDM72CVEGF46VNLXEVNL6XYGWG","json":"https://pith.science/pith/QDM72CVEGF46VNLXEVNL6XYGWG.json","graph_json":"https://pith.science/api/pith-number/QDM72CVEGF46VNLXEVNL6XYGWG/graph.json","events_json":"https://pith.science/api/pith-number/QDM72CVEGF46VNLXEVNL6XYGWG/events.json","paper":"https://pith.science/paper/QDM72CVE"},"agent_actions":{"view_html":"https://pith.science/pith/QDM72CVEGF46VNLXEVNL6XYGWG","download_json":"https://pith.science/pith/QDM72CVEGF46VNLXEVNL6XYGWG.json","view_paper":"https://pith.science/paper/QDM72CVE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.3736&json=true","fetch_graph":"https://pith.science/api/pith-number/QDM72CVEGF46VNLXEVNL6XYGWG/graph.json","fetch_events":"https://pith.science/api/pith-number/QDM72CVEGF46VNLXEVNL6XYGWG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QDM72CVEGF46VNLXEVNL6XYGWG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QDM72CVEGF46VNLXEVNL6XYGWG/action/storage_attestation","attest_author":"https://pith.science/pith/QDM72CVEGF46VNLXEVNL6XYGWG/action/author_attestation","sign_citation":"https://pith.science/pith/QDM72CVEGF46VNLXEVNL6XYGWG/action/citation_signature","submit_replication":"https://pith.science/pith/QDM72CVEGF46VNLXEVNL6XYGWG/action/replication_record"}},"created_at":"2026-05-18T02:53:15.463156+00:00","updated_at":"2026-05-18T02:53:15.463156+00:00"}