{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:OHYWFRTFXIYIUC6KASCGSITU5T","short_pith_number":"pith:OHYWFRTF","schema_version":"1.0","canonical_sha256":"71f162c665ba308a0bca0484692274ece4530c749f65ef59ca561191d3b29ce6","source":{"kind":"arxiv","id":"0710.3603","version":3},"attestation_state":"computed","paper":{"title":"On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Andrew J. Parkes, Edmund K. Burke, Hana Rudova, Jakub Marecek","submitted_at":"2007-10-18T21:38:37Z","abstract_excerpt":"Vertex colouring is a well-known problem in combinatorial optimisation, whose alternative integer programming formulations have recently attracted considerable attention. This paper briefly surveys seven known formulations of vertex colouring and introduces a formulation of vertex colouring using a suitable clique partition of the graph. This formulation is applicable in timetabling applications, where such a clique partition of the conflict graph is given implicitly. In contrast with some alternatives, the presented formulation can also be easily extended to accommodate complex performance in"},"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":"0710.3603","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2007-10-18T21:38:37Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"be2872560c13c4c2605462c86e09a88668e8930bd48e7082595e1853aab840ff","abstract_canon_sha256":"d634c028889c510aa25da1f0354da3ce95b0eb1688653a43591e60c08b8063ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:38.151048Z","signature_b64":"v3MAOMQ9SESXSwh6iD10FVJFuFjbQGX+KNDEKM1oG6J++NrYvVlH3QNEZUH1IFf+HwP9ZVG9xm0Mj8j9bjMTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71f162c665ba308a0bca0484692274ece4530c749f65ef59ca561191d3b29ce6","last_reissued_at":"2026-05-18T02:54:38.150575Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:38.150575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Andrew J. Parkes, Edmund K. Burke, Hana Rudova, Jakub Marecek","submitted_at":"2007-10-18T21:38:37Z","abstract_excerpt":"Vertex colouring is a well-known problem in combinatorial optimisation, whose alternative integer programming formulations have recently attracted considerable attention. This paper briefly surveys seven known formulations of vertex colouring and introduces a formulation of vertex colouring using a suitable clique partition of the graph. This formulation is applicable in timetabling applications, where such a clique partition of the conflict graph is given implicitly. In contrast with some alternatives, the presented formulation can also be easily extended to accommodate complex performance in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.3603","kind":"arxiv","version":3},"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":"0710.3603","created_at":"2026-05-18T02:54:38.150665+00:00"},{"alias_kind":"arxiv_version","alias_value":"0710.3603v3","created_at":"2026-05-18T02:54:38.150665+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.3603","created_at":"2026-05-18T02:54:38.150665+00:00"},{"alias_kind":"pith_short_12","alias_value":"OHYWFRTFXIYI","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"OHYWFRTFXIYIUC6K","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"OHYWFRTF","created_at":"2026-05-18T12:25:55.427421+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/OHYWFRTFXIYIUC6KASCGSITU5T","json":"https://pith.science/pith/OHYWFRTFXIYIUC6KASCGSITU5T.json","graph_json":"https://pith.science/api/pith-number/OHYWFRTFXIYIUC6KASCGSITU5T/graph.json","events_json":"https://pith.science/api/pith-number/OHYWFRTFXIYIUC6KASCGSITU5T/events.json","paper":"https://pith.science/paper/OHYWFRTF"},"agent_actions":{"view_html":"https://pith.science/pith/OHYWFRTFXIYIUC6KASCGSITU5T","download_json":"https://pith.science/pith/OHYWFRTFXIYIUC6KASCGSITU5T.json","view_paper":"https://pith.science/paper/OHYWFRTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0710.3603&json=true","fetch_graph":"https://pith.science/api/pith-number/OHYWFRTFXIYIUC6KASCGSITU5T/graph.json","fetch_events":"https://pith.science/api/pith-number/OHYWFRTFXIYIUC6KASCGSITU5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OHYWFRTFXIYIUC6KASCGSITU5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OHYWFRTFXIYIUC6KASCGSITU5T/action/storage_attestation","attest_author":"https://pith.science/pith/OHYWFRTFXIYIUC6KASCGSITU5T/action/author_attestation","sign_citation":"https://pith.science/pith/OHYWFRTFXIYIUC6KASCGSITU5T/action/citation_signature","submit_replication":"https://pith.science/pith/OHYWFRTFXIYIUC6KASCGSITU5T/action/replication_record"}},"created_at":"2026-05-18T02:54:38.150665+00:00","updated_at":"2026-05-18T02:54:38.150665+00:00"}