{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:X4XNH7BLH4PWM4RMX3YMI4DIN2","short_pith_number":"pith:X4XNH7BL","canonical_record":{"source":{"id":"1303.0160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-01T12:53:38Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"eb0b2f61799f5bec5133f2f94c42adaa57fb7b56e0eb6047638c77eba6a9b466","abstract_canon_sha256":"09514f2a450da27303d0234c9cc3b50f3b6da986f32de7a60ef61cd4aef01ee1"},"schema_version":"1.0"},"canonical_sha256":"bf2ed3fc2b3f1f66722cbef0c470686ebc2af3f3cd510e2cbeb9c79c7bd81561","source":{"kind":"arxiv","id":"1303.0160","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0160","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0160v1","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0160","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"pith_short_12","alias_value":"X4XNH7BLH4PW","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"X4XNH7BLH4PWM4RM","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"X4XNH7BL","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:X4XNH7BLH4PWM4RMX3YMI4DIN2","target":"record","payload":{"canonical_record":{"source":{"id":"1303.0160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-01T12:53:38Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"eb0b2f61799f5bec5133f2f94c42adaa57fb7b56e0eb6047638c77eba6a9b466","abstract_canon_sha256":"09514f2a450da27303d0234c9cc3b50f3b6da986f32de7a60ef61cd4aef01ee1"},"schema_version":"1.0"},"canonical_sha256":"bf2ed3fc2b3f1f66722cbef0c470686ebc2af3f3cd510e2cbeb9c79c7bd81561","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:32.698858Z","signature_b64":"oxcW7BMB6zjjdOfqEw9GirsNM/GdJn+LWT2Ta7o9Q9K3fZqwgGw58AOyNujIL+2OFR2N/oHGOyCu3YTqaugVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf2ed3fc2b3f1f66722cbef0c470686ebc2af3f3cd510e2cbeb9c79c7bd81561","last_reissued_at":"2026-05-18T02:30:32.698456Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:32.698456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.0160","source_version":1,"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:30:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VzapYIpBGY3pt+PPTiRqGgjI/Qxu/3Be//xGZYjh0TPdEjXk518/RVZMvneuezgxruC5u1lI/Qi2IzNrUBpPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:08:17.475278Z"},"content_sha256":"ae32f8051e95e09ea9de34adc0b376ecfd2aeec006ed24c155a0aae9d975f3a4","schema_version":"1.0","event_id":"sha256:ae32f8051e95e09ea9de34adc0b376ecfd2aeec006ed24c155a0aae9d975f3a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:X4XNH7BLH4PWM4RMX3YMI4DIN2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms","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":"2013-03-01T12:53:38Z","abstract_excerpt":"We consider domination analysis of approximation algorithms for the bipartite boolean quadratic programming problem (BBQP) with m+n variables. A closed form formula is developed to compute the average objective function value A of all solutions in O(mn) time. However, computing the median objective function value of the solutions is shown to be NP-hard. Also, we show that any solution with objective function value no worse than A dominates at least 2^{m+n-2} solutions and this bound is the best possible. Further, we show that such a solution can be identified in O(mn) time and hence the domina"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0160","kind":"arxiv","version":1},"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:30:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WJ5M0zxbnZXXAwg/iD8El8wYzJbv5tiWlZYEQgp8XUzP+xBGhXewxttQMIf8W8kEb5UJLK06CBV/POFSxetYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:08:17.475657Z"},"content_sha256":"952c56ebf95319428239079f94bc5a4c38a13f95a3ba0ee20690ec6e923c1dbe","schema_version":"1.0","event_id":"sha256:952c56ebf95319428239079f94bc5a4c38a13f95a3ba0ee20690ec6e923c1dbe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X4XNH7BLH4PWM4RMX3YMI4DIN2/bundle.json","state_url":"https://pith.science/pith/X4XNH7BLH4PWM4RMX3YMI4DIN2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X4XNH7BLH4PWM4RMX3YMI4DIN2/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-05T09:08:17Z","links":{"resolver":"https://pith.science/pith/X4XNH7BLH4PWM4RMX3YMI4DIN2","bundle":"https://pith.science/pith/X4XNH7BLH4PWM4RMX3YMI4DIN2/bundle.json","state":"https://pith.science/pith/X4XNH7BLH4PWM4RMX3YMI4DIN2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X4XNH7BLH4PWM4RMX3YMI4DIN2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:X4XNH7BLH4PWM4RMX3YMI4DIN2","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":"09514f2a450da27303d0234c9cc3b50f3b6da986f32de7a60ef61cd4aef01ee1","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-01T12:53:38Z","title_canon_sha256":"eb0b2f61799f5bec5133f2f94c42adaa57fb7b56e0eb6047638c77eba6a9b466"},"schema_version":"1.0","source":{"id":"1303.0160","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0160","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0160v1","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0160","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"pith_short_12","alias_value":"X4XNH7BLH4PW","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"X4XNH7BLH4PWM4RM","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"X4XNH7BL","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:952c56ebf95319428239079f94bc5a4c38a13f95a3ba0ee20690ec6e923c1dbe","target":"graph","created_at":"2026-05-18T02:30:32Z","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 domination analysis of approximation algorithms for the bipartite boolean quadratic programming problem (BBQP) with m+n variables. A closed form formula is developed to compute the average objective function value A of all solutions in O(mn) time. However, computing the median objective function value of the solutions is shown to be NP-hard. Also, we show that any solution with objective function value no worse than A dominates at least 2^{m+n-2} solutions and this bound is the best possible. Further, we show that such a solution can be identified in O(mn) time and hence the domina","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":"2013-03-01T12:53:38Z","title":"Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0160","kind":"arxiv","version":1},"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:ae32f8051e95e09ea9de34adc0b376ecfd2aeec006ed24c155a0aae9d975f3a4","target":"record","created_at":"2026-05-18T02:30:32Z","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":"09514f2a450da27303d0234c9cc3b50f3b6da986f32de7a60ef61cd4aef01ee1","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-01T12:53:38Z","title_canon_sha256":"eb0b2f61799f5bec5133f2f94c42adaa57fb7b56e0eb6047638c77eba6a9b466"},"schema_version":"1.0","source":{"id":"1303.0160","kind":"arxiv","version":1}},"canonical_sha256":"bf2ed3fc2b3f1f66722cbef0c470686ebc2af3f3cd510e2cbeb9c79c7bd81561","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf2ed3fc2b3f1f66722cbef0c470686ebc2af3f3cd510e2cbeb9c79c7bd81561","first_computed_at":"2026-05-18T02:30:32.698456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:32.698456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oxcW7BMB6zjjdOfqEw9GirsNM/GdJn+LWT2Ta7o9Q9K3fZqwgGw58AOyNujIL+2OFR2N/oHGOyCu3YTqaugVCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:32.698858Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.0160","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae32f8051e95e09ea9de34adc0b376ecfd2aeec006ed24c155a0aae9d975f3a4","sha256:952c56ebf95319428239079f94bc5a4c38a13f95a3ba0ee20690ec6e923c1dbe"],"state_sha256":"d37ea161868a430e66356d890d3a79070f7dac55296a156456a0248e3ee16313"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vWWfTFzGTupAXcVsYi8euRAJs7yQURMxyHFvatnZdY2ln3zuYp/KyUutDTWlK6HhtKONg5Bj1FkhVcdlitobAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:08:17.478262Z","bundle_sha256":"aa5ee4049eaed09c894fdda91addbc669735adc04698b8914b034001a07e4248"}}