{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CNRNTWKOCWZG35LI6CCZGSDPAK","short_pith_number":"pith:CNRNTWKO","schema_version":"1.0","canonical_sha256":"1362d9d94e15b26df568f08593486f02a976c2f0667dd484bbfe6029c46757db","source":{"kind":"arxiv","id":"1212.6510","version":1},"attestation_state":"computed","paper":{"title":"On Neighborhood Tree Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Bilel Derbel (LIFL, Houda Derbel, INRIA Lille - Nord Europe)","submitted_at":"2012-12-28T12:31:19Z","abstract_excerpt":"We consider the neighborhood tree induced by alternating the use of different neighborhood structures within a local search descent. We investigate the issue of designing a search strategy operating at the neighborhood tree level by exploring different paths of the tree in a heuristic way. We show that allowing the search to 'backtrack' to a previously visited solution and resuming the iterative variable neighborhood descent by 'pruning' the already explored neighborhood branches leads to the design of effective and efficient search heuristics. We describe this idea by discussing its basic des"},"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":"1212.6510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2012-12-28T12:31:19Z","cross_cats_sorted":[],"title_canon_sha256":"e27cf332290c7024eab6a97b3110f625bec3f49469b09c4772119478141c46ba","abstract_canon_sha256":"44674d8dd1aee28247a06943a5b2bf20212aa0b2b3dd01f39a4c378f6751a7f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:31.751751Z","signature_b64":"3UAy0EUihbKo2MwIcqS0rsGWYHXPLgxEpaGIn/UCtERy2CU3a2Nm/oQhlKVvHxhSyeAFb9zXeBXM03R2WA9fBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1362d9d94e15b26df568f08593486f02a976c2f0667dd484bbfe6029c46757db","last_reissued_at":"2026-05-18T03:37:31.751022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:31.751022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Neighborhood Tree Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Bilel Derbel (LIFL, Houda Derbel, INRIA Lille - Nord Europe)","submitted_at":"2012-12-28T12:31:19Z","abstract_excerpt":"We consider the neighborhood tree induced by alternating the use of different neighborhood structures within a local search descent. We investigate the issue of designing a search strategy operating at the neighborhood tree level by exploring different paths of the tree in a heuristic way. We show that allowing the search to 'backtrack' to a previously visited solution and resuming the iterative variable neighborhood descent by 'pruning' the already explored neighborhood branches leads to the design of effective and efficient search heuristics. We describe this idea by discussing its basic des"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6510","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":"1212.6510","created_at":"2026-05-18T03:37:31.751124+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.6510v1","created_at":"2026-05-18T03:37:31.751124+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6510","created_at":"2026-05-18T03:37:31.751124+00:00"},{"alias_kind":"pith_short_12","alias_value":"CNRNTWKOCWZG","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CNRNTWKOCWZG35LI","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CNRNTWKO","created_at":"2026-05-18T12:27:01.376967+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/CNRNTWKOCWZG35LI6CCZGSDPAK","json":"https://pith.science/pith/CNRNTWKOCWZG35LI6CCZGSDPAK.json","graph_json":"https://pith.science/api/pith-number/CNRNTWKOCWZG35LI6CCZGSDPAK/graph.json","events_json":"https://pith.science/api/pith-number/CNRNTWKOCWZG35LI6CCZGSDPAK/events.json","paper":"https://pith.science/paper/CNRNTWKO"},"agent_actions":{"view_html":"https://pith.science/pith/CNRNTWKOCWZG35LI6CCZGSDPAK","download_json":"https://pith.science/pith/CNRNTWKOCWZG35LI6CCZGSDPAK.json","view_paper":"https://pith.science/paper/CNRNTWKO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.6510&json=true","fetch_graph":"https://pith.science/api/pith-number/CNRNTWKOCWZG35LI6CCZGSDPAK/graph.json","fetch_events":"https://pith.science/api/pith-number/CNRNTWKOCWZG35LI6CCZGSDPAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CNRNTWKOCWZG35LI6CCZGSDPAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CNRNTWKOCWZG35LI6CCZGSDPAK/action/storage_attestation","attest_author":"https://pith.science/pith/CNRNTWKOCWZG35LI6CCZGSDPAK/action/author_attestation","sign_citation":"https://pith.science/pith/CNRNTWKOCWZG35LI6CCZGSDPAK/action/citation_signature","submit_replication":"https://pith.science/pith/CNRNTWKOCWZG35LI6CCZGSDPAK/action/replication_record"}},"created_at":"2026-05-18T03:37:31.751124+00:00","updated_at":"2026-05-18T03:37:31.751124+00:00"}