{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2YPZXKN7DHRHYYVNQSFGNN5Y2X","short_pith_number":"pith:2YPZXKN7","schema_version":"1.0","canonical_sha256":"d61f9ba9bf19e27c62ad848a66b7b8d5cdcba28bb4287737b58ea459367d85d1","source":{"kind":"arxiv","id":"2205.05957","version":1},"attestation_state":"computed","paper":{"title":"Communicative Subgraph Representation Learning for Multi-Relational Inductive Drug-Gene Interaction Prediction","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jiahua Rao, Shuangjia Zheng, Sijie Mai, Yuedong Yang","submitted_at":"2022-05-12T08:53:45Z","abstract_excerpt":"Illuminating the interconnections between drugs and genes is an important topic in drug development and precision medicine. Currently, computational predictions of drug-gene interactions mainly focus on the binding interactions without considering other relation types like agonist, antagonist, etc. In addition, existing methods either heavily rely on high-quality domain features or are intrinsically transductive, which limits the capacity of models to generalize to drugs/genes that lack external information or are unseen during the training process. To address these problems, we propose a nove"},"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":"2205.05957","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-12T08:53:45Z","cross_cats_sorted":[],"title_canon_sha256":"e13f7decda8961d522e142cee6f091b75b03c2646a01e98414ded35b8cb20cb6","abstract_canon_sha256":"64b1557f1374d07c3042ac35df1f902e040e42e6ad4eedaac358a014caf05a64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:22:43.934833Z","signature_b64":"BfpA6FEauHj2mrL3dRQWYV3KtN3kekrTq4Rg11HuAnOjiaJj84kBZtNMuKUudg9LGKuoUq368MgR5vBQY+5EAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d61f9ba9bf19e27c62ad848a66b7b8d5cdcba28bb4287737b58ea459367d85d1","last_reissued_at":"2026-07-05T04:22:43.934498Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:22:43.934498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communicative Subgraph Representation Learning for Multi-Relational Inductive Drug-Gene Interaction Prediction","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jiahua Rao, Shuangjia Zheng, Sijie Mai, Yuedong Yang","submitted_at":"2022-05-12T08:53:45Z","abstract_excerpt":"Illuminating the interconnections between drugs and genes is an important topic in drug development and precision medicine. Currently, computational predictions of drug-gene interactions mainly focus on the binding interactions without considering other relation types like agonist, antagonist, etc. In addition, existing methods either heavily rely on high-quality domain features or are intrinsically transductive, which limits the capacity of models to generalize to drugs/genes that lack external information or are unseen during the training process. To address these problems, we propose a nove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.05957","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/2205.05957/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":"2205.05957","created_at":"2026-07-05T04:22:43.934553+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.05957v1","created_at":"2026-07-05T04:22:43.934553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.05957","created_at":"2026-07-05T04:22:43.934553+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YPZXKN7DHRH","created_at":"2026-07-05T04:22:43.934553+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YPZXKN7DHRHYYVN","created_at":"2026-07-05T04:22:43.934553+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YPZXKN7","created_at":"2026-07-05T04:22:43.934553+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.11075","citing_title":"Edge Contrastive Learning: An Augmentation-Free Graph Contrastive Learning Model","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2YPZXKN7DHRHYYVNQSFGNN5Y2X","json":"https://pith.science/pith/2YPZXKN7DHRHYYVNQSFGNN5Y2X.json","graph_json":"https://pith.science/api/pith-number/2YPZXKN7DHRHYYVNQSFGNN5Y2X/graph.json","events_json":"https://pith.science/api/pith-number/2YPZXKN7DHRHYYVNQSFGNN5Y2X/events.json","paper":"https://pith.science/paper/2YPZXKN7"},"agent_actions":{"view_html":"https://pith.science/pith/2YPZXKN7DHRHYYVNQSFGNN5Y2X","download_json":"https://pith.science/pith/2YPZXKN7DHRHYYVNQSFGNN5Y2X.json","view_paper":"https://pith.science/paper/2YPZXKN7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.05957&json=true","fetch_graph":"https://pith.science/api/pith-number/2YPZXKN7DHRHYYVNQSFGNN5Y2X/graph.json","fetch_events":"https://pith.science/api/pith-number/2YPZXKN7DHRHYYVNQSFGNN5Y2X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YPZXKN7DHRHYYVNQSFGNN5Y2X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YPZXKN7DHRHYYVNQSFGNN5Y2X/action/storage_attestation","attest_author":"https://pith.science/pith/2YPZXKN7DHRHYYVNQSFGNN5Y2X/action/author_attestation","sign_citation":"https://pith.science/pith/2YPZXKN7DHRHYYVNQSFGNN5Y2X/action/citation_signature","submit_replication":"https://pith.science/pith/2YPZXKN7DHRHYYVNQSFGNN5Y2X/action/replication_record"}},"created_at":"2026-07-05T04:22:43.934553+00:00","updated_at":"2026-07-05T04:22:43.934553+00:00"}