{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6KBWTRM2O7HWZDCTDWU3E3QBB4","short_pith_number":"pith:6KBWTRM2","schema_version":"1.0","canonical_sha256":"f28369c59a77cf6c8c531da9b26e010f17bc9b827791c1d6d7d288eee91b1414","source":{"kind":"arxiv","id":"2306.13770","version":1},"attestation_state":"computed","paper":{"title":"Meta-Path-based Probabilistic Soft Logic for Drug-Target Interaction Prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"q-bio.BM","authors_text":"Shengming Zhang, Yizhou Sun","submitted_at":"2023-06-25T02:30:38Z","abstract_excerpt":"Drug-target interaction (DTI) prediction, which aims at predicting whether a drug will be bounded to a target, have received wide attention recently, with the goal to automate and accelerate the costly process of drug design. Most of the recently proposed methods use single drug-drug similarity and target-target similarity information for DTI prediction, which are unable to take advantage of the abundant information regarding various types of similarities between them. Very recently, some methods are proposed to leverage multi-similarity information, however, they still lack the ability to tak"},"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":"2306.13770","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-bio.BM","submitted_at":"2023-06-25T02:30:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"423da0e5010b2956490b1fffba765c633a808a644535ddcd5bd49ff062af87ef","abstract_canon_sha256":"895c4e2b90cc8d8442d1e6aff124cf2feab7d8d7412cceb96a61d07ac9b8a068"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:24:15.344078Z","signature_b64":"8ynyTRR7aHAH1/5TZ0GaM3BVa5I4c6O8s0EbWU/Lome8ECgX9Wjz1payOLeoy5fwGiW5O0wBPkobBFNKYcZbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f28369c59a77cf6c8c531da9b26e010f17bc9b827791c1d6d7d288eee91b1414","last_reissued_at":"2026-07-05T06:24:15.343668Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:24:15.343668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Meta-Path-based Probabilistic Soft Logic for Drug-Target Interaction Prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"q-bio.BM","authors_text":"Shengming Zhang, Yizhou Sun","submitted_at":"2023-06-25T02:30:38Z","abstract_excerpt":"Drug-target interaction (DTI) prediction, which aims at predicting whether a drug will be bounded to a target, have received wide attention recently, with the goal to automate and accelerate the costly process of drug design. Most of the recently proposed methods use single drug-drug similarity and target-target similarity information for DTI prediction, which are unable to take advantage of the abundant information regarding various types of similarities between them. Very recently, some methods are proposed to leverage multi-similarity information, however, they still lack the ability to tak"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.13770","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/2306.13770/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":"2306.13770","created_at":"2026-07-05T06:24:15.343729+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.13770v1","created_at":"2026-07-05T06:24:15.343729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.13770","created_at":"2026-07-05T06:24:15.343729+00:00"},{"alias_kind":"pith_short_12","alias_value":"6KBWTRM2O7HW","created_at":"2026-07-05T06:24:15.343729+00:00"},{"alias_kind":"pith_short_16","alias_value":"6KBWTRM2O7HWZDCT","created_at":"2026-07-05T06:24:15.343729+00:00"},{"alias_kind":"pith_short_8","alias_value":"6KBWTRM2","created_at":"2026-07-05T06:24:15.343729+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.02760","citing_title":"CHAT: Beyond Contrastive Graph Transformer for Link Prediction in Heterogeneous Networks","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6KBWTRM2O7HWZDCTDWU3E3QBB4","json":"https://pith.science/pith/6KBWTRM2O7HWZDCTDWU3E3QBB4.json","graph_json":"https://pith.science/api/pith-number/6KBWTRM2O7HWZDCTDWU3E3QBB4/graph.json","events_json":"https://pith.science/api/pith-number/6KBWTRM2O7HWZDCTDWU3E3QBB4/events.json","paper":"https://pith.science/paper/6KBWTRM2"},"agent_actions":{"view_html":"https://pith.science/pith/6KBWTRM2O7HWZDCTDWU3E3QBB4","download_json":"https://pith.science/pith/6KBWTRM2O7HWZDCTDWU3E3QBB4.json","view_paper":"https://pith.science/paper/6KBWTRM2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.13770&json=true","fetch_graph":"https://pith.science/api/pith-number/6KBWTRM2O7HWZDCTDWU3E3QBB4/graph.json","fetch_events":"https://pith.science/api/pith-number/6KBWTRM2O7HWZDCTDWU3E3QBB4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6KBWTRM2O7HWZDCTDWU3E3QBB4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6KBWTRM2O7HWZDCTDWU3E3QBB4/action/storage_attestation","attest_author":"https://pith.science/pith/6KBWTRM2O7HWZDCTDWU3E3QBB4/action/author_attestation","sign_citation":"https://pith.science/pith/6KBWTRM2O7HWZDCTDWU3E3QBB4/action/citation_signature","submit_replication":"https://pith.science/pith/6KBWTRM2O7HWZDCTDWU3E3QBB4/action/replication_record"}},"created_at":"2026-07-05T06:24:15.343729+00:00","updated_at":"2026-07-05T06:24:15.343729+00:00"}