{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:R7VTPUMYERYLESWMZV5GS6G2SC","short_pith_number":"pith:R7VTPUMY","schema_version":"1.0","canonical_sha256":"8feb37d1982470b24acccd7a6978da90b27b1e8d6f062acdd58e3327e59825c6","source":{"kind":"arxiv","id":"1405.4507","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.4507","created_at":"2026-05-18T02:51:40.692101+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.4507v1","created_at":"2026-05-18T02:51:40.692101+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4507","created_at":"2026-05-18T02:51:40.692101+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7VTPUMYERYL","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7VTPUMYERYLESWM","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7VTPUMY","created_at":"2026-05-18T12:28:46.137349+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/R7VTPUMYERYLESWMZV5GS6G2SC","json":"https://pith.science/pith/R7VTPUMYERYLESWMZV5GS6G2SC.json","graph_json":"https://pith.science/api/pith-number/R7VTPUMYERYLESWMZV5GS6G2SC/graph.json","events_json":"https://pith.science/api/pith-number/R7VTPUMYERYLESWMZV5GS6G2SC/events.json","paper":"https://pith.science/paper/R7VTPUMY"},"agent_actions":{"view_html":"https://pith.science/pith/R7VTPUMYERYLESWMZV5GS6G2SC","download_json":"https://pith.science/pith/R7VTPUMYERYLESWMZV5GS6G2SC.json","view_paper":"https://pith.science/paper/R7VTPUMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.4507&json=true","fetch_graph":"https://pith.science/api/pith-number/R7VTPUMYERYLESWMZV5GS6G2SC/graph.json","fetch_events":"https://pith.science/api/pith-number/R7VTPUMYERYLESWMZV5GS6G2SC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7VTPUMYERYLESWMZV5GS6G2SC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7VTPUMYERYLESWMZV5GS6G2SC/action/storage_attestation","attest_author":"https://pith.science/pith/R7VTPUMYERYLESWMZV5GS6G2SC/action/author_attestation","sign_citation":"https://pith.science/pith/R7VTPUMYERYLESWMZV5GS6G2SC/action/citation_signature","submit_replication":"https://pith.science/pith/R7VTPUMYERYLESWMZV5GS6G2SC/action/replication_record"}},"created_at":"2026-05-18T02:51:40.692101+00:00","updated_at":"2026-05-18T02:51:40.692101+00:00"}