{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ULQWYWG4YZHFMVIOHBYHAQQNUC","short_pith_number":"pith:ULQWYWG4","canonical_record":{"source":{"id":"1111.4470","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-18T20:32:33Z","cross_cats_sorted":[],"title_canon_sha256":"71dc570e7974bda13bd0305bcb979acf8b0a87cf3dc3bb038f7274b435b6fea1","abstract_canon_sha256":"fa582178e9a130b1988bd6f7867bd875e58507924abebc3f0c4827ad9699df94"},"schema_version":"1.0"},"canonical_sha256":"a2e16c58dcc64e56550e387070420da0977c9fbc2017e404e43187b7ec068386","source":{"kind":"arxiv","id":"1111.4470","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4470","created_at":"2026-05-18T00:45:54Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4470v3","created_at":"2026-05-18T00:45:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4470","created_at":"2026-05-18T00:45:54Z"},{"alias_kind":"pith_short_12","alias_value":"ULQWYWG4YZHF","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"ULQWYWG4YZHFMVIO","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"ULQWYWG4","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ULQWYWG4YZHFMVIOHBYHAQQNUC","target":"record","payload":{"canonical_record":{"source":{"id":"1111.4470","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-18T20:32:33Z","cross_cats_sorted":[],"title_canon_sha256":"71dc570e7974bda13bd0305bcb979acf8b0a87cf3dc3bb038f7274b435b6fea1","abstract_canon_sha256":"fa582178e9a130b1988bd6f7867bd875e58507924abebc3f0c4827ad9699df94"},"schema_version":"1.0"},"canonical_sha256":"a2e16c58dcc64e56550e387070420da0977c9fbc2017e404e43187b7ec068386","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:54.885782Z","signature_b64":"xHwzZEGSLlCMgon+181Y6SQrR37GxSOXpN+Rw5BFUvl9bZ4P0+bhKztYCABgSN3wyqsjTgYhrhhIgdn7d7+YAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2e16c58dcc64e56550e387070420da0977c9fbc2017e404e43187b7ec068386","last_reissued_at":"2026-05-18T00:45:54.885112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:54.885112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.4470","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-18T00:45:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UkuvcGFlbmtxqESWgWD+HGZqXvMPdWtvjLuo9OW8+MCngg6fjeDDydgcH2y0oyq9uGpIgQW8+AAT0e8jd+k0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T03:27:15.130960Z"},"content_sha256":"51d6c60af0fd5fac882df9b27aa57d47ac7771c470d404818cd6c4878eb44b79","schema_version":"1.0","event_id":"sha256:51d6c60af0fd5fac882df9b27aa57d47ac7771c470d404818cd6c4878eb44b79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ULQWYWG4YZHFMVIOHBYHAQQNUC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Regression in Metric Spaces via Approximate Lipschitz Extension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aryeh Kontorovich, Lee-Ad Gottlieb, Robert Krauthgamer","submitted_at":"2011-11-18T20:32:33Z","abstract_excerpt":"We present a framework for performing efficient regression in general metric spaces. Roughly speaking, our regressor predicts the value at a new point by computing a Lipschitz extension --- the smoothest function consistent with the observed data --- after performing structural risk minimization to avoid overfitting. We obtain finite-sample risk bounds with minimal structural and noise assumptions, and a natural speed-precision tradeoff. The offline (learning) and online (prediction) stages can be solved by convex programming, but this naive approach has runtime complexity $O(n^3)$, which is p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4470","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-18T00:45:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lekN6rpYtxh/NTqQ2//QseOvxAHCrLPRLwe1jrIbF3PzXj97myPiFUsvAtSBkfmA+KEJG0eDJrASgq0ktI8XBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T03:27:15.131290Z"},"content_sha256":"dd37d93e7ec259589c9c63db19dce16682f68105c52e31fb2d7a365202e6905b","schema_version":"1.0","event_id":"sha256:dd37d93e7ec259589c9c63db19dce16682f68105c52e31fb2d7a365202e6905b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULQWYWG4YZHFMVIOHBYHAQQNUC/bundle.json","state_url":"https://pith.science/pith/ULQWYWG4YZHFMVIOHBYHAQQNUC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULQWYWG4YZHFMVIOHBYHAQQNUC/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-23T03:27:15Z","links":{"resolver":"https://pith.science/pith/ULQWYWG4YZHFMVIOHBYHAQQNUC","bundle":"https://pith.science/pith/ULQWYWG4YZHFMVIOHBYHAQQNUC/bundle.json","state":"https://pith.science/pith/ULQWYWG4YZHFMVIOHBYHAQQNUC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULQWYWG4YZHFMVIOHBYHAQQNUC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ULQWYWG4YZHFMVIOHBYHAQQNUC","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":"fa582178e9a130b1988bd6f7867bd875e58507924abebc3f0c4827ad9699df94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-18T20:32:33Z","title_canon_sha256":"71dc570e7974bda13bd0305bcb979acf8b0a87cf3dc3bb038f7274b435b6fea1"},"schema_version":"1.0","source":{"id":"1111.4470","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4470","created_at":"2026-05-18T00:45:54Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4470v3","created_at":"2026-05-18T00:45:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4470","created_at":"2026-05-18T00:45:54Z"},{"alias_kind":"pith_short_12","alias_value":"ULQWYWG4YZHF","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"ULQWYWG4YZHFMVIO","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"ULQWYWG4","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:dd37d93e7ec259589c9c63db19dce16682f68105c52e31fb2d7a365202e6905b","target":"graph","created_at":"2026-05-18T00:45:54Z","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 present a framework for performing efficient regression in general metric spaces. Roughly speaking, our regressor predicts the value at a new point by computing a Lipschitz extension --- the smoothest function consistent with the observed data --- after performing structural risk minimization to avoid overfitting. We obtain finite-sample risk bounds with minimal structural and noise assumptions, and a natural speed-precision tradeoff. The offline (learning) and online (prediction) stages can be solved by convex programming, but this naive approach has runtime complexity $O(n^3)$, which is p","authors_text":"Aryeh Kontorovich, Lee-Ad Gottlieb, Robert Krauthgamer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-18T20:32:33Z","title":"Efficient Regression in Metric Spaces via Approximate Lipschitz Extension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4470","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:51d6c60af0fd5fac882df9b27aa57d47ac7771c470d404818cd6c4878eb44b79","target":"record","created_at":"2026-05-18T00:45:54Z","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":"fa582178e9a130b1988bd6f7867bd875e58507924abebc3f0c4827ad9699df94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-18T20:32:33Z","title_canon_sha256":"71dc570e7974bda13bd0305bcb979acf8b0a87cf3dc3bb038f7274b435b6fea1"},"schema_version":"1.0","source":{"id":"1111.4470","kind":"arxiv","version":3}},"canonical_sha256":"a2e16c58dcc64e56550e387070420da0977c9fbc2017e404e43187b7ec068386","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2e16c58dcc64e56550e387070420da0977c9fbc2017e404e43187b7ec068386","first_computed_at":"2026-05-18T00:45:54.885112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:54.885112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xHwzZEGSLlCMgon+181Y6SQrR37GxSOXpN+Rw5BFUvl9bZ4P0+bhKztYCABgSN3wyqsjTgYhrhhIgdn7d7+YAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:54.885782Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.4470","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51d6c60af0fd5fac882df9b27aa57d47ac7771c470d404818cd6c4878eb44b79","sha256:dd37d93e7ec259589c9c63db19dce16682f68105c52e31fb2d7a365202e6905b"],"state_sha256":"7bb71d0eaf45d58ee25fa5ba578ff074e10a3e25007ae2b294b71282e60823ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qJ8t4/HAWjYFDBRxR5XSD2unt7iGKBlTx7zt0hcPDjvb8iYtceLpMxficaIIh3HNM5xrcDJnucmP6MupPVUQCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T03:27:15.133200Z","bundle_sha256":"0a7914e4b3a2e43680636f2149ac7310460273c78007f70495b08ebba5ca5e23"}}