{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YIYMMI6JMFXVH5VSGZGO2QIDXG","short_pith_number":"pith:YIYMMI6J","canonical_record":{"source":{"id":"1812.07734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-12-17T14:33:18Z","cross_cats_sorted":[],"title_canon_sha256":"c8034e28f7a06a2741a8a414e2cc3fc52ffc55077097bcdff578090f506981cc","abstract_canon_sha256":"004a16fe1079b39b4f4a272077af4d5a5799bbce887a90c172446c629a8b0e53"},"schema_version":"1.0"},"canonical_sha256":"c230c623c9616f53f6b2364ced4103b9b36c9ff0af9e9e0cebb99fc2ae9d46b5","source":{"kind":"arxiv","id":"1812.07734","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.07734","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1812.07734v1","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.07734","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"YIYMMI6JMFXV","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YIYMMI6JMFXVH5VS","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YIYMMI6J","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YIYMMI6JMFXVH5VSGZGO2QIDXG","target":"record","payload":{"canonical_record":{"source":{"id":"1812.07734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-12-17T14:33:18Z","cross_cats_sorted":[],"title_canon_sha256":"c8034e28f7a06a2741a8a414e2cc3fc52ffc55077097bcdff578090f506981cc","abstract_canon_sha256":"004a16fe1079b39b4f4a272077af4d5a5799bbce887a90c172446c629a8b0e53"},"schema_version":"1.0"},"canonical_sha256":"c230c623c9616f53f6b2364ced4103b9b36c9ff0af9e9e0cebb99fc2ae9d46b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:56.190904Z","signature_b64":"W3GCdJpE6jbl9H1P9d0eiLOl3gkgbLOldY0t8xHlgZEkPSrd1MI0FPTi1XVlNv32vhCxU4sn6769wu874x5ACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c230c623c9616f53f6b2364ced4103b9b36c9ff0af9e9e0cebb99fc2ae9d46b5","last_reissued_at":"2026-05-17T23:57:56.190290Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:56.190290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.07734","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-17T23:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I1mXv5f1CjvoZe84o1Dfq7QiAMyj3NTsrQzDKrLxuYVoyPamwqnag43SktCtpsnXHFgTNw854Pi/8PVxe32SCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:30:33.968074Z"},"content_sha256":"8566f4d74353272ec9815a3006c31d2a80a5e8b347b22ddd4c0ef2dae31cc531","schema_version":"1.0","event_id":"sha256:8566f4d74353272ec9815a3006c31d2a80a5e8b347b22ddd4c0ef2dae31cc531"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YIYMMI6JMFXVH5VSGZGO2QIDXG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimality Clue for Graph Coloring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Alexandre Gondran (ENAC), Laurent Moalic (Universit\\'e de Haute-Alsace (UHA))","submitted_at":"2018-12-17T14:33:18Z","abstract_excerpt":"In this paper, we present a new approach which qualifies or not a solution found by a heuristic as a potential optimal solution. Our approach is based on the following observation: for a minimization problem, the number of admissible solutions decreases with the value of the objective function. For the Graph Coloring Problem (GCP), we confirm this observation and present a new way to prove optimality. This proof is based on the counting of the number of different k-colorings and the number of independent sets of a given graph G. Exact solutions counting problems are difficult problems (\\#P-com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.07734","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-17T23:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eZM1ck+qvoex1o366rsY857RBanX5jFwLE0o/eQ62qRbAMNsuNMKzG5btipNFdzP2QTdwcoLfUyCdGpxL49xCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:30:33.968790Z"},"content_sha256":"de8d8441361e31c711267936da4f8c584fa2f685f88a5146f3aedf72931b671f","schema_version":"1.0","event_id":"sha256:de8d8441361e31c711267936da4f8c584fa2f685f88a5146f3aedf72931b671f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YIYMMI6JMFXVH5VSGZGO2QIDXG/bundle.json","state_url":"https://pith.science/pith/YIYMMI6JMFXVH5VSGZGO2QIDXG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YIYMMI6JMFXVH5VSGZGO2QIDXG/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-05T20:30:33Z","links":{"resolver":"https://pith.science/pith/YIYMMI6JMFXVH5VSGZGO2QIDXG","bundle":"https://pith.science/pith/YIYMMI6JMFXVH5VSGZGO2QIDXG/bundle.json","state":"https://pith.science/pith/YIYMMI6JMFXVH5VSGZGO2QIDXG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YIYMMI6JMFXVH5VSGZGO2QIDXG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YIYMMI6JMFXVH5VSGZGO2QIDXG","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":"004a16fe1079b39b4f4a272077af4d5a5799bbce887a90c172446c629a8b0e53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-12-17T14:33:18Z","title_canon_sha256":"c8034e28f7a06a2741a8a414e2cc3fc52ffc55077097bcdff578090f506981cc"},"schema_version":"1.0","source":{"id":"1812.07734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.07734","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1812.07734v1","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.07734","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"YIYMMI6JMFXV","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YIYMMI6JMFXVH5VS","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YIYMMI6J","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:de8d8441361e31c711267936da4f8c584fa2f685f88a5146f3aedf72931b671f","target":"graph","created_at":"2026-05-17T23:57: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"},"paper":{"abstract_excerpt":"In this paper, we present a new approach which qualifies or not a solution found by a heuristic as a potential optimal solution. Our approach is based on the following observation: for a minimization problem, the number of admissible solutions decreases with the value of the objective function. For the Graph Coloring Problem (GCP), we confirm this observation and present a new way to prove optimality. This proof is based on the counting of the number of different k-colorings and the number of independent sets of a given graph G. Exact solutions counting problems are difficult problems (\\#P-com","authors_text":"Alexandre Gondran (ENAC), Laurent Moalic (Universit\\'e de Haute-Alsace (UHA))","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-12-17T14:33:18Z","title":"Optimality Clue for Graph Coloring Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.07734","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:8566f4d74353272ec9815a3006c31d2a80a5e8b347b22ddd4c0ef2dae31cc531","target":"record","created_at":"2026-05-17T23:57: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":"004a16fe1079b39b4f4a272077af4d5a5799bbce887a90c172446c629a8b0e53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-12-17T14:33:18Z","title_canon_sha256":"c8034e28f7a06a2741a8a414e2cc3fc52ffc55077097bcdff578090f506981cc"},"schema_version":"1.0","source":{"id":"1812.07734","kind":"arxiv","version":1}},"canonical_sha256":"c230c623c9616f53f6b2364ced4103b9b36c9ff0af9e9e0cebb99fc2ae9d46b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c230c623c9616f53f6b2364ced4103b9b36c9ff0af9e9e0cebb99fc2ae9d46b5","first_computed_at":"2026-05-17T23:57:56.190290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:56.190290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W3GCdJpE6jbl9H1P9d0eiLOl3gkgbLOldY0t8xHlgZEkPSrd1MI0FPTi1XVlNv32vhCxU4sn6769wu874x5ACA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:56.190904Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.07734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8566f4d74353272ec9815a3006c31d2a80a5e8b347b22ddd4c0ef2dae31cc531","sha256:de8d8441361e31c711267936da4f8c584fa2f685f88a5146f3aedf72931b671f"],"state_sha256":"0927cc82ebfae4309fc1dd2334e045163c395830f84f9bdb3d8bac368fed30ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w9MAWxYZf31RTp4/u0Tp/Gja90MzrHlYwlxsCe0DciyEu6jAGYLcNBjwlCE5rF806cfp+JmU42OnkxKjQRUcAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:30:33.973022Z","bundle_sha256":"77c1f9607802dd4fe7fc39c6fc1f920e3b800a9161a7c03fc607f604bc4513a4"}}