{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2QF5WTP2YMIHH5OTTRJE6GDC46","short_pith_number":"pith:2QF5WTP2","canonical_record":{"source":{"id":"1208.1688","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-08T15:21:50Z","cross_cats_sorted":[],"title_canon_sha256":"4a23a34d3a1df4aba3df19fc0ce042bbb830362d3b9d8b7ddd1a4cd956b0c632","abstract_canon_sha256":"11d1f3cdc1189646b7d3edb0a139020161ca741b78f52d97bc685ab0bbda902f"},"schema_version":"1.0"},"canonical_sha256":"d40bdb4dfac31073f5d39c524f1862e79cf4b73207dfc17d482b9b3f8b5c28d2","source":{"kind":"arxiv","id":"1208.1688","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1688","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1688v3","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1688","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"2QF5WTP2YMIH","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2QF5WTP2YMIHH5OT","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2QF5WTP2","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2QF5WTP2YMIHH5OTTRJE6GDC46","target":"record","payload":{"canonical_record":{"source":{"id":"1208.1688","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-08T15:21:50Z","cross_cats_sorted":[],"title_canon_sha256":"4a23a34d3a1df4aba3df19fc0ce042bbb830362d3b9d8b7ddd1a4cd956b0c632","abstract_canon_sha256":"11d1f3cdc1189646b7d3edb0a139020161ca741b78f52d97bc685ab0bbda902f"},"schema_version":"1.0"},"canonical_sha256":"d40bdb4dfac31073f5d39c524f1862e79cf4b73207dfc17d482b9b3f8b5c28d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:35.202289Z","signature_b64":"V81ShdnJw8FNGKBD90QkLGYzi51gHY2mOfKG/HR8AmcKMLpjSA/OJNQnKcwE/6A2HA4Dr5d7AZS+tS864SgrDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d40bdb4dfac31073f5d39c524f1862e79cf4b73207dfc17d482b9b3f8b5c28d2","last_reissued_at":"2026-05-18T03:48:35.201611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:35.201611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.1688","source_version":3,"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:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"95Rkz8r2qvcS3o9AokyttBeVas6mk4uK3OMRBmwBW3Ghf7J6QsmW7HkeoxsrRyipHwAAdBqMDnBHO0dag1+EAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:23:21.829746Z"},"content_sha256":"44a5ed1ba76bcb898f2e590c25576f937da985da08a3fc5eee853a80e9583a09","schema_version":"1.0","event_id":"sha256:44a5ed1ba76bcb898f2e590c25576f937da985da08a3fc5eee853a80e9583a09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2QF5WTP2YMIHH5OTTRJE6GDC46","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Don't Be Strict in Local Search!","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eun Jung Kim, Saket Saurabh, Sebastian Ordyniak, Serge Gaspers, Stefan Szeider","submitted_at":"2012-08-08T15:21:50Z","abstract_excerpt":"Local Search is one of the fundamental approaches to combinatorial optimization and it is used throughout AI. Several local search algorithms are based on searching the k-exchange neighborhood. This is the set of solutions that can be obtained from the current solution by exchanging at most k elements. As a rule of thumb, the larger k is, the better are the chances of finding an improved solution. However, for inputs of size n, a na\\\"ive brute-force search of the k-exchange neighborhood requires n to the power of O(k) time, which is not practical even for very small values of k.\n  Fellows et a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1688","kind":"arxiv","version":3},"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:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FUdGNMsxZCYqE499oWk19x+ekTyHeNky7+WOjO3BOq39YdXCUk5HpR27Dh7FkE92xO8BlcJzZ+vT+z1jLq52BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:23:21.830445Z"},"content_sha256":"853ce1696c7fe3e5f75892ecda05c570948ee7392f83718dd997c4f92d9bdcdd","schema_version":"1.0","event_id":"sha256:853ce1696c7fe3e5f75892ecda05c570948ee7392f83718dd997c4f92d9bdcdd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2QF5WTP2YMIHH5OTTRJE6GDC46/bundle.json","state_url":"https://pith.science/pith/2QF5WTP2YMIHH5OTTRJE6GDC46/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2QF5WTP2YMIHH5OTTRJE6GDC46/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-05-29T18:23:21Z","links":{"resolver":"https://pith.science/pith/2QF5WTP2YMIHH5OTTRJE6GDC46","bundle":"https://pith.science/pith/2QF5WTP2YMIHH5OTTRJE6GDC46/bundle.json","state":"https://pith.science/pith/2QF5WTP2YMIHH5OTTRJE6GDC46/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2QF5WTP2YMIHH5OTTRJE6GDC46/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2QF5WTP2YMIHH5OTTRJE6GDC46","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":"11d1f3cdc1189646b7d3edb0a139020161ca741b78f52d97bc685ab0bbda902f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-08T15:21:50Z","title_canon_sha256":"4a23a34d3a1df4aba3df19fc0ce042bbb830362d3b9d8b7ddd1a4cd956b0c632"},"schema_version":"1.0","source":{"id":"1208.1688","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1688","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1688v3","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1688","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"2QF5WTP2YMIH","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2QF5WTP2YMIHH5OT","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2QF5WTP2","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:853ce1696c7fe3e5f75892ecda05c570948ee7392f83718dd997c4f92d9bdcdd","target":"graph","created_at":"2026-05-18T03:48:35Z","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 is one of the fundamental approaches to combinatorial optimization and it is used throughout AI. Several local search algorithms are based on searching the k-exchange neighborhood. This is the set of solutions that can be obtained from the current solution by exchanging at most k elements. As a rule of thumb, the larger k is, the better are the chances of finding an improved solution. However, for inputs of size n, a na\\\"ive brute-force search of the k-exchange neighborhood requires n to the power of O(k) time, which is not practical even for very small values of k.\n  Fellows et a","authors_text":"Eun Jung Kim, Saket Saurabh, Sebastian Ordyniak, Serge Gaspers, Stefan Szeider","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-08T15:21:50Z","title":"Don't Be Strict in Local Search!"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1688","kind":"arxiv","version":3},"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:44a5ed1ba76bcb898f2e590c25576f937da985da08a3fc5eee853a80e9583a09","target":"record","created_at":"2026-05-18T03:48:35Z","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":"11d1f3cdc1189646b7d3edb0a139020161ca741b78f52d97bc685ab0bbda902f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-08T15:21:50Z","title_canon_sha256":"4a23a34d3a1df4aba3df19fc0ce042bbb830362d3b9d8b7ddd1a4cd956b0c632"},"schema_version":"1.0","source":{"id":"1208.1688","kind":"arxiv","version":3}},"canonical_sha256":"d40bdb4dfac31073f5d39c524f1862e79cf4b73207dfc17d482b9b3f8b5c28d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d40bdb4dfac31073f5d39c524f1862e79cf4b73207dfc17d482b9b3f8b5c28d2","first_computed_at":"2026-05-18T03:48:35.201611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:35.201611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V81ShdnJw8FNGKBD90QkLGYzi51gHY2mOfKG/HR8AmcKMLpjSA/OJNQnKcwE/6A2HA4Dr5d7AZS+tS864SgrDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:35.202289Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.1688","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44a5ed1ba76bcb898f2e590c25576f937da985da08a3fc5eee853a80e9583a09","sha256:853ce1696c7fe3e5f75892ecda05c570948ee7392f83718dd997c4f92d9bdcdd"],"state_sha256":"5d46c29f52d3e40bf78c667f588074fe55f7778c97a46e5d950e61a24825b035"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q5134VikaSmOU+pHYQXX798BLakgORstfROXNNxHWqG+SufKFQ02ZIshV/47sYsJP3QvJfLOya8XKd4ak0evCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T18:23:21.834091Z","bundle_sha256":"1a375770c7cd10733f82f975e0ff91da4865701cac39c318f4fd0bd1c5faff24"}}