{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2KHN7INVRKA47WUTFOCMZHB5XG","short_pith_number":"pith:2KHN7INV","schema_version":"1.0","canonical_sha256":"d28edfa1b58a81cfda932b84cc9c3db9a479f388ba47edcc7c30102e79daa651","source":{"kind":"arxiv","id":"1912.06058","version":1},"attestation_state":"computed","paper":{"title":"Coloring graph neural networks for node disambiguation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aladin Virmaux, George Dasoulas, Kevin Scaman, Ludovic Dos Santos","submitted_at":"2019-12-12T16:06:47Z","abstract_excerpt":"In this paper, we show that a simple coloring scheme can improve, both theoretically and empirically, the expressive power of Message Passing Neural Networks(MPNNs). More specifically, we introduce a graph neural network called Colored Local Iterative Procedure (CLIP) that uses colors to disambiguate identical node attributes, and show that this representation is a universal approximator of continuous functions on graphs with node attributes. Our method relies on separability , a key topological characteristic that allows to extend well-chosen neural networks into universal representations. Fi"},"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.06058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-12-12T16:06:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3cb9f97e9e342d3e0ab3bde55e1288394fba66ae3da206fb328952ccca9039dd","abstract_canon_sha256":"285966b3dcb4d60ad0ebcf7a8bbe54158888d61bd7515aa6c848026e59c4f729"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:25:51.292922Z","signature_b64":"r9BrY4CcaOGeAHqsLXgG+55TMa8wPkJCyxIpDMzNUtjo0ugwBO6C5wsLZxEtfTo8ncSLn5dasu01eLZVqAsOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d28edfa1b58a81cfda932b84cc9c3db9a479f388ba47edcc7c30102e79daa651","last_reissued_at":"2026-07-05T00:25:51.292446Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:25:51.292446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring graph neural networks for node disambiguation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aladin Virmaux, George Dasoulas, Kevin Scaman, Ludovic Dos Santos","submitted_at":"2019-12-12T16:06:47Z","abstract_excerpt":"In this paper, we show that a simple coloring scheme can improve, both theoretically and empirically, the expressive power of Message Passing Neural Networks(MPNNs). More specifically, we introduce a graph neural network called Colored Local Iterative Procedure (CLIP) that uses colors to disambiguate identical node attributes, and show that this representation is a universal approximator of continuous functions on graphs with node attributes. Our method relies on separability , a key topological characteristic that allows to extend well-chosen neural networks into universal representations. Fi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.06058","kind":"arxiv","version":1},"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.06058/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.06058","created_at":"2026-07-05T00:25:51.292507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.06058v1","created_at":"2026-07-05T00:25:51.292507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.06058","created_at":"2026-07-05T00:25:51.292507+00:00"},{"alias_kind":"pith_short_12","alias_value":"2KHN7INVRKA4","created_at":"2026-07-05T00:25:51.292507+00:00"},{"alias_kind":"pith_short_16","alias_value":"2KHN7INVRKA47WUT","created_at":"2026-07-05T00:25:51.292507+00:00"},{"alias_kind":"pith_short_8","alias_value":"2KHN7INV","created_at":"2026-07-05T00:25:51.292507+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/2KHN7INVRKA47WUTFOCMZHB5XG","json":"https://pith.science/pith/2KHN7INVRKA47WUTFOCMZHB5XG.json","graph_json":"https://pith.science/api/pith-number/2KHN7INVRKA47WUTFOCMZHB5XG/graph.json","events_json":"https://pith.science/api/pith-number/2KHN7INVRKA47WUTFOCMZHB5XG/events.json","paper":"https://pith.science/paper/2KHN7INV"},"agent_actions":{"view_html":"https://pith.science/pith/2KHN7INVRKA47WUTFOCMZHB5XG","download_json":"https://pith.science/pith/2KHN7INVRKA47WUTFOCMZHB5XG.json","view_paper":"https://pith.science/paper/2KHN7INV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.06058&json=true","fetch_graph":"https://pith.science/api/pith-number/2KHN7INVRKA47WUTFOCMZHB5XG/graph.json","fetch_events":"https://pith.science/api/pith-number/2KHN7INVRKA47WUTFOCMZHB5XG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2KHN7INVRKA47WUTFOCMZHB5XG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2KHN7INVRKA47WUTFOCMZHB5XG/action/storage_attestation","attest_author":"https://pith.science/pith/2KHN7INVRKA47WUTFOCMZHB5XG/action/author_attestation","sign_citation":"https://pith.science/pith/2KHN7INVRKA47WUTFOCMZHB5XG/action/citation_signature","submit_replication":"https://pith.science/pith/2KHN7INVRKA47WUTFOCMZHB5XG/action/replication_record"}},"created_at":"2026-07-05T00:25:51.292507+00:00","updated_at":"2026-07-05T00:25:51.292507+00:00"}