{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RRV7IGRO4VDJRLNDGEHNNO7WZ3","short_pith_number":"pith:RRV7IGRO","canonical_record":{"source":{"id":"1802.03482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-10T00:09:42Z","cross_cats_sorted":[],"title_canon_sha256":"14b2cfd5e484c4a29dd086ddb837f54e7cbf01d101b7cf8c698ca1e657d1b0d0","abstract_canon_sha256":"7052cd8adaa8daebf68480454779b7d212ef3c5be767b7d51838a1b879db6bf4"},"schema_version":"1.0"},"canonical_sha256":"8c6bf41a2ee54698ada3310ed6bbf6ceebe1f50734043cf549b13fe4493affdd","source":{"kind":"arxiv","id":"1802.03482","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03482","created_at":"2026-05-18T00:23:51Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03482v1","created_at":"2026-05-18T00:23:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03482","created_at":"2026-05-18T00:23:51Z"},{"alias_kind":"pith_short_12","alias_value":"RRV7IGRO4VDJ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RRV7IGRO4VDJRLND","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RRV7IGRO","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RRV7IGRO4VDJRLNDGEHNNO7WZ3","target":"record","payload":{"canonical_record":{"source":{"id":"1802.03482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-10T00:09:42Z","cross_cats_sorted":[],"title_canon_sha256":"14b2cfd5e484c4a29dd086ddb837f54e7cbf01d101b7cf8c698ca1e657d1b0d0","abstract_canon_sha256":"7052cd8adaa8daebf68480454779b7d212ef3c5be767b7d51838a1b879db6bf4"},"schema_version":"1.0"},"canonical_sha256":"8c6bf41a2ee54698ada3310ed6bbf6ceebe1f50734043cf549b13fe4493affdd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:51.456425Z","signature_b64":"qok8luHBOHEw1SpVqjM5LavWnfkEb3K4QKtr/vE+UgTCYJoEAr8NCTXzuJ4Ip+AhFjxJzZcNmmWLh+CsCdFEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c6bf41a2ee54698ada3310ed6bbf6ceebe1f50734043cf549b13fe4493affdd","last_reissued_at":"2026-05-18T00:23:51.455748Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:51.455748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.03482","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-18T00:23:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bUVnzq2ccTFiyU4+wnUE1lp5lV1VFJhaHr8usIep7tsFvGxVycS7NxEjPEP7epYegDgh/MENR198FC27IriKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:13:08.633200Z"},"content_sha256":"61f3ad2d717dac316e4ab908e1fe69c73bbfab529d2f17c169745890f52674da","schema_version":"1.0","event_id":"sha256:61f3ad2d717dac316e4ab908e1fe69c73bbfab529d2f17c169745890f52674da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RRV7IGRO4VDJRLNDGEHNNO7WZ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Continuation Method for Discrete Optimization and its Application to Nearest Neighbor Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ali Shameli, Yasin Abbasi-Yadkori","submitted_at":"2018-02-10T00:09:42Z","abstract_excerpt":"The continuation method is a popular approach in non-convex optimization and computer vision. The main idea is to start from a simple function that can be minimized efficiently, and gradually transform it to the more complicated original objective function. The solution of the simpler problem is used as the starting point to solve the original problem. We show a continuation method for discrete optimization problems. Ideally, we would like the evolved function to be hill-climbing friendly and to have the same global minima as the original function. We show that the proposed continuation method"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03482","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-18T00:23:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C6wCV/1AmnH2jbnnKeyN5Aj5bu0ruRsdDtnR3PhBDCRQ/wTH/2NLLt62GjbuytYO9mCHLx8cLIkZiLo5gG/zAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:13:08.633617Z"},"content_sha256":"b2dd2c48325ab1647ac0c2c1f203f949328ae09ebf963a78e09f2f3a720a9be8","schema_version":"1.0","event_id":"sha256:b2dd2c48325ab1647ac0c2c1f203f949328ae09ebf963a78e09f2f3a720a9be8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RRV7IGRO4VDJRLNDGEHNNO7WZ3/bundle.json","state_url":"https://pith.science/pith/RRV7IGRO4VDJRLNDGEHNNO7WZ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RRV7IGRO4VDJRLNDGEHNNO7WZ3/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-29T15:13:08Z","links":{"resolver":"https://pith.science/pith/RRV7IGRO4VDJRLNDGEHNNO7WZ3","bundle":"https://pith.science/pith/RRV7IGRO4VDJRLNDGEHNNO7WZ3/bundle.json","state":"https://pith.science/pith/RRV7IGRO4VDJRLNDGEHNNO7WZ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RRV7IGRO4VDJRLNDGEHNNO7WZ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RRV7IGRO4VDJRLNDGEHNNO7WZ3","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":"7052cd8adaa8daebf68480454779b7d212ef3c5be767b7d51838a1b879db6bf4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-10T00:09:42Z","title_canon_sha256":"14b2cfd5e484c4a29dd086ddb837f54e7cbf01d101b7cf8c698ca1e657d1b0d0"},"schema_version":"1.0","source":{"id":"1802.03482","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03482","created_at":"2026-05-18T00:23:51Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03482v1","created_at":"2026-05-18T00:23:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03482","created_at":"2026-05-18T00:23:51Z"},{"alias_kind":"pith_short_12","alias_value":"RRV7IGRO4VDJ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RRV7IGRO4VDJRLND","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RRV7IGRO","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:b2dd2c48325ab1647ac0c2c1f203f949328ae09ebf963a78e09f2f3a720a9be8","target":"graph","created_at":"2026-05-18T00:23:51Z","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":"The continuation method is a popular approach in non-convex optimization and computer vision. The main idea is to start from a simple function that can be minimized efficiently, and gradually transform it to the more complicated original objective function. The solution of the simpler problem is used as the starting point to solve the original problem. We show a continuation method for discrete optimization problems. Ideally, we would like the evolved function to be hill-climbing friendly and to have the same global minima as the original function. We show that the proposed continuation method","authors_text":"Ali Shameli, Yasin Abbasi-Yadkori","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-10T00:09:42Z","title":"A Continuation Method for Discrete Optimization and its Application to Nearest Neighbor Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03482","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:61f3ad2d717dac316e4ab908e1fe69c73bbfab529d2f17c169745890f52674da","target":"record","created_at":"2026-05-18T00:23:51Z","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":"7052cd8adaa8daebf68480454779b7d212ef3c5be767b7d51838a1b879db6bf4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-10T00:09:42Z","title_canon_sha256":"14b2cfd5e484c4a29dd086ddb837f54e7cbf01d101b7cf8c698ca1e657d1b0d0"},"schema_version":"1.0","source":{"id":"1802.03482","kind":"arxiv","version":1}},"canonical_sha256":"8c6bf41a2ee54698ada3310ed6bbf6ceebe1f50734043cf549b13fe4493affdd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c6bf41a2ee54698ada3310ed6bbf6ceebe1f50734043cf549b13fe4493affdd","first_computed_at":"2026-05-18T00:23:51.455748Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:51.455748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qok8luHBOHEw1SpVqjM5LavWnfkEb3K4QKtr/vE+UgTCYJoEAr8NCTXzuJ4Ip+AhFjxJzZcNmmWLh+CsCdFEDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:51.456425Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03482","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61f3ad2d717dac316e4ab908e1fe69c73bbfab529d2f17c169745890f52674da","sha256:b2dd2c48325ab1647ac0c2c1f203f949328ae09ebf963a78e09f2f3a720a9be8"],"state_sha256":"91c56e09b7226acd637d00cf1393bff7f3b8852e2a448c08ce1bbb967acaf687"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s7dHKMRDD4lzSZOln0YULL8Da19H4k/Z2bng1fpLB65gW0qIumOQsH1ebhJCgl7R2SWgbJREqF5uPayWmH/zAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:13:08.636640Z","bundle_sha256":"4ca47cc77dfe0478087ff96a696d5a3f72f829ce84774f42b1ee1b9f8caef3c9"}}