{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:PPACRSVKRPB52ZOTFFLMT34Z5Y","short_pith_number":"pith:PPACRSVK","schema_version":"1.0","canonical_sha256":"7bc028caaa8bc3dd65d32956c9ef99ee0cf9482711820d9dde78076f4ec86f00","source":{"kind":"arxiv","id":"2203.15936","version":4},"attestation_state":"computed","paper":{"title":"Supervised Graph Contrastive Learning for Few-shot Node Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Huan Liu, Kaize Ding, Ruocheng Guo, Zhen Tan","submitted_at":"2022-03-29T22:30:00Z","abstract_excerpt":"Graphs are present in many real-world applications, such as financial fraud detection, commercial recommendation, and social network analysis. But given the high cost of graph annotation or labeling, we face a severe graph label-scarcity problem, i.e., a graph might have a few labeled nodes. One example of such a problem is the so-called \\textit{few-shot node classification}. A predominant approach to this problem resorts to \\textit{episodic meta-learning}. In this work, we challenge the status quo by asking a fundamental question whether meta-learning is a must for few-shot node classificatio"},"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":"2203.15936","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-29T22:30:00Z","cross_cats_sorted":[],"title_canon_sha256":"bb79c6b6c5827f2023f26195b455e673bbf0b42529cc0b651886adfdb1320d96","abstract_canon_sha256":"e4be5edc6b297c3cf49db5a919ea18238427456954ebb9aef33420e925f75600"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:46:14.259304Z","signature_b64":"GXSUQ0zKzjA/7nI0yEPoqVzVaaWReso80bsdZUz+4JIcq3kf/JZxGvu2Gh7KmQZXw/pwB8XhTENkrFKoXW7LDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bc028caaa8bc3dd65d32956c9ef99ee0cf9482711820d9dde78076f4ec86f00","last_reissued_at":"2026-07-05T04:46:14.258899Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:46:14.258899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Supervised Graph Contrastive Learning for Few-shot Node Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Huan Liu, Kaize Ding, Ruocheng Guo, Zhen Tan","submitted_at":"2022-03-29T22:30:00Z","abstract_excerpt":"Graphs are present in many real-world applications, such as financial fraud detection, commercial recommendation, and social network analysis. But given the high cost of graph annotation or labeling, we face a severe graph label-scarcity problem, i.e., a graph might have a few labeled nodes. One example of such a problem is the so-called \\textit{few-shot node classification}. A predominant approach to this problem resorts to \\textit{episodic meta-learning}. In this work, we challenge the status quo by asking a fundamental question whether meta-learning is a must for few-shot node classificatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.15936","kind":"arxiv","version":4},"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/2203.15936/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":"2203.15936","created_at":"2026-07-05T04:46:14.258951+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.15936v4","created_at":"2026-07-05T04:46:14.258951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.15936","created_at":"2026-07-05T04:46:14.258951+00:00"},{"alias_kind":"pith_short_12","alias_value":"PPACRSVKRPB5","created_at":"2026-07-05T04:46:14.258951+00:00"},{"alias_kind":"pith_short_16","alias_value":"PPACRSVKRPB52ZOT","created_at":"2026-07-05T04:46:14.258951+00:00"},{"alias_kind":"pith_short_8","alias_value":"PPACRSVK","created_at":"2026-07-05T04:46:14.258951+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/PPACRSVKRPB52ZOTFFLMT34Z5Y","json":"https://pith.science/pith/PPACRSVKRPB52ZOTFFLMT34Z5Y.json","graph_json":"https://pith.science/api/pith-number/PPACRSVKRPB52ZOTFFLMT34Z5Y/graph.json","events_json":"https://pith.science/api/pith-number/PPACRSVKRPB52ZOTFFLMT34Z5Y/events.json","paper":"https://pith.science/paper/PPACRSVK"},"agent_actions":{"view_html":"https://pith.science/pith/PPACRSVKRPB52ZOTFFLMT34Z5Y","download_json":"https://pith.science/pith/PPACRSVKRPB52ZOTFFLMT34Z5Y.json","view_paper":"https://pith.science/paper/PPACRSVK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.15936&json=true","fetch_graph":"https://pith.science/api/pith-number/PPACRSVKRPB52ZOTFFLMT34Z5Y/graph.json","fetch_events":"https://pith.science/api/pith-number/PPACRSVKRPB52ZOTFFLMT34Z5Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PPACRSVKRPB52ZOTFFLMT34Z5Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PPACRSVKRPB52ZOTFFLMT34Z5Y/action/storage_attestation","attest_author":"https://pith.science/pith/PPACRSVKRPB52ZOTFFLMT34Z5Y/action/author_attestation","sign_citation":"https://pith.science/pith/PPACRSVKRPB52ZOTFFLMT34Z5Y/action/citation_signature","submit_replication":"https://pith.science/pith/PPACRSVKRPB52ZOTFFLMT34Z5Y/action/replication_record"}},"created_at":"2026-07-05T04:46:14.258951+00:00","updated_at":"2026-07-05T04:46:14.258951+00:00"}