{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LNKQRBVYUJGLSXDJNLLRMG4LI2","short_pith_number":"pith:LNKQRBVY","schema_version":"1.0","canonical_sha256":"5b550886b8a24cb95c696ad7161b8b4686ff701c32a4e07421713d32cf3c9125","source":{"kind":"arxiv","id":"2402.10380","version":1},"attestation_state":"computed","paper":{"title":"Subgraph-level Universal Prompt Tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Jaewoo Kang, Junhyun Lee, Wooseong Yang","submitted_at":"2024-02-16T00:25:24Z","abstract_excerpt":"In the evolving landscape of machine learning, the adaptation of pre-trained models through prompt tuning has become increasingly prominent. This trend is particularly observable in the graph domain, where diverse pre-training strategies present unique challenges in developing effective prompt-based tuning methods for graph neural networks. Previous approaches have been limited, focusing on specialized prompting functions tailored to models with edge prediction pre-training tasks. These methods, however, suffer from a lack of generalizability across different pre-training strategies. Recently,"},"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":"2402.10380","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-16T00:25:24Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"02239f86ae7ee85ca5c386076212f2ee6f2587a73e6d5e4aa8652afcd6797cb6","abstract_canon_sha256":"1e8b10192ffc634645c802a4854022ef5eed5891318661be4a1b5720d8c42a42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:14.802258Z","signature_b64":"pqfrCUv+1ILJ+1+4MANbHNJ16GOm59FG3HuEhbJ60ps0K5cgzhhWG91b487CvrSblR+6avf/hWhZWMadX7xIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b550886b8a24cb95c696ad7161b8b4686ff701c32a4e07421713d32cf3c9125","last_reissued_at":"2026-05-20T00:00:14.801386Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:14.801386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subgraph-level Universal Prompt Tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Jaewoo Kang, Junhyun Lee, Wooseong Yang","submitted_at":"2024-02-16T00:25:24Z","abstract_excerpt":"In the evolving landscape of machine learning, the adaptation of pre-trained models through prompt tuning has become increasingly prominent. This trend is particularly observable in the graph domain, where diverse pre-training strategies present unique challenges in developing effective prompt-based tuning methods for graph neural networks. Previous approaches have been limited, focusing on specialized prompting functions tailored to models with edge prediction pre-training tasks. These methods, however, suffer from a lack of generalizability across different pre-training strategies. Recently,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.10380","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/2402.10380/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":"2402.10380","created_at":"2026-05-20T00:00:14.801509+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.10380v1","created_at":"2026-05-20T00:00:14.801509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.10380","created_at":"2026-05-20T00:00:14.801509+00:00"},{"alias_kind":"pith_short_12","alias_value":"LNKQRBVYUJGL","created_at":"2026-05-20T00:00:14.801509+00:00"},{"alias_kind":"pith_short_16","alias_value":"LNKQRBVYUJGLSXDJ","created_at":"2026-05-20T00:00:14.801509+00:00"},{"alias_kind":"pith_short_8","alias_value":"LNKQRBVY","created_at":"2026-05-20T00:00:14.801509+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/LNKQRBVYUJGLSXDJNLLRMG4LI2","json":"https://pith.science/pith/LNKQRBVYUJGLSXDJNLLRMG4LI2.json","graph_json":"https://pith.science/api/pith-number/LNKQRBVYUJGLSXDJNLLRMG4LI2/graph.json","events_json":"https://pith.science/api/pith-number/LNKQRBVYUJGLSXDJNLLRMG4LI2/events.json","paper":"https://pith.science/paper/LNKQRBVY"},"agent_actions":{"view_html":"https://pith.science/pith/LNKQRBVYUJGLSXDJNLLRMG4LI2","download_json":"https://pith.science/pith/LNKQRBVYUJGLSXDJNLLRMG4LI2.json","view_paper":"https://pith.science/paper/LNKQRBVY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.10380&json=true","fetch_graph":"https://pith.science/api/pith-number/LNKQRBVYUJGLSXDJNLLRMG4LI2/graph.json","fetch_events":"https://pith.science/api/pith-number/LNKQRBVYUJGLSXDJNLLRMG4LI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LNKQRBVYUJGLSXDJNLLRMG4LI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LNKQRBVYUJGLSXDJNLLRMG4LI2/action/storage_attestation","attest_author":"https://pith.science/pith/LNKQRBVYUJGLSXDJNLLRMG4LI2/action/author_attestation","sign_citation":"https://pith.science/pith/LNKQRBVYUJGLSXDJNLLRMG4LI2/action/citation_signature","submit_replication":"https://pith.science/pith/LNKQRBVYUJGLSXDJNLLRMG4LI2/action/replication_record"}},"created_at":"2026-05-20T00:00:14.801509+00:00","updated_at":"2026-05-20T00:00:14.801509+00:00"}