{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:C5D2XBURD75WLKIPYQTMOJBM6L","short_pith_number":"pith:C5D2XBUR","schema_version":"1.0","canonical_sha256":"1747ab86911ffb65a90fc426c7242cf2ef2f0f1bda3a4d01a92e5685ff8dfb15","source":{"kind":"arxiv","id":"1911.05384","version":2},"attestation_state":"computed","paper":{"title":"On the choice of graph neural network architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP","stat.ML"],"primary_cat":"cs.SI","authors_text":"Cl\\'ement Vignac, Guillermo Ortiz-Jim\\'enez, Pascal Frossard","submitted_at":"2019-11-13T10:25:08Z","abstract_excerpt":"Seminal works on graph neural networks have primarily targeted semi-supervised node classification problems with few observed labels and high-dimensional signals. With the development of graph networks, this setup has become a de facto benchmark for a significant body of research. Interestingly, several works have recently shown that in this particular setting, graph neural networks do not perform much better than predefined low-pass filters followed by a linear classifier. However, when learning from little data in a high-dimensional space, it is not surprising that simple and heavily regular"},"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":"1911.05384","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-11-13T10:25:08Z","cross_cats_sorted":["cs.LG","eess.SP","stat.ML"],"title_canon_sha256":"5848e2a9355ca6fc27391c5cd24e240b64f6b3cf6418af9c092a6d8f757ec9e3","abstract_canon_sha256":"b5e43205a79cb471cdb26b9a530178e33ab8a074bb79669aabeadf588e7bf02f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:39:15.571089Z","signature_b64":"1OapWPVKSyvRWYaM78jPNW8aQUsFPh0EfFvvJpQC/uY0LWA5v1Tt+D9ljueqFfh48TyPzjjKM0sU+ksxagiGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1747ab86911ffb65a90fc426c7242cf2ef2f0f1bda3a4d01a92e5685ff8dfb15","last_reissued_at":"2026-07-05T00:39:15.570568Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:39:15.570568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the choice of graph neural network architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP","stat.ML"],"primary_cat":"cs.SI","authors_text":"Cl\\'ement Vignac, Guillermo Ortiz-Jim\\'enez, Pascal Frossard","submitted_at":"2019-11-13T10:25:08Z","abstract_excerpt":"Seminal works on graph neural networks have primarily targeted semi-supervised node classification problems with few observed labels and high-dimensional signals. With the development of graph networks, this setup has become a de facto benchmark for a significant body of research. Interestingly, several works have recently shown that in this particular setting, graph neural networks do not perform much better than predefined low-pass filters followed by a linear classifier. However, when learning from little data in a high-dimensional space, it is not surprising that simple and heavily regular"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.05384","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/1911.05384/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":"1911.05384","created_at":"2026-07-05T00:39:15.570625+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.05384v2","created_at":"2026-07-05T00:39:15.570625+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.05384","created_at":"2026-07-05T00:39:15.570625+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5D2XBURD75W","created_at":"2026-07-05T00:39:15.570625+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5D2XBURD75WLKIP","created_at":"2026-07-05T00:39:15.570625+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5D2XBUR","created_at":"2026-07-05T00:39:15.570625+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C5D2XBURD75WLKIPYQTMOJBM6L","json":"https://pith.science/pith/C5D2XBURD75WLKIPYQTMOJBM6L.json","graph_json":"https://pith.science/api/pith-number/C5D2XBURD75WLKIPYQTMOJBM6L/graph.json","events_json":"https://pith.science/api/pith-number/C5D2XBURD75WLKIPYQTMOJBM6L/events.json","paper":"https://pith.science/paper/C5D2XBUR"},"agent_actions":{"view_html":"https://pith.science/pith/C5D2XBURD75WLKIPYQTMOJBM6L","download_json":"https://pith.science/pith/C5D2XBURD75WLKIPYQTMOJBM6L.json","view_paper":"https://pith.science/paper/C5D2XBUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.05384&json=true","fetch_graph":"https://pith.science/api/pith-number/C5D2XBURD75WLKIPYQTMOJBM6L/graph.json","fetch_events":"https://pith.science/api/pith-number/C5D2XBURD75WLKIPYQTMOJBM6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5D2XBURD75WLKIPYQTMOJBM6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5D2XBURD75WLKIPYQTMOJBM6L/action/storage_attestation","attest_author":"https://pith.science/pith/C5D2XBURD75WLKIPYQTMOJBM6L/action/author_attestation","sign_citation":"https://pith.science/pith/C5D2XBURD75WLKIPYQTMOJBM6L/action/citation_signature","submit_replication":"https://pith.science/pith/C5D2XBURD75WLKIPYQTMOJBM6L/action/replication_record"}},"created_at":"2026-07-05T00:39:15.570625+00:00","updated_at":"2026-07-05T00:39:15.570625+00:00"}