{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2VENPSMJFSIWK3WVSROUV3MDN6","short_pith_number":"pith:2VENPSMJ","schema_version":"1.0","canonical_sha256":"d548d7c9892c91656ed5945d4aed836f8e6840756813a2e5dfea5d3799577d65","source":{"kind":"arxiv","id":"1106.3349","version":1},"attestation_state":"computed","paper":{"title":"Polyhedral results 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:43Z","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 of the effectiveness of including these inequalities as cuts in a Branch & Cut 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.3349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-06-16T21:01:43Z","cross_cats_sorted":[],"title_canon_sha256":"b942b7f36aca580239aa442cf3489c4ad93257d6e65c6aa2893790160c73dab2","abstract_canon_sha256":"aac230f78ba9b95860d77e396e873e12f15ece3e23b6e4034404cb2c5c0d2d86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:06.790974Z","signature_b64":"Nm/R3nT/9Mh0qILIiAngYEtaIUqDRRMaRsmgocqf7XQgBR3UQdXigtKHY1I1koV3YCvcYbnauxm/fJ/00olpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d548d7c9892c91656ed5945d4aed836f8e6840756813a2e5dfea5d3799577d65","last_reissued_at":"2026-05-18T02:51:06.790551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:06.790551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polyhedral results 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:43Z","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 of the effectiveness of including these inequalities as cuts in a Branch & Cut algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3349","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":"1106.3349","created_at":"2026-05-18T02:51:06.790607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.3349v1","created_at":"2026-05-18T02:51:06.790607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3349","created_at":"2026-05-18T02:51:06.790607+00:00"},{"alias_kind":"pith_short_12","alias_value":"2VENPSMJFSIW","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2VENPSMJFSIWK3WV","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2VENPSMJ","created_at":"2026-05-18T12:26:18.847500+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/2VENPSMJFSIWK3WVSROUV3MDN6","json":"https://pith.science/pith/2VENPSMJFSIWK3WVSROUV3MDN6.json","graph_json":"https://pith.science/api/pith-number/2VENPSMJFSIWK3WVSROUV3MDN6/graph.json","events_json":"https://pith.science/api/pith-number/2VENPSMJFSIWK3WVSROUV3MDN6/events.json","paper":"https://pith.science/paper/2VENPSMJ"},"agent_actions":{"view_html":"https://pith.science/pith/2VENPSMJFSIWK3WVSROUV3MDN6","download_json":"https://pith.science/pith/2VENPSMJFSIWK3WVSROUV3MDN6.json","view_paper":"https://pith.science/paper/2VENPSMJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.3349&json=true","fetch_graph":"https://pith.science/api/pith-number/2VENPSMJFSIWK3WVSROUV3MDN6/graph.json","fetch_events":"https://pith.science/api/pith-number/2VENPSMJFSIWK3WVSROUV3MDN6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2VENPSMJFSIWK3WVSROUV3MDN6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2VENPSMJFSIWK3WVSROUV3MDN6/action/storage_attestation","attest_author":"https://pith.science/pith/2VENPSMJFSIWK3WVSROUV3MDN6/action/author_attestation","sign_citation":"https://pith.science/pith/2VENPSMJFSIWK3WVSROUV3MDN6/action/citation_signature","submit_replication":"https://pith.science/pith/2VENPSMJFSIWK3WVSROUV3MDN6/action/replication_record"}},"created_at":"2026-05-18T02:51:06.790607+00:00","updated_at":"2026-05-18T02:51:06.790607+00:00"}