{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QTNKCL7UZLDWKON5ETEE2W4IJY","short_pith_number":"pith:QTNKCL7U","schema_version":"1.0","canonical_sha256":"84daa12ff4cac76539bd24c84d5b884e095de78e5a58fac12de6518b138217df","source":{"kind":"arxiv","id":"1503.00980","version":1},"attestation_state":"computed","paper":{"title":"On memetic search for the max-mean dispersion problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jin-Kao Hao, Xiangjing Lai","submitted_at":"2015-03-03T15:43:36Z","abstract_excerpt":"Given a set $V$ of $n$ elements and a distance matrix $[d_{ij}]_{n\\times n}$ among elements, the max-mean dispersion problem (MaxMeanDP) consists in selecting a subset $M$ from $V$ such that the mean dispersion (or distance) among the selected elements is maximized. Being a useful model to formulate several relevant applications, MaxMeanDP is known to be NP-hard and thus computationally difficult. In this paper, we present a highly effective memetic algorithm for MaxMeanDP which relies on solution recombination and local optimization to find high quality solutions. Computational experiments on"},"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":"1503.00980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-03-03T15:43:36Z","cross_cats_sorted":[],"title_canon_sha256":"ba1c956a6e59404603e3751522926f1af64bb885e067a956a3068458173344ae","abstract_canon_sha256":"649b38c3e9697c5e87d46ac546f8619e362ca7100e648440384d021df5e11387"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:47.983946Z","signature_b64":"dYZybTzGGNLSg+/tqU5V5+qU12dnsJyJLAJvqulsVeCpzMKCteVMreUmCgb+wNt5UEr2pFOwbYi2Acjtn5NhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84daa12ff4cac76539bd24c84d5b884e095de78e5a58fac12de6518b138217df","last_reissued_at":"2026-05-18T02:25:47.983368Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:47.983368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On memetic search for the max-mean dispersion problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jin-Kao Hao, Xiangjing Lai","submitted_at":"2015-03-03T15:43:36Z","abstract_excerpt":"Given a set $V$ of $n$ elements and a distance matrix $[d_{ij}]_{n\\times n}$ among elements, the max-mean dispersion problem (MaxMeanDP) consists in selecting a subset $M$ from $V$ such that the mean dispersion (or distance) among the selected elements is maximized. Being a useful model to formulate several relevant applications, MaxMeanDP is known to be NP-hard and thus computationally difficult. In this paper, we present a highly effective memetic algorithm for MaxMeanDP which relies on solution recombination and local optimization to find high quality solutions. Computational experiments on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00980","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":"1503.00980","created_at":"2026-05-18T02:25:47.983451+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.00980v1","created_at":"2026-05-18T02:25:47.983451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00980","created_at":"2026-05-18T02:25:47.983451+00:00"},{"alias_kind":"pith_short_12","alias_value":"QTNKCL7UZLDW","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QTNKCL7UZLDWKON5","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QTNKCL7U","created_at":"2026-05-18T12:29:37.295048+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/QTNKCL7UZLDWKON5ETEE2W4IJY","json":"https://pith.science/pith/QTNKCL7UZLDWKON5ETEE2W4IJY.json","graph_json":"https://pith.science/api/pith-number/QTNKCL7UZLDWKON5ETEE2W4IJY/graph.json","events_json":"https://pith.science/api/pith-number/QTNKCL7UZLDWKON5ETEE2W4IJY/events.json","paper":"https://pith.science/paper/QTNKCL7U"},"agent_actions":{"view_html":"https://pith.science/pith/QTNKCL7UZLDWKON5ETEE2W4IJY","download_json":"https://pith.science/pith/QTNKCL7UZLDWKON5ETEE2W4IJY.json","view_paper":"https://pith.science/paper/QTNKCL7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.00980&json=true","fetch_graph":"https://pith.science/api/pith-number/QTNKCL7UZLDWKON5ETEE2W4IJY/graph.json","fetch_events":"https://pith.science/api/pith-number/QTNKCL7UZLDWKON5ETEE2W4IJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QTNKCL7UZLDWKON5ETEE2W4IJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QTNKCL7UZLDWKON5ETEE2W4IJY/action/storage_attestation","attest_author":"https://pith.science/pith/QTNKCL7UZLDWKON5ETEE2W4IJY/action/author_attestation","sign_citation":"https://pith.science/pith/QTNKCL7UZLDWKON5ETEE2W4IJY/action/citation_signature","submit_replication":"https://pith.science/pith/QTNKCL7UZLDWKON5ETEE2W4IJY/action/replication_record"}},"created_at":"2026-05-18T02:25:47.983451+00:00","updated_at":"2026-05-18T02:25:47.983451+00:00"}