{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5UAHWDVL4SAX74E5P2HCQCIS5O","short_pith_number":"pith:5UAHWDVL","schema_version":"1.0","canonical_sha256":"ed007b0eabe4817ff09d7e8e280912eba263dc0dfb8d1884edf567ee776b234e","source":{"kind":"arxiv","id":"1303.4031","version":1},"attestation_state":"computed","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_"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1303.4031","created_at":"2026-05-18T03:30:40.094171+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.4031v1","created_at":"2026-05-18T03:30:40.094171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4031","created_at":"2026-05-18T03:30:40.094171+00:00"},{"alias_kind":"pith_short_12","alias_value":"5UAHWDVL4SAX","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5UAHWDVL4SAX74E5","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5UAHWDVL","created_at":"2026-05-18T12:27:34.582898+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/5UAHWDVL4SAX74E5P2HCQCIS5O","json":"https://pith.science/pith/5UAHWDVL4SAX74E5P2HCQCIS5O.json","graph_json":"https://pith.science/api/pith-number/5UAHWDVL4SAX74E5P2HCQCIS5O/graph.json","events_json":"https://pith.science/api/pith-number/5UAHWDVL4SAX74E5P2HCQCIS5O/events.json","paper":"https://pith.science/paper/5UAHWDVL"},"agent_actions":{"view_html":"https://pith.science/pith/5UAHWDVL4SAX74E5P2HCQCIS5O","download_json":"https://pith.science/pith/5UAHWDVL4SAX74E5P2HCQCIS5O.json","view_paper":"https://pith.science/paper/5UAHWDVL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.4031&json=true","fetch_graph":"https://pith.science/api/pith-number/5UAHWDVL4SAX74E5P2HCQCIS5O/graph.json","fetch_events":"https://pith.science/api/pith-number/5UAHWDVL4SAX74E5P2HCQCIS5O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5UAHWDVL4SAX74E5P2HCQCIS5O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5UAHWDVL4SAX74E5P2HCQCIS5O/action/storage_attestation","attest_author":"https://pith.science/pith/5UAHWDVL4SAX74E5P2HCQCIS5O/action/author_attestation","sign_citation":"https://pith.science/pith/5UAHWDVL4SAX74E5P2HCQCIS5O/action/citation_signature","submit_replication":"https://pith.science/pith/5UAHWDVL4SAX74E5P2HCQCIS5O/action/replication_record"}},"created_at":"2026-05-18T03:30:40.094171+00:00","updated_at":"2026-05-18T03:30:40.094171+00:00"}