{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:TYX5PPLPOSU5W7FXAGPDYFUSTC","short_pith_number":"pith:TYX5PPLP","schema_version":"1.0","canonical_sha256":"9e2fd7bd6f74a9db7cb7019e3c169298ae565a1b4ac3fc0014bc85d985a2e4c3","source":{"kind":"arxiv","id":"2208.06975","version":2},"attestation_state":"computed","paper":{"title":"Rethinking Graph Neural Networks for the Graph Coloring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bei Yu, David Pan, Ruxuan Li, Siu On Chan, Wei Li, Yuzhe Ma","submitted_at":"2022-08-15T02:24:26Z","abstract_excerpt":"Graph coloring, a classical and critical NP-hard problem, is the problem of assigning connected nodes as different colors as possible. However, we observe that state-of-the-art GNNs are less successful in the graph coloring problem. We analyze the reasons from two perspectives. First, most GNNs fail to generalize the task under homophily to heterophily, i.e., graphs where connected nodes are assigned different colors. Second, GNNs are bounded by the network depth, making them possible to be a local method, which has been demonstrated to be non-optimal in Maximum Independent Set (MIS) problem. "},"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":"2208.06975","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-08-15T02:24:26Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a9c261c740941d0f56a257adf889a5cb5e9253f23be1761e12f1a023f7cb8750","abstract_canon_sha256":"5e8f533f26db98e4ec262458b0c5f9ae670116508e0e70ff473e898eb4892b79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:49:54.647899Z","signature_b64":"nKxuPzEmBYtfvN7hCpoRqrnaeFCFVJkYvcC/XeB+hddcFYQgAeh+L8tdTgvlsJUSt65DXDUB1r0ltUlyqbRxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e2fd7bd6f74a9db7cb7019e3c169298ae565a1b4ac3fc0014bc85d985a2e4c3","last_reissued_at":"2026-07-05T04:49:54.647431Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:49:54.647431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rethinking Graph Neural Networks for the Graph Coloring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bei Yu, David Pan, Ruxuan Li, Siu On Chan, Wei Li, Yuzhe Ma","submitted_at":"2022-08-15T02:24:26Z","abstract_excerpt":"Graph coloring, a classical and critical NP-hard problem, is the problem of assigning connected nodes as different colors as possible. However, we observe that state-of-the-art GNNs are less successful in the graph coloring problem. We analyze the reasons from two perspectives. First, most GNNs fail to generalize the task under homophily to heterophily, i.e., graphs where connected nodes are assigned different colors. Second, GNNs are bounded by the network depth, making them possible to be a local method, which has been demonstrated to be non-optimal in Maximum Independent Set (MIS) problem. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.06975","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/2208.06975/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":"2208.06975","created_at":"2026-07-05T04:49:54.647486+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.06975v2","created_at":"2026-07-05T04:49:54.647486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.06975","created_at":"2026-07-05T04:49:54.647486+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYX5PPLPOSU5","created_at":"2026-07-05T04:49:54.647486+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYX5PPLPOSU5W7FX","created_at":"2026-07-05T04:49:54.647486+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYX5PPLP","created_at":"2026-07-05T04:49:54.647486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2601.10175","citing_title":"A Low-Complexity Framework for Multi-access Coded Caching Systems with Arbitrary User-cache Access Topology","ref_index":51,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TYX5PPLPOSU5W7FXAGPDYFUSTC","json":"https://pith.science/pith/TYX5PPLPOSU5W7FXAGPDYFUSTC.json","graph_json":"https://pith.science/api/pith-number/TYX5PPLPOSU5W7FXAGPDYFUSTC/graph.json","events_json":"https://pith.science/api/pith-number/TYX5PPLPOSU5W7FXAGPDYFUSTC/events.json","paper":"https://pith.science/paper/TYX5PPLP"},"agent_actions":{"view_html":"https://pith.science/pith/TYX5PPLPOSU5W7FXAGPDYFUSTC","download_json":"https://pith.science/pith/TYX5PPLPOSU5W7FXAGPDYFUSTC.json","view_paper":"https://pith.science/paper/TYX5PPLP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.06975&json=true","fetch_graph":"https://pith.science/api/pith-number/TYX5PPLPOSU5W7FXAGPDYFUSTC/graph.json","fetch_events":"https://pith.science/api/pith-number/TYX5PPLPOSU5W7FXAGPDYFUSTC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYX5PPLPOSU5W7FXAGPDYFUSTC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYX5PPLPOSU5W7FXAGPDYFUSTC/action/storage_attestation","attest_author":"https://pith.science/pith/TYX5PPLPOSU5W7FXAGPDYFUSTC/action/author_attestation","sign_citation":"https://pith.science/pith/TYX5PPLPOSU5W7FXAGPDYFUSTC/action/citation_signature","submit_replication":"https://pith.science/pith/TYX5PPLPOSU5W7FXAGPDYFUSTC/action/replication_record"}},"created_at":"2026-07-05T04:49:54.647486+00:00","updated_at":"2026-07-05T04:49:54.647486+00:00"}