{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:R7XJC2GBXJ5AICNLPS6NKFN5D3","short_pith_number":"pith:R7XJC2GB","canonical_record":{"source":{"id":"1603.06459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-12T12:38:32Z","cross_cats_sorted":[],"title_canon_sha256":"0997cb17fd3f975c56a75b943c32fd3ed79c68fd04b2dde3bc2547b35de527bd","abstract_canon_sha256":"e8becd487faf92b90f820ff8f6a7f60419c64710812795ae8f83e30fdbf7580e"},"schema_version":"1.0"},"canonical_sha256":"8fee9168c1ba7a0409ab7cbcd515bd1ecfa32661facbe9a5613abd789591e99d","source":{"kind":"arxiv","id":"1603.06459","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06459","created_at":"2026-05-18T01:18:48Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06459v1","created_at":"2026-05-18T01:18:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06459","created_at":"2026-05-18T01:18:48Z"},{"alias_kind":"pith_short_12","alias_value":"R7XJC2GBXJ5A","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R7XJC2GBXJ5AICNL","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R7XJC2GB","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:R7XJC2GBXJ5AICNLPS6NKFN5D3","target":"record","payload":{"canonical_record":{"source":{"id":"1603.06459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-12T12:38:32Z","cross_cats_sorted":[],"title_canon_sha256":"0997cb17fd3f975c56a75b943c32fd3ed79c68fd04b2dde3bc2547b35de527bd","abstract_canon_sha256":"e8becd487faf92b90f820ff8f6a7f60419c64710812795ae8f83e30fdbf7580e"},"schema_version":"1.0"},"canonical_sha256":"8fee9168c1ba7a0409ab7cbcd515bd1ecfa32661facbe9a5613abd789591e99d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:48.481585Z","signature_b64":"3gMlSrsP0byc4F0MFeL6tfdxYPWwgzxwktlnGynIELVX75y3XeCzuUjlyZwm/kt8xXwTdXYp64nELyXb4uvjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fee9168c1ba7a0409ab7cbcd515bd1ecfa32661facbe9a5613abd789591e99d","last_reissued_at":"2026-05-18T01:18:48.480891Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:48.480891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.06459","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:18:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qGSlsytU6ZZwjIinB+U3dn6aDNwAJQo/22h/iWu+aGxIQQ9T/nsmlsXiHWwLggSaxfzP9NE7kBewNsr4qLwyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:45:26.419926Z"},"content_sha256":"a4558e466df96b51ada7ef531eeee7afac351de73930521572872f417354e612","schema_version":"1.0","event_id":"sha256:a4558e466df96b51ada7ef531eeee7afac351de73930521572872f417354e612"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:R7XJC2GBXJ5AICNLPS6NKFN5D3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterization of neighborhood behaviours in a multi-neighborhood local search algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Nguyen Thi Thanh Dang, Patrick De Causmaecker","submitted_at":"2016-03-12T12:38:32Z","abstract_excerpt":"We consider a multi-neighborhood local search algorithm with a large number of possible neighborhoods. Each neighborhood is accompanied by a weight value which represents the probability of being chosen at each iteration. These weights are fixed before the algorithm runs, and are considered as parameters of the algorithm. Given a set of instances, off-line tuning of the algorithm's parameters can be done by automated algorithm configuration tools (e.g., SMAC). However, the large number of neighborhoods can make the tuning expensive and difficult even when the number of parameters has been redu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06459","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:18:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3kamTr3ypGL+dpmIa1H02tJzBrOw7oPIwlj6luiBcSmvfopumnNDsW4DM9qL2EQmEmSb244zCTiSxDZfvoFEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:45:26.420454Z"},"content_sha256":"c3ada34e475aff32b4ee9ac3a56cb964f57fcffdec1b3949461213e328497c00","schema_version":"1.0","event_id":"sha256:c3ada34e475aff32b4ee9ac3a56cb964f57fcffdec1b3949461213e328497c00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R7XJC2GBXJ5AICNLPS6NKFN5D3/bundle.json","state_url":"https://pith.science/pith/R7XJC2GBXJ5AICNLPS6NKFN5D3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R7XJC2GBXJ5AICNLPS6NKFN5D3/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-26T00:45:26Z","links":{"resolver":"https://pith.science/pith/R7XJC2GBXJ5AICNLPS6NKFN5D3","bundle":"https://pith.science/pith/R7XJC2GBXJ5AICNLPS6NKFN5D3/bundle.json","state":"https://pith.science/pith/R7XJC2GBXJ5AICNLPS6NKFN5D3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R7XJC2GBXJ5AICNLPS6NKFN5D3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:R7XJC2GBXJ5AICNLPS6NKFN5D3","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":"e8becd487faf92b90f820ff8f6a7f60419c64710812795ae8f83e30fdbf7580e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-12T12:38:32Z","title_canon_sha256":"0997cb17fd3f975c56a75b943c32fd3ed79c68fd04b2dde3bc2547b35de527bd"},"schema_version":"1.0","source":{"id":"1603.06459","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06459","created_at":"2026-05-18T01:18:48Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06459v1","created_at":"2026-05-18T01:18:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06459","created_at":"2026-05-18T01:18:48Z"},{"alias_kind":"pith_short_12","alias_value":"R7XJC2GBXJ5A","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R7XJC2GBXJ5AICNL","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R7XJC2GB","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:c3ada34e475aff32b4ee9ac3a56cb964f57fcffdec1b3949461213e328497c00","target":"graph","created_at":"2026-05-18T01:18:48Z","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":"We consider a multi-neighborhood local search algorithm with a large number of possible neighborhoods. Each neighborhood is accompanied by a weight value which represents the probability of being chosen at each iteration. These weights are fixed before the algorithm runs, and are considered as parameters of the algorithm. Given a set of instances, off-line tuning of the algorithm's parameters can be done by automated algorithm configuration tools (e.g., SMAC). However, the large number of neighborhoods can make the tuning expensive and difficult even when the number of parameters has been redu","authors_text":"Nguyen Thi Thanh Dang, Patrick De Causmaecker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-12T12:38:32Z","title":"Characterization of neighborhood behaviours in a multi-neighborhood local search algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06459","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:a4558e466df96b51ada7ef531eeee7afac351de73930521572872f417354e612","target":"record","created_at":"2026-05-18T01:18:48Z","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":"e8becd487faf92b90f820ff8f6a7f60419c64710812795ae8f83e30fdbf7580e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-12T12:38:32Z","title_canon_sha256":"0997cb17fd3f975c56a75b943c32fd3ed79c68fd04b2dde3bc2547b35de527bd"},"schema_version":"1.0","source":{"id":"1603.06459","kind":"arxiv","version":1}},"canonical_sha256":"8fee9168c1ba7a0409ab7cbcd515bd1ecfa32661facbe9a5613abd789591e99d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fee9168c1ba7a0409ab7cbcd515bd1ecfa32661facbe9a5613abd789591e99d","first_computed_at":"2026-05-18T01:18:48.480891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:48.480891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3gMlSrsP0byc4F0MFeL6tfdxYPWwgzxwktlnGynIELVX75y3XeCzuUjlyZwm/kt8xXwTdXYp64nELyXb4uvjBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:48.481585Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.06459","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4558e466df96b51ada7ef531eeee7afac351de73930521572872f417354e612","sha256:c3ada34e475aff32b4ee9ac3a56cb964f57fcffdec1b3949461213e328497c00"],"state_sha256":"17f98f841944a196bf7a5e9dd3ed0a427bc29b0bb105acca7766f5ebf4140a6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1U8MqKqXpgcMhifl57ltCMl4sgMhJ7e2hAXN16nRghS+UMDnjbISYF+JS9xlBgaRH3gva8HlqreeDTXVlTRoAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T00:45:26.423213Z","bundle_sha256":"94cee49c77c0ec78a3b6704ff0bfde89d0f65457eee556bf96e4cef6e035f4bd"}}