{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:R7VTPUMYERYLESWMZV5GS6G2SC","short_pith_number":"pith:R7VTPUMY","canonical_record":{"source":{"id":"1405.4507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-05-18T14:02:15Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e66c7cb7200db7fb35cb7e974b007e1dbd576f2f29b364cc4ea7ec2569d37716","abstract_canon_sha256":"f43d3af0521cf09d919464d847781ba517623b833009303e9aa38d65e987caf4"},"schema_version":"1.0"},"canonical_sha256":"8feb37d1982470b24acccd7a6978da90b27b1e8d6f062acdd58e3327e59825c6","source":{"kind":"arxiv","id":"1405.4507","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4507","created_at":"2026-05-18T02:51:40Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4507v1","created_at":"2026-05-18T02:51:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4507","created_at":"2026-05-18T02:51:40Z"},{"alias_kind":"pith_short_12","alias_value":"R7VTPUMYERYL","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"R7VTPUMYERYLESWM","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"R7VTPUMY","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:R7VTPUMYERYLESWMZV5GS6G2SC","target":"record","payload":{"canonical_record":{"source":{"id":"1405.4507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-05-18T14:02:15Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e66c7cb7200db7fb35cb7e974b007e1dbd576f2f29b364cc4ea7ec2569d37716","abstract_canon_sha256":"f43d3af0521cf09d919464d847781ba517623b833009303e9aa38d65e987caf4"},"schema_version":"1.0"},"canonical_sha256":"8feb37d1982470b24acccd7a6978da90b27b1e8d6f062acdd58e3327e59825c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:40.692509Z","signature_b64":"SqcUGSw31yAZW6LKP8YNTrZrJuBVH/h3jzXksbBWxCGNDz16oV2CxJ3DZb3Yw6UxqKormKmmVRXB2GoDw7dsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8feb37d1982470b24acccd7a6978da90b27b1e8d6f062acdd58e3327e59825c6","last_reissued_at":"2026-05-18T02:51:40.692032Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:40.692032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.4507","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-18T02:51:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SLI37QS15syueaIFtyjMjts0S28E8VRe6vMk7cG2mvwWiExacDdtDHHGX6RwuV7bpmd39kioWAS94Veuxhb+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:03:15.102845Z"},"content_sha256":"966a578d19972a9565eba8fbfaf8e4a0ef328eb6adfc730cde77cb30c012b07b","schema_version":"1.0","event_id":"sha256:966a578d19972a9565eba8fbfaf8e4a0ef328eb6adfc730cde77cb30c012b07b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:R7VTPUMYERYLESWMZV5GS6G2SC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Multi-parent Memetic Algorithm for the Linear Ordering Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NE","authors_text":"Jin-Kao Hao, Tao Wang, Tao Ye, Zhipeng Lu","submitted_at":"2014-05-18T14:02:15Z","abstract_excerpt":"In this paper, we present a multi-parent memetic algorithm (denoted by MPM) for solving the classic Linear Ordering Problem (LOP). The MPM algorithm integrates in particular a multi-parent recombination operator for generating offspring solutions and a distance-and-quality based criterion for pool updating. Our MPM algorithm is assessed on 8 sets of 484 widely used LOP instances and compared with several state-of-the-art algorithms in the literature, showing the efficacy of the MPM algorithm. Specifically, for the 255 instances whose optimal solutions are unknown, the MPM is able to detect bet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4507","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-18T02:51:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"86CvtDWkdBp6Bts7J1thXR6j2aANhDFUm9bqs0+62wtzM/d9jGDNLBmKhcPNwOPUWhGAuYWncSWpm/JUZODlCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:03:15.103193Z"},"content_sha256":"438f307c4505d980d444d7532c47526fa23aa52d1a234785b8793e57429f7164","schema_version":"1.0","event_id":"sha256:438f307c4505d980d444d7532c47526fa23aa52d1a234785b8793e57429f7164"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R7VTPUMYERYLESWMZV5GS6G2SC/bundle.json","state_url":"https://pith.science/pith/R7VTPUMYERYLESWMZV5GS6G2SC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R7VTPUMYERYLESWMZV5GS6G2SC/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-02T02:03:15Z","links":{"resolver":"https://pith.science/pith/R7VTPUMYERYLESWMZV5GS6G2SC","bundle":"https://pith.science/pith/R7VTPUMYERYLESWMZV5GS6G2SC/bundle.json","state":"https://pith.science/pith/R7VTPUMYERYLESWMZV5GS6G2SC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R7VTPUMYERYLESWMZV5GS6G2SC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:R7VTPUMYERYLESWMZV5GS6G2SC","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":"f43d3af0521cf09d919464d847781ba517623b833009303e9aa38d65e987caf4","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-05-18T14:02:15Z","title_canon_sha256":"e66c7cb7200db7fb35cb7e974b007e1dbd576f2f29b364cc4ea7ec2569d37716"},"schema_version":"1.0","source":{"id":"1405.4507","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4507","created_at":"2026-05-18T02:51:40Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4507v1","created_at":"2026-05-18T02:51:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4507","created_at":"2026-05-18T02:51:40Z"},{"alias_kind":"pith_short_12","alias_value":"R7VTPUMYERYL","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"R7VTPUMYERYLESWM","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"R7VTPUMY","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:438f307c4505d980d444d7532c47526fa23aa52d1a234785b8793e57429f7164","target":"graph","created_at":"2026-05-18T02:51:40Z","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":"In this paper, we present a multi-parent memetic algorithm (denoted by MPM) for solving the classic Linear Ordering Problem (LOP). The MPM algorithm integrates in particular a multi-parent recombination operator for generating offspring solutions and a distance-and-quality based criterion for pool updating. Our MPM algorithm is assessed on 8 sets of 484 widely used LOP instances and compared with several state-of-the-art algorithms in the literature, showing the efficacy of the MPM algorithm. Specifically, for the 255 instances whose optimal solutions are unknown, the MPM is able to detect bet","authors_text":"Jin-Kao Hao, Tao Wang, Tao Ye, Zhipeng Lu","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-05-18T14:02:15Z","title":"A Multi-parent Memetic Algorithm for the Linear Ordering Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4507","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:966a578d19972a9565eba8fbfaf8e4a0ef328eb6adfc730cde77cb30c012b07b","target":"record","created_at":"2026-05-18T02:51:40Z","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":"f43d3af0521cf09d919464d847781ba517623b833009303e9aa38d65e987caf4","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-05-18T14:02:15Z","title_canon_sha256":"e66c7cb7200db7fb35cb7e974b007e1dbd576f2f29b364cc4ea7ec2569d37716"},"schema_version":"1.0","source":{"id":"1405.4507","kind":"arxiv","version":1}},"canonical_sha256":"8feb37d1982470b24acccd7a6978da90b27b1e8d6f062acdd58e3327e59825c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8feb37d1982470b24acccd7a6978da90b27b1e8d6f062acdd58e3327e59825c6","first_computed_at":"2026-05-18T02:51:40.692032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:40.692032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SqcUGSw31yAZW6LKP8YNTrZrJuBVH/h3jzXksbBWxCGNDz16oV2CxJ3DZb3Yw6UxqKormKmmVRXB2GoDw7dsAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:40.692509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.4507","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:966a578d19972a9565eba8fbfaf8e4a0ef328eb6adfc730cde77cb30c012b07b","sha256:438f307c4505d980d444d7532c47526fa23aa52d1a234785b8793e57429f7164"],"state_sha256":"597100c556bcb0ab4603730ca2a6bdfbf708944fe6a80194a609e6e2165d2429"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"POPgHrOU1FeNvRdzpdnEyZGMu+VBxLPCJvaerAvPNMWaajxrtkHLeLiVVeBq7z9og4UCSMyrP762DaP/ZOIgBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:03:15.105198Z","bundle_sha256":"0730477559ddae14ccf2b9aa3e836c8be4199639e4e06e5dbafda8640d95e5e4"}}