{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OI3TF6L6R7GHH2D44EO2YRG4RP","short_pith_number":"pith:OI3TF6L6","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"},"canonical_sha256":"723732f97e8fcc73e87ce11dac44dc8bc424157ecfecfdb40462d739562eb7e0","source":{"kind":"arxiv","id":"1608.04217","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04217","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04217v1","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04217","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"pith_short_12","alias_value":"OI3TF6L6R7GH","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OI3TF6L6R7GHH2D4","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OI3TF6L6","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OI3TF6L6R7GHH2D44EO2YRG4RP","target":"record","payload":{"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"},"canonical_sha256":"723732f97e8fcc73e87ce11dac44dc8bc424157ecfecfdb40462d739562eb7e0","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"},"source_kind":"arxiv","source_id":"1608.04217","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-18T01:09:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UeESJi1Qnl7Y9SwpzILgOouY7qHuS4iBpcwxpLiuNMDocPDee2BVYEuE5mOs6yUr6etXf5AQ5mzsDt2uih5bDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:28:02.302935Z"},"content_sha256":"51774ed3f09f49c8c607b7d9c07addf8efdb0099effe476c6e903177d290c6e6","schema_version":"1.0","event_id":"sha256:51774ed3f09f49c8c607b7d9c07addf8efdb0099effe476c6e903177d290c6e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OI3TF6L6R7GHH2D44EO2YRG4RP","target":"graph","payload":{"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"},"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-18T01:09:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NvGGIwVTsobW/W+UE5M4w4DKrBwrgTZXhvOjFedBaWJHFvpQoEvQdY7g6PMQVxkl48tGMFSqVTJR4HRymms9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:28:02.303280Z"},"content_sha256":"50ecf9d6ce049fa1b57e9aff23a0923b3a859e10628efc36a9bb089f0f58b254","schema_version":"1.0","event_id":"sha256:50ecf9d6ce049fa1b57e9aff23a0923b3a859e10628efc36a9bb089f0f58b254"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OI3TF6L6R7GHH2D44EO2YRG4RP/bundle.json","state_url":"https://pith.science/pith/OI3TF6L6R7GHH2D44EO2YRG4RP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OI3TF6L6R7GHH2D44EO2YRG4RP/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-01T15:28:02Z","links":{"resolver":"https://pith.science/pith/OI3TF6L6R7GHH2D44EO2YRG4RP","bundle":"https://pith.science/pith/OI3TF6L6R7GHH2D44EO2YRG4RP/bundle.json","state":"https://pith.science/pith/OI3TF6L6R7GHH2D44EO2YRG4RP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OI3TF6L6R7GHH2D44EO2YRG4RP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OI3TF6L6R7GHH2D44EO2YRG4RP","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":"4d7ca0237702c0c5b711b6e33755256e04f55930165277d51077143b8ecd7cd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-15T09:32:12Z","title_canon_sha256":"8aa83291695feab3963f5388e80e5268dc5b5772859ceaf12a46cbb33a7d20a5"},"schema_version":"1.0","source":{"id":"1608.04217","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04217","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04217v1","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04217","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"pith_short_12","alias_value":"OI3TF6L6R7GH","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OI3TF6L6R7GHH2D4","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OI3TF6L6","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:50ecf9d6ce049fa1b57e9aff23a0923b3a859e10628efc36a9bb089f0f58b254","target":"graph","created_at":"2026-05-18T01:09:04Z","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 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 ","authors_text":"Jin-Kao Hao, Yangming Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-15T09:32:12Z","title":"An iterated local search algorithm for the minimum differential dispersion problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04217","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:51774ed3f09f49c8c607b7d9c07addf8efdb0099effe476c6e903177d290c6e6","target":"record","created_at":"2026-05-18T01:09:04Z","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":"4d7ca0237702c0c5b711b6e33755256e04f55930165277d51077143b8ecd7cd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-15T09:32:12Z","title_canon_sha256":"8aa83291695feab3963f5388e80e5268dc5b5772859ceaf12a46cbb33a7d20a5"},"schema_version":"1.0","source":{"id":"1608.04217","kind":"arxiv","version":1}},"canonical_sha256":"723732f97e8fcc73e87ce11dac44dc8bc424157ecfecfdb40462d739562eb7e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"723732f97e8fcc73e87ce11dac44dc8bc424157ecfecfdb40462d739562eb7e0","first_computed_at":"2026-05-18T01:09:04.051372Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:04.051372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B1+u8Y3UPhbZwmRPE5jOVzJrbJDP40/1jNEAMCAM/lk8QEWy6jyi1NUjHHYRb+SrQU1TLhvpl1V3eXnwR9bwAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:04.051909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.04217","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51774ed3f09f49c8c607b7d9c07addf8efdb0099effe476c6e903177d290c6e6","sha256:50ecf9d6ce049fa1b57e9aff23a0923b3a859e10628efc36a9bb089f0f58b254"],"state_sha256":"03b08187812f1ecdcb09e8e4c112572b93d39177bb097adb659298518a5935ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fn46YAUSfP2+m4KKpex9ZKl/iX9EW7fY9OvrWGMmOf5m5LiaNnaMp16BFLWH7JFyLNOZLWW1AMmLh1mE+UTQDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:28:02.305333Z","bundle_sha256":"72ca41d5a0591473edb58d5f3ff6fc7f68f655fa48206c7eab896e54ff9d5513"}}