{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YIYMMI6JMFXVH5VSGZGO2QIDXG","short_pith_number":"pith:YIYMMI6J","schema_version":"1.0","canonical_sha256":"c230c623c9616f53f6b2364ced4103b9b36c9ff0af9e9e0cebb99fc2ae9d46b5","source":{"kind":"arxiv","id":"1812.07734","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.07734","created_at":"2026-05-17T23:57:56.190391+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.07734v1","created_at":"2026-05-17T23:57:56.190391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.07734","created_at":"2026-05-17T23:57:56.190391+00:00"},{"alias_kind":"pith_short_12","alias_value":"YIYMMI6JMFXV","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YIYMMI6JMFXVH5VS","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YIYMMI6J","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YIYMMI6JMFXVH5VSGZGO2QIDXG","json":"https://pith.science/pith/YIYMMI6JMFXVH5VSGZGO2QIDXG.json","graph_json":"https://pith.science/api/pith-number/YIYMMI6JMFXVH5VSGZGO2QIDXG/graph.json","events_json":"https://pith.science/api/pith-number/YIYMMI6JMFXVH5VSGZGO2QIDXG/events.json","paper":"https://pith.science/paper/YIYMMI6J"},"agent_actions":{"view_html":"https://pith.science/pith/YIYMMI6JMFXVH5VSGZGO2QIDXG","download_json":"https://pith.science/pith/YIYMMI6JMFXVH5VSGZGO2QIDXG.json","view_paper":"https://pith.science/paper/YIYMMI6J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.07734&json=true","fetch_graph":"https://pith.science/api/pith-number/YIYMMI6JMFXVH5VSGZGO2QIDXG/graph.json","fetch_events":"https://pith.science/api/pith-number/YIYMMI6JMFXVH5VSGZGO2QIDXG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YIYMMI6JMFXVH5VSGZGO2QIDXG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YIYMMI6JMFXVH5VSGZGO2QIDXG/action/storage_attestation","attest_author":"https://pith.science/pith/YIYMMI6JMFXVH5VSGZGO2QIDXG/action/author_attestation","sign_citation":"https://pith.science/pith/YIYMMI6JMFXVH5VSGZGO2QIDXG/action/citation_signature","submit_replication":"https://pith.science/pith/YIYMMI6JMFXVH5VSGZGO2QIDXG/action/replication_record"}},"created_at":"2026-05-17T23:57:56.190391+00:00","updated_at":"2026-05-17T23:57:56.190391+00:00"}