{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:54UVWICXRKPLBNWMVJXUKLKHGA","short_pith_number":"pith:54UVWICX","canonical_record":{"source":{"id":"1301.6092","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-25T17:01:18Z","cross_cats_sorted":[],"title_canon_sha256":"68c6aa8efa7e77e4480c67865dc2dd49f58dca4a3cc3e50b4d0400907e1a065f","abstract_canon_sha256":"971fed1bd4615d30c3ec0f58f3ce2fc3f5d5fab03fa63df9d26621f8d7b237d6"},"schema_version":"1.0"},"canonical_sha256":"ef295b20578a9eb0b6ccaa6f452d47302b47507bfea1663ae15b590f2127a5d8","source":{"kind":"arxiv","id":"1301.6092","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6092","created_at":"2026-05-18T03:35:27Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6092v1","created_at":"2026-05-18T03:35:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6092","created_at":"2026-05-18T03:35:27Z"},{"alias_kind":"pith_short_12","alias_value":"54UVWICXRKPL","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"54UVWICXRKPLBNWM","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"54UVWICX","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:54UVWICXRKPLBNWMVJXUKLKHGA","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6092","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-25T17:01:18Z","cross_cats_sorted":[],"title_canon_sha256":"68c6aa8efa7e77e4480c67865dc2dd49f58dca4a3cc3e50b4d0400907e1a065f","abstract_canon_sha256":"971fed1bd4615d30c3ec0f58f3ce2fc3f5d5fab03fa63df9d26621f8d7b237d6"},"schema_version":"1.0"},"canonical_sha256":"ef295b20578a9eb0b6ccaa6f452d47302b47507bfea1663ae15b590f2127a5d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:27.130903Z","signature_b64":"MgCYXgYy+PJ+dnND++RPQTIZJQc3n6iAfWRpYvghYBMfCaTivAX41KVO0v82hhpmvB2ZFPLXTyNE9b42G4ruAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef295b20578a9eb0b6ccaa6f452d47302b47507bfea1663ae15b590f2127a5d8","last_reissued_at":"2026-05-18T03:35:27.130414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:27.130414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6092","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-05-18T03:35:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2FF61nstnrTLObZ+TCjuM3ZdjQCb/P34yf2tgeh5mp/PEcwLKtNttMwxe9RX14aNVbtKnfLrvlcjeSv9ytIsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:21:15.935412Z"},"content_sha256":"8954e3158e0f455da281ec4b18b85e08dcb2071759cab7707ae9231f07948b53","schema_version":"1.0","event_id":"sha256:8954e3158e0f455da281ec4b18b85e08dcb2071759cab7707ae9231f07948b53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:54UVWICXRKPLBNWMVJXUKLKHGA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neutrality in the Graph Coloring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aymeric Blot (INRIA Lille - Nord Europe, Clarisse Dhaenens (INRIA Lille - Nord Europe, Laetitia Jourdan (INRIA Lille - Nord Europe, LIFL), Marie-Eleonore Marmion (INRIA Lille - Nord Europe","submitted_at":"2013-01-25T17:01:18Z","abstract_excerpt":"The graph coloring problem is often investigated in the literature. Many insights about many neighboring solutions with the same fitness value are raised but as far as we know, no deep analysis of this neutrality has ever been conducted in the literature. In this paper, we quantify the neutrality of some hard instances of the graph coloring problem. This neutrality property has to be detected as it impacts the search process. Indeed, local optima may belong to plateaus that represents a barrier for local search methods. In this work, we also aim at pointing out the interest of exploiting neutr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6092","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":""},"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-05-18T03:35:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xeJ7UD6BPOB8vBG6IZlrd3YrVbtKPOnV349NOiSE33O46nMRDkuBeGumMLifkwF9bJ6f9Z4Qn+lMpM2BfUXtBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:21:15.935767Z"},"content_sha256":"5d5f11f63fea7402dfaf7ad6ae9a4bdcf78b5214f32f25088e4bbdaa188f6f5c","schema_version":"1.0","event_id":"sha256:5d5f11f63fea7402dfaf7ad6ae9a4bdcf78b5214f32f25088e4bbdaa188f6f5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/54UVWICXRKPLBNWMVJXUKLKHGA/bundle.json","state_url":"https://pith.science/pith/54UVWICXRKPLBNWMVJXUKLKHGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/54UVWICXRKPLBNWMVJXUKLKHGA/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-06-06T13:21:15Z","links":{"resolver":"https://pith.science/pith/54UVWICXRKPLBNWMVJXUKLKHGA","bundle":"https://pith.science/pith/54UVWICXRKPLBNWMVJXUKLKHGA/bundle.json","state":"https://pith.science/pith/54UVWICXRKPLBNWMVJXUKLKHGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/54UVWICXRKPLBNWMVJXUKLKHGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:54UVWICXRKPLBNWMVJXUKLKHGA","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":"971fed1bd4615d30c3ec0f58f3ce2fc3f5d5fab03fa63df9d26621f8d7b237d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-25T17:01:18Z","title_canon_sha256":"68c6aa8efa7e77e4480c67865dc2dd49f58dca4a3cc3e50b4d0400907e1a065f"},"schema_version":"1.0","source":{"id":"1301.6092","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6092","created_at":"2026-05-18T03:35:27Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6092v1","created_at":"2026-05-18T03:35:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6092","created_at":"2026-05-18T03:35:27Z"},{"alias_kind":"pith_short_12","alias_value":"54UVWICXRKPL","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"54UVWICXRKPLBNWM","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"54UVWICX","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:5d5f11f63fea7402dfaf7ad6ae9a4bdcf78b5214f32f25088e4bbdaa188f6f5c","target":"graph","created_at":"2026-05-18T03:35:27Z","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"},"paper":{"abstract_excerpt":"The graph coloring problem is often investigated in the literature. Many insights about many neighboring solutions with the same fitness value are raised but as far as we know, no deep analysis of this neutrality has ever been conducted in the literature. In this paper, we quantify the neutrality of some hard instances of the graph coloring problem. This neutrality property has to be detected as it impacts the search process. Indeed, local optima may belong to plateaus that represents a barrier for local search methods. In this work, we also aim at pointing out the interest of exploiting neutr","authors_text":"Aymeric Blot (INRIA Lille - Nord Europe, Clarisse Dhaenens (INRIA Lille - Nord Europe, Laetitia Jourdan (INRIA Lille - Nord Europe, LIFL), Marie-Eleonore Marmion (INRIA Lille - Nord Europe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-25T17:01:18Z","title":"Neutrality in the Graph Coloring Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6092","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:8954e3158e0f455da281ec4b18b85e08dcb2071759cab7707ae9231f07948b53","target":"record","created_at":"2026-05-18T03:35:27Z","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":"971fed1bd4615d30c3ec0f58f3ce2fc3f5d5fab03fa63df9d26621f8d7b237d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-25T17:01:18Z","title_canon_sha256":"68c6aa8efa7e77e4480c67865dc2dd49f58dca4a3cc3e50b4d0400907e1a065f"},"schema_version":"1.0","source":{"id":"1301.6092","kind":"arxiv","version":1}},"canonical_sha256":"ef295b20578a9eb0b6ccaa6f452d47302b47507bfea1663ae15b590f2127a5d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef295b20578a9eb0b6ccaa6f452d47302b47507bfea1663ae15b590f2127a5d8","first_computed_at":"2026-05-18T03:35:27.130414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:27.130414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MgCYXgYy+PJ+dnND++RPQTIZJQc3n6iAfWRpYvghYBMfCaTivAX41KVO0v82hhpmvB2ZFPLXTyNE9b42G4ruAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:27.130903Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6092","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8954e3158e0f455da281ec4b18b85e08dcb2071759cab7707ae9231f07948b53","sha256:5d5f11f63fea7402dfaf7ad6ae9a4bdcf78b5214f32f25088e4bbdaa188f6f5c"],"state_sha256":"3682de51dca699cbb93fdd53cdf5c72cc71d80ecaecb0a740e0422aa4638b264"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HahYpqI0c785F0NCzw1+7mziob59dNANntKR5uRy6mCZsWG+yddPeqYqIfnoYmtMBW89M/E4vhomcJ4KNKSFAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T13:21:15.937867Z","bundle_sha256":"a30aac7ef4807003717591bca099df559764893c59f1b23ad72830bb7ec8a822"}}