{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:75LU6VMLRFEFBWOKMD6JD2UMYC","short_pith_number":"pith:75LU6VML","schema_version":"1.0","canonical_sha256":"ff574f558b894850d9ca60fc91ea8cc0b24b12650622241448fd28fc387dd112","source":{"kind":"arxiv","id":"2003.00982","version":5},"attestation_state":"computed","paper":{"title":"Benchmarking Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anh Tuan Luu, Chaitanya K. Joshi, Thomas Laurent, Vijay Prakash Dwivedi, Xavier Bresson, Yoshua Bengio","submitted_at":"2020-03-02T15:58:46Z","abstract_excerpt":"In the last few years, graph neural networks (GNNs) have become the standard toolkit for analyzing and learning from data on graphs. This emerging field has witnessed an extensive growth of promising techniques that have been applied with success to computer science, mathematics, biology, physics and chemistry. But for any successful field to become mainstream and reliable, benchmarks must be developed to quantify progress. This led us in March 2020 to release a benchmark framework that i) comprises of a diverse collection of mathematical and real-world graphs, ii) enables fair model compariso"},"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":"2003.00982","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-02T15:58:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b48467fb72bb17902617c544e5a5c5bbbd037cde82a56e6b95d2823d12017e9c","abstract_canon_sha256":"27fc1a17e077067bbff9298f4c0b85ca781de8c753f1411a1aaa976d87eb9469"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:28:40.399217Z","signature_b64":"NyhNzBz1Z+Xr7+kpAhXZGGsAllUy8D9WLtpaqHbpjwIsBy8L2fb/kSDtCp6cGVEPGPL/ILJPbVREOvv+xML9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff574f558b894850d9ca60fc91ea8cc0b24b12650622241448fd28fc387dd112","last_reissued_at":"2026-07-05T05:28:40.398751Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:28:40.398751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Benchmarking Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anh Tuan Luu, Chaitanya K. Joshi, Thomas Laurent, Vijay Prakash Dwivedi, Xavier Bresson, Yoshua Bengio","submitted_at":"2020-03-02T15:58:46Z","abstract_excerpt":"In the last few years, graph neural networks (GNNs) have become the standard toolkit for analyzing and learning from data on graphs. This emerging field has witnessed an extensive growth of promising techniques that have been applied with success to computer science, mathematics, biology, physics and chemistry. But for any successful field to become mainstream and reliable, benchmarks must be developed to quantify progress. This led us in March 2020 to release a benchmark framework that i) comprises of a diverse collection of mathematical and real-world graphs, ii) enables fair model compariso"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.00982","kind":"arxiv","version":5},"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/2003.00982/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":"2003.00982","created_at":"2026-07-05T05:28:40.398802+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.00982v5","created_at":"2026-07-05T05:28:40.398802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.00982","created_at":"2026-07-05T05:28:40.398802+00:00"},{"alias_kind":"pith_short_12","alias_value":"75LU6VMLRFEF","created_at":"2026-07-05T05:28:40.398802+00:00"},{"alias_kind":"pith_short_16","alias_value":"75LU6VMLRFEFBWOK","created_at":"2026-07-05T05:28:40.398802+00:00"},{"alias_kind":"pith_short_8","alias_value":"75LU6VML","created_at":"2026-07-05T05:28:40.398802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":12,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22429","citing_title":"Enhancing LLMs for Graph Tasks via Graph-aware LoRA Generation","ref_index":115,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30470","citing_title":"Can Subgraph Explanations Be Weaponized to Steal Graph Neural Networks?","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23708","citing_title":"Learning Dynamic Stability Landscapes in Synchronization Networks","ref_index":176,"is_internal_anchor":false},{"citing_arxiv_id":"2412.08835","citing_title":"Grothendieck Graph Neural Networks Framework: An Algebraic Platform for Crafting Topology-Aware GNNs","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2506.08618","citing_title":"HSG-12M: A Large-Scale Benchmark of Spatial Multigraphs from the Energy Spectra of Non-Hermitian Crystals","ref_index":135,"is_internal_anchor":false},{"citing_arxiv_id":"2506.08618","citing_title":"HSG-12M: A Large-Scale Benchmark of Spatial Multigraphs from the Energy Spectra of Non-Hermitian Crystals","ref_index":135,"is_internal_anchor":false},{"citing_arxiv_id":"2105.14491","citing_title":"How Attentive are Graph Attention Networks?","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09226","citing_title":"Quantum Injection Pathways for Implicit Graph Neural Networks","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05689","citing_title":"GCCM: Enhancing Generative Graph Prediction via Contrastive Consistency Model","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08810","citing_title":"R2G: A Multi-View Circuit Graph Benchmark Suite from RTL to GDSII","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07492","citing_title":"Cluster Attention for Graph Machine Learning","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15273","citing_title":"How Embeddings Shape Graph Neural Networks: Classical vs Quantum-Oriented Node Representations","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/75LU6VMLRFEFBWOKMD6JD2UMYC","json":"https://pith.science/pith/75LU6VMLRFEFBWOKMD6JD2UMYC.json","graph_json":"https://pith.science/api/pith-number/75LU6VMLRFEFBWOKMD6JD2UMYC/graph.json","events_json":"https://pith.science/api/pith-number/75LU6VMLRFEFBWOKMD6JD2UMYC/events.json","paper":"https://pith.science/paper/75LU6VML"},"agent_actions":{"view_html":"https://pith.science/pith/75LU6VMLRFEFBWOKMD6JD2UMYC","download_json":"https://pith.science/pith/75LU6VMLRFEFBWOKMD6JD2UMYC.json","view_paper":"https://pith.science/paper/75LU6VML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.00982&json=true","fetch_graph":"https://pith.science/api/pith-number/75LU6VMLRFEFBWOKMD6JD2UMYC/graph.json","fetch_events":"https://pith.science/api/pith-number/75LU6VMLRFEFBWOKMD6JD2UMYC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/75LU6VMLRFEFBWOKMD6JD2UMYC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/75LU6VMLRFEFBWOKMD6JD2UMYC/action/storage_attestation","attest_author":"https://pith.science/pith/75LU6VMLRFEFBWOKMD6JD2UMYC/action/author_attestation","sign_citation":"https://pith.science/pith/75LU6VMLRFEFBWOKMD6JD2UMYC/action/citation_signature","submit_replication":"https://pith.science/pith/75LU6VMLRFEFBWOKMD6JD2UMYC/action/replication_record"}},"created_at":"2026-07-05T05:28:40.398802+00:00","updated_at":"2026-07-05T05:28:40.398802+00:00"}