{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HVQTX3U6YK2HTTFBK4B3SHQIXT","short_pith_number":"pith:HVQTX3U6","schema_version":"1.0","canonical_sha256":"3d613bee9ec2b479cca15703b91e08bcea72b2012016ed8d1fde1b07ffed5ef2","source":{"kind":"arxiv","id":"2606.08491","version":1},"attestation_state":"computed","paper":{"title":"What Makes a Desired Graph for Relational Deep Learning?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Siqiang Luo, Yao Cheng","submitted_at":"2026-06-07T07:30:34Z","abstract_excerpt":"Relational deep learning (RDL) converts relational databases (RDBs) into heterogeneous graphs, but graphs derived directly from database schemas are often not well suited for how graph neural networks (GNNs) perform relational reasoning. We study what makes a relational graph suitable for deep learning and show that schema-derived graphs suffer from two systematic failures: information overload and semantic fragmentation. Our empirical analysis reveals that the desired graph is not the raw schema, but a result of controlled structural adaptation. Performance depends on balancing two operations"},"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":"2606.08491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-07T07:30:34Z","cross_cats_sorted":[],"title_canon_sha256":"cbf3f30c50208673c78c4e8c6458f0b5a9a32cb8e1f1674cd32f192063f2aa92","abstract_canon_sha256":"5e636d99f4ae991ef2452d323fb3787796c6ede712ccdb4e17bc6afad208cc13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:38.134873Z","signature_b64":"BNQxNdCFGz9/inwzY27WaRzPY+WL7EDzP5oWEt0ZNGHtf55sGz81rRlCi8OEdXu0wrnsx44/1O5HEkIKTjY7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d613bee9ec2b479cca15703b91e08bcea72b2012016ed8d1fde1b07ffed5ef2","last_reissued_at":"2026-06-09T01:05:38.134395Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:38.134395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"What Makes a Desired Graph for Relational Deep Learning?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Siqiang Luo, Yao Cheng","submitted_at":"2026-06-07T07:30:34Z","abstract_excerpt":"Relational deep learning (RDL) converts relational databases (RDBs) into heterogeneous graphs, but graphs derived directly from database schemas are often not well suited for how graph neural networks (GNNs) perform relational reasoning. We study what makes a relational graph suitable for deep learning and show that schema-derived graphs suffer from two systematic failures: information overload and semantic fragmentation. Our empirical analysis reveals that the desired graph is not the raw schema, but a result of controlled structural adaptation. Performance depends on balancing two operations"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08491","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/2606.08491/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":"2606.08491","created_at":"2026-06-09T01:05:38.134462+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.08491v1","created_at":"2026-06-09T01:05:38.134462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08491","created_at":"2026-06-09T01:05:38.134462+00:00"},{"alias_kind":"pith_short_12","alias_value":"HVQTX3U6YK2H","created_at":"2026-06-09T01:05:38.134462+00:00"},{"alias_kind":"pith_short_16","alias_value":"HVQTX3U6YK2HTTFB","created_at":"2026-06-09T01:05:38.134462+00:00"},{"alias_kind":"pith_short_8","alias_value":"HVQTX3U6","created_at":"2026-06-09T01:05:38.134462+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/HVQTX3U6YK2HTTFBK4B3SHQIXT","json":"https://pith.science/pith/HVQTX3U6YK2HTTFBK4B3SHQIXT.json","graph_json":"https://pith.science/api/pith-number/HVQTX3U6YK2HTTFBK4B3SHQIXT/graph.json","events_json":"https://pith.science/api/pith-number/HVQTX3U6YK2HTTFBK4B3SHQIXT/events.json","paper":"https://pith.science/paper/HVQTX3U6"},"agent_actions":{"view_html":"https://pith.science/pith/HVQTX3U6YK2HTTFBK4B3SHQIXT","download_json":"https://pith.science/pith/HVQTX3U6YK2HTTFBK4B3SHQIXT.json","view_paper":"https://pith.science/paper/HVQTX3U6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.08491&json=true","fetch_graph":"https://pith.science/api/pith-number/HVQTX3U6YK2HTTFBK4B3SHQIXT/graph.json","fetch_events":"https://pith.science/api/pith-number/HVQTX3U6YK2HTTFBK4B3SHQIXT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HVQTX3U6YK2HTTFBK4B3SHQIXT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HVQTX3U6YK2HTTFBK4B3SHQIXT/action/storage_attestation","attest_author":"https://pith.science/pith/HVQTX3U6YK2HTTFBK4B3SHQIXT/action/author_attestation","sign_citation":"https://pith.science/pith/HVQTX3U6YK2HTTFBK4B3SHQIXT/action/citation_signature","submit_replication":"https://pith.science/pith/HVQTX3U6YK2HTTFBK4B3SHQIXT/action/replication_record"}},"created_at":"2026-06-09T01:05:38.134462+00:00","updated_at":"2026-06-09T01:05:38.134462+00:00"}