{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZZ5RCWYLS6NUW7RMZI5O6FKNKL","short_pith_number":"pith:ZZ5RCWYL","canonical_record":{"source":{"id":"1706.08700","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2017-06-27T07:42:31Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"5cd799d2e7e32e6122cbd899443be2a2ad322f53a5e75be76535674ea8c75d3c","abstract_canon_sha256":"e6088f8f5e171052dfe5cc3fe836a28d565ef4100ceed80a79663df0979ce53b"},"schema_version":"1.0"},"canonical_sha256":"ce7b115b0b979b4b7e2cca3aef154d52cf40c08afefa035062f001d0c7b3412f","source":{"kind":"arxiv","id":"1706.08700","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08700","created_at":"2026-05-18T00:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08700v1","created_at":"2026-05-18T00:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08700","created_at":"2026-05-18T00:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZZ5RCWYLS6NU","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZZ5RCWYLS6NUW7RM","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZZ5RCWYL","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZZ5RCWYLS6NUW7RMZI5O6FKNKL","target":"record","payload":{"canonical_record":{"source":{"id":"1706.08700","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2017-06-27T07:42:31Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"5cd799d2e7e32e6122cbd899443be2a2ad322f53a5e75be76535674ea8c75d3c","abstract_canon_sha256":"e6088f8f5e171052dfe5cc3fe836a28d565ef4100ceed80a79663df0979ce53b"},"schema_version":"1.0"},"canonical_sha256":"ce7b115b0b979b4b7e2cca3aef154d52cf40c08afefa035062f001d0c7b3412f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:42.155120Z","signature_b64":"59LfSqIsAasEYQE2USrzJmiCMO/JAWCMQoRxiVkHw8AiKOhgNmlH0rebto0yj4Xc8JifC9L0cm3BFIYtbfuqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce7b115b0b979b4b7e2cca3aef154d52cf40c08afefa035062f001d0c7b3412f","last_reissued_at":"2026-05-18T00:19:42.154456Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:42.154456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.08700","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-18T00:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u8NnnR1O4D5hHM/KezEKX6xKGuxqnqTAdYU59Acf5zDMyokw63QfA+iGDZlm2u114NnISd5c7WSH+dJr2OE4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:31:09.706452Z"},"content_sha256":"c73cf7e0aa13bafd70bc4145ee0fe90d95da18bc375e91c81e4325ca90e33ee4","schema_version":"1.0","event_id":"sha256:c73cf7e0aa13bafd70bc4145ee0fe90d95da18bc375e91c81e4325ca90e33ee4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZZ5RCWYLS6NUW7RMZI5O6FKNKL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PasMoQAP: A Parallel Asynchronous Memetic Algorithm for solving the Multi-Objective Quadratic Assignment Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NE","authors_text":"Claudio Sanhueza, Francia Jimenez, Pablo Moscato, Regina Berretta","submitted_at":"2017-06-27T07:42:31Z","abstract_excerpt":"Multi-Objective Optimization Problems (MOPs) have attracted growing attention during the last decades. Multi-Objective Evolutionary Algorithms (MOEAs) have been extensively used to address MOPs because are able to approximate a set of non-dominated high-quality solutions. The Multi-Objective Quadratic Assignment Problem (mQAP) is a MOP. The mQAP is a generalization of the classical QAP which has been extensively studied, and used in several real-life applications. The mQAP is defined as having as input several flows between the facilities which generate multiple cost functions that must be opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08700","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-18T00:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BdPkNd9Nq+ibzMDF8+hP4cCeSsLqhp0EHimiIQEOZc0f9RVqlddbIm3oWnQHAERW8kbc+CuP7xVj+Nsb2EE1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:31:09.706797Z"},"content_sha256":"08d375cc2694ca6d328555fce4d26dba50ac69443a857691adab5460a66014c6","schema_version":"1.0","event_id":"sha256:08d375cc2694ca6d328555fce4d26dba50ac69443a857691adab5460a66014c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZ5RCWYLS6NUW7RMZI5O6FKNKL/bundle.json","state_url":"https://pith.science/pith/ZZ5RCWYLS6NUW7RMZI5O6FKNKL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZ5RCWYLS6NUW7RMZI5O6FKNKL/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-01T13:31:09Z","links":{"resolver":"https://pith.science/pith/ZZ5RCWYLS6NUW7RMZI5O6FKNKL","bundle":"https://pith.science/pith/ZZ5RCWYLS6NUW7RMZI5O6FKNKL/bundle.json","state":"https://pith.science/pith/ZZ5RCWYLS6NUW7RMZI5O6FKNKL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZ5RCWYLS6NUW7RMZI5O6FKNKL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZZ5RCWYLS6NUW7RMZI5O6FKNKL","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":"e6088f8f5e171052dfe5cc3fe836a28d565ef4100ceed80a79663df0979ce53b","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2017-06-27T07:42:31Z","title_canon_sha256":"5cd799d2e7e32e6122cbd899443be2a2ad322f53a5e75be76535674ea8c75d3c"},"schema_version":"1.0","source":{"id":"1706.08700","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08700","created_at":"2026-05-18T00:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08700v1","created_at":"2026-05-18T00:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08700","created_at":"2026-05-18T00:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZZ5RCWYLS6NU","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZZ5RCWYLS6NUW7RM","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZZ5RCWYL","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:08d375cc2694ca6d328555fce4d26dba50ac69443a857691adab5460a66014c6","target":"graph","created_at":"2026-05-18T00:19:42Z","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":"Multi-Objective Optimization Problems (MOPs) have attracted growing attention during the last decades. Multi-Objective Evolutionary Algorithms (MOEAs) have been extensively used to address MOPs because are able to approximate a set of non-dominated high-quality solutions. The Multi-Objective Quadratic Assignment Problem (mQAP) is a MOP. The mQAP is a generalization of the classical QAP which has been extensively studied, and used in several real-life applications. The mQAP is defined as having as input several flows between the facilities which generate multiple cost functions that must be opt","authors_text":"Claudio Sanhueza, Francia Jimenez, Pablo Moscato, Regina Berretta","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2017-06-27T07:42:31Z","title":"PasMoQAP: A Parallel Asynchronous Memetic Algorithm for solving the Multi-Objective Quadratic Assignment Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08700","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:c73cf7e0aa13bafd70bc4145ee0fe90d95da18bc375e91c81e4325ca90e33ee4","target":"record","created_at":"2026-05-18T00:19:42Z","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":"e6088f8f5e171052dfe5cc3fe836a28d565ef4100ceed80a79663df0979ce53b","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2017-06-27T07:42:31Z","title_canon_sha256":"5cd799d2e7e32e6122cbd899443be2a2ad322f53a5e75be76535674ea8c75d3c"},"schema_version":"1.0","source":{"id":"1706.08700","kind":"arxiv","version":1}},"canonical_sha256":"ce7b115b0b979b4b7e2cca3aef154d52cf40c08afefa035062f001d0c7b3412f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce7b115b0b979b4b7e2cca3aef154d52cf40c08afefa035062f001d0c7b3412f","first_computed_at":"2026-05-18T00:19:42.154456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:42.154456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"59LfSqIsAasEYQE2USrzJmiCMO/JAWCMQoRxiVkHw8AiKOhgNmlH0rebto0yj4Xc8JifC9L0cm3BFIYtbfuqDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:42.155120Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08700","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c73cf7e0aa13bafd70bc4145ee0fe90d95da18bc375e91c81e4325ca90e33ee4","sha256:08d375cc2694ca6d328555fce4d26dba50ac69443a857691adab5460a66014c6"],"state_sha256":"c4675e02b872f6db340c0c93a26389890cbff8bef3d10a3f8562cd58c6c4e367"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kie7/o+0wbGgPhk6pRzi6PU114N39DvCK5YAWYcmFe4Dy9QkKxpc7MG2XDbX37WFJMbukHSpItvN+ZOyjUnaBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:31:09.708845Z","bundle_sha256":"b6c0627b4844ad75f4f36f76b75635d36dce11ae5b1f9662ef676b2f5636499b"}}