{"as_of":"2026-08-10T00:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:040035b7dec8dd4ddba912cca0eb4bc20f6c754aaa354b83052ebe06f0fa8107","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:58:59.680337Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.04360/citation-record","integrity":"/paper/2506.04360/integrity","json":"/paper/2506.04360/citation-record.json","paper":"/paper/2506.04360"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-981-97-5128-0_5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":"Gaussian Beltrami - Klein Model for Protein Sequence Classification : A Hyperbolic Approach","venue":"Lecture notes in computer science","work_id":"926edb0a-a2f0-4a8a-81bd-2b3441782942","year":2024},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:54.662880Z"},"links":{"citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:e00f5e78fc816beb80ed896763aaffef884ce42dbdd1c567f81f58cf59e64829","observation_id":"bc3331b7-c9af-4059-a758-3c5dd8c3fe9c","resolution":{"observed_at":"2026-08-07T10:59:01.139244Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.05189","last_updated":"2022-10-25T17:32:33Z","snapshot_observed_at":"2026-08-07T08:46:59.462215Z","submitted_at":"2022-10-11T06:49:51Z","title":"Neural Networks are Decision Trees","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.05189","snapshot_observed_at":"2026-08-07T10:58:54.793307Z","title":"Neural Networks are Decision Trees , October 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:54.793307Z"},"links":{"cited_paper":"/paper/2210.05189","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:669fa3e0cf0eb8af6fc99855a806afb93d1c273a6f03f18134d27438d76cd57b","observation_id":"5a26485f-c31f-48dc-bf83-04eee591aa93","resolution":{"observed_at":"2026-08-07T10:58:54.793307Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.06705","last_updated":"2020-04-25T12:29:53Z","snapshot_observed_at":"2026-08-08T22:26:44.712632Z","submitted_at":"2018-09-18T13:33:45Z","title":"Is rotation forest the best classifier for problems with continuous features?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.06705","snapshot_observed_at":"2026-08-07T10:58:54.937011Z","title":"Bagnall, M","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:54.937011Z"},"links":{"cited_paper":"/paper/1809.06705","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:359b21854dcc5bc13b5c55960fc2049fcf8af47299406dc6f027dcca1827e914","observation_id":"e11351e9-b9c5-4a0e-b6ed-3d0dc9026c4b","resolution":{"observed_at":"2026-08-07T10:58:54.937011Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.04854","last_updated":"2020-09-23T06:44:45Z","snapshot_observed_at":"2026-08-08T00:21:28.387022Z","submitted_at":"2019-12-10T17:50:26Z","title":"Random spanning forests and hyperbolic symmetry","version":2},"cited_work":{"arxiv_id":"1912.04854","doi":null,"metadata_source":"pith","pith_arxiv_id":"1912.04854","snapshot_observed_at":"2026-08-07T10:59:04.383606Z","title":"Random spanning forests and hyperbolic symmetry","venue":"math.PR","work_id":"18f7f7d5-413e-4d8c-b248-7898e36e4738","year":2019},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:55.047661Z"},"links":{"cited_paper":"/paper/1912.04854","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:0c5536f89e6a40bc94f6a2d482bea9372cc61b1105177c34699f7290a7a355ac","observation_id":"3014b252-477c-4015-af60-6c923333bf37","resolution":{"observed_at":"2026-08-07T10:59:04.437698Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15919","last_updated":"2024-02-07T13:46:35Z","snapshot_observed_at":"2026-08-08T06:14:15.644727Z","submitted_at":"2023-03-28T12:20:52Z","title":"Fully Hyperbolic Convolutional Neural Networks for Computer Vision","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15919","snapshot_observed_at":"2026-08-07T10:58:55.201236Z","title":"Hyperbolic Geometry in Computer Vision : A Novel Framework for Convolutional Neural Networks , March 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:55.201236Z"},"links":{"cited_paper":"/paper/2303.15919","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:e615564f0c3717b4176ec8cca570bc3699b7f8e574aaab78637b264b486b82ee","observation_id":"7f5342ab-2ec3-4aa0-b7ab-56557d13cbb4","resolution":{"observed_at":"2026-08-07T10:58:55.201236Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1371/journal.pone.0184865","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:59:00.704193Z","title":"Multiple Cayley - Klein metric learning","venue":null,"work_id":"f1b82bd7-f3ac-4507-8720-36c44d87071c","year":2017},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:55.352268Z"},"links":{"citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:977ebc8301d262fb30b429d6209c19151be5b22a997e84aee61046d762d56381","observation_id":"7fb6f942-2707-4702-9c12-04a670c554e1","resolution":{"observed_at":"2026-08-07T10:59:00.818892Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12312","last_updated":"2022-11-22T15:03:48Z","snapshot_observed_at":"2026-07-06T14:21:45.463565Z","submitted_at":"2022-11-22T15:03:48Z","title":"Interpreting Neural Networks through the Polytope Lens","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.12312","snapshot_observed_at":"2026-08-07T10:58:55.491563Z","title":"Interpreting Neural Networks through the Polytope Lens , November 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:55.491563Z"},"links":{"cited_paper":"/paper/2211.12312","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:097882057eef1822424945457f465cf56fd1c0c1ce488991284dad5dc82bc7e9","observation_id":"766391a1-f556-4d91-933b-9c421c5e7135","resolution":{"observed_at":"2026-08-07T10:58:55.491563Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:55.613883Z","title":"Random Forests","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:55.613883Z"},"links":{"citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:358b9f3c2d6ed1a3c574a07beda6be9b9476ce72af07a92ded0fd3bd3c6b5d08","observation_id":"bd6aea03-0246-4ff3-b76c-ef123fd7efc6","resolution":{"observed_at":"2026-08-07T10:58:55.613883Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:55.754124Z","title":"Classification and Regression Trees","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:55.754124Z"},"links":{"citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:eaa4bc3cf6ad4f99f6be77603061b8f24071fda1ca3280e1f7bff5675fbcc4e8","observation_id":"51ab0658-d249-4a48-911f-826cfb9ae93c","resolution":{"observed_at":"2026-08-07T10:58:55.754124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.12933","last_updated":"2019-10-28T19:41:56Z","snapshot_observed_at":"2026-08-04T09:28:06.015529Z","submitted_at":"2019-10-28T19:41:56Z","title":"Hyperbolic Graph Convolutional Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.12933","snapshot_observed_at":"2026-08-07T10:58:55.879215Z","title":"Hyperbolic Graph Convolutional Neural Networks , October 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:55.879215Z"},"links":{"cited_paper":"/paper/1910.12933","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:80e5020dc563e578c343832ce2ce05546d46af07c3a98061d31d45530750db96","observation_id":"d7f9c107-58ba-4b39-84f6-9125b6ebb4be","resolution":{"observed_at":"2026-08-07T10:58:55.879215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:55.988399Z","title":"XGBoost : A Scalable Tree Boosting System","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:55.988399Z"},"links":{"citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:ea2208b23e3c7a3e4c9ce9da37d15f98d115a34ef6b8e5b04ad006c496f396b2","observation_id":"e7fde421-6bb4-49bd-b72d-84ddfd95ab20","resolution":{"observed_at":"2026-08-07T10:58:55.988399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.14686","last_updated":"2022-03-16T02:23:49Z","snapshot_observed_at":"2026-08-03T20:33:54.881158Z","submitted_at":"2021-05-31T03:36:49Z","title":"Fully Hyperbolic Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.14686","snapshot_observed_at":"2026-08-07T10:58:56.133603Z","title":"Fully Hyperbolic Neural Networks , March 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:56.133603Z"},"links":{"cited_paper":"/paper/2105.14686","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:daa500f191c1d32aad5d6c3826f4f668c10b2d199c67a8e014d44ad8630ad64f","observation_id":"aaf4c47b-c967-4197-9ab1-eeb07c50c383","resolution":{"observed_at":"2026-08-07T10:58:56.133603Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.13841","last_updated":"2024-03-04T20:02:03Z","snapshot_observed_at":"2026-07-06T16:36:23.513728Z","submitted_at":"2023-10-20T22:31:10Z","title":"Fast hyperboloid decision tree algorithms","version":2},"cited_work":{"arxiv_id":"2310.13841","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.13841","snapshot_observed_at":"2026-08-07T10:59:03.994867Z","title":"Fast hyperboloid decision tree algorithms","venue":"cs.LG","work_id":"a30aa1bb-8ead-4f1d-9166-97469d617310","year":2023},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:56.262484Z"},"links":{"cited_paper":"/paper/2310.13841","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:b85e3f972aac7e88e9a8c9de9098a92c16baf2e1722aa114eadb86038f6125e1","observation_id":"38b37822-73f0-4982-b729-0b477f826b8a","resolution":{"observed_at":"2026-08-07T10:59:04.122866Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13879","last_updated":"2025-06-06T21:26:35Z","snapshot_observed_at":"2026-07-06T19:35:30.732080Z","submitted_at":"2024-10-03T00:48:07Z","title":"Mixed-curvature decision trees and random forests","version":3},"cited_work":{"arxiv_id":"2410.13879","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.13879","snapshot_observed_at":"2026-08-07T10:59:03.727754Z","title":"Mixed-curvature decision trees and random forests","venue":"cs.LG","work_id":"e55d4136-9954-4fd1-a57e-8757d69e4e2d","year":2024},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:56.408026Z"},"links":{"cited_paper":"/paper/2410.13879","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:b18f217bb91ba04cf5d257e9ffb84528efc3498e0f978d6adc1e846d1fa2dbd1","observation_id":"d2ee0090-6a72-4a69-8983-786c34fa6ace","resolution":{"observed_at":"2026-08-07T10:59:03.858752Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.09576","last_updated":"2025-07-16T21:28:30Z","snapshot_observed_at":"2026-08-07T17:09:28.232574Z","submitted_at":"2025-03-12T17:44:40Z","title":"Manify: A Python Library for Learning Non-Euclidean Representations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.09576","snapshot_observed_at":"2026-08-07T10:58:56.567305Z","title":"Manify: A Python Library for Learning Non - Euclidean Representations , March 2025 b","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:56.567305Z"},"links":{"cited_paper":"/paper/2503.09576","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:57b4def37a2a8bf314d0f71ea54a58977c0fe26d20c90df8a25321192865f294","observation_id":"8e024fb5-86ea-4b35-9167-dadf04c97b30","resolution":{"observed_at":"2026-08-07T10:58:56.567305Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.00437","last_updated":"2018-06-01T16:52:16Z","snapshot_observed_at":"2026-07-06T06:42:30.989473Z","submitted_at":"2018-06-01T16:52:16Z","title":"Large-Margin Classification in Hyperbolic Space","version":1},"cited_work":{"arxiv_id":"1806.00437","doi":null,"metadata_source":"pith","pith_arxiv_id":"1806.00437","snapshot_observed_at":"2026-08-07T10:59:03.480737Z","title":"Large-Margin Classification in Hyperbolic Space","venue":"cs.LG","work_id":"f8f0b11f-2f8b-43c6-b12f-bdebc7d05ff1","year":2018},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:56.733512Z"},"links":{"cited_paper":"/paper/1806.00437","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:2a3bd90f3ebbf795e1714c12d31d2831d8539a6efd69834794da1aa62b80c57e","observation_id":"704c8c7d-1207-48fe-a640-4a2bec7e09be","resolution":{"observed_at":"2026-08-07T10:59:03.551701Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.13279","last_updated":"2024-06-24T13:57:01Z","snapshot_observed_at":"2026-08-07T23:35:17.778782Z","submitted_at":"2023-08-25T10:01:53Z","title":"Hyperbolic Random Forests","version":2},"cited_work":{"arxiv_id":"2308.13279","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.13279","snapshot_observed_at":"2026-08-07T10:59:03.266487Z","title":"Hyperbolic Random Forests","venue":"cs.LG","work_id":"346fd0b6-96ee-4a5d-99d8-3604a1f54f25","year":2023},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:56.838021Z"},"links":{"cited_paper":"/paper/2308.13279","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:5bf3d4fe4c46b9b30bfcf966c2f5ff5b822491a9758e927e04ab551dba38b8be","observation_id":"cf4a6914-9ed0-4c2f-a4ff-ca92905a7ebc","resolution":{"observed_at":"2026-08-07T10:59:03.390302Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:59:05.122968Z","title":"Oblique Decision Tree in Python , 2021","venue":null,"work_id":"8ab071e5-7e26-47b5-a105-fc4b3c3b1871","year":2021},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:56.964127Z"},"links":{"citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:a8673ff39b75fc443211c20d3a6808647252222e873600df0a699fbf55a76949","observation_id":"6faf5630-358b-4b24-a37f-848b300a2fc1","resolution":{"observed_at":"2026-08-07T10:59:05.243096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:59:04.923890Z","title":"Privileged Bases in the Transformer Residual Stream , 2023","venue":null,"work_id":"a67b7d38-c441-4f03-b9b7-9e353f105819","year":2023},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:57.125345Z"},"links":{"citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:11305a75ca430d1a8788ab82fda2eb29d86bab64a8310d68d54cb80a087106f2","observation_id":"93c33c7f-8bd2-44dd-8270-eb6403d066fe","resolution":{"observed_at":"2026-08-07T10:59:04.959112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.06807","last_updated":"2023-09-28T17:12:16Z","snapshot_observed_at":"2026-08-07T14:09:36.717826Z","submitted_at":"2023-02-14T03:26:19Z","title":"Horospherical Decision Boundaries for Large Margin Classification in Hyperbolic Space","version":3},"cited_work":{"arxiv_id":"2302.06807","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.06807","snapshot_observed_at":"2026-08-07T10:59:03.047166Z","title":"Horospherical Decision Boundaries for Large Margin Classification in Hyperbolic Space","venue":"stat.ML","work_id":"fce15312-1081-4c8c-81db-c81a71c16b22","year":2023},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:57.243347Z"},"links":{"cited_paper":"/paper/2302.06807","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:f68e004c1661b2a5b2e4ee7a6747655921b754a7a77012bccc691bcc1eda62f2","observation_id":"d0a4045d-7946-443e-9382-116210fc1330","resolution":{"observed_at":"2026-08-07T10:59:03.121585Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.09112","last_updated":"2018-06-28T17:20:43Z","snapshot_observed_at":"2026-08-07T15:11:54.782329Z","submitted_at":"2018-05-23T13:08:07Z","title":"Hyperbolic Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.09112","snapshot_observed_at":"2026-08-07T10:58:57.375090Z","title":"Hyperbolic Neural Networks , June 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:57.375090Z"},"links":{"cited_paper":"/paper/1805.09112","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:4cf91b1c1c32a0a29d3446cffbfddd8d1a776f3068aa90f94700065ecf45b949","observation_id":"bd46deca-3636-44a9-b0c9-48b62aae6cdc","resolution":{"observed_at":"2026-08-07T10:58:57.375090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.05671","last_updated":"2025-01-13T19:14:26Z","snapshot_observed_at":"2026-07-06T19:12:36.212757Z","submitted_at":"2024-09-09T14:40:21Z","title":"HyperSteiner: Computing Heuristic Hyperbolic Steiner Minimal Trees","version":2},"cited_work":{"arxiv_id":"2409.05671","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.05671","snapshot_observed_at":"2026-08-07T10:59:02.769864Z","title":"HyperSteiner: Computing Heuristic Hyperbolic Steiner Minimal Trees","venue":"cs.CG","work_id":"902513d5-9aec-4ec8-83f8-53faf081b385","year":2024},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:57.509778Z"},"links":{"cited_paper":"/paper/2409.05671","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:ad7b769a68a93b59d9c598ef7b2c2d5767dbf239120c13ffe4ffa98785210180","observation_id":"4f165d96-83d7-415e-92bd-4341981855d0","resolution":{"observed_at":"2026-08-07T10:59:02.848944Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:59:04.711979Z","title":"LightGBM : A Highly Efficient Gradient Boosting Decision Tree","venue":null,"work_id":"d28f12fd-826a-4c6c-80ee-81638a56b619","year":2017},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:57.657376Z"},"links":{"citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:68669800a4a55a2fc793659b0d53957c13a47c0cb106103d1fcc735752d8ac9b","observation_id":"8b150529-227e-4e97-9311-5105fce585c1","resolution":{"observed_at":"2026-08-07T10:59:04.804476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:59:04.544354Z","title":"Khan, Philippe Chlenski, and Itsik Pe'er","venue":null,"work_id":"7557b2d2-16ce-4feb-9fd8-79011498d369","year":2024},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:57.764774Z"},"links":{"citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:4001bec102c1d416f6be7d86332c54c937447b4dab44b8f7d27e295870eb1966","observation_id":"807dc6a8-6be3-4e67-864c-a1bbe145e828","resolution":{"observed_at":"2026-08-07T10:59:04.617728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:57.964718Z","title":"Isolation Forest","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:57.964718Z"},"links":{"citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:475bbf78cee0b199c47d31e1c858d49ae8e8c4c8e60428458a3cc19b7d51731a","observation_id":"5f8c72ff-b6f8-4034-8f21-656dd246938f","resolution":{"observed_at":"2026-08-07T10:58:57.964718Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16813","last_updated":"2024-10-22T08:40:05Z","snapshot_observed_at":"2026-07-06T19:37:42.469688Z","submitted_at":"2024-10-22T08:40:05Z","title":"Klein Model for Hyperbolic Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.16813","snapshot_observed_at":"2026-08-07T10:58:58.079358Z","title":"Werner, and Dongmian Zou","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:58.079358Z"},"links":{"cited_paper":"/paper/2410.16813","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:aa0069bc6a6b0d4f451f73d826054c9fb469aac1663abc31411b12903f8f8d35","observation_id":"6a049c78-55bb-4f44-b142-4da62da60d5f","resolution":{"observed_at":"2026-08-07T10:58:58.079358Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.13885","last_updated":"2020-05-28T10:16:30Z","snapshot_observed_at":"2026-08-09T17:03:53.118594Z","submitted_at":"2020-05-28T10:16:30Z","title":"Hyperbolic Manifold Regression","version":1},"cited_work":{"arxiv_id":"2005.13885","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.13885","snapshot_observed_at":"2026-08-07T10:59:02.416590Z","title":"Hyperbolic Manifold Regression","venue":"stat.ML","work_id":"a0697b7d-a5bc-478c-b30f-85ab0cfbf84e","year":2020},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:58.220515Z"},"links":{"cited_paper":"/paper/2005.13885","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:170b7f4143a69322c418499cb88c18ae5cc60b7ccb168d12d9f814f63b682b69","observation_id":"f64eb2c7-2732-4aba-a031-3a311103b87c","resolution":{"observed_at":"2026-08-07T10:59:02.506222Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.03036","last_updated":"2019-05-02T11:17:22Z","snapshot_observed_at":"2026-07-06T07:37:45.658276Z","submitted_at":"2019-03-07T16:50:26Z","title":"HEAT: Hyperbolic Embedding of Attributed Networks","version":2},"cited_work":{"arxiv_id":"1903.03036","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.03036","snapshot_observed_at":"2026-08-07T10:59:02.207520Z","title":"HEAT: Hyperbolic Embedding of Attributed Networks","venue":"cs.SI","work_id":"7c944c8e-4c3f-498c-a06c-df3ce629722e","year":2019},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:58.391886Z"},"links":{"cited_paper":"/paper/1903.03036","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:4a3917dc533b1d308ebc4aac2d0a3ada1f165c4459e3a10eee01ea51d33b8d06","observation_id":"27428414-f6a9-4263-bbc6-c418fec70125","resolution":{"observed_at":"2026-08-07T10:59:02.286618Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.02992","last_updated":"2019-05-10T03:12:01Z","snapshot_observed_at":"2026-08-05T00:24:45.776927Z","submitted_at":"2019-02-08T09:42:06Z","title":"A Wrapped Normal Distribution on Hyperbolic Space for Gradient-Based Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.02992","snapshot_observed_at":"2026-08-07T10:58:58.507905Z","title":"A Wrapped Normal Distribution on Hyperbolic Space for Gradient - Based Learning , May 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:58.507905Z"},"links":{"cited_paper":"/paper/1902.02992","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:2be9b635efd9d89d91aafb226ad6b6b040b7b50013e05480bb2285a0d30444d4","observation_id":"f4a33cd4-d51a-457a-bbb8-977bc8cdc191","resolution":{"observed_at":"2026-08-07T10:58:58.507905Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0903.3287","last_updated":"2009-03-19T08:45:09Z","snapshot_observed_at":"2026-07-06T01:51:38.873738Z","submitted_at":"2009-03-19T08:45:09Z","title":"Hyperbolic Voronoi diagrams made easy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0903.3287","snapshot_observed_at":"2026-08-07T10:58:58.620946Z","title":"Hyperbolic Voronoi diagrams made easy","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:58.620946Z"},"links":{"cited_paper":"/paper/0903.3287","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:abb6cf297983995493754bf9777d35f1fdbe52a82b9fd8d1dccba38857ee891d","observation_id":"e602425a-68ed-4dc5-b6d6-04e9985992ab","resolution":{"observed_at":"2026-08-07T10:58:58.620946Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1506.06155","last_updated":"2015-06-24T21:23:43Z","snapshot_observed_at":"2026-07-06T04:21:26.923926Z","submitted_at":"2015-06-19T20:42:47Z","title":"CO2 Forest: Improved Random Forest by Continuous Optimization of Oblique Splits","version":2},"cited_work":{"arxiv_id":"1506.06155","doi":null,"metadata_source":"pith","pith_arxiv_id":"1506.06155","snapshot_observed_at":"2026-08-07T10:59:01.867872Z","title":"CO2 Forest: Improved Random Forest by Continuous Optimization of Oblique Splits","venue":"cs.LG","work_id":"be4d1ca3-5f21-4403-8c11-c295eb0926a2","year":2015},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:58.754166Z"},"links":{"cited_paper":"/paper/1506.06155","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:f068388a55665107ab3ed3b93a3803616d25437752024f8cfb9eaadc8acc5298","observation_id":"d4b9a8c3-dec8-4982-ad98-e18a8a235c1f","resolution":{"observed_at":"2026-08-07T10:59:02.033469Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-31597-9_3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":"Ratcliffe","venue":"Graduate texts in mathematics","work_id":"91acab18-0a73-40c7-9696-bb5d39ec0a79","year":2019},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:58.884837Z"},"links":{"citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:a12e10082c6885ba0a7f18bfb5607f302940a669707e9d1e18b56cb45fdf27a6","observation_id":"8d8a93cf-21af-4e70-a917-9242884c08db","resolution":{"observed_at":"2026-08-07T10:59:00.565947Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:59.001516Z","title":"Computational Complexity Analysis of Decision Tree Algorithms","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:59.001516Z"},"links":{"citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:d592678c437c42cdab8533091a01d052d2702b3e3fc8fed22b60c130826c79bb","observation_id":"69d10c48-cce5-4036-8bcb-dc316441e41c","resolution":{"observed_at":"2026-08-07T10:58:59.001516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1701.08381","last_updated":"2017-02-15T22:07:32Z","snapshot_observed_at":"2026-07-06T05:27:56.123808Z","submitted_at":"2017-01-29T13:47:38Z","title":"Random Forest regression for manifold-valued responses","version":2},"cited_work":{"arxiv_id":"1701.08381","doi":null,"metadata_source":"pith","pith_arxiv_id":"1701.08381","snapshot_observed_at":"2026-08-07T10:59:01.546254Z","title":"Random Forest regression for manifold-valued responses","venue":"stat.ML","work_id":"7388da75-a653-4443-983c-27b9ac415e5d","year":2017},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:59.132195Z"},"links":{"cited_paper":"/paper/1701.08381","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:a19251c922419306c922cb453c3677789f581ea9ad4e3efd507e079fec9367f3","observation_id":"bd723fc1-e6eb-4ea6-a75c-de512b81e749","resolution":{"observed_at":"2026-08-07T10:59:01.687535Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1504.03415","last_updated":"2015-04-14T04:04:00Z","snapshot_observed_at":"2026-07-06T04:14:55.002146Z","submitted_at":"2015-04-14T04:04:00Z","title":"HHCART: An Oblique Decision Tree","version":1},"cited_work":{"arxiv_id":"1504.03415","doi":null,"metadata_source":"pith","pith_arxiv_id":"1504.03415","snapshot_observed_at":"2026-08-07T10:59:01.286803Z","title":"HHCART: An Oblique Decision Tree","venue":"stat.ML","work_id":"35b51ef7-2783-4464-80cb-109e9672edf7","year":2015},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:59.299476Z"},"links":{"cited_paper":"/paper/1504.03415","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:4d805207d4d78f84f35fb9a550e353619b7e6e12bf837bbcc3a60108f9b3d7b8","observation_id":"29378dff-c21c-46aa-ada8-8cb38d30b99d","resolution":{"observed_at":"2026-08-07T10:59:01.390563Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1111/anzs.12275","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:59:00.123804Z","title":null,"venue":null,"work_id":"7427305e-8697-4840-ac00-f1b24befdbdc","year":2019},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:59.404918Z"},"links":{"citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:8dfcb6a322ba5d55938744573598b45c9f502c6bcacaa6c5ceb71c8903521fd7","observation_id":"8c2cded0-ff59-4d6b-abde-c0c4f7ebfe74","resolution":{"observed_at":"2026-08-07T10:59:00.241487Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11704-022-2457-y","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:59.863905Z","title":"Towards kernelizing the classifier for hyperbolic data","venue":null,"work_id":"e24de56d-060d-4129-822f-0d7cbc21804d","year":2023},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:59.540312Z"},"links":{"citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:edbdfa523ecca192f1e0503de9e6183f6d2a0bb6eb15350e25cf7176bd6c1858","observation_id":"72366cc4-9469-408e-8bd8-d2256d34e42c","resolution":{"observed_at":"2026-08-07T10:58:59.993483Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:59.680337Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:59.680337Z"},"links":{"citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:cbba075fcf42ab64e1223713792504cd02b29978dae5a52525494aa2b99b11cd","observation_id":"a2119b4e-2226-488d-a2e5-4a34a3fbac60","resolution":{"observed_at":"2026-08-07T10:58:59.680337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T00:20:38.118715Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":17,"verified_exact":15,"verified_fuzzy":4},"total_outbound_references":38},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2506.04360."}