{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QTNKCL7UZLDWKON5ETEE2W4IJY","short_pith_number":"pith:QTNKCL7U","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"},"canonical_sha256":"84daa12ff4cac76539bd24c84d5b884e095de78e5a58fac12de6518b138217df","source":{"kind":"arxiv","id":"1503.00980","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00980","created_at":"2026-05-18T02:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00980v1","created_at":"2026-05-18T02:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00980","created_at":"2026-05-18T02:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"QTNKCL7UZLDW","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QTNKCL7UZLDWKON5","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QTNKCL7U","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QTNKCL7UZLDWKON5ETEE2W4IJY","target":"record","payload":{"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"},"canonical_sha256":"84daa12ff4cac76539bd24c84d5b884e095de78e5a58fac12de6518b138217df","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"},"source_kind":"arxiv","source_id":"1503.00980","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:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hqyRNFbUHzT+YWTaKfa26rqO0Twv13GOMOBb/RFuQ1ZHyAq5lKmQ9z2NqVCWexKU8OOTu1AogOxZqA6i0l66Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:13:12.854655Z"},"content_sha256":"05727000f90f84f46f09749b394e4040c151df464fe9816b91fb49301c830505","schema_version":"1.0","event_id":"sha256:05727000f90f84f46f09749b394e4040c151df464fe9816b91fb49301c830505"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QTNKCL7UZLDWKON5ETEE2W4IJY","target":"graph","payload":{"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"},"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:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WgzNNS11Tz10a9key9p2nC9rRIewVHhQl6nFivT04iavhr80xUu2Cj562OKGd+jQN+c2M1mz2S9hOg8MnkuGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:13:12.855009Z"},"content_sha256":"db10dd2eeb0e646009c3f33939b468adc9495ad9de5dabcbb5e5cd7128b7504f","schema_version":"1.0","event_id":"sha256:db10dd2eeb0e646009c3f33939b468adc9495ad9de5dabcbb5e5cd7128b7504f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QTNKCL7UZLDWKON5ETEE2W4IJY/bundle.json","state_url":"https://pith.science/pith/QTNKCL7UZLDWKON5ETEE2W4IJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QTNKCL7UZLDWKON5ETEE2W4IJY/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-01T19:13:12Z","links":{"resolver":"https://pith.science/pith/QTNKCL7UZLDWKON5ETEE2W4IJY","bundle":"https://pith.science/pith/QTNKCL7UZLDWKON5ETEE2W4IJY/bundle.json","state":"https://pith.science/pith/QTNKCL7UZLDWKON5ETEE2W4IJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QTNKCL7UZLDWKON5ETEE2W4IJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QTNKCL7UZLDWKON5ETEE2W4IJY","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":"649b38c3e9697c5e87d46ac546f8619e362ca7100e648440384d021df5e11387","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-03-03T15:43:36Z","title_canon_sha256":"ba1c956a6e59404603e3751522926f1af64bb885e067a956a3068458173344ae"},"schema_version":"1.0","source":{"id":"1503.00980","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00980","created_at":"2026-05-18T02:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00980v1","created_at":"2026-05-18T02:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00980","created_at":"2026-05-18T02:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"QTNKCL7UZLDW","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QTNKCL7UZLDWKON5","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QTNKCL7U","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:db10dd2eeb0e646009c3f33939b468adc9495ad9de5dabcbb5e5cd7128b7504f","target":"graph","created_at":"2026-05-18T02:25:47Z","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":"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","authors_text":"Jin-Kao Hao, Xiangjing Lai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-03-03T15:43:36Z","title":"On memetic search for the max-mean dispersion problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00980","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:05727000f90f84f46f09749b394e4040c151df464fe9816b91fb49301c830505","target":"record","created_at":"2026-05-18T02:25:47Z","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":"649b38c3e9697c5e87d46ac546f8619e362ca7100e648440384d021df5e11387","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-03-03T15:43:36Z","title_canon_sha256":"ba1c956a6e59404603e3751522926f1af64bb885e067a956a3068458173344ae"},"schema_version":"1.0","source":{"id":"1503.00980","kind":"arxiv","version":1}},"canonical_sha256":"84daa12ff4cac76539bd24c84d5b884e095de78e5a58fac12de6518b138217df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84daa12ff4cac76539bd24c84d5b884e095de78e5a58fac12de6518b138217df","first_computed_at":"2026-05-18T02:25:47.983368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:47.983368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dYZybTzGGNLSg+/tqU5V5+qU12dnsJyJLAJvqulsVeCpzMKCteVMreUmCgb+wNt5UEr2pFOwbYi2Acjtn5NhCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:47.983946Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.00980","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05727000f90f84f46f09749b394e4040c151df464fe9816b91fb49301c830505","sha256:db10dd2eeb0e646009c3f33939b468adc9495ad9de5dabcbb5e5cd7128b7504f"],"state_sha256":"9bc6603164951240ec92db6eec7235de82867c9995ca908a4f5a5cd55a6d39da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZkaRJU4iK5lo5n1e2tu54yxuYLeKL9ESuSbQ+dNa6IUuDqziY0Q+NLfkLgGneY3XGUZCQYnH1E/0NmrBcI0OAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:13:12.857113Z","bundle_sha256":"0d24c112f6f74baf1f3df8563af58dd6439c28f6410fee7b611dd50b43a9cb89"}}