{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:UQW35COBYN6GDRCEZHXBORR4RH","short_pith_number":"pith:UQW35COB","schema_version":"1.0","canonical_sha256":"a42dbe89c1c37c61c444c9ee17463c89d96b078c3c21e27e8688bb6e9264d7cc","source":{"kind":"arxiv","id":"0906.2960","version":1},"attestation_state":"computed","paper":{"title":"Empirical evaluation of construction heuristics for the multidimensional assignment problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Boris Goldengorin, Daniel Karapetyan, Gregory Gutin","submitted_at":"2009-06-16T15:47:17Z","abstract_excerpt":"The multidimensional assignment problem (MAP) (abbreviated s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s have also a number of applications. In this paper we consider four fast construction heuristics for MAP. One of the heuristics is new. A modification of the heuristics is proposed to optimize the access to slow computer memory. The results of computational experiments for several instance families are provided and discussed."},"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":"0906.2960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-06-16T15:47:17Z","cross_cats_sorted":[],"title_canon_sha256":"817da0df37417e2e151487ea0d83f0a0abb5feb3db3f1d9df6e6a5b8da78f40b","abstract_canon_sha256":"c7229286081061388b3249f7268ffc109a361c66ca4c5925d8a1e58d1e82c5f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:35.821519Z","signature_b64":"Nq6lwgLeOAwC3RAoAWKGVd0soxV/dnGM+dKvO7vkNmw3f7X69qHZkcS/Z2rKSQ8n7HzVqTzdAAy5YtIg5nm/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a42dbe89c1c37c61c444c9ee17463c89d96b078c3c21e27e8688bb6e9264d7cc","last_reissued_at":"2026-05-18T03:55:35.820983Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:35.820983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Empirical evaluation of construction heuristics for the multidimensional assignment problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Boris Goldengorin, Daniel Karapetyan, Gregory Gutin","submitted_at":"2009-06-16T15:47:17Z","abstract_excerpt":"The multidimensional assignment problem (MAP) (abbreviated s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s have also a number of applications. In this paper we consider four fast construction heuristics for MAP. One of the heuristics is new. A modification of the heuristics is proposed to optimize the access to slow computer memory. The results of computational experiments for several instance families are provided and discussed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.2960","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":"0906.2960","created_at":"2026-05-18T03:55:35.821062+00:00"},{"alias_kind":"arxiv_version","alias_value":"0906.2960v1","created_at":"2026-05-18T03:55:35.821062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.2960","created_at":"2026-05-18T03:55:35.821062+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQW35COBYN6G","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQW35COBYN6GDRCE","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQW35COB","created_at":"2026-05-18T12:26:02.257875+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/UQW35COBYN6GDRCEZHXBORR4RH","json":"https://pith.science/pith/UQW35COBYN6GDRCEZHXBORR4RH.json","graph_json":"https://pith.science/api/pith-number/UQW35COBYN6GDRCEZHXBORR4RH/graph.json","events_json":"https://pith.science/api/pith-number/UQW35COBYN6GDRCEZHXBORR4RH/events.json","paper":"https://pith.science/paper/UQW35COB"},"agent_actions":{"view_html":"https://pith.science/pith/UQW35COBYN6GDRCEZHXBORR4RH","download_json":"https://pith.science/pith/UQW35COBYN6GDRCEZHXBORR4RH.json","view_paper":"https://pith.science/paper/UQW35COB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0906.2960&json=true","fetch_graph":"https://pith.science/api/pith-number/UQW35COBYN6GDRCEZHXBORR4RH/graph.json","fetch_events":"https://pith.science/api/pith-number/UQW35COBYN6GDRCEZHXBORR4RH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQW35COBYN6GDRCEZHXBORR4RH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQW35COBYN6GDRCEZHXBORR4RH/action/storage_attestation","attest_author":"https://pith.science/pith/UQW35COBYN6GDRCEZHXBORR4RH/action/author_attestation","sign_citation":"https://pith.science/pith/UQW35COBYN6GDRCEZHXBORR4RH/action/citation_signature","submit_replication":"https://pith.science/pith/UQW35COBYN6GDRCEZHXBORR4RH/action/replication_record"}},"created_at":"2026-05-18T03:55:35.821062+00:00","updated_at":"2026-05-18T03:55:35.821062+00:00"}