{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:B4HAM5QXGOUVXWQH2PVKZL26MZ","short_pith_number":"pith:B4HAM5QX","canonical_record":{"source":{"id":"1401.3894","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-16T05:17:32Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"90f7ae73c7802eb4469827c42fe2e137b4029b22694fe3a24ea938855add353d","abstract_canon_sha256":"8fdde160f2d74d7ad2902741d45fc66145240fcd838398191b2964a5ac19e1ce"},"schema_version":"1.0"},"canonical_sha256":"0f0e06761733a95bda07d3eaacaf5e6661b77edcb22530daf634f1db41a14658","source":{"kind":"arxiv","id":"1401.3894","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3894","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3894v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3894","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"B4HAM5QXGOUV","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"B4HAM5QXGOUVXWQH","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"B4HAM5QX","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:B4HAM5QXGOUVXWQH2PVKZL26MZ","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3894","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-16T05:17:32Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"90f7ae73c7802eb4469827c42fe2e137b4029b22694fe3a24ea938855add353d","abstract_canon_sha256":"8fdde160f2d74d7ad2902741d45fc66145240fcd838398191b2964a5ac19e1ce"},"schema_version":"1.0"},"canonical_sha256":"0f0e06761733a95bda07d3eaacaf5e6661b77edcb22530daf634f1db41a14658","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:06.182781Z","signature_b64":"PglX5IabsNmva6IsGb9fZ/ExhKiVwhLLQxHSj7KvhtAg9s6dq26NV1W1nrLT4HyhYrKqo4kY/GTUHcJ7yYcyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f0e06761733a95bda07d3eaacaf5e6661b77edcb22530daf634f1db41a14658","last_reissued_at":"2026-05-18T03:02:06.181995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:06.181995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3894","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-18T03:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4nf2k25jkCSGRAd/6cYPV53Ya4/uS4+PwJAL+nXItaciaeyZJ2YztfMVWrClKB2q4JVxeAqDqBzvXt3U3piCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:01:43.896599Z"},"content_sha256":"131ea5108fe7450e83ca78971e207095de054f4a83efb456b06ba42d45634088","schema_version":"1.0","event_id":"sha256:131ea5108fe7450e83ca78971e207095de054f4a83efb456b06ba42d45634088"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:B4HAM5QXGOUVXWQH2PVKZL26MZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Multi-Start Strategies for Local Search Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andr\\'as Gy\\\"orgy, Levente Kocsis","submitted_at":"2014-01-16T05:17:32Z","abstract_excerpt":"Local search algorithms applied to optimization problems often suffer from getting trapped in a local optimum. The common solution for this deficiency is to restart the algorithm when no progress is observed. Alternatively, one can start multiple instances of a local search algorithm, and allocate computational resources (in particular, processing time) to the instances depending on their behavior. Hence, a multi-start strategy has to decide (dynamically) when to allocate additional resources to a particular instance and when to start new instances. In this paper we propose multi-start strateg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3894","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-18T03:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n4Ice5ouERm1lfcz7VYUADgEu8awBe+WcpmYHDops7oRDFtI+qMBBJpe7eR0qHry+dR8sPzWzlHcB/DeI4eMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:01:43.897370Z"},"content_sha256":"4ac50fbb7a5824a363ec2ec0817b01e22ef7145b88b60d5ec4438a8bd73acb60","schema_version":"1.0","event_id":"sha256:4ac50fbb7a5824a363ec2ec0817b01e22ef7145b88b60d5ec4438a8bd73acb60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B4HAM5QXGOUVXWQH2PVKZL26MZ/bundle.json","state_url":"https://pith.science/pith/B4HAM5QXGOUVXWQH2PVKZL26MZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B4HAM5QXGOUVXWQH2PVKZL26MZ/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-11T10:01:43Z","links":{"resolver":"https://pith.science/pith/B4HAM5QXGOUVXWQH2PVKZL26MZ","bundle":"https://pith.science/pith/B4HAM5QXGOUVXWQH2PVKZL26MZ/bundle.json","state":"https://pith.science/pith/B4HAM5QXGOUVXWQH2PVKZL26MZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B4HAM5QXGOUVXWQH2PVKZL26MZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:B4HAM5QXGOUVXWQH2PVKZL26MZ","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":"8fdde160f2d74d7ad2902741d45fc66145240fcd838398191b2964a5ac19e1ce","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-16T05:17:32Z","title_canon_sha256":"90f7ae73c7802eb4469827c42fe2e137b4029b22694fe3a24ea938855add353d"},"schema_version":"1.0","source":{"id":"1401.3894","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3894","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3894v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3894","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"B4HAM5QXGOUV","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"B4HAM5QXGOUVXWQH","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"B4HAM5QX","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:4ac50fbb7a5824a363ec2ec0817b01e22ef7145b88b60d5ec4438a8bd73acb60","target":"graph","created_at":"2026-05-18T03:02:06Z","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":"Local search algorithms applied to optimization problems often suffer from getting trapped in a local optimum. The common solution for this deficiency is to restart the algorithm when no progress is observed. Alternatively, one can start multiple instances of a local search algorithm, and allocate computational resources (in particular, processing time) to the instances depending on their behavior. Hence, a multi-start strategy has to decide (dynamically) when to allocate additional resources to a particular instance and when to start new instances. In this paper we propose multi-start strateg","authors_text":"Andr\\'as Gy\\\"orgy, Levente Kocsis","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-16T05:17:32Z","title":"Efficient Multi-Start Strategies for Local Search Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3894","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:131ea5108fe7450e83ca78971e207095de054f4a83efb456b06ba42d45634088","target":"record","created_at":"2026-05-18T03:02:06Z","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":"8fdde160f2d74d7ad2902741d45fc66145240fcd838398191b2964a5ac19e1ce","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-16T05:17:32Z","title_canon_sha256":"90f7ae73c7802eb4469827c42fe2e137b4029b22694fe3a24ea938855add353d"},"schema_version":"1.0","source":{"id":"1401.3894","kind":"arxiv","version":1}},"canonical_sha256":"0f0e06761733a95bda07d3eaacaf5e6661b77edcb22530daf634f1db41a14658","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f0e06761733a95bda07d3eaacaf5e6661b77edcb22530daf634f1db41a14658","first_computed_at":"2026-05-18T03:02:06.181995Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:06.181995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PglX5IabsNmva6IsGb9fZ/ExhKiVwhLLQxHSj7KvhtAg9s6dq26NV1W1nrLT4HyhYrKqo4kY/GTUHcJ7yYcyBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:06.182781Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3894","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:131ea5108fe7450e83ca78971e207095de054f4a83efb456b06ba42d45634088","sha256:4ac50fbb7a5824a363ec2ec0817b01e22ef7145b88b60d5ec4438a8bd73acb60"],"state_sha256":"060c03310d2e04b5aeffcf4d7ecc7cbc3762828da06fd91cdb02b3660de1dc5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m9Ibhi/tGm1c7Ddg7qtpUExFRux0TNNwK1LkfhuW2CzZVJxoW83/wm1y3KMecPmpTQL+d8XrUY1zffLR+mJeBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:01:43.901345Z","bundle_sha256":"9608d96e69e5a6dbdeaaccfc9ac7286d5282936996c45a41debc8f89ebf62445"}}