{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5UAHWDVL4SAX74E5P2HCQCIS5O","short_pith_number":"pith:5UAHWDVL","canonical_record":{"source":{"id":"1303.4031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-17T02:57:16Z","cross_cats_sorted":[],"title_canon_sha256":"a6bcd5554762321dc2f5bbc78f70274ef1ef5cbbc4ed563ee6ae3a47259876ba","abstract_canon_sha256":"60e75df9b221ca1b9aec317ffabfc6b124619c70022ecd62e7168b17f6f3364c"},"schema_version":"1.0"},"canonical_sha256":"ed007b0eabe4817ff09d7e8e280912eba263dc0dfb8d1884edf567ee776b234e","source":{"kind":"arxiv","id":"1303.4031","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4031","created_at":"2026-05-18T03:30:40Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4031v1","created_at":"2026-05-18T03:30:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4031","created_at":"2026-05-18T03:30:40Z"},{"alias_kind":"pith_short_12","alias_value":"5UAHWDVL4SAX","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5UAHWDVL4SAX74E5","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5UAHWDVL","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5UAHWDVL4SAX74E5P2HCQCIS5O","target":"record","payload":{"canonical_record":{"source":{"id":"1303.4031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-17T02:57:16Z","cross_cats_sorted":[],"title_canon_sha256":"a6bcd5554762321dc2f5bbc78f70274ef1ef5cbbc4ed563ee6ae3a47259876ba","abstract_canon_sha256":"60e75df9b221ca1b9aec317ffabfc6b124619c70022ecd62e7168b17f6f3364c"},"schema_version":"1.0"},"canonical_sha256":"ed007b0eabe4817ff09d7e8e280912eba263dc0dfb8d1884edf567ee776b234e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:40.094866Z","signature_b64":"EH4aBkbf2I8LviTcGzo7ifiPRAPl3CIW35FUi97sOSMwGSm91hAEdGQe8k5RksDIJvAYI02B5emymSbI8weqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed007b0eabe4817ff09d7e8e280912eba263dc0dfb8d1884edf567ee776b234e","last_reissued_at":"2026-05-18T03:30:40.094041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:40.094041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.4031","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-18T03:30:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jQjO0k4E3ujpGfTuSEj1G60Yo2cw57g7btY8JbJHmy0Yp1NEaoP1Vs7WBHwTTU+NBSwG2k25huPNHhfFr1XBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T09:20:12.050905Z"},"content_sha256":"79ab5df17e2ea23abb31c77493b3a2531907984d16f5f00f3dae59eb2bc52f85","schema_version":"1.0","event_id":"sha256:79ab5df17e2ea23abb31c77493b3a2531907984d16f5f00f3dae59eb2bc52f85"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5UAHWDVL4SAX74E5P2HCQCIS5O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two exact algorithms for the generalized assignment problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fatemeh Rajabi-Alni","submitted_at":"2013-03-17T02:57:16Z","abstract_excerpt":"Let A={a_1,a_2,...,a_s} and B={b_1,b_2,...,b_t} be two sets of objects with s+r=n, the generalized assignment problem assigns each element a_i in A to at least alpha_i and at most alpha '_i elements in B, and each element b_j in B to at least beta_j and at most beta '_j elements in A for all 1 <= i <= s and 1 <= j <= t. In this paper, we present an O(n^4) time and O(n) space algorithm for this problem using the well known Hungarian algorithm. We also present an O(n^3) algorithm for a special case of the generalized assignment, called the limited-capacity assignment problem, where alpha_i,beta_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4031","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-18T03:30:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wcyk9R0rvDbuOky55ZG/67Q8rsGds/XTLwH2vxmQ2wNIejJHmhnAnSmMWX83quOw3tR7lVP8CHtBNLN2Eyo5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T09:20:12.051274Z"},"content_sha256":"0e092615ba85c11b966c1f9f0c6998e3eca831e4988d8774920185031603558a","schema_version":"1.0","event_id":"sha256:0e092615ba85c11b966c1f9f0c6998e3eca831e4988d8774920185031603558a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5UAHWDVL4SAX74E5P2HCQCIS5O/bundle.json","state_url":"https://pith.science/pith/5UAHWDVL4SAX74E5P2HCQCIS5O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5UAHWDVL4SAX74E5P2HCQCIS5O/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-28T09:20:12Z","links":{"resolver":"https://pith.science/pith/5UAHWDVL4SAX74E5P2HCQCIS5O","bundle":"https://pith.science/pith/5UAHWDVL4SAX74E5P2HCQCIS5O/bundle.json","state":"https://pith.science/pith/5UAHWDVL4SAX74E5P2HCQCIS5O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5UAHWDVL4SAX74E5P2HCQCIS5O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5UAHWDVL4SAX74E5P2HCQCIS5O","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":"60e75df9b221ca1b9aec317ffabfc6b124619c70022ecd62e7168b17f6f3364c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-17T02:57:16Z","title_canon_sha256":"a6bcd5554762321dc2f5bbc78f70274ef1ef5cbbc4ed563ee6ae3a47259876ba"},"schema_version":"1.0","source":{"id":"1303.4031","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4031","created_at":"2026-05-18T03:30:40Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4031v1","created_at":"2026-05-18T03:30:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4031","created_at":"2026-05-18T03:30:40Z"},{"alias_kind":"pith_short_12","alias_value":"5UAHWDVL4SAX","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5UAHWDVL4SAX74E5","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5UAHWDVL","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:0e092615ba85c11b966c1f9f0c6998e3eca831e4988d8774920185031603558a","target":"graph","created_at":"2026-05-18T03:30:40Z","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":"Let A={a_1,a_2,...,a_s} and B={b_1,b_2,...,b_t} be two sets of objects with s+r=n, the generalized assignment problem assigns each element a_i in A to at least alpha_i and at most alpha '_i elements in B, and each element b_j in B to at least beta_j and at most beta '_j elements in A for all 1 <= i <= s and 1 <= j <= t. In this paper, we present an O(n^4) time and O(n) space algorithm for this problem using the well known Hungarian algorithm. We also present an O(n^3) algorithm for a special case of the generalized assignment, called the limited-capacity assignment problem, where alpha_i,beta_","authors_text":"Fatemeh Rajabi-Alni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-17T02:57:16Z","title":"Two exact algorithms for the generalized assignment problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4031","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:79ab5df17e2ea23abb31c77493b3a2531907984d16f5f00f3dae59eb2bc52f85","target":"record","created_at":"2026-05-18T03:30:40Z","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":"60e75df9b221ca1b9aec317ffabfc6b124619c70022ecd62e7168b17f6f3364c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-17T02:57:16Z","title_canon_sha256":"a6bcd5554762321dc2f5bbc78f70274ef1ef5cbbc4ed563ee6ae3a47259876ba"},"schema_version":"1.0","source":{"id":"1303.4031","kind":"arxiv","version":1}},"canonical_sha256":"ed007b0eabe4817ff09d7e8e280912eba263dc0dfb8d1884edf567ee776b234e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed007b0eabe4817ff09d7e8e280912eba263dc0dfb8d1884edf567ee776b234e","first_computed_at":"2026-05-18T03:30:40.094041Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:40.094041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EH4aBkbf2I8LviTcGzo7ifiPRAPl3CIW35FUi97sOSMwGSm91hAEdGQe8k5RksDIJvAYI02B5emymSbI8weqAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:40.094866Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.4031","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79ab5df17e2ea23abb31c77493b3a2531907984d16f5f00f3dae59eb2bc52f85","sha256:0e092615ba85c11b966c1f9f0c6998e3eca831e4988d8774920185031603558a"],"state_sha256":"ab98e6cb3cb798447e501bc355997398f54014924bd130d72f5f696a0b1d99db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pYqHRAkJqDK/lw1yvYP2KTWTcyVa/NYKC1l4B8G1lNlGFvPgy62UHRqrzvBUVG6lJBjFKztsGUT05XKh4w10Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T09:20:12.053061Z","bundle_sha256":"dcf89bd25b5e7b51aa77b02ccea9efdffea9f5a0d8bd808e8e81d31af347bb98"}}