{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BUVFTEGDB6UHUNGQIJUDYBBQZ3","short_pith_number":"pith:BUVFTEGD","canonical_record":{"source":{"id":"1505.01429","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-05-06T16:46:55Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"1c1dd7751327fa85d9277bd49657769846f4373039e66bd2a563465f2dedc31b","abstract_canon_sha256":"e7ed64c7253ede28fde8b5463054f00144b944d29ef28a6f4b23b3fb9bd53970"},"schema_version":"1.0"},"canonical_sha256":"0d2a5990c30fa87a34d042683c0430ced16bdaa51eb488e76576f77babcf5e78","source":{"kind":"arxiv","id":"1505.01429","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01429","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01429v3","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01429","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"BUVFTEGDB6UH","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BUVFTEGDB6UHUNGQ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BUVFTEGD","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BUVFTEGDB6UHUNGQIJUDYBBQZ3","target":"record","payload":{"canonical_record":{"source":{"id":"1505.01429","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-05-06T16:46:55Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"1c1dd7751327fa85d9277bd49657769846f4373039e66bd2a563465f2dedc31b","abstract_canon_sha256":"e7ed64c7253ede28fde8b5463054f00144b944d29ef28a6f4b23b3fb9bd53970"},"schema_version":"1.0"},"canonical_sha256":"0d2a5990c30fa87a34d042683c0430ced16bdaa51eb488e76576f77babcf5e78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:50.644591Z","signature_b64":"46cRcsuM2cNAXNZXFM0bLCqFHqetswDdCZiz7Rr6gB/ICyPk3qhvQekqrB8bBu1s+snxgZGJOSKekfi6RNYECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d2a5990c30fa87a34d042683c0430ced16bdaa51eb488e76576f77babcf5e78","last_reissued_at":"2026-05-18T01:16:50.643947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:50.643947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.01429","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-18T01:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ucTaAr4m+MzVyoWZ6D1ZNpXjDloE8dEK0Ti4/LlcmIQMTOICrqvtYsYCrKJGUuoMXjGF0WiTZ88KZiz0p8TzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:46:24.832281Z"},"content_sha256":"37e637d368e17dd2645b7e4f4cdf9a0cea0d411622f162e4674618e0ab7c2234","schema_version":"1.0","event_id":"sha256:37e637d368e17dd2645b7e4f4cdf9a0cea0d411622f162e4674618e0ab7c2234"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BUVFTEGDB6UHUNGQIJUDYBBQZ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geometry-Aware Neighborhood Search for Learning Local Models for Image Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"cs.CV","authors_text":"Christine Guillemot, Elif Vural, Julio Cesar Ferreira","submitted_at":"2015-05-06T16:46:55Z","abstract_excerpt":"Local learning of sparse image models has proven to be very effective to solve inverse problems in many computer vision applications. To learn such models, the data samples are often clustered using the K-means algorithm with the Euclidean distance as a dissimilarity metric. However, the Euclidean distance may not always be a good dissimilarity measure for comparing data samples lying on a manifold. In this paper, we propose two algorithms for determining a local subset of training samples from which a good local model can be computed for reconstructing a given input test sample, where we take"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01429","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-18T01:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N/1XGnLqNoWBQe0YrS/9P1We54dnjrR4taPLPZzYOqi7uVr2JM22oI+EtgDMn8d/t/uJFBu/8V2k8g4mIs0zAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:46:24.833131Z"},"content_sha256":"5a2b3f9fa61c16246d150ba73b61b6a86a271b0d28c4186bebbf5e53314e2077","schema_version":"1.0","event_id":"sha256:5a2b3f9fa61c16246d150ba73b61b6a86a271b0d28c4186bebbf5e53314e2077"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BUVFTEGDB6UHUNGQIJUDYBBQZ3/bundle.json","state_url":"https://pith.science/pith/BUVFTEGDB6UHUNGQIJUDYBBQZ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BUVFTEGDB6UHUNGQIJUDYBBQZ3/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-11T01:46:24Z","links":{"resolver":"https://pith.science/pith/BUVFTEGDB6UHUNGQIJUDYBBQZ3","bundle":"https://pith.science/pith/BUVFTEGDB6UHUNGQIJUDYBBQZ3/bundle.json","state":"https://pith.science/pith/BUVFTEGDB6UHUNGQIJUDYBBQZ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BUVFTEGDB6UHUNGQIJUDYBBQZ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BUVFTEGDB6UHUNGQIJUDYBBQZ3","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":"e7ed64c7253ede28fde8b5463054f00144b944d29ef28a6f4b23b3fb9bd53970","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-05-06T16:46:55Z","title_canon_sha256":"1c1dd7751327fa85d9277bd49657769846f4373039e66bd2a563465f2dedc31b"},"schema_version":"1.0","source":{"id":"1505.01429","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01429","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01429v3","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01429","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"BUVFTEGDB6UH","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BUVFTEGDB6UHUNGQ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BUVFTEGD","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:5a2b3f9fa61c16246d150ba73b61b6a86a271b0d28c4186bebbf5e53314e2077","target":"graph","created_at":"2026-05-18T01:16:50Z","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 learning of sparse image models has proven to be very effective to solve inverse problems in many computer vision applications. To learn such models, the data samples are often clustered using the K-means algorithm with the Euclidean distance as a dissimilarity metric. However, the Euclidean distance may not always be a good dissimilarity measure for comparing data samples lying on a manifold. In this paper, we propose two algorithms for determining a local subset of training samples from which a good local model can be computed for reconstructing a given input test sample, where we take","authors_text":"Christine Guillemot, Elif Vural, Julio Cesar Ferreira","cross_cats":["cs.IT","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-05-06T16:46:55Z","title":"Geometry-Aware Neighborhood Search for Learning Local Models for Image Reconstruction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01429","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:37e637d368e17dd2645b7e4f4cdf9a0cea0d411622f162e4674618e0ab7c2234","target":"record","created_at":"2026-05-18T01:16:50Z","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":"e7ed64c7253ede28fde8b5463054f00144b944d29ef28a6f4b23b3fb9bd53970","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-05-06T16:46:55Z","title_canon_sha256":"1c1dd7751327fa85d9277bd49657769846f4373039e66bd2a563465f2dedc31b"},"schema_version":"1.0","source":{"id":"1505.01429","kind":"arxiv","version":3}},"canonical_sha256":"0d2a5990c30fa87a34d042683c0430ced16bdaa51eb488e76576f77babcf5e78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d2a5990c30fa87a34d042683c0430ced16bdaa51eb488e76576f77babcf5e78","first_computed_at":"2026-05-18T01:16:50.643947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:50.643947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"46cRcsuM2cNAXNZXFM0bLCqFHqetswDdCZiz7Rr6gB/ICyPk3qhvQekqrB8bBu1s+snxgZGJOSKekfi6RNYECg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:50.644591Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.01429","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37e637d368e17dd2645b7e4f4cdf9a0cea0d411622f162e4674618e0ab7c2234","sha256:5a2b3f9fa61c16246d150ba73b61b6a86a271b0d28c4186bebbf5e53314e2077"],"state_sha256":"461e4177c53798cdc6e0931cb1963ada315eb387ff27216a6bfd4c7bc2f7f09d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h3akDiVnBhbza995jTS1vTVxIadoja8mqXZsEO5XzETFNQb2irxKFXii5cGsvQ0BriHNyPqm6Dy++fqj0vh1BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:46:24.837170Z","bundle_sha256":"f58af8bb01132c9a2e2c468953aa7cc3667e31c30091c50f29c6a092b2a7c99c"}}