{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:JJRUYMA7N4ZPHMKB6BQUHOGKO7","short_pith_number":"pith:JJRUYMA7","canonical_record":{"source":{"id":"2306.06063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-09T17:38:22Z","cross_cats_sorted":[],"title_canon_sha256":"19241a494da34afab686fb532a2a5f6a60e741538c97ed8037c526ad476f2fd4","abstract_canon_sha256":"f97b45be08e2c2048e687f31ba7cff0ab7f83cf7f558fc3809be653a0161b3b7"},"schema_version":"1.0"},"canonical_sha256":"4a634c301f6f32f3b141f06143b8ca77d04740328e47201bdf90fff55c022b25","source":{"kind":"arxiv","id":"2306.06063","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.06063","created_at":"2026-07-05T06:19:13Z"},{"alias_kind":"arxiv_version","alias_value":"2306.06063v1","created_at":"2026-07-05T06:19:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.06063","created_at":"2026-07-05T06:19:13Z"},{"alias_kind":"pith_short_12","alias_value":"JJRUYMA7N4ZP","created_at":"2026-07-05T06:19:13Z"},{"alias_kind":"pith_short_16","alias_value":"JJRUYMA7N4ZPHMKB","created_at":"2026-07-05T06:19:13Z"},{"alias_kind":"pith_short_8","alias_value":"JJRUYMA7","created_at":"2026-07-05T06:19:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:JJRUYMA7N4ZPHMKB6BQUHOGKO7","target":"record","payload":{"canonical_record":{"source":{"id":"2306.06063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-09T17:38:22Z","cross_cats_sorted":[],"title_canon_sha256":"19241a494da34afab686fb532a2a5f6a60e741538c97ed8037c526ad476f2fd4","abstract_canon_sha256":"f97b45be08e2c2048e687f31ba7cff0ab7f83cf7f558fc3809be653a0161b3b7"},"schema_version":"1.0"},"canonical_sha256":"4a634c301f6f32f3b141f06143b8ca77d04740328e47201bdf90fff55c022b25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:19:13.272797Z","signature_b64":"l4s9bNNk4yX8Z1e/582ymcYVsND8UOoR9WwA7yk1wi/s1SrwrYFSEz9MweyCCpQ9q8CvsHFcM8ETERceTyT7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a634c301f6f32f3b141f06143b8ca77d04740328e47201bdf90fff55c022b25","last_reissued_at":"2026-07-05T06:19:13.272373Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:19:13.272373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.06063","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:19:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lxf5sx5Del5IPxznCsOzopgIkMFD+XZzzlsQBQQ9OkHV2mKOnjH6phCYmaRoPFUDWe4/2wNu50HIRojMMmNXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:07:28.236483Z"},"content_sha256":"3b86aa44834fc45657ce9171dfa8a193079e905306d054157ed71d1edaf7e970","schema_version":"1.0","event_id":"sha256:3b86aa44834fc45657ce9171dfa8a193079e905306d054157ed71d1edaf7e970"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:JJRUYMA7N4ZPHMKB6BQUHOGKO7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Virtual Node Tuning 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":"2023-06-09T17:38:22Z","abstract_excerpt":"Few-shot Node Classification (FSNC) is a challenge in graph representation learning where only a few labeled nodes per class are available for training. To tackle this issue, meta-learning has been proposed to transfer structural knowledge from base classes with abundant labels to target novel classes. However, existing solutions become ineffective or inapplicable when base classes have no or limited labeled nodes. To address this challenge, we propose an innovative method dubbed Virtual Node Tuning (VNT). Our approach utilizes a pretrained graph transformer as the encoder and injects virtual "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.06063","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.06063/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:19:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1zVocC6/w7K3+nZdAlSuiMGoqxnR+RjcQ3csM+GWSTk/2acxtN++BUzEaaXB3JjNeYB4FV0vS8QzHd6AtKAvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:07:28.236961Z"},"content_sha256":"0e7102911f914c0c62a3a1254c8e4bee1fd65739db1625a9201f01275aa21ee0","schema_version":"1.0","event_id":"sha256:0e7102911f914c0c62a3a1254c8e4bee1fd65739db1625a9201f01275aa21ee0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJRUYMA7N4ZPHMKB6BQUHOGKO7/bundle.json","state_url":"https://pith.science/pith/JJRUYMA7N4ZPHMKB6BQUHOGKO7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJRUYMA7N4ZPHMKB6BQUHOGKO7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-06T03:07:28Z","links":{"resolver":"https://pith.science/pith/JJRUYMA7N4ZPHMKB6BQUHOGKO7","bundle":"https://pith.science/pith/JJRUYMA7N4ZPHMKB6BQUHOGKO7/bundle.json","state":"https://pith.science/pith/JJRUYMA7N4ZPHMKB6BQUHOGKO7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJRUYMA7N4ZPHMKB6BQUHOGKO7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:JJRUYMA7N4ZPHMKB6BQUHOGKO7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f97b45be08e2c2048e687f31ba7cff0ab7f83cf7f558fc3809be653a0161b3b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-09T17:38:22Z","title_canon_sha256":"19241a494da34afab686fb532a2a5f6a60e741538c97ed8037c526ad476f2fd4"},"schema_version":"1.0","source":{"id":"2306.06063","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.06063","created_at":"2026-07-05T06:19:13Z"},{"alias_kind":"arxiv_version","alias_value":"2306.06063v1","created_at":"2026-07-05T06:19:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.06063","created_at":"2026-07-05T06:19:13Z"},{"alias_kind":"pith_short_12","alias_value":"JJRUYMA7N4ZP","created_at":"2026-07-05T06:19:13Z"},{"alias_kind":"pith_short_16","alias_value":"JJRUYMA7N4ZPHMKB","created_at":"2026-07-05T06:19:13Z"},{"alias_kind":"pith_short_8","alias_value":"JJRUYMA7","created_at":"2026-07-05T06:19:13Z"}],"graph_snapshots":[{"event_id":"sha256:0e7102911f914c0c62a3a1254c8e4bee1fd65739db1625a9201f01275aa21ee0","target":"graph","created_at":"2026-07-05T06:19:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2306.06063/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Few-shot Node Classification (FSNC) is a challenge in graph representation learning where only a few labeled nodes per class are available for training. To tackle this issue, meta-learning has been proposed to transfer structural knowledge from base classes with abundant labels to target novel classes. However, existing solutions become ineffective or inapplicable when base classes have no or limited labeled nodes. To address this challenge, we propose an innovative method dubbed Virtual Node Tuning (VNT). Our approach utilizes a pretrained graph transformer as the encoder and injects virtual ","authors_text":"Huan Liu, Kaize Ding, Ruocheng Guo, Zhen Tan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-09T17:38:22Z","title":"Virtual Node Tuning for Few-shot Node Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.06063","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3b86aa44834fc45657ce9171dfa8a193079e905306d054157ed71d1edaf7e970","target":"record","created_at":"2026-07-05T06:19:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f97b45be08e2c2048e687f31ba7cff0ab7f83cf7f558fc3809be653a0161b3b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-09T17:38:22Z","title_canon_sha256":"19241a494da34afab686fb532a2a5f6a60e741538c97ed8037c526ad476f2fd4"},"schema_version":"1.0","source":{"id":"2306.06063","kind":"arxiv","version":1}},"canonical_sha256":"4a634c301f6f32f3b141f06143b8ca77d04740328e47201bdf90fff55c022b25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a634c301f6f32f3b141f06143b8ca77d04740328e47201bdf90fff55c022b25","first_computed_at":"2026-07-05T06:19:13.272373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:19:13.272373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l4s9bNNk4yX8Z1e/582ymcYVsND8UOoR9WwA7yk1wi/s1SrwrYFSEz9MweyCCpQ9q8CvsHFcM8ETERceTyT7Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T06:19:13.272797Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.06063","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b86aa44834fc45657ce9171dfa8a193079e905306d054157ed71d1edaf7e970","sha256:0e7102911f914c0c62a3a1254c8e4bee1fd65739db1625a9201f01275aa21ee0"],"state_sha256":"23d8153e7d978932246aa40bdca5ae582342eaa64c58946433f37e31f70b32e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mXCR5tTvzN7rFOgzTOUCSk25uISRezmTazwgFaRdDolVdgOSzEcmcy2qDlzwBV4mXht/Te1XbRgBiDdVmJpMAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T03:07:28.240383Z","bundle_sha256":"b9659fdcf858d3413b341252207d7a9b35ba1376a584b594d61e9f370e439633"}}