{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UDQL4E2S7UC2C4MF2ASZ4CNY5P","short_pith_number":"pith:UDQL4E2S","schema_version":"1.0","canonical_sha256":"a0e0be1352fd05a17185d0259e09b8ebf1e65663b84c5c0551d8c225543b7eb9","source":{"kind":"arxiv","id":"2602.01828","version":2},"attestation_state":"computed","paper":{"title":"Hyperbolic Graph Neural Networks Under the Microscope: The Role of Geometry-Task Alignment","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Hyperbolic graph neural networks outperform Euclidean ones only when the task itself requires preserving the graph's metric structure.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dionisia Naddeo, Geri Skenderi, Jonas Linkerh\\\"agner, Nicola Toschi, Veronica Lachi","submitted_at":"2026-02-02T09:01:58Z","abstract_excerpt":"Many complex networks exhibit hierarchical, tree-like structures, making hyperbolic space a natural candidate wherein to learn representations of them. Based on this observation, Hyperbolic Graph Neural Networks (HGNNs) have been widely adopted as a principled choice for representation learning on tree-like graphs. In this work, we question this paradigm by proposing the additional condition of geometry--task alignment, i.e., whether the metric structure of the target follows that of the input graph. We theoretically and empirically demonstrate the capability of HGNNs to recover low-distortion"},"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":true},"canonical_record":{"source":{"id":"2602.01828","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-02T09:01:58Z","cross_cats_sorted":[],"title_canon_sha256":"2f48ecc4de1e079bab579484a8d956acc375f7aa6edf9948ba24dfc4b899eed2","abstract_canon_sha256":"20ef0215f595be1f32ebfc6900b3d59054c5ae1f03faf44fb34d258f57b3e9f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:00.098330Z","signature_b64":"E1Jg6V85ZH5mLMRp5KiYFtUSn3+pk6G7A9mv6PBNBcTyOabwyehpV2AJzS2FkE9FkR68ZH2qdkD91iZgVovsAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0e0be1352fd05a17185d0259e09b8ebf1e65663b84c5c0551d8c225543b7eb9","last_reissued_at":"2026-05-17T23:39:00.097600Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:00.097600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hyperbolic Graph Neural Networks Under the Microscope: The Role of Geometry-Task Alignment","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Hyperbolic graph neural networks outperform Euclidean ones only when the task itself requires preserving the graph's metric structure.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dionisia Naddeo, Geri Skenderi, Jonas Linkerh\\\"agner, Nicola Toschi, Veronica Lachi","submitted_at":"2026-02-02T09:01:58Z","abstract_excerpt":"Many complex networks exhibit hierarchical, tree-like structures, making hyperbolic space a natural candidate wherein to learn representations of them. Based on this observation, Hyperbolic Graph Neural Networks (HGNNs) have been widely adopted as a principled choice for representation learning on tree-like graphs. In this work, we question this paradigm by proposing the additional condition of geometry--task alignment, i.e., whether the metric structure of the target follows that of the input graph. We theoretically and empirically demonstrate the capability of HGNNs to recover low-distortion"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"HGNNs gain an advantage on link prediction, a naturally geometry-aligned task, whereas this advantage largely disappears on standard node classification benchmarks, which are typically not geometry-aligned.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That link prediction is inherently geometry-aligned while standard node classification benchmarks are not, and that the chosen distortion measures and benchmarks generalize beyond the tested cases.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"HGNNs recover low-distortion representations and outperform Euclidean models only on geometry-aligned tasks such as link prediction, while the advantage disappears on non-aligned tasks like node classification.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Hyperbolic graph neural networks outperform Euclidean ones only when the task itself requires preserving the graph's metric structure.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"fb924015bf0306b207d0c86b23b963ab80d84645c6044bff35b6622be71b4df0"},"source":{"id":"2602.01828","kind":"arxiv","version":2},"verdict":{"id":"31c5d020-03ee-4a94-9849-10605a5fe56e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T08:47:46.604918Z","strongest_claim":"HGNNs gain an advantage on link prediction, a naturally geometry-aligned task, whereas this advantage largely disappears on standard node classification benchmarks, which are typically not geometry-aligned.","one_line_summary":"HGNNs recover low-distortion representations and outperform Euclidean models only on geometry-aligned tasks such as link prediction, while the advantage disappears on non-aligned tasks like node classification.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That link prediction is inherently geometry-aligned while standard node classification benchmarks are not, and that the chosen distortion measures and benchmarks generalize beyond the tested cases.","pith_extraction_headline":"Hyperbolic graph neural networks outperform Euclidean ones only when the task itself requires preserving the graph's metric structure."},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"4017e771db8931486e527eba68561fd1892cc6b6950a62b8bdaeb95f3e6616dd"},"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":"2602.01828","created_at":"2026-05-17T23:39:00.097718+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.01828v2","created_at":"2026-05-17T23:39:00.097718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.01828","created_at":"2026-05-17T23:39:00.097718+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDQL4E2S7UC2","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDQL4E2S7UC2C4MF","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDQL4E2S","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UDQL4E2S7UC2C4MF2ASZ4CNY5P","json":"https://pith.science/pith/UDQL4E2S7UC2C4MF2ASZ4CNY5P.json","graph_json":"https://pith.science/api/pith-number/UDQL4E2S7UC2C4MF2ASZ4CNY5P/graph.json","events_json":"https://pith.science/api/pith-number/UDQL4E2S7UC2C4MF2ASZ4CNY5P/events.json","paper":"https://pith.science/paper/UDQL4E2S"},"agent_actions":{"view_html":"https://pith.science/pith/UDQL4E2S7UC2C4MF2ASZ4CNY5P","download_json":"https://pith.science/pith/UDQL4E2S7UC2C4MF2ASZ4CNY5P.json","view_paper":"https://pith.science/paper/UDQL4E2S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.01828&json=true","fetch_graph":"https://pith.science/api/pith-number/UDQL4E2S7UC2C4MF2ASZ4CNY5P/graph.json","fetch_events":"https://pith.science/api/pith-number/UDQL4E2S7UC2C4MF2ASZ4CNY5P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDQL4E2S7UC2C4MF2ASZ4CNY5P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDQL4E2S7UC2C4MF2ASZ4CNY5P/action/storage_attestation","attest_author":"https://pith.science/pith/UDQL4E2S7UC2C4MF2ASZ4CNY5P/action/author_attestation","sign_citation":"https://pith.science/pith/UDQL4E2S7UC2C4MF2ASZ4CNY5P/action/citation_signature","submit_replication":"https://pith.science/pith/UDQL4E2S7UC2C4MF2ASZ4CNY5P/action/replication_record"}},"created_at":"2026-05-17T23:39:00.097718+00:00","updated_at":"2026-05-17T23:39:00.097718+00:00"}