{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:T7ABLR5OWKO3I3IK2BREA7QMT5","short_pith_number":"pith:T7ABLR5O","schema_version":"1.0","canonical_sha256":"9fc015c7aeb29db46d0ad062407e0c9f576cce5826ceb53b8990bb9029097628","source":{"kind":"arxiv","id":"2409.05671","version":2},"attestation_state":"computed","paper":{"title":"HyperSteiner: Computing Heuristic Hyperbolic Steiner Minimal Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alejandro Garc\\'ia-Castellanos, Aniss Aiman Medbouhi, Danica Kragic, Erik J. Bekkers, Giovanni Luca Marchetti","submitted_at":"2024-09-09T14:40:21Z","abstract_excerpt":"We propose HyperSteiner -- an efficient heuristic algorithm for computing Steiner minimal trees in the hyperbolic space. HyperSteiner extends the Euclidean Smith-Lee-Liebman algorithm, which is grounded in a divide-and-conquer approach involving the Delaunay triangulation. The central idea is rephrasing Steiner tree problems with three terminals as a system of equations in the Klein-Beltrami model. Motivated by the fact that hyperbolic geometry is well-suited for representing hierarchies, we explore applications to hierarchy discovery in data. Results show that HyperSteiner infers more realist"},"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":"2409.05671","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2024-09-09T14:40:21Z","cross_cats_sorted":[],"title_canon_sha256":"6408d8742411dae8cdecee3ce4f90bdbed641df0ab5a25f6b27ac1a5a0af17ff","abstract_canon_sha256":"3751c08d19d0f00bbc5f49d167ec8fc75b2a5f25fe40fd65332273ebaf820383"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:00:41.001208Z","signature_b64":"tZlLo4RmDrd0aSj2RPzTTsauhW2kMm1eioVlSn0rqN58FY/6neUzC1BGXQxPMWN3l7rj5qAksJwW9NUW9sIfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fc015c7aeb29db46d0ad062407e0c9f576cce5826ceb53b8990bb9029097628","last_reissued_at":"2026-07-05T10:00:41.000723Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:00:41.000723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HyperSteiner: Computing Heuristic Hyperbolic Steiner Minimal Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alejandro Garc\\'ia-Castellanos, Aniss Aiman Medbouhi, Danica Kragic, Erik J. Bekkers, Giovanni Luca Marchetti","submitted_at":"2024-09-09T14:40:21Z","abstract_excerpt":"We propose HyperSteiner -- an efficient heuristic algorithm for computing Steiner minimal trees in the hyperbolic space. HyperSteiner extends the Euclidean Smith-Lee-Liebman algorithm, which is grounded in a divide-and-conquer approach involving the Delaunay triangulation. The central idea is rephrasing Steiner tree problems with three terminals as a system of equations in the Klein-Beltrami model. Motivated by the fact that hyperbolic geometry is well-suited for representing hierarchies, we explore applications to hierarchy discovery in data. Results show that HyperSteiner infers more realist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.05671","kind":"arxiv","version":2},"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/2409.05671/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":"2409.05671","created_at":"2026-07-05T10:00:41.000782+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.05671v2","created_at":"2026-07-05T10:00:41.000782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.05671","created_at":"2026-07-05T10:00:41.000782+00:00"},{"alias_kind":"pith_short_12","alias_value":"T7ABLR5OWKO3","created_at":"2026-07-05T10:00:41.000782+00:00"},{"alias_kind":"pith_short_16","alias_value":"T7ABLR5OWKO3I3IK","created_at":"2026-07-05T10:00:41.000782+00:00"},{"alias_kind":"pith_short_8","alias_value":"T7ABLR5O","created_at":"2026-07-05T10:00:41.000782+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":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T7ABLR5OWKO3I3IK2BREA7QMT5","json":"https://pith.science/pith/T7ABLR5OWKO3I3IK2BREA7QMT5.json","graph_json":"https://pith.science/api/pith-number/T7ABLR5OWKO3I3IK2BREA7QMT5/graph.json","events_json":"https://pith.science/api/pith-number/T7ABLR5OWKO3I3IK2BREA7QMT5/events.json","paper":"https://pith.science/paper/T7ABLR5O"},"agent_actions":{"view_html":"https://pith.science/pith/T7ABLR5OWKO3I3IK2BREA7QMT5","download_json":"https://pith.science/pith/T7ABLR5OWKO3I3IK2BREA7QMT5.json","view_paper":"https://pith.science/paper/T7ABLR5O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.05671&json=true","fetch_graph":"https://pith.science/api/pith-number/T7ABLR5OWKO3I3IK2BREA7QMT5/graph.json","fetch_events":"https://pith.science/api/pith-number/T7ABLR5OWKO3I3IK2BREA7QMT5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T7ABLR5OWKO3I3IK2BREA7QMT5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T7ABLR5OWKO3I3IK2BREA7QMT5/action/storage_attestation","attest_author":"https://pith.science/pith/T7ABLR5OWKO3I3IK2BREA7QMT5/action/author_attestation","sign_citation":"https://pith.science/pith/T7ABLR5OWKO3I3IK2BREA7QMT5/action/citation_signature","submit_replication":"https://pith.science/pith/T7ABLR5OWKO3I3IK2BREA7QMT5/action/replication_record"}},"created_at":"2026-07-05T10:00:41.000782+00:00","updated_at":"2026-07-05T10:00:41.000782+00:00"}