{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:OGWQQYCSSNZWB3GVAFUO6EX74Q","short_pith_number":"pith:OGWQQYCS","schema_version":"1.0","canonical_sha256":"71ad086052937360ecd50168ef12ffe4343f2361b7590643b24f5b9f8184a8d5","source":{"kind":"arxiv","id":"2104.07477","version":1},"attestation_state":"computed","paper":{"title":"Lorentzian Graph Convolutional Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chuan Shi, Guojie Song, Nian Liu, Xiao Wang, Yiding Zhang","submitted_at":"2021-04-15T14:14:25Z","abstract_excerpt":"Graph convolutional networks (GCNs) have received considerable research attention recently. Most GCNs learn the node representations in Euclidean geometry, but that could have a high distortion in the case of embedding graphs with scale-free or hierarchical structure. Recently, some GCNs are proposed to deal with this problem in non-Euclidean geometry, e.g., hyperbolic geometry. Although hyperbolic GCNs achieve promising performance, existing hyperbolic graph operations actually cannot rigorously follow the hyperbolic geometry, which may limit the ability of hyperbolic geometry and thus hurt t"},"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":"2104.07477","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-04-15T14:14:25Z","cross_cats_sorted":[],"title_canon_sha256":"22ddf6910a198b27ca9250b207eb91534206bcaee1716953bcf7a792fb5fdd43","abstract_canon_sha256":"882a634824026c004403c8552a55b2f4522d289ffbc08f95a5350d42bcf152b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:32:28.387961Z","signature_b64":"s9KvmXdBsPWpj/mdDfHRYEoqURgjlaLNVbf3gQsZSiWCGW/UoCyIuDgsgzWFKQ3WYa3hD8PNmUifL1zdpLf9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71ad086052937360ecd50168ef12ffe4343f2361b7590643b24f5b9f8184a8d5","last_reissued_at":"2026-07-05T02:32:28.387534Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:32:28.387534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lorentzian Graph Convolutional Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chuan Shi, Guojie Song, Nian Liu, Xiao Wang, Yiding Zhang","submitted_at":"2021-04-15T14:14:25Z","abstract_excerpt":"Graph convolutional networks (GCNs) have received considerable research attention recently. Most GCNs learn the node representations in Euclidean geometry, but that could have a high distortion in the case of embedding graphs with scale-free or hierarchical structure. Recently, some GCNs are proposed to deal with this problem in non-Euclidean geometry, e.g., hyperbolic geometry. Although hyperbolic GCNs achieve promising performance, existing hyperbolic graph operations actually cannot rigorously follow the hyperbolic geometry, which may limit the ability of hyperbolic geometry and thus hurt t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.07477","kind":"arxiv","version":1},"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/2104.07477/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":"2104.07477","created_at":"2026-07-05T02:32:28.387600+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.07477v1","created_at":"2026-07-05T02:32:28.387600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.07477","created_at":"2026-07-05T02:32:28.387600+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGWQQYCSSNZW","created_at":"2026-07-05T02:32:28.387600+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGWQQYCSSNZWB3GV","created_at":"2026-07-05T02:32:28.387600+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGWQQYCS","created_at":"2026-07-05T02:32:28.387600+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OGWQQYCSSNZWB3GVAFUO6EX74Q","json":"https://pith.science/pith/OGWQQYCSSNZWB3GVAFUO6EX74Q.json","graph_json":"https://pith.science/api/pith-number/OGWQQYCSSNZWB3GVAFUO6EX74Q/graph.json","events_json":"https://pith.science/api/pith-number/OGWQQYCSSNZWB3GVAFUO6EX74Q/events.json","paper":"https://pith.science/paper/OGWQQYCS"},"agent_actions":{"view_html":"https://pith.science/pith/OGWQQYCSSNZWB3GVAFUO6EX74Q","download_json":"https://pith.science/pith/OGWQQYCSSNZWB3GVAFUO6EX74Q.json","view_paper":"https://pith.science/paper/OGWQQYCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.07477&json=true","fetch_graph":"https://pith.science/api/pith-number/OGWQQYCSSNZWB3GVAFUO6EX74Q/graph.json","fetch_events":"https://pith.science/api/pith-number/OGWQQYCSSNZWB3GVAFUO6EX74Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGWQQYCSSNZWB3GVAFUO6EX74Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGWQQYCSSNZWB3GVAFUO6EX74Q/action/storage_attestation","attest_author":"https://pith.science/pith/OGWQQYCSSNZWB3GVAFUO6EX74Q/action/author_attestation","sign_citation":"https://pith.science/pith/OGWQQYCSSNZWB3GVAFUO6EX74Q/action/citation_signature","submit_replication":"https://pith.science/pith/OGWQQYCSSNZWB3GVAFUO6EX74Q/action/replication_record"}},"created_at":"2026-07-05T02:32:28.387600+00:00","updated_at":"2026-07-05T02:32:28.387600+00:00"}