{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:TYX5PPLPOSU5W7FXAGPDYFUSTC","short_pith_number":"pith:TYX5PPLP","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"},"canonical_sha256":"9e2fd7bd6f74a9db7cb7019e3c169298ae565a1b4ac3fc0014bc85d985a2e4c3","source":{"kind":"arxiv","id":"2208.06975","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.06975","created_at":"2026-07-05T04:49:54Z"},{"alias_kind":"arxiv_version","alias_value":"2208.06975v2","created_at":"2026-07-05T04:49:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.06975","created_at":"2026-07-05T04:49:54Z"},{"alias_kind":"pith_short_12","alias_value":"TYX5PPLPOSU5","created_at":"2026-07-05T04:49:54Z"},{"alias_kind":"pith_short_16","alias_value":"TYX5PPLPOSU5W7FX","created_at":"2026-07-05T04:49:54Z"},{"alias_kind":"pith_short_8","alias_value":"TYX5PPLP","created_at":"2026-07-05T04:49:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:TYX5PPLPOSU5W7FXAGPDYFUSTC","target":"record","payload":{"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"},"canonical_sha256":"9e2fd7bd6f74a9db7cb7019e3c169298ae565a1b4ac3fc0014bc85d985a2e4c3","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"},"source_kind":"arxiv","source_id":"2208.06975","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:49:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZMok364szMj8/iXWjk67DTHTPcrCbw9xweF46m/Whyx2aKw77K2RW+ysmHEEAByMHKYKgp8MAas2UemgmargBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T02:13:56.848433Z"},"content_sha256":"c1dcaa08156f046376d8e25d172faeb5231da95c30a42d1ddc58cad5646e30d7","schema_version":"1.0","event_id":"sha256:c1dcaa08156f046376d8e25d172faeb5231da95c30a42d1ddc58cad5646e30d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:TYX5PPLPOSU5W7FXAGPDYFUSTC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:49:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sUgYx41mjs0dD/ZtjWnPtjyPDxuge01eSneUmO/m7K7UyVTHGud3XtjNTYDaxvVwkmEdZsDNjeJGwMhg/H48Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T02:13:56.849345Z"},"content_sha256":"4a2db886b355d1c4a6bace1d869a79a25ceda817d84fbe9d0ff7d4260cf0d8b1","schema_version":"1.0","event_id":"sha256:4a2db886b355d1c4a6bace1d869a79a25ceda817d84fbe9d0ff7d4260cf0d8b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TYX5PPLPOSU5W7FXAGPDYFUSTC/bundle.json","state_url":"https://pith.science/pith/TYX5PPLPOSU5W7FXAGPDYFUSTC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TYX5PPLPOSU5W7FXAGPDYFUSTC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-14T02:13:56Z","links":{"resolver":"https://pith.science/pith/TYX5PPLPOSU5W7FXAGPDYFUSTC","bundle":"https://pith.science/pith/TYX5PPLPOSU5W7FXAGPDYFUSTC/bundle.json","state":"https://pith.science/pith/TYX5PPLPOSU5W7FXAGPDYFUSTC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TYX5PPLPOSU5W7FXAGPDYFUSTC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:TYX5PPLPOSU5W7FXAGPDYFUSTC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5e8f533f26db98e4ec262458b0c5f9ae670116508e0e70ff473e898eb4892b79","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-08-15T02:24:26Z","title_canon_sha256":"a9c261c740941d0f56a257adf889a5cb5e9253f23be1761e12f1a023f7cb8750"},"schema_version":"1.0","source":{"id":"2208.06975","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.06975","created_at":"2026-07-05T04:49:54Z"},{"alias_kind":"arxiv_version","alias_value":"2208.06975v2","created_at":"2026-07-05T04:49:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.06975","created_at":"2026-07-05T04:49:54Z"},{"alias_kind":"pith_short_12","alias_value":"TYX5PPLPOSU5","created_at":"2026-07-05T04:49:54Z"},{"alias_kind":"pith_short_16","alias_value":"TYX5PPLPOSU5W7FX","created_at":"2026-07-05T04:49:54Z"},{"alias_kind":"pith_short_8","alias_value":"TYX5PPLP","created_at":"2026-07-05T04:49:54Z"}],"graph_snapshots":[{"event_id":"sha256:4a2db886b355d1c4a6bace1d869a79a25ceda817d84fbe9d0ff7d4260cf0d8b1","target":"graph","created_at":"2026-07-05T04:49:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2208.06975/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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. ","authors_text":"Bei Yu, David Pan, Ruxuan Li, Siu On Chan, Wei Li, Yuzhe Ma","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-08-15T02:24:26Z","title":"Rethinking Graph Neural Networks for the Graph Coloring Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.06975","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c1dcaa08156f046376d8e25d172faeb5231da95c30a42d1ddc58cad5646e30d7","target":"record","created_at":"2026-07-05T04:49:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5e8f533f26db98e4ec262458b0c5f9ae670116508e0e70ff473e898eb4892b79","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-08-15T02:24:26Z","title_canon_sha256":"a9c261c740941d0f56a257adf889a5cb5e9253f23be1761e12f1a023f7cb8750"},"schema_version":"1.0","source":{"id":"2208.06975","kind":"arxiv","version":2}},"canonical_sha256":"9e2fd7bd6f74a9db7cb7019e3c169298ae565a1b4ac3fc0014bc85d985a2e4c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e2fd7bd6f74a9db7cb7019e3c169298ae565a1b4ac3fc0014bc85d985a2e4c3","first_computed_at":"2026-07-05T04:49:54.647431Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:49:54.647431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nKxuPzEmBYtfvN7hCpoRqrnaeFCFVJkYvcC/XeB+hddcFYQgAeh+L8tdTgvlsJUSt65DXDUB1r0ltUlyqbRxBw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:49:54.647899Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.06975","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1dcaa08156f046376d8e25d172faeb5231da95c30a42d1ddc58cad5646e30d7","sha256:4a2db886b355d1c4a6bace1d869a79a25ceda817d84fbe9d0ff7d4260cf0d8b1"],"state_sha256":"fc3a3daefbabaf88ef3179a365a8eaddaf3ffc8c8c094e55320fe211e4cd179b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kBvoXFdm9actOr20ssQ1mVVcP6q+f3mgXTLQ6gSiquFgbnj0IfW7Hxa/cC4sOm8M3MJy/wZ9Gxt6Qjuyi3ECAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T02:13:56.910231Z","bundle_sha256":"423f8dd05017d60858927ebe85f6cf9378ce850b2c781c354fc4aeba7c8057bd"}}