{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:DTQPX3A2KQXICV645RJPQA7ULU","short_pith_number":"pith:DTQPX3A2","schema_version":"1.0","canonical_sha256":"1ce0fbec1a542e8157dcec52f803f45d316e4125bc0a6528d9195e91224cb9dc","source":{"kind":"arxiv","id":"2102.07007","version":4},"attestation_state":"computed","paper":{"title":"A Statistical Relational Approach to Learning Distance-based GCNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"2), (2) The University of Texas at Dallas, Devendra Singh Dhami (1, Germany, Siwen Yan (2), Sriraam Natarajan (2) ((1) Technical University of Darmstadt, USA)","submitted_at":"2021-02-13T21:34:44Z","abstract_excerpt":"We consider the problem of learning distance-based Graph Convolutional Networks (GCNs) for relational data. Specifically, we first embed the original graph into the Euclidean space $\\mathbb{R}^m$ using a relational density estimation technique thereby constructing a secondary Euclidean graph. The graph vertices correspond to the target triples and edges denote the Euclidean distances between the target triples. We emphasize the importance of learning the secondary Euclidean graph and the advantages of employing a distance matrix over the typically used adjacency matrix. Our comprehensive empir"},"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":"2102.07007","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-13T21:34:44Z","cross_cats_sorted":[],"title_canon_sha256":"6b9b2032d7bf3500910c2b035713f28ab035543b544ae144dd9d360f509fef7c","abstract_canon_sha256":"c2b24939b9a8111eb8c79951edd74f81decfda68f541591e2509c4dcf388721a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:22:12.278112Z","signature_b64":"CphE5C5rJyxN4jHJ5uN5w4bJifVhgBMtTqG1Yrnk4FpIEmqndQZY6hErGoQufpWOdnLmZKPvsjf6NAV5XG4XDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ce0fbec1a542e8157dcec52f803f45d316e4125bc0a6528d9195e91224cb9dc","last_reissued_at":"2026-07-05T03:22:12.277661Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:22:12.277661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Statistical Relational Approach to Learning Distance-based GCNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"2), (2) The University of Texas at Dallas, Devendra Singh Dhami (1, Germany, Siwen Yan (2), Sriraam Natarajan (2) ((1) Technical University of Darmstadt, USA)","submitted_at":"2021-02-13T21:34:44Z","abstract_excerpt":"We consider the problem of learning distance-based Graph Convolutional Networks (GCNs) for relational data. Specifically, we first embed the original graph into the Euclidean space $\\mathbb{R}^m$ using a relational density estimation technique thereby constructing a secondary Euclidean graph. The graph vertices correspond to the target triples and edges denote the Euclidean distances between the target triples. We emphasize the importance of learning the secondary Euclidean graph and the advantages of employing a distance matrix over the typically used adjacency matrix. Our comprehensive empir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.07007","kind":"arxiv","version":4},"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/2102.07007/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":"2102.07007","created_at":"2026-07-05T03:22:12.277718+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.07007v4","created_at":"2026-07-05T03:22:12.277718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.07007","created_at":"2026-07-05T03:22:12.277718+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTQPX3A2KQXI","created_at":"2026-07-05T03:22:12.277718+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTQPX3A2KQXICV64","created_at":"2026-07-05T03:22:12.277718+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTQPX3A2","created_at":"2026-07-05T03:22:12.277718+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/DTQPX3A2KQXICV645RJPQA7ULU","json":"https://pith.science/pith/DTQPX3A2KQXICV645RJPQA7ULU.json","graph_json":"https://pith.science/api/pith-number/DTQPX3A2KQXICV645RJPQA7ULU/graph.json","events_json":"https://pith.science/api/pith-number/DTQPX3A2KQXICV645RJPQA7ULU/events.json","paper":"https://pith.science/paper/DTQPX3A2"},"agent_actions":{"view_html":"https://pith.science/pith/DTQPX3A2KQXICV645RJPQA7ULU","download_json":"https://pith.science/pith/DTQPX3A2KQXICV645RJPQA7ULU.json","view_paper":"https://pith.science/paper/DTQPX3A2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.07007&json=true","fetch_graph":"https://pith.science/api/pith-number/DTQPX3A2KQXICV645RJPQA7ULU/graph.json","fetch_events":"https://pith.science/api/pith-number/DTQPX3A2KQXICV645RJPQA7ULU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTQPX3A2KQXICV645RJPQA7ULU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTQPX3A2KQXICV645RJPQA7ULU/action/storage_attestation","attest_author":"https://pith.science/pith/DTQPX3A2KQXICV645RJPQA7ULU/action/author_attestation","sign_citation":"https://pith.science/pith/DTQPX3A2KQXICV645RJPQA7ULU/action/citation_signature","submit_replication":"https://pith.science/pith/DTQPX3A2KQXICV645RJPQA7ULU/action/replication_record"}},"created_at":"2026-07-05T03:22:12.277718+00:00","updated_at":"2026-07-05T03:22:12.277718+00:00"}