{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:R3LPX4CGGDEHOUIMIZKE7O65H4","short_pith_number":"pith:R3LPX4CG","schema_version":"1.0","canonical_sha256":"8ed6fbf04630c877510c46544fbbdd3f1fc8d155aeede38b59e43e03212e7798","source":{"kind":"arxiv","id":"2206.08061","version":1},"attestation_state":"computed","paper":{"title":"Active Nearest Neighbor Regression Through Delaunay Refinement","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.LG","authors_text":"Alexander Kravberg, Anastasiia Varava, Danica Kragic, Florian T. Pokorny, Giovanni Luca Marchetti, Vladislav Polianskii","submitted_at":"2022-06-16T10:24:03Z","abstract_excerpt":"We introduce an algorithm for active function approximation based on nearest neighbor regression. Our Active Nearest Neighbor Regressor (ANNR) relies on the Voronoi-Delaunay framework from computational geometry to subdivide the space into cells with constant estimated function value and select novel query points in a way that takes the geometry of the function graph into account. We consider the recent state-of-the-art active function approximator called DEFER, which is based on incremental rectangular partitioning of the space, as the main baseline. The ANNR addresses a number of limitations"},"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":"2206.08061","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-06-16T10:24:03Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"31caa1c46a86710bc878c9cb6bd0ee764de66f4a1654137d6862f7a31359e7cf","abstract_canon_sha256":"90fdb016dbfcdd06cfc7f9d8a6d96e7d106f0afddecab2031010d34d17bc6c5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:32:21.694703Z","signature_b64":"qf53PpU7ml43jtrmXtWjHC6g2bvJVNeLIgyXGEULifePST6xYAlYi7bxPucNTkFl7cj/nT1Uu5gGQCibka1UDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ed6fbf04630c877510c46544fbbdd3f1fc8d155aeede38b59e43e03212e7798","last_reissued_at":"2026-07-05T04:32:21.694188Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:32:21.694188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Active Nearest Neighbor Regression Through Delaunay Refinement","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.LG","authors_text":"Alexander Kravberg, Anastasiia Varava, Danica Kragic, Florian T. Pokorny, Giovanni Luca Marchetti, Vladislav Polianskii","submitted_at":"2022-06-16T10:24:03Z","abstract_excerpt":"We introduce an algorithm for active function approximation based on nearest neighbor regression. Our Active Nearest Neighbor Regressor (ANNR) relies on the Voronoi-Delaunay framework from computational geometry to subdivide the space into cells with constant estimated function value and select novel query points in a way that takes the geometry of the function graph into account. We consider the recent state-of-the-art active function approximator called DEFER, which is based on incremental rectangular partitioning of the space, as the main baseline. The ANNR addresses a number of limitations"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.08061","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.08061/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2206.08061","created_at":"2026-07-05T04:32:21.694245+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.08061v1","created_at":"2026-07-05T04:32:21.694245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.08061","created_at":"2026-07-05T04:32:21.694245+00:00"},{"alias_kind":"pith_short_12","alias_value":"R3LPX4CGGDEH","created_at":"2026-07-05T04:32:21.694245+00:00"},{"alias_kind":"pith_short_16","alias_value":"R3LPX4CGGDEHOUIM","created_at":"2026-07-05T04:32:21.694245+00:00"},{"alias_kind":"pith_short_8","alias_value":"R3LPX4CG","created_at":"2026-07-05T04:32:21.694245+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04670","citing_title":"Fitting scattered data with optional monotonicity constraints on GPU: LipFit package","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R3LPX4CGGDEHOUIMIZKE7O65H4","json":"https://pith.science/pith/R3LPX4CGGDEHOUIMIZKE7O65H4.json","graph_json":"https://pith.science/api/pith-number/R3LPX4CGGDEHOUIMIZKE7O65H4/graph.json","events_json":"https://pith.science/api/pith-number/R3LPX4CGGDEHOUIMIZKE7O65H4/events.json","paper":"https://pith.science/paper/R3LPX4CG"},"agent_actions":{"view_html":"https://pith.science/pith/R3LPX4CGGDEHOUIMIZKE7O65H4","download_json":"https://pith.science/pith/R3LPX4CGGDEHOUIMIZKE7O65H4.json","view_paper":"https://pith.science/paper/R3LPX4CG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.08061&json=true","fetch_graph":"https://pith.science/api/pith-number/R3LPX4CGGDEHOUIMIZKE7O65H4/graph.json","fetch_events":"https://pith.science/api/pith-number/R3LPX4CGGDEHOUIMIZKE7O65H4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R3LPX4CGGDEHOUIMIZKE7O65H4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R3LPX4CGGDEHOUIMIZKE7O65H4/action/storage_attestation","attest_author":"https://pith.science/pith/R3LPX4CGGDEHOUIMIZKE7O65H4/action/author_attestation","sign_citation":"https://pith.science/pith/R3LPX4CGGDEHOUIMIZKE7O65H4/action/citation_signature","submit_replication":"https://pith.science/pith/R3LPX4CGGDEHOUIMIZKE7O65H4/action/replication_record"}},"created_at":"2026-07-05T04:32:21.694245+00:00","updated_at":"2026-07-05T04:32:21.694245+00:00"}