{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:UOYPRO74KSP4F766JSD6TLKS47","short_pith_number":"pith:UOYPRO74","schema_version":"1.0","canonical_sha256":"a3b0f8bbfc549fc2ffde4c87e9ad52e7cf2e18c3259b8d0c37e6f445db7ee1c6","source":{"kind":"arxiv","id":"2007.02901","version":2},"attestation_state":"computed","paper":{"title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"C\\u{a}t\\u{a}lina Cangea, P\\'eter Mernyei","submitted_at":"2020-07-06T17:25:47Z","abstract_excerpt":"We present Wiki-CS, a novel dataset derived from Wikipedia for benchmarking Graph Neural Networks. The dataset consists of nodes corresponding to Computer Science articles, with edges based on hyperlinks and 10 classes representing different branches of the field. We use the dataset to evaluate semi-supervised node classification and single-relation link prediction models. Our experiments show that these methods perform well on a new domain, with structural properties different from earlier benchmarks. The dataset is publicly available, along with the implementation of the data pipeline and th"},"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":"2007.02901","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-06T17:25:47Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"5133c3ecf8356bddcc22f5af4c16221c411c76d916467d142e90c57793d0a4cf","abstract_canon_sha256":"034b4ddffec42cf5a7f7a72661c8659289fc3a57d53e16a6c4f87c69382af44a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:46:55.774899Z","signature_b64":"WRQP/9ej1rBfZ2RSAatigx6NZO1XdFWaEpbKotaFmfEKwM2Isd944ywUogrSYJjxR0Ydain5f7bv6I9QgqNSBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3b0f8bbfc549fc2ffde4c87e9ad52e7cf2e18c3259b8d0c37e6f445db7ee1c6","last_reissued_at":"2026-07-05T03:46:55.774454Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:46:55.774454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"C\\u{a}t\\u{a}lina Cangea, P\\'eter Mernyei","submitted_at":"2020-07-06T17:25:47Z","abstract_excerpt":"We present Wiki-CS, a novel dataset derived from Wikipedia for benchmarking Graph Neural Networks. The dataset consists of nodes corresponding to Computer Science articles, with edges based on hyperlinks and 10 classes representing different branches of the field. We use the dataset to evaluate semi-supervised node classification and single-relation link prediction models. Our experiments show that these methods perform well on a new domain, with structural properties different from earlier benchmarks. The dataset is publicly available, along with the implementation of the data pipeline and th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.02901","kind":"arxiv","version":2},"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/2007.02901/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":"2007.02901","created_at":"2026-07-05T03:46:55.774514+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.02901v2","created_at":"2026-07-05T03:46:55.774514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.02901","created_at":"2026-07-05T03:46:55.774514+00:00"},{"alias_kind":"pith_short_12","alias_value":"UOYPRO74KSP4","created_at":"2026-07-05T03:46:55.774514+00:00"},{"alias_kind":"pith_short_16","alias_value":"UOYPRO74KSP4F766","created_at":"2026-07-05T03:46:55.774514+00:00"},{"alias_kind":"pith_short_8","alias_value":"UOYPRO74","created_at":"2026-07-05T03:46:55.774514+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":30,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24956","citing_title":"Convex--Concave Quadratic Spectral Filtering for Graph Neural Networks","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2606.22975","citing_title":"TaLK: Text-attributed Graph Dataset Distillation via Coupling Language Model with Graph-Aware Kernel","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20283","citing_title":"Boundary Embedding Shaping with Adaptive Contrastive Learning for Graph Structural Disentanglement","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2606.12581","citing_title":"Graph Reduction in Multirelational Networks: A Spreading-Oriented Reduction Benchmark","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2606.11898","citing_title":"GraspLLM: Towards Zero-Shot Generalization on Text-Attributed Graphs with LLMs","ref_index":69,"is_internal_anchor":false},{"citing_arxiv_id":"2606.11583","citing_title":"Beyond the Golden Teacher: Enhancing Graph Learning through LLM-GNN Co-teaching","ref_index":67,"is_internal_anchor":false},{"citing_arxiv_id":"2606.11562","citing_title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2606.10461","citing_title":"ERAlign: Energy-based Representation Alignment of GNNs and LLMs on Text-attributed Graphs","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2607.01553","citing_title":"X-LogSMask: Expand Transformer for Graph-Structured Data","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2606.03307","citing_title":"Generalizing Graph Foundation Models via Hyperbolic Retrieval-Augmented Generation","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2606.03232","citing_title":"GFFMERGE: Efficient Merging of Graph Neural Force Fields and Beyond","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30291","citing_title":"PromptGNN-sim: Deep Fusion and Alignment of GNN and LLMs for Text-Attributed Graph Learning","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27913","citing_title":"Where LLM Annotators Fail: Label-Free Learning on Graphs with LLMs","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2602.11629","citing_title":"GP2F: Cross-Domain Graph Prompting with Adaptive Fusion of Pre-trained Graph Neural Networks","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2603.02938","citing_title":"Beyond One-Size-Fits-All: Adaptive Subgraph Denoising for Zero-Shot Graph Learning with Large Language Models","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20248","citing_title":"Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18579","citing_title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18579","citing_title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19916","citing_title":"Fast and Featureless Node Representation Learning with Partial Pairwise Supervision","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2508.07117","citing_title":"From Nodes to Narratives: Explaining Graph Neural Networks with LLMs and Graph Context","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2510.08952","citing_title":"When LLM Agents Meet Graph Optimization: An Automated Data Quality Improvement Approach","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2512.24062","citing_title":"Energy-Balanced Hyperspherical Graph Representation Learning via Structural Binding and Entropic Dispersion","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2602.17071","citing_title":"AdvSynGNN: Structure-Adaptive Graph Neural Nets via Adversarial Synthesis and Self-Corrective Propagation","ref_index":77,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03514","citing_title":"Revisiting Graph-Tokenizing Large Language Models: A Systematic Evaluation of Graph Token Understanding","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27462","citing_title":"Improving Graph Few-shot Learning with Hyperbolic Space and Denoising Diffusion","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UOYPRO74KSP4F766JSD6TLKS47","json":"https://pith.science/pith/UOYPRO74KSP4F766JSD6TLKS47.json","graph_json":"https://pith.science/api/pith-number/UOYPRO74KSP4F766JSD6TLKS47/graph.json","events_json":"https://pith.science/api/pith-number/UOYPRO74KSP4F766JSD6TLKS47/events.json","paper":"https://pith.science/paper/UOYPRO74"},"agent_actions":{"view_html":"https://pith.science/pith/UOYPRO74KSP4F766JSD6TLKS47","download_json":"https://pith.science/pith/UOYPRO74KSP4F766JSD6TLKS47.json","view_paper":"https://pith.science/paper/UOYPRO74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.02901&json=true","fetch_graph":"https://pith.science/api/pith-number/UOYPRO74KSP4F766JSD6TLKS47/graph.json","fetch_events":"https://pith.science/api/pith-number/UOYPRO74KSP4F766JSD6TLKS47/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UOYPRO74KSP4F766JSD6TLKS47/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UOYPRO74KSP4F766JSD6TLKS47/action/storage_attestation","attest_author":"https://pith.science/pith/UOYPRO74KSP4F766JSD6TLKS47/action/author_attestation","sign_citation":"https://pith.science/pith/UOYPRO74KSP4F766JSD6TLKS47/action/citation_signature","submit_replication":"https://pith.science/pith/UOYPRO74KSP4F766JSD6TLKS47/action/replication_record"}},"created_at":"2026-07-05T03:46:55.774514+00:00","updated_at":"2026-07-05T03:46:55.774514+00:00"}