{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:N6SKMMLH2GVM3VFBQL5I3XPLR7","short_pith_number":"pith:N6SKMMLH","canonical_record":{"source":{"id":"2504.03277","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2025-04-04T08:57:01Z","cross_cats_sorted":[],"title_canon_sha256":"9ba5003cccf01648d40b3173d8df818eb54cf653c3f781ca022c55a396e03f7c","abstract_canon_sha256":"8452dd2175e483feddd7eb5600d86415706fbafe753781a30024d968a1a84971"},"schema_version":"1.0"},"canonical_sha256":"6fa4a63167d1aacdd4a182fa8dddeb8fe5dd0c94577b89e2c5acc8ff46d4a391","source":{"kind":"arxiv","id":"2504.03277","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.03277","created_at":"2026-07-05T10:44:29Z"},{"alias_kind":"arxiv_version","alias_value":"2504.03277v1","created_at":"2026-07-05T10:44:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.03277","created_at":"2026-07-05T10:44:29Z"},{"alias_kind":"pith_short_12","alias_value":"N6SKMMLH2GVM","created_at":"2026-07-05T10:44:29Z"},{"alias_kind":"pith_short_16","alias_value":"N6SKMMLH2GVM3VFB","created_at":"2026-07-05T10:44:29Z"},{"alias_kind":"pith_short_8","alias_value":"N6SKMMLH","created_at":"2026-07-05T10:44:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:N6SKMMLH2GVM3VFBQL5I3XPLR7","target":"record","payload":{"canonical_record":{"source":{"id":"2504.03277","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2025-04-04T08:57:01Z","cross_cats_sorted":[],"title_canon_sha256":"9ba5003cccf01648d40b3173d8df818eb54cf653c3f781ca022c55a396e03f7c","abstract_canon_sha256":"8452dd2175e483feddd7eb5600d86415706fbafe753781a30024d968a1a84971"},"schema_version":"1.0"},"canonical_sha256":"6fa4a63167d1aacdd4a182fa8dddeb8fe5dd0c94577b89e2c5acc8ff46d4a391","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:44:29.334531Z","signature_b64":"hxMFkuuz1Gax0YND/6+GYHJapz0Es8ZsMVbTNvEpJVLmozwWUoks5oQwun/6WTNJPdWPhh7ML5KFif24lgAtBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fa4a63167d1aacdd4a182fa8dddeb8fe5dd0c94577b89e2c5acc8ff46d4a391","last_reissued_at":"2026-07-05T10:44:29.334030Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:44:29.334030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.03277","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-05T10:44:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4KFvmN5xpn539GErg/z6hj90t/MEnqJw+nPvLsDyDWwYWtVu0VBzJO3Y8J4oUzB0HLyVZ05hVG9sIqNusXiaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T16:01:05.146144Z"},"content_sha256":"963f57c24fbe3a2604b583960ea870d7aaf1f639f6413ff3dc71f4bc38f50b80","schema_version":"1.0","event_id":"sha256:963f57c24fbe3a2604b583960ea870d7aaf1f639f6413ff3dc71f4bc38f50b80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:N6SKMMLH2GVM3VFBQL5I3XPLR7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Monte Carlo Graph Coloring","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Benjamin Negrevergne, Florian Sikora, Tristan Cazenave","submitted_at":"2025-04-04T08:57:01Z","abstract_excerpt":"Graph Coloring is probably one of the most studied and famous problem in graph algorithms. Exact methods fail to solve instances with more than few hundred vertices, therefore, a large number of heuristics have been proposed. Nested Monte Carlo Search (NMCS) and Nested Rollout Policy Adaptation (NRPA) are Monte Carlo search algorithms for single player games. Surprisingly, few work has been dedicated to evaluating Monte Carlo search algorithms to combinatorial graph problems. In this paper we expose how to efficiently apply Monte Carlo search to Graph Coloring and compare this approach to exis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.03277","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/2504.03277/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-05T10:44:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pzH1BZJkY2Hr1v9E5OKtxwGPvOwalK8e3lJW49RrnqV0asE9wnjGDVDABaEsGaZpezt7jPSxATWP3meq86+qBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T16:01:05.146566Z"},"content_sha256":"ce9ced523c7d0d115ba8fdbf2cd450f263b4cd242b2d3dcba70616d483117747","schema_version":"1.0","event_id":"sha256:ce9ced523c7d0d115ba8fdbf2cd450f263b4cd242b2d3dcba70616d483117747"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N6SKMMLH2GVM3VFBQL5I3XPLR7/bundle.json","state_url":"https://pith.science/pith/N6SKMMLH2GVM3VFBQL5I3XPLR7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N6SKMMLH2GVM3VFBQL5I3XPLR7/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-07-18T16:01:05Z","links":{"resolver":"https://pith.science/pith/N6SKMMLH2GVM3VFBQL5I3XPLR7","bundle":"https://pith.science/pith/N6SKMMLH2GVM3VFBQL5I3XPLR7/bundle.json","state":"https://pith.science/pith/N6SKMMLH2GVM3VFBQL5I3XPLR7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N6SKMMLH2GVM3VFBQL5I3XPLR7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:N6SKMMLH2GVM3VFBQL5I3XPLR7","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":"8452dd2175e483feddd7eb5600d86415706fbafe753781a30024d968a1a84971","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2025-04-04T08:57:01Z","title_canon_sha256":"9ba5003cccf01648d40b3173d8df818eb54cf653c3f781ca022c55a396e03f7c"},"schema_version":"1.0","source":{"id":"2504.03277","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.03277","created_at":"2026-07-05T10:44:29Z"},{"alias_kind":"arxiv_version","alias_value":"2504.03277v1","created_at":"2026-07-05T10:44:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.03277","created_at":"2026-07-05T10:44:29Z"},{"alias_kind":"pith_short_12","alias_value":"N6SKMMLH2GVM","created_at":"2026-07-05T10:44:29Z"},{"alias_kind":"pith_short_16","alias_value":"N6SKMMLH2GVM3VFB","created_at":"2026-07-05T10:44:29Z"},{"alias_kind":"pith_short_8","alias_value":"N6SKMMLH","created_at":"2026-07-05T10:44:29Z"}],"graph_snapshots":[{"event_id":"sha256:ce9ced523c7d0d115ba8fdbf2cd450f263b4cd242b2d3dcba70616d483117747","target":"graph","created_at":"2026-07-05T10:44:29Z","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/2504.03277/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Coloring is probably one of the most studied and famous problem in graph algorithms. Exact methods fail to solve instances with more than few hundred vertices, therefore, a large number of heuristics have been proposed. Nested Monte Carlo Search (NMCS) and Nested Rollout Policy Adaptation (NRPA) are Monte Carlo search algorithms for single player games. Surprisingly, few work has been dedicated to evaluating Monte Carlo search algorithms to combinatorial graph problems. In this paper we expose how to efficiently apply Monte Carlo search to Graph Coloring and compare this approach to exis","authors_text":"Benjamin Negrevergne, Florian Sikora, Tristan Cazenave","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2025-04-04T08:57:01Z","title":"Monte Carlo Graph Coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.03277","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:963f57c24fbe3a2604b583960ea870d7aaf1f639f6413ff3dc71f4bc38f50b80","target":"record","created_at":"2026-07-05T10:44:29Z","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":"8452dd2175e483feddd7eb5600d86415706fbafe753781a30024d968a1a84971","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2025-04-04T08:57:01Z","title_canon_sha256":"9ba5003cccf01648d40b3173d8df818eb54cf653c3f781ca022c55a396e03f7c"},"schema_version":"1.0","source":{"id":"2504.03277","kind":"arxiv","version":1}},"canonical_sha256":"6fa4a63167d1aacdd4a182fa8dddeb8fe5dd0c94577b89e2c5acc8ff46d4a391","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6fa4a63167d1aacdd4a182fa8dddeb8fe5dd0c94577b89e2c5acc8ff46d4a391","first_computed_at":"2026-07-05T10:44:29.334030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:44:29.334030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hxMFkuuz1Gax0YND/6+GYHJapz0Es8ZsMVbTNvEpJVLmozwWUoks5oQwun/6WTNJPdWPhh7ML5KFif24lgAtBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:44:29.334531Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.03277","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:963f57c24fbe3a2604b583960ea870d7aaf1f639f6413ff3dc71f4bc38f50b80","sha256:ce9ced523c7d0d115ba8fdbf2cd450f263b4cd242b2d3dcba70616d483117747"],"state_sha256":"3867ae6de7d307f07b19b04a7a27a90bda613e8c8ba06995b8e47bfd68921aaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rnkuh5zDXxMp6Zh1TQ82zdOy+b6ajL+ntp2kjn+A35mXF83qauhey1nqSCpcbnqyadfckTr9pKJ2KIeeWcvfAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-18T16:01:05.149139Z","bundle_sha256":"feb61fb8777d8a22fb37e631ed0177d92f68107078fa5d38fb8911bd5b1d309e"}}