{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QDM72CVEGF46VNLXEVNL6XYGWG","short_pith_number":"pith:QDM72CVE","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"},"canonical_sha256":"80d9fd0aa43179eab577255abf5f06b189e237e61162ea3b21b14c320f50bcf2","source":{"kind":"arxiv","id":"1212.3736","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3736","created_at":"2026-05-18T02:53:15Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3736v3","created_at":"2026-05-18T02:53:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3736","created_at":"2026-05-18T02:53:15Z"},{"alias_kind":"pith_short_12","alias_value":"QDM72CVEGF46","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QDM72CVEGF46VNLX","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QDM72CVE","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QDM72CVEGF46VNLXEVNL6XYGWG","target":"record","payload":{"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"},"canonical_sha256":"80d9fd0aa43179eab577255abf5f06b189e237e61162ea3b21b14c320f50bcf2","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"},"source_kind":"arxiv","source_id":"1212.3736","source_version":3,"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-18T02:53:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y9HmBCgVPwHsbfWGsoyn7rYU2IIimNmgi3Pfl4Ghj9wKUs57zSGI5qqtWeciffssv2JNaIXKxzlPGSq8cYz1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:04:08.446568Z"},"content_sha256":"8ae2f71cbcb5d9eb0a5974d7af9653bd42d684725c075bd9c302288e39a25b0c","schema_version":"1.0","event_id":"sha256:8ae2f71cbcb5d9eb0a5974d7af9653bd42d684725c075bd9c302288e39a25b0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QDM72CVEGF46VNLXEVNL6XYGWG","target":"graph","payload":{"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"},"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-18T02:53:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n+NEnbvlQcjp4ZvyhGSmCGuN7w4t4XJA9pee9l1D26HM0hT9nfLvxWCasGsYR3DFsjUlQVCrP70x3OghakJlCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:04:08.446918Z"},"content_sha256":"a63def1baa6e4987c7225e9fa866264efd0a751b59b8d8b8f61a67c12a6ea6d3","schema_version":"1.0","event_id":"sha256:a63def1baa6e4987c7225e9fa866264efd0a751b59b8d8b8f61a67c12a6ea6d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QDM72CVEGF46VNLXEVNL6XYGWG/bundle.json","state_url":"https://pith.science/pith/QDM72CVEGF46VNLXEVNL6XYGWG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QDM72CVEGF46VNLXEVNL6XYGWG/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-05T06:04:08Z","links":{"resolver":"https://pith.science/pith/QDM72CVEGF46VNLXEVNL6XYGWG","bundle":"https://pith.science/pith/QDM72CVEGF46VNLXEVNL6XYGWG/bundle.json","state":"https://pith.science/pith/QDM72CVEGF46VNLXEVNL6XYGWG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QDM72CVEGF46VNLXEVNL6XYGWG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QDM72CVEGF46VNLXEVNL6XYGWG","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":"2f59516bdec479fac666befc972fb9f30d4b6d1c16f6257e36fa0df695d5a095","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-15T22:34:10Z","title_canon_sha256":"81b53ee06c45aa139150ac8ab4def5760a21d9ade1cb5ba511c52efe7e5026f3"},"schema_version":"1.0","source":{"id":"1212.3736","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3736","created_at":"2026-05-18T02:53:15Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3736v3","created_at":"2026-05-18T02:53:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3736","created_at":"2026-05-18T02:53:15Z"},{"alias_kind":"pith_short_12","alias_value":"QDM72CVEGF46","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QDM72CVEGF46VNLX","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QDM72CVE","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:a63def1baa6e4987c7225e9fa866264efd0a751b59b8d8b8f61a67c12a6ea6d3","target":"graph","created_at":"2026-05-18T02:53:15Z","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 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","authors_text":"Abraham P. Punnen, Daniel Karapetyan, Piyashat Sripratak","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-15T22:34:10Z","title":"The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3736","kind":"arxiv","version":3},"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:8ae2f71cbcb5d9eb0a5974d7af9653bd42d684725c075bd9c302288e39a25b0c","target":"record","created_at":"2026-05-18T02:53:15Z","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":"2f59516bdec479fac666befc972fb9f30d4b6d1c16f6257e36fa0df695d5a095","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-15T22:34:10Z","title_canon_sha256":"81b53ee06c45aa139150ac8ab4def5760a21d9ade1cb5ba511c52efe7e5026f3"},"schema_version":"1.0","source":{"id":"1212.3736","kind":"arxiv","version":3}},"canonical_sha256":"80d9fd0aa43179eab577255abf5f06b189e237e61162ea3b21b14c320f50bcf2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80d9fd0aa43179eab577255abf5f06b189e237e61162ea3b21b14c320f50bcf2","first_computed_at":"2026-05-18T02:53:15.463034Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:15.463034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FqlHl3ERlTBnCgrSgFUjrIzxHaAGP/nBiQaIbqLOY/YuFs1YOr/6bO9kMpjMjugqGWwIRLbE6tqXly9RoWf9Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:15.463729Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.3736","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ae2f71cbcb5d9eb0a5974d7af9653bd42d684725c075bd9c302288e39a25b0c","sha256:a63def1baa6e4987c7225e9fa866264efd0a751b59b8d8b8f61a67c12a6ea6d3"],"state_sha256":"56bf744bfc977086f27d8e28ac41b0d891bcdf1d7cd871538e2f33c49db03258"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UJeZdMoyqV/ebi+PD7VHGbVF9+9CM6dwVbpU0GbumbjsUWuEChNu6xPdmTnHx23XTGrjzmpEQgoMbzDmaVnJCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:04:08.449039Z","bundle_sha256":"93a507912f63903e5d8433456c55846fb8f2c874a68660f5cb5ac8811a93348d"}}