{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:L5XUBT7UXKZXWL5VNSGDTQJUZX","short_pith_number":"pith:L5XUBT7U","canonical_record":{"source":{"id":"2408.05054","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-08-09T13:21:08Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"deeca42ea9861173087bf47d7803afb87f4d29edc697c0729d9536efb8be7577","abstract_canon_sha256":"af968492ccd40c7fe24b7d4d9d964c9d8d8fa0cafb53ba1bfae98f3944eb0a3d"},"schema_version":"1.0"},"canonical_sha256":"5f6f40cff4bab37b2fb56c8c39c134cdeb7733c356a027b278e34a132623be13","source":{"kind":"arxiv","id":"2408.05054","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.05054","created_at":"2026-07-05T08:53:56Z"},{"alias_kind":"arxiv_version","alias_value":"2408.05054v1","created_at":"2026-07-05T08:53:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.05054","created_at":"2026-07-05T08:53:56Z"},{"alias_kind":"pith_short_12","alias_value":"L5XUBT7UXKZX","created_at":"2026-07-05T08:53:56Z"},{"alias_kind":"pith_short_16","alias_value":"L5XUBT7UXKZXWL5V","created_at":"2026-07-05T08:53:56Z"},{"alias_kind":"pith_short_8","alias_value":"L5XUBT7U","created_at":"2026-07-05T08:53:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:L5XUBT7UXKZXWL5VNSGDTQJUZX","target":"record","payload":{"canonical_record":{"source":{"id":"2408.05054","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-08-09T13:21:08Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"deeca42ea9861173087bf47d7803afb87f4d29edc697c0729d9536efb8be7577","abstract_canon_sha256":"af968492ccd40c7fe24b7d4d9d964c9d8d8fa0cafb53ba1bfae98f3944eb0a3d"},"schema_version":"1.0"},"canonical_sha256":"5f6f40cff4bab37b2fb56c8c39c134cdeb7733c356a027b278e34a132623be13","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:53:56.056207Z","signature_b64":"FxUXHydJfoR4GlsIKh38cWPDgYXhIxrjVFanTBKhzEVSm1wqaTceqSNdqGjSiKFgB4MaflP8PK1HGbsxtG+rAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f6f40cff4bab37b2fb56c8c39c134cdeb7733c356a027b278e34a132623be13","last_reissued_at":"2026-07-05T08:53:56.055786Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:53:56.055786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.05054","source_version":1,"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-05T08:53:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2zmO2lQWEvp3XrD+IpPZ+M0DokYQPEzmZpe3jrOFD8cuZ6MJrsSkV5mvee+7sfUPW1IidyQFHXBQ8NtrudyiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T14:00:00.025063Z"},"content_sha256":"f16b0b37d97323d04fa42751cee8b6d76c79419ddb24d708646adcdbe6521a4f","schema_version":"1.0","event_id":"sha256:f16b0b37d97323d04fa42751cee8b6d76c79419ddb24d708646adcdbe6521a4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:L5XUBT7UXKZXWL5VNSGDTQJUZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Neural Networks as Ordering Heuristics for Parallel Graph Coloring","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Fredrik Manne, Kenneth Langedal","submitted_at":"2024-08-09T13:21:08Z","abstract_excerpt":"The graph coloring problem asks for an assignment of the minimum number of distinct colors to vertices in an undirected graph with the constraint that no pair of adjacent vertices share the same color. The problem is a thoroughly studied NP-hard combinatorial problem with several real-world applications. As such, a number of greedy heuristics have been suggested that strike a good balance between coloring quality, execution time, and also parallel scalability. In this work, we introduce a graph neural network (GNN) based ordering heuristic and demonstrate that it outperforms existing greedy or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.05054","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/2408.05054/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-05T08:53:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6efoeUBPr0PEWYBKnYYb1eerK8Ob75Z2W0Vyu9fC6/6sj61IMTNOgmW0R9NUUoicUXIyu3Gb4RSW0ODm4P8PBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T14:00:00.025955Z"},"content_sha256":"057f3dcbae1eaf2d8722f0c29a3f987133666ccd3e5105c286269f40bdd1be5e","schema_version":"1.0","event_id":"sha256:057f3dcbae1eaf2d8722f0c29a3f987133666ccd3e5105c286269f40bdd1be5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L5XUBT7UXKZXWL5VNSGDTQJUZX/bundle.json","state_url":"https://pith.science/pith/L5XUBT7UXKZXWL5VNSGDTQJUZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L5XUBT7UXKZXWL5VNSGDTQJUZX/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-09T14:00:00Z","links":{"resolver":"https://pith.science/pith/L5XUBT7UXKZXWL5VNSGDTQJUZX","bundle":"https://pith.science/pith/L5XUBT7UXKZXWL5VNSGDTQJUZX/bundle.json","state":"https://pith.science/pith/L5XUBT7UXKZXWL5VNSGDTQJUZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L5XUBT7UXKZXWL5VNSGDTQJUZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:L5XUBT7UXKZXWL5VNSGDTQJUZX","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":"af968492ccd40c7fe24b7d4d9d964c9d8d8fa0cafb53ba1bfae98f3944eb0a3d","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-08-09T13:21:08Z","title_canon_sha256":"deeca42ea9861173087bf47d7803afb87f4d29edc697c0729d9536efb8be7577"},"schema_version":"1.0","source":{"id":"2408.05054","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.05054","created_at":"2026-07-05T08:53:56Z"},{"alias_kind":"arxiv_version","alias_value":"2408.05054v1","created_at":"2026-07-05T08:53:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.05054","created_at":"2026-07-05T08:53:56Z"},{"alias_kind":"pith_short_12","alias_value":"L5XUBT7UXKZX","created_at":"2026-07-05T08:53:56Z"},{"alias_kind":"pith_short_16","alias_value":"L5XUBT7UXKZXWL5V","created_at":"2026-07-05T08:53:56Z"},{"alias_kind":"pith_short_8","alias_value":"L5XUBT7U","created_at":"2026-07-05T08:53:56Z"}],"graph_snapshots":[{"event_id":"sha256:057f3dcbae1eaf2d8722f0c29a3f987133666ccd3e5105c286269f40bdd1be5e","target":"graph","created_at":"2026-07-05T08:53:56Z","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/2408.05054/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The graph coloring problem asks for an assignment of the minimum number of distinct colors to vertices in an undirected graph with the constraint that no pair of adjacent vertices share the same color. The problem is a thoroughly studied NP-hard combinatorial problem with several real-world applications. As such, a number of greedy heuristics have been suggested that strike a good balance between coloring quality, execution time, and also parallel scalability. In this work, we introduce a graph neural network (GNN) based ordering heuristic and demonstrate that it outperforms existing greedy or","authors_text":"Fredrik Manne, Kenneth Langedal","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-08-09T13:21:08Z","title":"Graph Neural Networks as Ordering Heuristics for Parallel Graph Coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.05054","kind":"arxiv","version":1},"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:f16b0b37d97323d04fa42751cee8b6d76c79419ddb24d708646adcdbe6521a4f","target":"record","created_at":"2026-07-05T08:53:56Z","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":"af968492ccd40c7fe24b7d4d9d964c9d8d8fa0cafb53ba1bfae98f3944eb0a3d","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-08-09T13:21:08Z","title_canon_sha256":"deeca42ea9861173087bf47d7803afb87f4d29edc697c0729d9536efb8be7577"},"schema_version":"1.0","source":{"id":"2408.05054","kind":"arxiv","version":1}},"canonical_sha256":"5f6f40cff4bab37b2fb56c8c39c134cdeb7733c356a027b278e34a132623be13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f6f40cff4bab37b2fb56c8c39c134cdeb7733c356a027b278e34a132623be13","first_computed_at":"2026-07-05T08:53:56.055786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:53:56.055786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FxUXHydJfoR4GlsIKh38cWPDgYXhIxrjVFanTBKhzEVSm1wqaTceqSNdqGjSiKFgB4MaflP8PK1HGbsxtG+rAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:53:56.056207Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.05054","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f16b0b37d97323d04fa42751cee8b6d76c79419ddb24d708646adcdbe6521a4f","sha256:057f3dcbae1eaf2d8722f0c29a3f987133666ccd3e5105c286269f40bdd1be5e"],"state_sha256":"4d093b9d4836669cc6c16e0a64030358aaa8daef250b458431c4c0c732672de7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S36ZPHwrhAcq8379P1nNSPCyK1Fo+zhlXmC2wN+FFRlpr1WoZo0X0jBQPITFoz2vOG3w37lzmhz5T1UmUMk/Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T14:00:00.034569Z","bundle_sha256":"5fbda8afe830f7e81a389bc677319672fe478cbce2f6d95a760c26db049a7441"}}