{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:T7ABLR5OWKO3I3IK2BREA7QMT5","short_pith_number":"pith:T7ABLR5O","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"},"canonical_sha256":"9fc015c7aeb29db46d0ad062407e0c9f576cce5826ceb53b8990bb9029097628","source":{"kind":"arxiv","id":"2409.05671","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.05671","created_at":"2026-07-05T10:00:41Z"},{"alias_kind":"arxiv_version","alias_value":"2409.05671v2","created_at":"2026-07-05T10:00:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.05671","created_at":"2026-07-05T10:00:41Z"},{"alias_kind":"pith_short_12","alias_value":"T7ABLR5OWKO3","created_at":"2026-07-05T10:00:41Z"},{"alias_kind":"pith_short_16","alias_value":"T7ABLR5OWKO3I3IK","created_at":"2026-07-05T10:00:41Z"},{"alias_kind":"pith_short_8","alias_value":"T7ABLR5O","created_at":"2026-07-05T10:00:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:T7ABLR5OWKO3I3IK2BREA7QMT5","target":"record","payload":{"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"},"canonical_sha256":"9fc015c7aeb29db46d0ad062407e0c9f576cce5826ceb53b8990bb9029097628","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"},"source_kind":"arxiv","source_id":"2409.05671","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:00:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fmYx3L26N9qTxmXoCW8NDDpbAC/H3tecfi8cbhuWjOahrf+gLtYgoBdLC87maR5B9fmkfOkxKzR81bxTetnAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T17:42:40.987618Z"},"content_sha256":"113604fba109d5726b7452e860bf7d02977331a0a2b215ffcebb2e4c02eeb027","schema_version":"1.0","event_id":"sha256:113604fba109d5726b7452e860bf7d02977331a0a2b215ffcebb2e4c02eeb027"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:T7ABLR5OWKO3I3IK2BREA7QMT5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:00:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dxwup8gfB4XUda0q0l2AW9ZQebuf/gk2YiBLFndFAlHvAq2ans7XW+NQt3hrU63W9J1Ibd2I0ztvWkLb+q6TDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T17:42:40.988125Z"},"content_sha256":"f41007f739703d13575ada459c41f045fc30472e47a4b8c3b83b284a207fe2fe","schema_version":"1.0","event_id":"sha256:f41007f739703d13575ada459c41f045fc30472e47a4b8c3b83b284a207fe2fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T7ABLR5OWKO3I3IK2BREA7QMT5/bundle.json","state_url":"https://pith.science/pith/T7ABLR5OWKO3I3IK2BREA7QMT5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T7ABLR5OWKO3I3IK2BREA7QMT5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T17:42:40Z","links":{"resolver":"https://pith.science/pith/T7ABLR5OWKO3I3IK2BREA7QMT5","bundle":"https://pith.science/pith/T7ABLR5OWKO3I3IK2BREA7QMT5/bundle.json","state":"https://pith.science/pith/T7ABLR5OWKO3I3IK2BREA7QMT5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T7ABLR5OWKO3I3IK2BREA7QMT5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:T7ABLR5OWKO3I3IK2BREA7QMT5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3751c08d19d0f00bbc5f49d167ec8fc75b2a5f25fe40fd65332273ebaf820383","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2024-09-09T14:40:21Z","title_canon_sha256":"6408d8742411dae8cdecee3ce4f90bdbed641df0ab5a25f6b27ac1a5a0af17ff"},"schema_version":"1.0","source":{"id":"2409.05671","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.05671","created_at":"2026-07-05T10:00:41Z"},{"alias_kind":"arxiv_version","alias_value":"2409.05671v2","created_at":"2026-07-05T10:00:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.05671","created_at":"2026-07-05T10:00:41Z"},{"alias_kind":"pith_short_12","alias_value":"T7ABLR5OWKO3","created_at":"2026-07-05T10:00:41Z"},{"alias_kind":"pith_short_16","alias_value":"T7ABLR5OWKO3I3IK","created_at":"2026-07-05T10:00:41Z"},{"alias_kind":"pith_short_8","alias_value":"T7ABLR5O","created_at":"2026-07-05T10:00:41Z"}],"graph_snapshots":[{"event_id":"sha256:f41007f739703d13575ada459c41f045fc30472e47a4b8c3b83b284a207fe2fe","target":"graph","created_at":"2026-07-05T10:00:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2409.05671/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alejandro Garc\\'ia-Castellanos, Aniss Aiman Medbouhi, Danica Kragic, Erik J. Bekkers, Giovanni Luca Marchetti","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2024-09-09T14:40:21Z","title":"HyperSteiner: Computing Heuristic Hyperbolic Steiner Minimal Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.05671","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:113604fba109d5726b7452e860bf7d02977331a0a2b215ffcebb2e4c02eeb027","target":"record","created_at":"2026-07-05T10:00:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3751c08d19d0f00bbc5f49d167ec8fc75b2a5f25fe40fd65332273ebaf820383","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2024-09-09T14:40:21Z","title_canon_sha256":"6408d8742411dae8cdecee3ce4f90bdbed641df0ab5a25f6b27ac1a5a0af17ff"},"schema_version":"1.0","source":{"id":"2409.05671","kind":"arxiv","version":2}},"canonical_sha256":"9fc015c7aeb29db46d0ad062407e0c9f576cce5826ceb53b8990bb9029097628","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fc015c7aeb29db46d0ad062407e0c9f576cce5826ceb53b8990bb9029097628","first_computed_at":"2026-07-05T10:00:41.000723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:00:41.000723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tZlLo4RmDrd0aSj2RPzTTsauhW2kMm1eioVlSn0rqN58FY/6neUzC1BGXQxPMWN3l7rj5qAksJwW9NUW9sIfCA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:00:41.001208Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.05671","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:113604fba109d5726b7452e860bf7d02977331a0a2b215ffcebb2e4c02eeb027","sha256:f41007f739703d13575ada459c41f045fc30472e47a4b8c3b83b284a207fe2fe"],"state_sha256":"7c9f958ca71ea803024ff9478a3e365028c0c4dfd94cbab7e29daa45cf364fcf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GnF3/vJlK4np+ZfWg7+NPSGbVXrdzWygBTsRMm9AgK3fxmBgNHDdnAfWBMsMCVtpLOeaXsSSZkFQSIyyTjwpBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T17:42:40.991571Z","bundle_sha256":"6b86e4f85761c172394655d1165e4c34d133a57d704624c401a1f60a73997503"}}