{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BAM4RB5R654WC3YGBZPHIUK6RB","short_pith_number":"pith:BAM4RB5R","schema_version":"1.0","canonical_sha256":"0819c887b1f779616f060e5e74515e887754ab6de66fd8f8ee8a4d178fb2b740","source":{"kind":"arxiv","id":"1812.00058","version":1},"attestation_state":"computed","paper":{"title":"Corresponding Projections for Orphan Screening","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Paurat, Katrin Ullrich, Michael Kamp, Sven Giesselbach, Thomas G\\\"artner","submitted_at":"2018-11-30T21:07:33Z","abstract_excerpt":"We propose a novel transfer learning approach for orphan screening called corresponding projections. In orphan screening the learning task is to predict the binding affinities of compounds to an orphan protein, i.e., one for which no training data is available. The identification of compounds with high affinity is a central concern in medicine since it can be used for drug discovery and design. Given a set of prediction models for proteins with labelled training data and a similarity between the proteins, corresponding projections constructs a model for the orphan protein from them such that t"},"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":"1812.00058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-30T21:07:33Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"72b23c079c89d94bc4e73f9ca79122c1dc87fb644fba79cd2072293c779a9b5b","abstract_canon_sha256":"fbed35a49d30854daf83dd404dbea294f1656bc45a1da76b052a3d40a4369cda"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:27.423892Z","signature_b64":"xiFPZmqwqBHVblY5uEybQSxCuRk9SQnF2hEuQzpG5z1YCc5qVBONVWktu6CjNr1sD5I+/mVnGcxgm/s3qxTDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0819c887b1f779616f060e5e74515e887754ab6de66fd8f8ee8a4d178fb2b740","last_reissued_at":"2026-05-17T23:59:27.423448Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:27.423448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Corresponding Projections for Orphan Screening","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Paurat, Katrin Ullrich, Michael Kamp, Sven Giesselbach, Thomas G\\\"artner","submitted_at":"2018-11-30T21:07:33Z","abstract_excerpt":"We propose a novel transfer learning approach for orphan screening called corresponding projections. In orphan screening the learning task is to predict the binding affinities of compounds to an orphan protein, i.e., one for which no training data is available. The identification of compounds with high affinity is a central concern in medicine since it can be used for drug discovery and design. Given a set of prediction models for proteins with labelled training data and a similarity between the proteins, corresponding projections constructs a model for the orphan protein from them such that t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00058","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":""},"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":"1812.00058","created_at":"2026-05-17T23:59:27.423515+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.00058v1","created_at":"2026-05-17T23:59:27.423515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00058","created_at":"2026-05-17T23:59:27.423515+00:00"},{"alias_kind":"pith_short_12","alias_value":"BAM4RB5R654W","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"BAM4RB5R654WC3YG","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"BAM4RB5R","created_at":"2026-05-18T12:32:13.499390+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/BAM4RB5R654WC3YGBZPHIUK6RB","json":"https://pith.science/pith/BAM4RB5R654WC3YGBZPHIUK6RB.json","graph_json":"https://pith.science/api/pith-number/BAM4RB5R654WC3YGBZPHIUK6RB/graph.json","events_json":"https://pith.science/api/pith-number/BAM4RB5R654WC3YGBZPHIUK6RB/events.json","paper":"https://pith.science/paper/BAM4RB5R"},"agent_actions":{"view_html":"https://pith.science/pith/BAM4RB5R654WC3YGBZPHIUK6RB","download_json":"https://pith.science/pith/BAM4RB5R654WC3YGBZPHIUK6RB.json","view_paper":"https://pith.science/paper/BAM4RB5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.00058&json=true","fetch_graph":"https://pith.science/api/pith-number/BAM4RB5R654WC3YGBZPHIUK6RB/graph.json","fetch_events":"https://pith.science/api/pith-number/BAM4RB5R654WC3YGBZPHIUK6RB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BAM4RB5R654WC3YGBZPHIUK6RB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BAM4RB5R654WC3YGBZPHIUK6RB/action/storage_attestation","attest_author":"https://pith.science/pith/BAM4RB5R654WC3YGBZPHIUK6RB/action/author_attestation","sign_citation":"https://pith.science/pith/BAM4RB5R654WC3YGBZPHIUK6RB/action/citation_signature","submit_replication":"https://pith.science/pith/BAM4RB5R654WC3YGBZPHIUK6RB/action/replication_record"}},"created_at":"2026-05-17T23:59:27.423515+00:00","updated_at":"2026-05-17T23:59:27.423515+00:00"}