{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:UQW35COBYN6GDRCEZHXBORR4RH","short_pith_number":"pith:UQW35COB","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"},"canonical_sha256":"a42dbe89c1c37c61c444c9ee17463c89d96b078c3c21e27e8688bb6e9264d7cc","source":{"kind":"arxiv","id":"0906.2960","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.2960","created_at":"2026-05-18T03:55:35Z"},{"alias_kind":"arxiv_version","alias_value":"0906.2960v1","created_at":"2026-05-18T03:55:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.2960","created_at":"2026-05-18T03:55:35Z"},{"alias_kind":"pith_short_12","alias_value":"UQW35COBYN6G","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"UQW35COBYN6GDRCE","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"UQW35COB","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:UQW35COBYN6GDRCEZHXBORR4RH","target":"record","payload":{"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"},"canonical_sha256":"a42dbe89c1c37c61c444c9ee17463c89d96b078c3c21e27e8688bb6e9264d7cc","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"},"source_kind":"arxiv","source_id":"0906.2960","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:55:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KK/pbYhZpznCRnhaOvKF7705lIgqMFwpfYdCmjDSQHE3gdDxglHjpG2WEyc/AUVgZQgIrhWzfKNGSv6Sc8jJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:21:32.878181Z"},"content_sha256":"1590446d73adbaa7d763b089aacd1af0cce4c5d77e04898d3158b084cb0b2a08","schema_version":"1.0","event_id":"sha256:1590446d73adbaa7d763b089aacd1af0cce4c5d77e04898d3158b084cb0b2a08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:UQW35COBYN6GDRCEZHXBORR4RH","target":"graph","payload":{"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"},"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:55:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jr9YAEag2f9Jggc4oxb6gSMyDxTi5OU2/ugB4SATSiNrnQN9w64yu/4K3NHhgfuakYZLXMghR2HO3Ff/eBikCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:21:32.878529Z"},"content_sha256":"e550273a531365a5920f6097008c1dc874d2ddf9fe1274363cee62ae1e1c976f","schema_version":"1.0","event_id":"sha256:e550273a531365a5920f6097008c1dc874d2ddf9fe1274363cee62ae1e1c976f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UQW35COBYN6GDRCEZHXBORR4RH/bundle.json","state_url":"https://pith.science/pith/UQW35COBYN6GDRCEZHXBORR4RH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UQW35COBYN6GDRCEZHXBORR4RH/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-23T16:21:32Z","links":{"resolver":"https://pith.science/pith/UQW35COBYN6GDRCEZHXBORR4RH","bundle":"https://pith.science/pith/UQW35COBYN6GDRCEZHXBORR4RH/bundle.json","state":"https://pith.science/pith/UQW35COBYN6GDRCEZHXBORR4RH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UQW35COBYN6GDRCEZHXBORR4RH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:UQW35COBYN6GDRCEZHXBORR4RH","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":"c7229286081061388b3249f7268ffc109a361c66ca4c5925d8a1e58d1e82c5f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-06-16T15:47:17Z","title_canon_sha256":"817da0df37417e2e151487ea0d83f0a0abb5feb3db3f1d9df6e6a5b8da78f40b"},"schema_version":"1.0","source":{"id":"0906.2960","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.2960","created_at":"2026-05-18T03:55:35Z"},{"alias_kind":"arxiv_version","alias_value":"0906.2960v1","created_at":"2026-05-18T03:55:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.2960","created_at":"2026-05-18T03:55:35Z"},{"alias_kind":"pith_short_12","alias_value":"UQW35COBYN6G","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"UQW35COBYN6GDRCE","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"UQW35COB","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:e550273a531365a5920f6097008c1dc874d2ddf9fe1274363cee62ae1e1c976f","target":"graph","created_at":"2026-05-18T03:55:35Z","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":"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.","authors_text":"Boris Goldengorin, Daniel Karapetyan, Gregory Gutin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-06-16T15:47:17Z","title":"Empirical evaluation of construction heuristics for the multidimensional assignment problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.2960","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:1590446d73adbaa7d763b089aacd1af0cce4c5d77e04898d3158b084cb0b2a08","target":"record","created_at":"2026-05-18T03:55:35Z","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":"c7229286081061388b3249f7268ffc109a361c66ca4c5925d8a1e58d1e82c5f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-06-16T15:47:17Z","title_canon_sha256":"817da0df37417e2e151487ea0d83f0a0abb5feb3db3f1d9df6e6a5b8da78f40b"},"schema_version":"1.0","source":{"id":"0906.2960","kind":"arxiv","version":1}},"canonical_sha256":"a42dbe89c1c37c61c444c9ee17463c89d96b078c3c21e27e8688bb6e9264d7cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a42dbe89c1c37c61c444c9ee17463c89d96b078c3c21e27e8688bb6e9264d7cc","first_computed_at":"2026-05-18T03:55:35.820983Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:35.820983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nq6lwgLeOAwC3RAoAWKGVd0soxV/dnGM+dKvO7vkNmw3f7X69qHZkcS/Z2rKSQ8n7HzVqTzdAAy5YtIg5nm/CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:35.821519Z","signed_message":"canonical_sha256_bytes"},"source_id":"0906.2960","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1590446d73adbaa7d763b089aacd1af0cce4c5d77e04898d3158b084cb0b2a08","sha256:e550273a531365a5920f6097008c1dc874d2ddf9fe1274363cee62ae1e1c976f"],"state_sha256":"96a8fd0e5f3698e609422b26b9eb9c4026002bb2e0f83661294d322003e914e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ImVbmSWH6FpFlkxDRYCXceT0bNgjR9qWg6JxokErhfSEj8L66dvX1yTJTf91hwWVmm+2wuohiVsx4XRb6XmCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T16:21:32.880396Z","bundle_sha256":"a07ac56233568f5ecb74c8761536aa97c5fb82f55042758a8598136620cb0df5"}}