{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UDQL4E2S7UC2C4MF2ASZ4CNY5P","short_pith_number":"pith:UDQL4E2S","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"},"canonical_sha256":"a0e0be1352fd05a17185d0259e09b8ebf1e65663b84c5c0551d8c225543b7eb9","source":{"kind":"arxiv","id":"2602.01828","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.01828","created_at":"2026-05-17T23:39:00Z"},{"alias_kind":"arxiv_version","alias_value":"2602.01828v2","created_at":"2026-05-17T23:39:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.01828","created_at":"2026-05-17T23:39:00Z"},{"alias_kind":"pith_short_12","alias_value":"UDQL4E2S7UC2","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"UDQL4E2S7UC2C4MF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"UDQL4E2S","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UDQL4E2S7UC2C4MF2ASZ4CNY5P","target":"record","payload":{"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"},"canonical_sha256":"a0e0be1352fd05a17185d0259e09b8ebf1e65663b84c5c0551d8c225543b7eb9","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"},"source_kind":"arxiv","source_id":"2602.01828","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-05-17T23:39:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g+kTZtyuFzJM2lX/aXQ/oe7bn7kWOk76bnMiXs+dwkUoc8eLxg7CJAF2lwgfae9+Br5KhL2e9fvlRtxUtCBWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:27:35.104448Z"},"content_sha256":"b904abedb6c828e6c509ea621fa1cf22bef5cb987d27cfb6c9d3365c1990253d","schema_version":"1.0","event_id":"sha256:b904abedb6c828e6c509ea621fa1cf22bef5cb987d27cfb6c9d3365c1990253d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UDQL4E2S7UC2C4MF2ASZ4CNY5P","target":"graph","payload":{"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"},"verdict_id":"31c5d020-03ee-4a94-9849-10605a5fe56e"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SZme21/gIoRMDSAvZaPHzfJ35DA05XWRvGVklGfPd7V1Xix6vCoPO7Kh6tpR4Ew2uaiKHUcX3uOerE7k6nAuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:27:35.105368Z"},"content_sha256":"df6edc64ec05fc8268674c23ee0da644164d4748777b19fcb32122fc303d0047","schema_version":"1.0","event_id":"sha256:df6edc64ec05fc8268674c23ee0da644164d4748777b19fcb32122fc303d0047"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UDQL4E2S7UC2C4MF2ASZ4CNY5P/bundle.json","state_url":"https://pith.science/pith/UDQL4E2S7UC2C4MF2ASZ4CNY5P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UDQL4E2S7UC2C4MF2ASZ4CNY5P/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-06-02T20:27:35Z","links":{"resolver":"https://pith.science/pith/UDQL4E2S7UC2C4MF2ASZ4CNY5P","bundle":"https://pith.science/pith/UDQL4E2S7UC2C4MF2ASZ4CNY5P/bundle.json","state":"https://pith.science/pith/UDQL4E2S7UC2C4MF2ASZ4CNY5P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UDQL4E2S7UC2C4MF2ASZ4CNY5P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UDQL4E2S7UC2C4MF2ASZ4CNY5P","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":"20ef0215f595be1f32ebfc6900b3d59054c5ae1f03faf44fb34d258f57b3e9f7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-02T09:01:58Z","title_canon_sha256":"2f48ecc4de1e079bab579484a8d956acc375f7aa6edf9948ba24dfc4b899eed2"},"schema_version":"1.0","source":{"id":"2602.01828","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.01828","created_at":"2026-05-17T23:39:00Z"},{"alias_kind":"arxiv_version","alias_value":"2602.01828v2","created_at":"2026-05-17T23:39:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.01828","created_at":"2026-05-17T23:39:00Z"},{"alias_kind":"pith_short_12","alias_value":"UDQL4E2S7UC2","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"UDQL4E2S7UC2C4MF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"UDQL4E2S","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:df6edc64ec05fc8268674c23ee0da644164d4748777b19fcb32122fc303d0047","target":"graph","created_at":"2026-05-17T23:39:00Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Hyperbolic graph neural networks outperform Euclidean ones only when the task itself requires preserving the graph's metric structure."}],"snapshot_sha256":"fb924015bf0306b207d0c86b23b963ab80d84645c6044bff35b6622be71b4df0"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"4017e771db8931486e527eba68561fd1892cc6b6950a62b8bdaeb95f3e6616dd"},"paper":{"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","authors_text":"Dionisia Naddeo, Geri Skenderi, Jonas Linkerh\\\"agner, Nicola Toschi, Veronica Lachi","cross_cats":[],"headline":"Hyperbolic graph neural networks outperform Euclidean ones only when the task itself requires preserving the graph's metric structure.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-02T09:01:58Z","title":"Hyperbolic Graph Neural Networks Under the Microscope: The Role of Geometry-Task Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.01828","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-16T08:47:46.604918Z","id":"31c5d020-03ee-4a94-9849-10605a5fe56e","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"Hyperbolic graph neural networks outperform Euclidean ones only when the task itself requires preserving the graph's metric structure.","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.","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."}},"verdict_id":"31c5d020-03ee-4a94-9849-10605a5fe56e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b904abedb6c828e6c509ea621fa1cf22bef5cb987d27cfb6c9d3365c1990253d","target":"record","created_at":"2026-05-17T23:39:00Z","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":"20ef0215f595be1f32ebfc6900b3d59054c5ae1f03faf44fb34d258f57b3e9f7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-02T09:01:58Z","title_canon_sha256":"2f48ecc4de1e079bab579484a8d956acc375f7aa6edf9948ba24dfc4b899eed2"},"schema_version":"1.0","source":{"id":"2602.01828","kind":"arxiv","version":2}},"canonical_sha256":"a0e0be1352fd05a17185d0259e09b8ebf1e65663b84c5c0551d8c225543b7eb9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0e0be1352fd05a17185d0259e09b8ebf1e65663b84c5c0551d8c225543b7eb9","first_computed_at":"2026-05-17T23:39:00.097600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:00.097600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E1Jg6V85ZH5mLMRp5KiYFtUSn3+pk6G7A9mv6PBNBcTyOabwyehpV2AJzS2FkE9FkR68ZH2qdkD91iZgVovsAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:00.098330Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.01828","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b904abedb6c828e6c509ea621fa1cf22bef5cb987d27cfb6c9d3365c1990253d","sha256:df6edc64ec05fc8268674c23ee0da644164d4748777b19fcb32122fc303d0047"],"state_sha256":"eb946629c18c97bbb2061cd2aff227a933056dc288d0b566a60b29c5830c9111"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rKwIsaF9afNKdyyYQrZQyl8jjBSwYT/GfFIy+y5IOqQTIsxB4RVfqP4V3c32BHx+8hf3A9UWhV5YF+HuetfoDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:27:35.109972Z","bundle_sha256":"79280c1a4dde32f6a5f884d5caf4ad91505b922b28c9a7cce3094ea3eb139d6e"}}