{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FGO6X36WSMQABHGMDD3D6URUXX","short_pith_number":"pith:FGO6X36W","canonical_record":{"source":{"id":"1212.4211","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-18T01:46:51Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"d9518d910c8d400c96e4f1e27056cf8cb71775d249c961596a7841dcd71ba678","abstract_canon_sha256":"35f72a7944f90828109226be84f8520600804d9bddc15e89fe00c808cd38b53e"},"schema_version":"1.0"},"canonical_sha256":"299debefd69320009ccc18f63f5234bde7ae0cea9eb0594efa508b27cc1a763a","source":{"kind":"arxiv","id":"1212.4211","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4211","created_at":"2026-05-18T03:15:57Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4211v2","created_at":"2026-05-18T03:15:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4211","created_at":"2026-05-18T03:15:57Z"},{"alias_kind":"pith_short_12","alias_value":"FGO6X36WSMQA","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FGO6X36WSMQABHGM","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FGO6X36W","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FGO6X36WSMQABHGMDD3D6URUXX","target":"record","payload":{"canonical_record":{"source":{"id":"1212.4211","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-18T01:46:51Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"d9518d910c8d400c96e4f1e27056cf8cb71775d249c961596a7841dcd71ba678","abstract_canon_sha256":"35f72a7944f90828109226be84f8520600804d9bddc15e89fe00c808cd38b53e"},"schema_version":"1.0"},"canonical_sha256":"299debefd69320009ccc18f63f5234bde7ae0cea9eb0594efa508b27cc1a763a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:57.596810Z","signature_b64":"8dLBhIznnMeb247FwW2MO45xBsd7cOcCJ9kHQqDuriITumtBAwsg6d77vSTavrweFrsVxFSzAjx3tfE6+3ZvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"299debefd69320009ccc18f63f5234bde7ae0cea9eb0594efa508b27cc1a763a","last_reissued_at":"2026-05-18T03:15:57.596334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:57.596334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.4211","source_version":2,"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-18T03:15:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"orqjVsXleLZyGececHNxAyQ6RYKpuqyx6b7hOwuXUQx1jr3F2xPOBKk+IfvYPvJ6bvpr+o08lYWnEXfIOb5HAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:51:31.741724Z"},"content_sha256":"1d4779e1ee739c90da0b4e97524dbad73fbc0d0d01a39a7c13f33e65a0d4c0aa","schema_version":"1.0","event_id":"sha256:1d4779e1ee739c90da0b4e97524dbad73fbc0d0d01a39a7c13f33e65a0d4c0aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FGO6X36WSMQABHGMDD3D6URUXX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The quadratic balanced optimization problem","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, Bishnu Bhattacharyya, Daniel Karapetyan, Sara Taghipour","submitted_at":"2012-12-18T01:46:51Z","abstract_excerpt":"We introduce the quadratic balanced optimization problem (QBOP) which can be used to model equitable distribution of resources with pairwise interaction. QBOP is strongly NP-hard even if the family of feasible solutions has a very simple structure. Several general purpose exact and heuristic algorithms are presented. Results of extensive computational experiments are reported using randomly generated quadratic knapsack problems as the test bed. These results illustrate the efficacy of our exact and heuristic algorithms. We also show that when the cost matrix is specially structured, QBOP can b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4211","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"},"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-18T03:15:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xx0Zu5g9Jsv5Ug+xloTkp8n6UULUqBf2IMRhZF8GuhWZvR1RzvZsEHg4PxoprhwNAGOeQ3BfaHTMco3hOEKMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:51:31.742414Z"},"content_sha256":"4a93440ac0c53ed6ab88eaf3a9055e239caa80aa26d6f26fc466fdbef438958c","schema_version":"1.0","event_id":"sha256:4a93440ac0c53ed6ab88eaf3a9055e239caa80aa26d6f26fc466fdbef438958c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FGO6X36WSMQABHGMDD3D6URUXX/bundle.json","state_url":"https://pith.science/pith/FGO6X36WSMQABHGMDD3D6URUXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FGO6X36WSMQABHGMDD3D6URUXX/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:51:31Z","links":{"resolver":"https://pith.science/pith/FGO6X36WSMQABHGMDD3D6URUXX","bundle":"https://pith.science/pith/FGO6X36WSMQABHGMDD3D6URUXX/bundle.json","state":"https://pith.science/pith/FGO6X36WSMQABHGMDD3D6URUXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FGO6X36WSMQABHGMDD3D6URUXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FGO6X36WSMQABHGMDD3D6URUXX","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":"35f72a7944f90828109226be84f8520600804d9bddc15e89fe00c808cd38b53e","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-18T01:46:51Z","title_canon_sha256":"d9518d910c8d400c96e4f1e27056cf8cb71775d249c961596a7841dcd71ba678"},"schema_version":"1.0","source":{"id":"1212.4211","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4211","created_at":"2026-05-18T03:15:57Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4211v2","created_at":"2026-05-18T03:15:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4211","created_at":"2026-05-18T03:15:57Z"},{"alias_kind":"pith_short_12","alias_value":"FGO6X36WSMQA","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FGO6X36WSMQABHGM","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FGO6X36W","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:4a93440ac0c53ed6ab88eaf3a9055e239caa80aa26d6f26fc466fdbef438958c","target":"graph","created_at":"2026-05-18T03:15:57Z","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 introduce the quadratic balanced optimization problem (QBOP) which can be used to model equitable distribution of resources with pairwise interaction. QBOP is strongly NP-hard even if the family of feasible solutions has a very simple structure. Several general purpose exact and heuristic algorithms are presented. Results of extensive computational experiments are reported using randomly generated quadratic knapsack problems as the test bed. These results illustrate the efficacy of our exact and heuristic algorithms. We also show that when the cost matrix is specially structured, QBOP can b","authors_text":"Abraham P. Punnen, Bishnu Bhattacharyya, Daniel Karapetyan, Sara Taghipour","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-18T01:46:51Z","title":"The quadratic balanced optimization problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4211","kind":"arxiv","version":2},"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:1d4779e1ee739c90da0b4e97524dbad73fbc0d0d01a39a7c13f33e65a0d4c0aa","target":"record","created_at":"2026-05-18T03:15:57Z","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":"35f72a7944f90828109226be84f8520600804d9bddc15e89fe00c808cd38b53e","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-18T01:46:51Z","title_canon_sha256":"d9518d910c8d400c96e4f1e27056cf8cb71775d249c961596a7841dcd71ba678"},"schema_version":"1.0","source":{"id":"1212.4211","kind":"arxiv","version":2}},"canonical_sha256":"299debefd69320009ccc18f63f5234bde7ae0cea9eb0594efa508b27cc1a763a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"299debefd69320009ccc18f63f5234bde7ae0cea9eb0594efa508b27cc1a763a","first_computed_at":"2026-05-18T03:15:57.596334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:57.596334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8dLBhIznnMeb247FwW2MO45xBsd7cOcCJ9kHQqDuriITumtBAwsg6d77vSTavrweFrsVxFSzAjx3tfE6+3ZvBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:57.596810Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.4211","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d4779e1ee739c90da0b4e97524dbad73fbc0d0d01a39a7c13f33e65a0d4c0aa","sha256:4a93440ac0c53ed6ab88eaf3a9055e239caa80aa26d6f26fc466fdbef438958c"],"state_sha256":"98f50913f80237b9a2fa4f470fe4f18b5b608aa97d82fcabf3399025ba3d6817"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hRZ8eDuxjc7GrXl8zxRNOAWSMoqeLUSCo+rCqf/MP4HkWYKGScD1OMDlCjao++oMdPVf2TuC8Mo0A91K2svdDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:51:31.745877Z","bundle_sha256":"0643992bc1baf3d4b1e2a8f60617b3eab737788715713d3ab730b5bf9f553fd1"}}