{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CCORYCSDW6V4SPKEPJJNXVO4RS","short_pith_number":"pith:CCORYCSD","schema_version":"1.0","canonical_sha256":"109d1c0a43b7abc93d447a52dbd5dc8c98e9051d0f09124091b1650fc2aced15","source":{"kind":"arxiv","id":"1910.03053","version":3},"attestation_state":"computed","paper":{"title":"Graph Few-shot Learning via Knowledge Transfer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chuxu Zhang, Huaxiu Yao, Junzhou Huang, Meng Jiang, Nitesh V. Chawla, Suhang Wang, Ying Wei, Zhenhui Li","submitted_at":"2019-10-07T19:52:11Z","abstract_excerpt":"Towards the challenging problem of semi-supervised node classification, there have been extensive studies. As a frontier, Graph Neural Networks (GNNs) have aroused great interest recently, which update the representation of each node by aggregating information of its neighbors. However, most GNNs have shallow layers with a limited receptive field and may not achieve satisfactory performance especially when the number of labeled nodes is quite small. To address this challenge, we innovatively propose a graph few-shot learning (GFL) algorithm that incorporates prior knowledge learned from auxili"},"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":"1910.03053","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-07T19:52:11Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6ef1411b4619749b597767dd5a6a22fdb7399d232ed26985ce675f7734e70c88","abstract_canon_sha256":"6e30a1a6285e5cb94f34808807f823aee96c96e794df2658c83b703ecdb1ea38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:01:56.579821Z","signature_b64":"jyG7LqXU94LRvam8oTxQ+P0vwyI9SupEQhIciXx69fmoehGITuJR0R/gUw+ikgqNdQGqAzJZ4H6sxsh2u6fPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"109d1c0a43b7abc93d447a52dbd5dc8c98e9051d0f09124091b1650fc2aced15","last_reissued_at":"2026-07-05T01:01:56.579333Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:01:56.579333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Few-shot Learning via Knowledge Transfer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chuxu Zhang, Huaxiu Yao, Junzhou Huang, Meng Jiang, Nitesh V. Chawla, Suhang Wang, Ying Wei, Zhenhui Li","submitted_at":"2019-10-07T19:52:11Z","abstract_excerpt":"Towards the challenging problem of semi-supervised node classification, there have been extensive studies. As a frontier, Graph Neural Networks (GNNs) have aroused great interest recently, which update the representation of each node by aggregating information of its neighbors. However, most GNNs have shallow layers with a limited receptive field and may not achieve satisfactory performance especially when the number of labeled nodes is quite small. To address this challenge, we innovatively propose a graph few-shot learning (GFL) algorithm that incorporates prior knowledge learned from auxili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.03053","kind":"arxiv","version":3},"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/1910.03053/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":"1910.03053","created_at":"2026-07-05T01:01:56.579436+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.03053v3","created_at":"2026-07-05T01:01:56.579436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.03053","created_at":"2026-07-05T01:01:56.579436+00:00"},{"alias_kind":"pith_short_12","alias_value":"CCORYCSDW6V4","created_at":"2026-07-05T01:01:56.579436+00:00"},{"alias_kind":"pith_short_16","alias_value":"CCORYCSDW6V4SPKE","created_at":"2026-07-05T01:01:56.579436+00:00"},{"alias_kind":"pith_short_8","alias_value":"CCORYCSD","created_at":"2026-07-05T01:01:56.579436+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.07558","citing_title":"Transferring Robustness for Graph Neural Network Against Poisoning Attacks","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CCORYCSDW6V4SPKEPJJNXVO4RS","json":"https://pith.science/pith/CCORYCSDW6V4SPKEPJJNXVO4RS.json","graph_json":"https://pith.science/api/pith-number/CCORYCSDW6V4SPKEPJJNXVO4RS/graph.json","events_json":"https://pith.science/api/pith-number/CCORYCSDW6V4SPKEPJJNXVO4RS/events.json","paper":"https://pith.science/paper/CCORYCSD"},"agent_actions":{"view_html":"https://pith.science/pith/CCORYCSDW6V4SPKEPJJNXVO4RS","download_json":"https://pith.science/pith/CCORYCSDW6V4SPKEPJJNXVO4RS.json","view_paper":"https://pith.science/paper/CCORYCSD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.03053&json=true","fetch_graph":"https://pith.science/api/pith-number/CCORYCSDW6V4SPKEPJJNXVO4RS/graph.json","fetch_events":"https://pith.science/api/pith-number/CCORYCSDW6V4SPKEPJJNXVO4RS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CCORYCSDW6V4SPKEPJJNXVO4RS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CCORYCSDW6V4SPKEPJJNXVO4RS/action/storage_attestation","attest_author":"https://pith.science/pith/CCORYCSDW6V4SPKEPJJNXVO4RS/action/author_attestation","sign_citation":"https://pith.science/pith/CCORYCSDW6V4SPKEPJJNXVO4RS/action/citation_signature","submit_replication":"https://pith.science/pith/CCORYCSDW6V4SPKEPJJNXVO4RS/action/replication_record"}},"created_at":"2026-07-05T01:01:56.579436+00:00","updated_at":"2026-07-05T01:01:56.579436+00:00"}