{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OTVDD2CGYSE5UARX472KGD6H3F","short_pith_number":"pith:OTVDD2CG","schema_version":"1.0","canonical_sha256":"74ea31e846c489da0237e7f4a30fc7d951e844fd0ebb8be3314a01030c361f2c","source":{"kind":"arxiv","id":"2606.06329","version":1},"attestation_state":"computed","paper":{"title":"Efficient Mean Curvature Computation on High-Dimensional Data Manifolds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexandre L. M. Levada","submitted_at":"2026-06-04T16:04:31Z","abstract_excerpt":"Estimating local mean curvature at each point of a high-dimensional dataset is a key ingredient of geometry-aware machine learning algorithms, such as the Mean Curvature Boundary Points (MCBP) method. The naive implementation of this computation, based on a local shape operator approximated from k-nearest neighbor patches, involves an explicit construction of a matrix $H$ whose trace form yields an $O(m^4)$ cost per point, rendering the approach intractable for datasets with more than a few dozen features. This paper introduces two complementary contributions that together reduce this cost by "},"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":"2606.06329","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-04T16:04:31Z","cross_cats_sorted":["cs.CG","cs.CV","stat.ML"],"title_canon_sha256":"c08537fb7d3c08f397d360c355bedd17de71889b61f45f77bb827d063652a4db","abstract_canon_sha256":"334f80aed6cef90971a00f92e14278b1b18ef842bd18d8b080082de72a751e04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:15:42.037447Z","signature_b64":"0SGiu2q3ljrMa4FRL5qUM9WS3hjGLOUw3xDlzivnC6mhuXHZmfVNa+GyyqDbuNn7RZQDBoBdLO/qprGaH1Q+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74ea31e846c489da0237e7f4a30fc7d951e844fd0ebb8be3314a01030c361f2c","last_reissued_at":"2026-06-05T01:15:42.037034Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:15:42.037034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Mean Curvature Computation on High-Dimensional Data Manifolds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexandre L. M. Levada","submitted_at":"2026-06-04T16:04:31Z","abstract_excerpt":"Estimating local mean curvature at each point of a high-dimensional dataset is a key ingredient of geometry-aware machine learning algorithms, such as the Mean Curvature Boundary Points (MCBP) method. The naive implementation of this computation, based on a local shape operator approximated from k-nearest neighbor patches, involves an explicit construction of a matrix $H$ whose trace form yields an $O(m^4)$ cost per point, rendering the approach intractable for datasets with more than a few dozen features. This paper introduces two complementary contributions that together reduce this cost by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.06329","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/2606.06329/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":"2606.06329","created_at":"2026-06-05T01:15:42.037089+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.06329v1","created_at":"2026-06-05T01:15:42.037089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06329","created_at":"2026-06-05T01:15:42.037089+00:00"},{"alias_kind":"pith_short_12","alias_value":"OTVDD2CGYSE5","created_at":"2026-06-05T01:15:42.037089+00:00"},{"alias_kind":"pith_short_16","alias_value":"OTVDD2CGYSE5UARX","created_at":"2026-06-05T01:15:42.037089+00:00"},{"alias_kind":"pith_short_8","alias_value":"OTVDD2CG","created_at":"2026-06-05T01:15:42.037089+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/OTVDD2CGYSE5UARX472KGD6H3F","json":"https://pith.science/pith/OTVDD2CGYSE5UARX472KGD6H3F.json","graph_json":"https://pith.science/api/pith-number/OTVDD2CGYSE5UARX472KGD6H3F/graph.json","events_json":"https://pith.science/api/pith-number/OTVDD2CGYSE5UARX472KGD6H3F/events.json","paper":"https://pith.science/paper/OTVDD2CG"},"agent_actions":{"view_html":"https://pith.science/pith/OTVDD2CGYSE5UARX472KGD6H3F","download_json":"https://pith.science/pith/OTVDD2CGYSE5UARX472KGD6H3F.json","view_paper":"https://pith.science/paper/OTVDD2CG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.06329&json=true","fetch_graph":"https://pith.science/api/pith-number/OTVDD2CGYSE5UARX472KGD6H3F/graph.json","fetch_events":"https://pith.science/api/pith-number/OTVDD2CGYSE5UARX472KGD6H3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OTVDD2CGYSE5UARX472KGD6H3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OTVDD2CGYSE5UARX472KGD6H3F/action/storage_attestation","attest_author":"https://pith.science/pith/OTVDD2CGYSE5UARX472KGD6H3F/action/author_attestation","sign_citation":"https://pith.science/pith/OTVDD2CGYSE5UARX472KGD6H3F/action/citation_signature","submit_replication":"https://pith.science/pith/OTVDD2CGYSE5UARX472KGD6H3F/action/replication_record"}},"created_at":"2026-06-05T01:15:42.037089+00:00","updated_at":"2026-06-05T01:15:42.037089+00:00"}