{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:5YJLKHXWVBBCZWLWRFAYLPQFBU","short_pith_number":"pith:5YJLKHXW","canonical_record":{"source":{"id":"2007.14885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2020-07-29T15:02:07Z","cross_cats_sorted":[],"title_canon_sha256":"20c6617f85f96c5683ff7fd9964d987abc12f4e8a3eb186738565215e8312849","abstract_canon_sha256":"b4be1f80dfa2363db4ecaa017b9648a8777deb30fab8a4825141f8db261a4f08"},"schema_version":"1.0"},"canonical_sha256":"ee12b51ef6a8422cd976894185be050d0bf0aa086d82e209bd975b3599f36044","source":{"kind":"arxiv","id":"2007.14885","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.14885","created_at":"2026-07-05T01:23:19Z"},{"alias_kind":"arxiv_version","alias_value":"2007.14885v1","created_at":"2026-07-05T01:23:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.14885","created_at":"2026-07-05T01:23:19Z"},{"alias_kind":"pith_short_12","alias_value":"5YJLKHXWVBBC","created_at":"2026-07-05T01:23:19Z"},{"alias_kind":"pith_short_16","alias_value":"5YJLKHXWVBBCZWLW","created_at":"2026-07-05T01:23:19Z"},{"alias_kind":"pith_short_8","alias_value":"5YJLKHXW","created_at":"2026-07-05T01:23:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:5YJLKHXWVBBCZWLWRFAYLPQFBU","target":"record","payload":{"canonical_record":{"source":{"id":"2007.14885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2020-07-29T15:02:07Z","cross_cats_sorted":[],"title_canon_sha256":"20c6617f85f96c5683ff7fd9964d987abc12f4e8a3eb186738565215e8312849","abstract_canon_sha256":"b4be1f80dfa2363db4ecaa017b9648a8777deb30fab8a4825141f8db261a4f08"},"schema_version":"1.0"},"canonical_sha256":"ee12b51ef6a8422cd976894185be050d0bf0aa086d82e209bd975b3599f36044","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:23:19.920932Z","signature_b64":"mQbqMaA/KLre0xKDxlAvCiW9ZD4xyW/36pVUQqDuuCVW97p5LTBsqiIKSuGGfiF0SythpwAGO5iHwGKPShotAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee12b51ef6a8422cd976894185be050d0bf0aa086d82e209bd975b3599f36044","last_reissued_at":"2026-07-05T01:23:19.920546Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:23:19.920546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.14885","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-07-05T01:23:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LNT7GVyqo+RRCM/RMvHotArWQhATa0JqF55LF6aFSwBX6sx/2vryRSXfb5ezFxmw8+jNUDbRcTi8gw+UgZVqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T20:09:38.401856Z"},"content_sha256":"b261007e3135f2f4bc20829904c14b3a973a62df7f9b2617bdd6b653378a7040","schema_version":"1.0","event_id":"sha256:b261007e3135f2f4bc20829904c14b3a973a62df7f9b2617bdd6b653378a7040"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:5YJLKHXWVBBCZWLWRFAYLPQFBU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance Analysis of Meta-heuristic Algorithms for a Quadratic Assignment Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Reza Tavakkoli-Moghaddam, Siavash Tabrizian, Zohreh Raziei","submitted_at":"2020-07-29T15:02:07Z","abstract_excerpt":"A quadratic assignment problem (QAP) is a combinatorial optimization problem that belongs to the class of NP-hard ones. So, it is difficult to solve in the polynomial time even for small instances. Research on the QAP has thus focused on obtaining a method to overcome this problem. Heuristics and meta-heuristics algorithm are prevalent solution methods for this problem. This paper is one of comparative studies to apply different metaheuristic algorithms for solving the QAP. One of the most popular approaches for categorizing meta-heuristic algorithms is based on a search strategy, including (1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.14885","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.14885/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:23:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"77PW/WQvfFGUoILfljv3AvKOWyzXc0KI/SyC5Ml1QIC5yanZh0hrD7lWEZOyfRMcSrSpqy+E67Xjn71Wv7DbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T20:09:38.402971Z"},"content_sha256":"5ebed00ef114f54a15f67036431673525ce1bb95685613599e4757cf35487f26","schema_version":"1.0","event_id":"sha256:5ebed00ef114f54a15f67036431673525ce1bb95685613599e4757cf35487f26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5YJLKHXWVBBCZWLWRFAYLPQFBU/bundle.json","state_url":"https://pith.science/pith/5YJLKHXWVBBCZWLWRFAYLPQFBU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5YJLKHXWVBBCZWLWRFAYLPQFBU/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-07-12T20:09:38Z","links":{"resolver":"https://pith.science/pith/5YJLKHXWVBBCZWLWRFAYLPQFBU","bundle":"https://pith.science/pith/5YJLKHXWVBBCZWLWRFAYLPQFBU/bundle.json","state":"https://pith.science/pith/5YJLKHXWVBBCZWLWRFAYLPQFBU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5YJLKHXWVBBCZWLWRFAYLPQFBU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:5YJLKHXWVBBCZWLWRFAYLPQFBU","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":"b4be1f80dfa2363db4ecaa017b9648a8777deb30fab8a4825141f8db261a4f08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2020-07-29T15:02:07Z","title_canon_sha256":"20c6617f85f96c5683ff7fd9964d987abc12f4e8a3eb186738565215e8312849"},"schema_version":"1.0","source":{"id":"2007.14885","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.14885","created_at":"2026-07-05T01:23:19Z"},{"alias_kind":"arxiv_version","alias_value":"2007.14885v1","created_at":"2026-07-05T01:23:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.14885","created_at":"2026-07-05T01:23:19Z"},{"alias_kind":"pith_short_12","alias_value":"5YJLKHXWVBBC","created_at":"2026-07-05T01:23:19Z"},{"alias_kind":"pith_short_16","alias_value":"5YJLKHXWVBBCZWLW","created_at":"2026-07-05T01:23:19Z"},{"alias_kind":"pith_short_8","alias_value":"5YJLKHXW","created_at":"2026-07-05T01:23:19Z"}],"graph_snapshots":[{"event_id":"sha256:5ebed00ef114f54a15f67036431673525ce1bb95685613599e4757cf35487f26","target":"graph","created_at":"2026-07-05T01:23:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.14885/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A quadratic assignment problem (QAP) is a combinatorial optimization problem that belongs to the class of NP-hard ones. So, it is difficult to solve in the polynomial time even for small instances. Research on the QAP has thus focused on obtaining a method to overcome this problem. Heuristics and meta-heuristics algorithm are prevalent solution methods for this problem. This paper is one of comparative studies to apply different metaheuristic algorithms for solving the QAP. One of the most popular approaches for categorizing meta-heuristic algorithms is based on a search strategy, including (1","authors_text":"Reza Tavakkoli-Moghaddam, Siavash Tabrizian, Zohreh Raziei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2020-07-29T15:02:07Z","title":"Performance Analysis of Meta-heuristic Algorithms for a Quadratic Assignment Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.14885","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:b261007e3135f2f4bc20829904c14b3a973a62df7f9b2617bdd6b653378a7040","target":"record","created_at":"2026-07-05T01:23:19Z","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":"b4be1f80dfa2363db4ecaa017b9648a8777deb30fab8a4825141f8db261a4f08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2020-07-29T15:02:07Z","title_canon_sha256":"20c6617f85f96c5683ff7fd9964d987abc12f4e8a3eb186738565215e8312849"},"schema_version":"1.0","source":{"id":"2007.14885","kind":"arxiv","version":1}},"canonical_sha256":"ee12b51ef6a8422cd976894185be050d0bf0aa086d82e209bd975b3599f36044","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee12b51ef6a8422cd976894185be050d0bf0aa086d82e209bd975b3599f36044","first_computed_at":"2026-07-05T01:23:19.920546Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:23:19.920546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mQbqMaA/KLre0xKDxlAvCiW9ZD4xyW/36pVUQqDuuCVW97p5LTBsqiIKSuGGfiF0SythpwAGO5iHwGKPShotAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:23:19.920932Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.14885","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b261007e3135f2f4bc20829904c14b3a973a62df7f9b2617bdd6b653378a7040","sha256:5ebed00ef114f54a15f67036431673525ce1bb95685613599e4757cf35487f26"],"state_sha256":"9e54e375dff548df886446cb5452bb9f2878b03158a49d77668685d216bb1fed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yxvlPDMBGlIFSIE/uUXt9b+y7MrDIrcSxOX6Wf785UQk9VesnFV8A2oqoRQLgoRXAQkB031Q+zDHjiEGbZn2Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T20:09:38.408240Z","bundle_sha256":"8662ef2fda277929a2140fac69006f8bc341c93c4dc330a5c03799f4c77d81d7"}}