{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OI3TF6L6R7GHH2D44EO2YRG4RP","short_pith_number":"pith:OI3TF6L6","schema_version":"1.0","canonical_sha256":"723732f97e8fcc73e87ce11dac44dc8bc424157ecfecfdb40462d739562eb7e0","source":{"kind":"arxiv","id":"1608.04217","version":1},"attestation_state":"computed","paper":{"title":"An iterated local search algorithm for the minimum differential dispersion problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jin-Kao Hao, Yangming Zhou","submitted_at":"2016-08-15T09:32:12Z","abstract_excerpt":"Given a set of $n$ elements separated by a pairwise distance matrix, the minimum differential dispersion problem (Min-Diff DP) aims to identify a subset of m elements (m < n) such that the difference between the maximum sum and the minimum sum of the inter-element distances between any two chosen elements is minimized. We propose an effective iterated local search (denoted by ILS_MinDiff) for Min-Diff DP. To ensure an effective exploration and exploitation of the search space, the proposed ILS_MinDiff algorithm iterates through three sequential search phases: a fast descent-based neighborhood "},"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":"1608.04217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-15T09:32:12Z","cross_cats_sorted":[],"title_canon_sha256":"8aa83291695feab3963f5388e80e5268dc5b5772859ceaf12a46cbb33a7d20a5","abstract_canon_sha256":"4d7ca0237702c0c5b711b6e33755256e04f55930165277d51077143b8ecd7cd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:04.051909Z","signature_b64":"B1+u8Y3UPhbZwmRPE5jOVzJrbJDP40/1jNEAMCAM/lk8QEWy6jyi1NUjHHYRb+SrQU1TLhvpl1V3eXnwR9bwAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"723732f97e8fcc73e87ce11dac44dc8bc424157ecfecfdb40462d739562eb7e0","last_reissued_at":"2026-05-18T01:09:04.051372Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:04.051372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An iterated local search algorithm for the minimum differential dispersion problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jin-Kao Hao, Yangming Zhou","submitted_at":"2016-08-15T09:32:12Z","abstract_excerpt":"Given a set of $n$ elements separated by a pairwise distance matrix, the minimum differential dispersion problem (Min-Diff DP) aims to identify a subset of m elements (m < n) such that the difference between the maximum sum and the minimum sum of the inter-element distances between any two chosen elements is minimized. We propose an effective iterated local search (denoted by ILS_MinDiff) for Min-Diff DP. To ensure an effective exploration and exploitation of the search space, the proposed ILS_MinDiff algorithm iterates through three sequential search phases: a fast descent-based neighborhood "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04217","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":"1608.04217","created_at":"2026-05-18T01:09:04.051466+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.04217v1","created_at":"2026-05-18T01:09:04.051466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04217","created_at":"2026-05-18T01:09:04.051466+00:00"},{"alias_kind":"pith_short_12","alias_value":"OI3TF6L6R7GH","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OI3TF6L6R7GHH2D4","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OI3TF6L6","created_at":"2026-05-18T12:30:36.002864+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/OI3TF6L6R7GHH2D44EO2YRG4RP","json":"https://pith.science/pith/OI3TF6L6R7GHH2D44EO2YRG4RP.json","graph_json":"https://pith.science/api/pith-number/OI3TF6L6R7GHH2D44EO2YRG4RP/graph.json","events_json":"https://pith.science/api/pith-number/OI3TF6L6R7GHH2D44EO2YRG4RP/events.json","paper":"https://pith.science/paper/OI3TF6L6"},"agent_actions":{"view_html":"https://pith.science/pith/OI3TF6L6R7GHH2D44EO2YRG4RP","download_json":"https://pith.science/pith/OI3TF6L6R7GHH2D44EO2YRG4RP.json","view_paper":"https://pith.science/paper/OI3TF6L6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.04217&json=true","fetch_graph":"https://pith.science/api/pith-number/OI3TF6L6R7GHH2D44EO2YRG4RP/graph.json","fetch_events":"https://pith.science/api/pith-number/OI3TF6L6R7GHH2D44EO2YRG4RP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OI3TF6L6R7GHH2D44EO2YRG4RP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OI3TF6L6R7GHH2D44EO2YRG4RP/action/storage_attestation","attest_author":"https://pith.science/pith/OI3TF6L6R7GHH2D44EO2YRG4RP/action/author_attestation","sign_citation":"https://pith.science/pith/OI3TF6L6R7GHH2D44EO2YRG4RP/action/citation_signature","submit_replication":"https://pith.science/pith/OI3TF6L6R7GHH2D44EO2YRG4RP/action/replication_record"}},"created_at":"2026-05-18T01:09:04.051466+00:00","updated_at":"2026-05-18T01:09:04.051466+00:00"}