{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MYCFOY7LRZZF5MHMUHBXVLCNCF","short_pith_number":"pith:MYCFOY7L","schema_version":"1.0","canonical_sha256":"66045763eb8e725eb0eca1c37aac4d116cacdc556debf631fc94719b6ebf22c6","source":{"kind":"arxiv","id":"2302.06807","version":3},"attestation_state":"computed","paper":{"title":"Horospherical Decision Boundaries for Large Margin Classification in Hyperbolic Space","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Baba C. Vemuri, Chun-Hao Yang, Xiran Fan","submitted_at":"2023-02-14T03:26:19Z","abstract_excerpt":"Hyperbolic spaces have been quite popular in the recent past for representing hierarchically organized data. Further, several classification algorithms for data in these spaces have been proposed in the literature. These algorithms mainly use either hyperplanes or geodesics for decision boundaries in a large margin classifiers setting leading to a non-convex optimization problem. In this paper, we propose a novel large margin classifier based on horospherical decision boundaries that leads to a geodesically convex optimization problem that can be optimized using any Riemannian gradient descent"},"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":"2302.06807","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-02-14T03:26:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fe6446a8f02bbcdebc861f6d7f9abeaef80bbe3a96b77a8dc54d7e02d3cdc485","abstract_canon_sha256":"7d578f27fd22eee48ddb9a2c789b46eee293f2832ff7feef84878369af5da2bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:55:01.989092Z","signature_b64":"Xlqw6xE5h4ym9UOS/G5bpUq4/hxHodDxsUpQagkPWsU56U+oqba/z5WXhkCftYrxdzcJrZWhw1YymW2pzP6/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66045763eb8e725eb0eca1c37aac4d116cacdc556debf631fc94719b6ebf22c6","last_reissued_at":"2026-07-05T06:55:01.988608Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:55:01.988608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Horospherical Decision Boundaries for Large Margin Classification in Hyperbolic Space","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Baba C. Vemuri, Chun-Hao Yang, Xiran Fan","submitted_at":"2023-02-14T03:26:19Z","abstract_excerpt":"Hyperbolic spaces have been quite popular in the recent past for representing hierarchically organized data. Further, several classification algorithms for data in these spaces have been proposed in the literature. These algorithms mainly use either hyperplanes or geodesics for decision boundaries in a large margin classifiers setting leading to a non-convex optimization problem. In this paper, we propose a novel large margin classifier based on horospherical decision boundaries that leads to a geodesically convex optimization problem that can be optimized using any Riemannian gradient descent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.06807","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.06807/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":"2302.06807","created_at":"2026-07-05T06:55:01.988668+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.06807v3","created_at":"2026-07-05T06:55:01.988668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.06807","created_at":"2026-07-05T06:55:01.988668+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYCFOY7LRZZF","created_at":"2026-07-05T06:55:01.988668+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYCFOY7LRZZF5MHM","created_at":"2026-07-05T06:55:01.988668+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYCFOY7L","created_at":"2026-07-05T06:55:01.988668+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04360","citing_title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MYCFOY7LRZZF5MHMUHBXVLCNCF","json":"https://pith.science/pith/MYCFOY7LRZZF5MHMUHBXVLCNCF.json","graph_json":"https://pith.science/api/pith-number/MYCFOY7LRZZF5MHMUHBXVLCNCF/graph.json","events_json":"https://pith.science/api/pith-number/MYCFOY7LRZZF5MHMUHBXVLCNCF/events.json","paper":"https://pith.science/paper/MYCFOY7L"},"agent_actions":{"view_html":"https://pith.science/pith/MYCFOY7LRZZF5MHMUHBXVLCNCF","download_json":"https://pith.science/pith/MYCFOY7LRZZF5MHMUHBXVLCNCF.json","view_paper":"https://pith.science/paper/MYCFOY7L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.06807&json=true","fetch_graph":"https://pith.science/api/pith-number/MYCFOY7LRZZF5MHMUHBXVLCNCF/graph.json","fetch_events":"https://pith.science/api/pith-number/MYCFOY7LRZZF5MHMUHBXVLCNCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYCFOY7LRZZF5MHMUHBXVLCNCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYCFOY7LRZZF5MHMUHBXVLCNCF/action/storage_attestation","attest_author":"https://pith.science/pith/MYCFOY7LRZZF5MHMUHBXVLCNCF/action/author_attestation","sign_citation":"https://pith.science/pith/MYCFOY7LRZZF5MHMUHBXVLCNCF/action/citation_signature","submit_replication":"https://pith.science/pith/MYCFOY7LRZZF5MHMUHBXVLCNCF/action/replication_record"}},"created_at":"2026-07-05T06:55:01.988668+00:00","updated_at":"2026-07-05T06:55:01.988668+00:00"}