{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:Q3FVBE6N7GDWFC7LX7AF72ZCRG","short_pith_number":"pith:Q3FVBE6N","schema_version":"1.0","canonical_sha256":"86cb5093cdf987628bebbfc05feb228996686446939e66cb2abd594530641b3e","source":{"kind":"arxiv","id":"2206.07015","version":1},"attestation_state":"computed","paper":{"title":"SS-GNN: A Simple-Structured Graph Neural Network for Affinity Prediction","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"q-bio.BM","authors_text":"Bo Shan, Qi Wang, Shuke Zhang, Shuliang Zhao, Tianmeng Liu, Yanzhao Jin, Zhaohui Zhang","submitted_at":"2022-05-25T04:47:13Z","abstract_excerpt":"Efficient and effective drug-target binding affinity (DTBA) prediction is a challenging task due to the limited computational resources in practical applications and is a crucial basis for drug screening. Inspired by the good representation ability of graph neural networks (GNNs), we propose a simple-structured GNN model named SS-GNN to accurately predict DTBA. By constructing a single undirected graph based on a distance threshold to represent protein-ligand interactions, the scale of the graph data is greatly reduced. Moreover, ignoring covalent bonds in the protein further reduces the compu"},"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":"2206.07015","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"q-bio.BM","submitted_at":"2022-05-25T04:47:13Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"845d427a0a1129ecb8cb8c15cf41e9a11edfdfac0a40cc085d4e5aff19493abf","abstract_canon_sha256":"92cf228cf90418c30c871968f555eaed9f49b62d34ebc3d9c5ddfd2a6b831713"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:31:48.155775Z","signature_b64":"QwXIf2qoWuwW6YwhmHkpjAkKoVF+wNWIMKxWkmy4XZDMia0pyYFyn1tcXIvefDJUNo//fHCG3DzgywPN+LYhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86cb5093cdf987628bebbfc05feb228996686446939e66cb2abd594530641b3e","last_reissued_at":"2026-07-05T04:31:48.155375Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:31:48.155375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SS-GNN: A Simple-Structured Graph Neural Network for Affinity Prediction","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"q-bio.BM","authors_text":"Bo Shan, Qi Wang, Shuke Zhang, Shuliang Zhao, Tianmeng Liu, Yanzhao Jin, Zhaohui Zhang","submitted_at":"2022-05-25T04:47:13Z","abstract_excerpt":"Efficient and effective drug-target binding affinity (DTBA) prediction is a challenging task due to the limited computational resources in practical applications and is a crucial basis for drug screening. Inspired by the good representation ability of graph neural networks (GNNs), we propose a simple-structured GNN model named SS-GNN to accurately predict DTBA. By constructing a single undirected graph based on a distance threshold to represent protein-ligand interactions, the scale of the graph data is greatly reduced. Moreover, ignoring covalent bonds in the protein further reduces the compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.07015","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/2206.07015/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":"2206.07015","created_at":"2026-07-05T04:31:48.155428+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.07015v1","created_at":"2026-07-05T04:31:48.155428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.07015","created_at":"2026-07-05T04:31:48.155428+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3FVBE6N7GDW","created_at":"2026-07-05T04:31:48.155428+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3FVBE6N7GDWFC7L","created_at":"2026-07-05T04:31:48.155428+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3FVBE6N","created_at":"2026-07-05T04:31:48.155428+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04190","citing_title":"How to Use Graph Data in the Wild to Help Graph Anomaly Detection?","ref_index":59,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q3FVBE6N7GDWFC7LX7AF72ZCRG","json":"https://pith.science/pith/Q3FVBE6N7GDWFC7LX7AF72ZCRG.json","graph_json":"https://pith.science/api/pith-number/Q3FVBE6N7GDWFC7LX7AF72ZCRG/graph.json","events_json":"https://pith.science/api/pith-number/Q3FVBE6N7GDWFC7LX7AF72ZCRG/events.json","paper":"https://pith.science/paper/Q3FVBE6N"},"agent_actions":{"view_html":"https://pith.science/pith/Q3FVBE6N7GDWFC7LX7AF72ZCRG","download_json":"https://pith.science/pith/Q3FVBE6N7GDWFC7LX7AF72ZCRG.json","view_paper":"https://pith.science/paper/Q3FVBE6N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.07015&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3FVBE6N7GDWFC7LX7AF72ZCRG/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3FVBE6N7GDWFC7LX7AF72ZCRG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3FVBE6N7GDWFC7LX7AF72ZCRG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3FVBE6N7GDWFC7LX7AF72ZCRG/action/storage_attestation","attest_author":"https://pith.science/pith/Q3FVBE6N7GDWFC7LX7AF72ZCRG/action/author_attestation","sign_citation":"https://pith.science/pith/Q3FVBE6N7GDWFC7LX7AF72ZCRG/action/citation_signature","submit_replication":"https://pith.science/pith/Q3FVBE6N7GDWFC7LX7AF72ZCRG/action/replication_record"}},"created_at":"2026-07-05T04:31:48.155428+00:00","updated_at":"2026-07-05T04:31:48.155428+00:00"}