{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KCNPEMIWVPTBM35NWIDOSTDW3J","short_pith_number":"pith:KCNPEMIW","schema_version":"1.0","canonical_sha256":"509af23116abe6166fadb206e94c76da678bc99a8de6ed86a72ee947fb49c553","source":{"kind":"arxiv","id":"2506.16654","version":1},"attestation_state":"computed","paper":{"title":"Relational Deep Learning: Challenges, Foundations and Next-Generation Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DB"],"primary_cat":"cs.LG","authors_text":"Charilaos Kanatsoulis, Jure Leskovec, Shenyang Huang, Vijay Prakash Dwivedi","submitted_at":"2025-06-19T23:51:38Z","abstract_excerpt":"Graph machine learning has led to a significant increase in the capabilities of models that learn on arbitrary graph-structured data and has been applied to molecules, social networks, recommendation systems, and transportation, among other domains. Data in multi-tabular relational databases can also be constructed as 'relational entity graphs' for Relational Deep Learning (RDL) - a new blueprint that enables end-to-end representation learning without traditional feature engineering. Compared to arbitrary graph-structured data, relational entity graphs have key properties: (i) their structure "},"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":"2506.16654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-19T23:51:38Z","cross_cats_sorted":["cs.AI","cs.DB"],"title_canon_sha256":"b643ba3564b675f793418ba8e1cb8b7c07d7e7e3a1edd6d62d6633289d2b61e1","abstract_canon_sha256":"1575ce9b3ccbfda5f0ffd94b06dd338e3555069e5b1c177574e84401fcb5ea1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:24:40.248764Z","signature_b64":"0XXttkZNG7S0O9DFaLlenGweEoK7vRRTu+OXj5FRYI6H0tGj2Zy0QWZMBsOuyj1RZDGoP3pr8Y7CcqoEWgUVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"509af23116abe6166fadb206e94c76da678bc99a8de6ed86a72ee947fb49c553","last_reissued_at":"2026-07-05T11:24:40.248235Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:24:40.248235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relational Deep Learning: Challenges, Foundations and Next-Generation Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DB"],"primary_cat":"cs.LG","authors_text":"Charilaos Kanatsoulis, Jure Leskovec, Shenyang Huang, Vijay Prakash Dwivedi","submitted_at":"2025-06-19T23:51:38Z","abstract_excerpt":"Graph machine learning has led to a significant increase in the capabilities of models that learn on arbitrary graph-structured data and has been applied to molecules, social networks, recommendation systems, and transportation, among other domains. Data in multi-tabular relational databases can also be constructed as 'relational entity graphs' for Relational Deep Learning (RDL) - a new blueprint that enables end-to-end representation learning without traditional feature engineering. Compared to arbitrary graph-structured data, relational entity graphs have key properties: (i) their structure "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.16654","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/2506.16654/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":"2506.16654","created_at":"2026-07-05T11:24:40.248292+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.16654v1","created_at":"2026-07-05T11:24:40.248292+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.16654","created_at":"2026-07-05T11:24:40.248292+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCNPEMIWVPTB","created_at":"2026-07-05T11:24:40.248292+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCNPEMIWVPTBM35N","created_at":"2026-07-05T11:24:40.248292+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCNPEMIW","created_at":"2026-07-05T11:24:40.248292+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.03040","citing_title":"RelGT-AC: A Relational Graph Transformer for Autocomplete Tasks in Relational Databases","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KCNPEMIWVPTBM35NWIDOSTDW3J","json":"https://pith.science/pith/KCNPEMIWVPTBM35NWIDOSTDW3J.json","graph_json":"https://pith.science/api/pith-number/KCNPEMIWVPTBM35NWIDOSTDW3J/graph.json","events_json":"https://pith.science/api/pith-number/KCNPEMIWVPTBM35NWIDOSTDW3J/events.json","paper":"https://pith.science/paper/KCNPEMIW"},"agent_actions":{"view_html":"https://pith.science/pith/KCNPEMIWVPTBM35NWIDOSTDW3J","download_json":"https://pith.science/pith/KCNPEMIWVPTBM35NWIDOSTDW3J.json","view_paper":"https://pith.science/paper/KCNPEMIW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.16654&json=true","fetch_graph":"https://pith.science/api/pith-number/KCNPEMIWVPTBM35NWIDOSTDW3J/graph.json","fetch_events":"https://pith.science/api/pith-number/KCNPEMIWVPTBM35NWIDOSTDW3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCNPEMIWVPTBM35NWIDOSTDW3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCNPEMIWVPTBM35NWIDOSTDW3J/action/storage_attestation","attest_author":"https://pith.science/pith/KCNPEMIWVPTBM35NWIDOSTDW3J/action/author_attestation","sign_citation":"https://pith.science/pith/KCNPEMIWVPTBM35NWIDOSTDW3J/action/citation_signature","submit_replication":"https://pith.science/pith/KCNPEMIWVPTBM35NWIDOSTDW3J/action/replication_record"}},"created_at":"2026-07-05T11:24:40.248292+00:00","updated_at":"2026-07-05T11:24:40.248292+00:00"}