{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JN4U3T75RON2FLYW2F3P4JIFSH","short_pith_number":"pith:JN4U3T75","schema_version":"1.0","canonical_sha256":"4b794dcffd8b9ba2af16d176fe250591f5d1303fad4d96f54ded70bc242a07f1","source":{"kind":"arxiv","id":"1912.09893","version":3},"attestation_state":"computed","paper":{"title":"A Fair Comparison of Graph Neural Networks for Graph Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessio Micheli, Davide Bacciu, Federico Errica, Marco Podda","submitted_at":"2019-12-20T15:40:50Z","abstract_excerpt":"Experimental reproducibility and replicability are critical topics in machine learning. Authors have often raised concerns about their lack in scientific publications to improve the quality of the field. Recently, the graph representation learning field has attracted the attention of a wide research community, which resulted in a large stream of works. As such, several Graph Neural Network models have been developed to effectively tackle graph classification. However, experimental procedures often lack rigorousness and are hardly reproducible. Motivated by this, we provide an overview of commo"},"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":"1912.09893","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-12-20T15:40:50Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0ce737f84435c69a589d4db6e7be1b3f805abb771c6997aac958c57bdba9b527","abstract_canon_sha256":"9d433fed5e1690f89ad576cde27e2ae8a4d50e522bd4f3815a479e2258cb06b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:57:59.573207Z","signature_b64":"Zyte2951B4w5gDxnRKa/Mxdv5H2l+dZMo8huo3W+82Tlb14aiDqAZXVkcSXupGw9sUIe9VY0K1M+JgJbcgfYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b794dcffd8b9ba2af16d176fe250591f5d1303fad4d96f54ded70bc242a07f1","last_reissued_at":"2026-07-05T03:57:59.572749Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:57:59.572749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fair Comparison of Graph Neural Networks for Graph Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessio Micheli, Davide Bacciu, Federico Errica, Marco Podda","submitted_at":"2019-12-20T15:40:50Z","abstract_excerpt":"Experimental reproducibility and replicability are critical topics in machine learning. Authors have often raised concerns about their lack in scientific publications to improve the quality of the field. Recently, the graph representation learning field has attracted the attention of a wide research community, which resulted in a large stream of works. As such, several Graph Neural Network models have been developed to effectively tackle graph classification. However, experimental procedures often lack rigorousness and are hardly reproducible. Motivated by this, we provide an overview of commo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.09893","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/1912.09893/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":"1912.09893","created_at":"2026-07-05T03:57:59.572807+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.09893v3","created_at":"2026-07-05T03:57:59.572807+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.09893","created_at":"2026-07-05T03:57:59.572807+00:00"},{"alias_kind":"pith_short_12","alias_value":"JN4U3T75RON2","created_at":"2026-07-05T03:57:59.572807+00:00"},{"alias_kind":"pith_short_16","alias_value":"JN4U3T75RON2FLYW","created_at":"2026-07-05T03:57:59.572807+00:00"},{"alias_kind":"pith_short_8","alias_value":"JN4U3T75","created_at":"2026-07-05T03:57:59.572807+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09051","citing_title":"Beyond Convolution: Advancing Hypergraph Neural Networks with Hypergraph U-Nets","ref_index":60,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30786","citing_title":"AbstainGNN: Teaching Graph Neural Networks to Abstain for Graph Classification","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2501.00773","citing_title":"OpenGLT: A Comprehensive Benchmark of Graph Neural Networks for Graph-Level Tasks","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":9,"is_internal_anchor":false},{"citing_arxiv_id":"2512.08089","citing_title":"Efficient and Accurate Graph Classification with Hyperdimensional Computing on FPGA","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17854","citing_title":"Learning over Positive and Negative Edges with Contrastive Message Passing","ref_index":8,"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":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09486","citing_title":"CTQWformer: A CTQW-based Transformer for Graph Classification","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JN4U3T75RON2FLYW2F3P4JIFSH","json":"https://pith.science/pith/JN4U3T75RON2FLYW2F3P4JIFSH.json","graph_json":"https://pith.science/api/pith-number/JN4U3T75RON2FLYW2F3P4JIFSH/graph.json","events_json":"https://pith.science/api/pith-number/JN4U3T75RON2FLYW2F3P4JIFSH/events.json","paper":"https://pith.science/paper/JN4U3T75"},"agent_actions":{"view_html":"https://pith.science/pith/JN4U3T75RON2FLYW2F3P4JIFSH","download_json":"https://pith.science/pith/JN4U3T75RON2FLYW2F3P4JIFSH.json","view_paper":"https://pith.science/paper/JN4U3T75","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.09893&json=true","fetch_graph":"https://pith.science/api/pith-number/JN4U3T75RON2FLYW2F3P4JIFSH/graph.json","fetch_events":"https://pith.science/api/pith-number/JN4U3T75RON2FLYW2F3P4JIFSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JN4U3T75RON2FLYW2F3P4JIFSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JN4U3T75RON2FLYW2F3P4JIFSH/action/storage_attestation","attest_author":"https://pith.science/pith/JN4U3T75RON2FLYW2F3P4JIFSH/action/author_attestation","sign_citation":"https://pith.science/pith/JN4U3T75RON2FLYW2F3P4JIFSH/action/citation_signature","submit_replication":"https://pith.science/pith/JN4U3T75RON2FLYW2F3P4JIFSH/action/replication_record"}},"created_at":"2026-07-05T03:57:59.572807+00:00","updated_at":"2026-07-05T03:57:59.572807+00:00"}