{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BXNPSZXQQGC7DMJLPUXYNZNNGM","short_pith_number":"pith:BXNPSZXQ","schema_version":"1.0","canonical_sha256":"0ddaf966f08185f1b12b7d2f86e5ad33267e04b473a9adc6284bfc47779582c8","source":{"kind":"arxiv","id":"1706.10191","version":2},"attestation_state":"computed","paper":{"title":"New Integer Linear Programming Models for the Vertex Coloring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Adalat Jabrayilov, Petra Mutzel","submitted_at":"2017-06-30T13:37:16Z","abstract_excerpt":"The vertex coloring problem asks for the minimum number of colors that can be assigned to the vertices of a given graph such that for all vertices v the color of v is different from the color of any of its neighbors. The problem is NP-hard. Here, we introduce new integer linear programming formulations based on partial orderings. They have the advantage that they are as simple to work with as the classical assignment formulation, since they can be fed directly into a standard integer linear programming solver. We evaluate our new models using Gurobi and show that our new simple approach is a g"},"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":"1706.10191","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-06-30T13:37:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"97f35135307c48c10ac10b077c5c88c20193421a6ea0c4d72196fd834cc29411","abstract_canon_sha256":"0058b8e098295a1fa91a098db12ab3560757a32bcee1bf90ddaffa6289757c4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:29.821040Z","signature_b64":"JDAMD4lkt+McKMuoB2c6fBfZ6/QqwCKcJFm3OGy6Mq++gJt/GYDu+urv3LwdBCz9DJQ42ILYsrrTTE4UzrndDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ddaf966f08185f1b12b7d2f86e5ad33267e04b473a9adc6284bfc47779582c8","last_reissued_at":"2026-05-18T00:40:29.820631Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:29.820631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Integer Linear Programming Models for the Vertex Coloring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Adalat Jabrayilov, Petra Mutzel","submitted_at":"2017-06-30T13:37:16Z","abstract_excerpt":"The vertex coloring problem asks for the minimum number of colors that can be assigned to the vertices of a given graph such that for all vertices v the color of v is different from the color of any of its neighbors. The problem is NP-hard. Here, we introduce new integer linear programming formulations based on partial orderings. They have the advantage that they are as simple to work with as the classical assignment formulation, since they can be fed directly into a standard integer linear programming solver. We evaluate our new models using Gurobi and show that our new simple approach is a g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.10191","kind":"arxiv","version":2},"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":"1706.10191","created_at":"2026-05-18T00:40:29.820695+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.10191v2","created_at":"2026-05-18T00:40:29.820695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.10191","created_at":"2026-05-18T00:40:29.820695+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXNPSZXQQGC7","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXNPSZXQQGC7DMJL","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXNPSZXQ","created_at":"2026-05-18T12:31:08.081275+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/BXNPSZXQQGC7DMJLPUXYNZNNGM","json":"https://pith.science/pith/BXNPSZXQQGC7DMJLPUXYNZNNGM.json","graph_json":"https://pith.science/api/pith-number/BXNPSZXQQGC7DMJLPUXYNZNNGM/graph.json","events_json":"https://pith.science/api/pith-number/BXNPSZXQQGC7DMJLPUXYNZNNGM/events.json","paper":"https://pith.science/paper/BXNPSZXQ"},"agent_actions":{"view_html":"https://pith.science/pith/BXNPSZXQQGC7DMJLPUXYNZNNGM","download_json":"https://pith.science/pith/BXNPSZXQQGC7DMJLPUXYNZNNGM.json","view_paper":"https://pith.science/paper/BXNPSZXQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.10191&json=true","fetch_graph":"https://pith.science/api/pith-number/BXNPSZXQQGC7DMJLPUXYNZNNGM/graph.json","fetch_events":"https://pith.science/api/pith-number/BXNPSZXQQGC7DMJLPUXYNZNNGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXNPSZXQQGC7DMJLPUXYNZNNGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXNPSZXQQGC7DMJLPUXYNZNNGM/action/storage_attestation","attest_author":"https://pith.science/pith/BXNPSZXQQGC7DMJLPUXYNZNNGM/action/author_attestation","sign_citation":"https://pith.science/pith/BXNPSZXQQGC7DMJLPUXYNZNNGM/action/citation_signature","submit_replication":"https://pith.science/pith/BXNPSZXQQGC7DMJLPUXYNZNNGM/action/replication_record"}},"created_at":"2026-05-18T00:40:29.820695+00:00","updated_at":"2026-05-18T00:40:29.820695+00:00"}