{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ULQWYWG4YZHFMVIOHBYHAQQNUC","short_pith_number":"pith:ULQWYWG4","schema_version":"1.0","canonical_sha256":"a2e16c58dcc64e56550e387070420da0977c9fbc2017e404e43187b7ec068386","source":{"kind":"arxiv","id":"1111.4470","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1111.4470","created_at":"2026-05-18T00:45:54.885211+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.4470v3","created_at":"2026-05-18T00:45:54.885211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4470","created_at":"2026-05-18T00:45:54.885211+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULQWYWG4YZHF","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULQWYWG4YZHFMVIO","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULQWYWG4","created_at":"2026-05-18T12:26:42.757692+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/ULQWYWG4YZHFMVIOHBYHAQQNUC","json":"https://pith.science/pith/ULQWYWG4YZHFMVIOHBYHAQQNUC.json","graph_json":"https://pith.science/api/pith-number/ULQWYWG4YZHFMVIOHBYHAQQNUC/graph.json","events_json":"https://pith.science/api/pith-number/ULQWYWG4YZHFMVIOHBYHAQQNUC/events.json","paper":"https://pith.science/paper/ULQWYWG4"},"agent_actions":{"view_html":"https://pith.science/pith/ULQWYWG4YZHFMVIOHBYHAQQNUC","download_json":"https://pith.science/pith/ULQWYWG4YZHFMVIOHBYHAQQNUC.json","view_paper":"https://pith.science/paper/ULQWYWG4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.4470&json=true","fetch_graph":"https://pith.science/api/pith-number/ULQWYWG4YZHFMVIOHBYHAQQNUC/graph.json","fetch_events":"https://pith.science/api/pith-number/ULQWYWG4YZHFMVIOHBYHAQQNUC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULQWYWG4YZHFMVIOHBYHAQQNUC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULQWYWG4YZHFMVIOHBYHAQQNUC/action/storage_attestation","attest_author":"https://pith.science/pith/ULQWYWG4YZHFMVIOHBYHAQQNUC/action/author_attestation","sign_citation":"https://pith.science/pith/ULQWYWG4YZHFMVIOHBYHAQQNUC/action/citation_signature","submit_replication":"https://pith.science/pith/ULQWYWG4YZHFMVIOHBYHAQQNUC/action/replication_record"}},"created_at":"2026-05-18T00:45:54.885211+00:00","updated_at":"2026-05-18T00:45:54.885211+00:00"}