{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BIV24QBFHZOQ7FV6K2GEQD34S2","short_pith_number":"pith:BIV24QBF","schema_version":"1.0","canonical_sha256":"0a2bae40253e5d0f96be568c480f7c969533fc0a7f9023670e4c531c58858257","source":{"kind":"arxiv","id":"2502.12453","version":1},"attestation_state":"computed","paper":{"title":"UniMatch: Universal Matching from Atom to Task for Few-Shot Drug Discovery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","q-bio.BM"],"primary_cat":"cs.LG","authors_text":"Hongyang Chen, Mingqian Li, Qiang Zhang, Ruifeng Li, Wei Liu, Xiangxin Zhou, Yuan Yao, Yuhua Zhou","submitted_at":"2025-02-18T02:36:03Z","abstract_excerpt":"Drug discovery is crucial for identifying candidate drugs for various diseases.However, its low success rate often results in a scarcity of annotations, posing a few-shot learning problem. Existing methods primarily focus on single-scale features, overlooking the hierarchical molecular structures that determine different molecular properties. To address these issues, we introduce Universal Matching Networks (UniMatch), a dual matching framework that integrates explicit hierarchical molecular matching with implicit task-level matching via meta-learning, bridging multi-level molecular representa"},"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":"2502.12453","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-18T02:36:03Z","cross_cats_sorted":["cs.AI","q-bio.BM"],"title_canon_sha256":"c2259f63b6bfaecf0d5ea6e8a864cc36147197d6c5e33d42309e66407d8ea501","abstract_canon_sha256":"ea52701ac02d7b637c82a9ce0e70ea7bdf62adc68ded969d0812be32c39cb13c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:56.001586Z","signature_b64":"d/iUqkoSYxG6NYQGkF5rZSHtF121Ranu8yli/ytw6NQxN1iEP78juE/1kFXK9mFfqLtaGWkw35MVERRdGGqCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a2bae40253e5d0f96be568c480f7c969533fc0a7f9023670e4c531c58858257","last_reissued_at":"2026-07-05T10:15:56.001131Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:56.001131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"UniMatch: Universal Matching from Atom to Task for Few-Shot Drug Discovery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","q-bio.BM"],"primary_cat":"cs.LG","authors_text":"Hongyang Chen, Mingqian Li, Qiang Zhang, Ruifeng Li, Wei Liu, Xiangxin Zhou, Yuan Yao, Yuhua Zhou","submitted_at":"2025-02-18T02:36:03Z","abstract_excerpt":"Drug discovery is crucial for identifying candidate drugs for various diseases.However, its low success rate often results in a scarcity of annotations, posing a few-shot learning problem. Existing methods primarily focus on single-scale features, overlooking the hierarchical molecular structures that determine different molecular properties. To address these issues, we introduce Universal Matching Networks (UniMatch), a dual matching framework that integrates explicit hierarchical molecular matching with implicit task-level matching via meta-learning, bridging multi-level molecular representa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.12453","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/2502.12453/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":"2502.12453","created_at":"2026-07-05T10:15:56.001193+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.12453v1","created_at":"2026-07-05T10:15:56.001193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.12453","created_at":"2026-07-05T10:15:56.001193+00:00"},{"alias_kind":"pith_short_12","alias_value":"BIV24QBFHZOQ","created_at":"2026-07-05T10:15:56.001193+00:00"},{"alias_kind":"pith_short_16","alias_value":"BIV24QBFHZOQ7FV6","created_at":"2026-07-05T10:15:56.001193+00:00"},{"alias_kind":"pith_short_8","alias_value":"BIV24QBF","created_at":"2026-07-05T10:15:56.001193+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15824","citing_title":"FashionChameleon: Towards Real-Time and Interactive Human-Garment Video Customization","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15824","citing_title":"FashionChameleon: Towards Real-Time and Interactive Human-Garment Video Customization","ref_index":53,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BIV24QBFHZOQ7FV6K2GEQD34S2","json":"https://pith.science/pith/BIV24QBFHZOQ7FV6K2GEQD34S2.json","graph_json":"https://pith.science/api/pith-number/BIV24QBFHZOQ7FV6K2GEQD34S2/graph.json","events_json":"https://pith.science/api/pith-number/BIV24QBFHZOQ7FV6K2GEQD34S2/events.json","paper":"https://pith.science/paper/BIV24QBF"},"agent_actions":{"view_html":"https://pith.science/pith/BIV24QBFHZOQ7FV6K2GEQD34S2","download_json":"https://pith.science/pith/BIV24QBFHZOQ7FV6K2GEQD34S2.json","view_paper":"https://pith.science/paper/BIV24QBF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.12453&json=true","fetch_graph":"https://pith.science/api/pith-number/BIV24QBFHZOQ7FV6K2GEQD34S2/graph.json","fetch_events":"https://pith.science/api/pith-number/BIV24QBFHZOQ7FV6K2GEQD34S2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BIV24QBFHZOQ7FV6K2GEQD34S2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BIV24QBFHZOQ7FV6K2GEQD34S2/action/storage_attestation","attest_author":"https://pith.science/pith/BIV24QBFHZOQ7FV6K2GEQD34S2/action/author_attestation","sign_citation":"https://pith.science/pith/BIV24QBFHZOQ7FV6K2GEQD34S2/action/citation_signature","submit_replication":"https://pith.science/pith/BIV24QBFHZOQ7FV6K2GEQD34S2/action/replication_record"}},"created_at":"2026-07-05T10:15:56.001193+00:00","updated_at":"2026-07-05T10:15:56.001193+00:00"}