{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RQ4RDZ24JH5GXWUEEUASAL4ONM","short_pith_number":"pith:RQ4RDZ24","schema_version":"1.0","canonical_sha256":"8c3911e75c49fa6bda842501202f8e6b23a34f9c96bd9ed34c69c5d88018a94a","source":{"kind":"arxiv","id":"1106.3348","version":2},"attestation_state":"computed","paper":{"title":"A polyhedral approach for the Equitable Coloring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Daniel Severin, Graciela Nasini, Isabel M\\'endez-D\\'iaz","submitted_at":"2011-06-16T21:01:16Z","abstract_excerpt":"In this work we study the polytope associated with a 0,1-integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining inequalities. We also present computational evidence that shows the efficacy of these inequalities used in a cutting-plane algorithm."},"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":"1106.3348","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-06-16T21:01:16Z","cross_cats_sorted":[],"title_canon_sha256":"46a61dbc88c3f0fd1f41144c58fb1e37bb605f5fc64c7e187a4fe9db6b15b371","abstract_canon_sha256":"9c26474b6dc04926baa4cb9b93936f0f035b262886292afc87d90b06b1931c04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:43.907897Z","signature_b64":"VyXjY+wgz7fAir0pDFS1ckhHBOW6W8rLk6ga3tqVZYv1IBiQMeGrB04ADELrSc9bkC/WRCpBi69zCzu9SLImDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c3911e75c49fa6bda842501202f8e6b23a34f9c96bd9ed34c69c5d88018a94a","last_reissued_at":"2026-05-18T02:21:43.907475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:43.907475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A polyhedral approach for the Equitable Coloring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Daniel Severin, Graciela Nasini, Isabel M\\'endez-D\\'iaz","submitted_at":"2011-06-16T21:01:16Z","abstract_excerpt":"In this work we study the polytope associated with a 0,1-integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining inequalities. We also present computational evidence that shows the efficacy of these inequalities used in a cutting-plane algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3348","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":"1106.3348","created_at":"2026-05-18T02:21:43.907540+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.3348v2","created_at":"2026-05-18T02:21:43.907540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3348","created_at":"2026-05-18T02:21:43.907540+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQ4RDZ24JH5G","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQ4RDZ24JH5GXWUE","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQ4RDZ24","created_at":"2026-05-18T12:26:41.206345+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/RQ4RDZ24JH5GXWUEEUASAL4ONM","json":"https://pith.science/pith/RQ4RDZ24JH5GXWUEEUASAL4ONM.json","graph_json":"https://pith.science/api/pith-number/RQ4RDZ24JH5GXWUEEUASAL4ONM/graph.json","events_json":"https://pith.science/api/pith-number/RQ4RDZ24JH5GXWUEEUASAL4ONM/events.json","paper":"https://pith.science/paper/RQ4RDZ24"},"agent_actions":{"view_html":"https://pith.science/pith/RQ4RDZ24JH5GXWUEEUASAL4ONM","download_json":"https://pith.science/pith/RQ4RDZ24JH5GXWUEEUASAL4ONM.json","view_paper":"https://pith.science/paper/RQ4RDZ24","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.3348&json=true","fetch_graph":"https://pith.science/api/pith-number/RQ4RDZ24JH5GXWUEEUASAL4ONM/graph.json","fetch_events":"https://pith.science/api/pith-number/RQ4RDZ24JH5GXWUEEUASAL4ONM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQ4RDZ24JH5GXWUEEUASAL4ONM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQ4RDZ24JH5GXWUEEUASAL4ONM/action/storage_attestation","attest_author":"https://pith.science/pith/RQ4RDZ24JH5GXWUEEUASAL4ONM/action/author_attestation","sign_citation":"https://pith.science/pith/RQ4RDZ24JH5GXWUEEUASAL4ONM/action/citation_signature","submit_replication":"https://pith.science/pith/RQ4RDZ24JH5GXWUEEUASAL4ONM/action/replication_record"}},"created_at":"2026-05-18T02:21:43.907540+00:00","updated_at":"2026-05-18T02:21:43.907540+00:00"}