{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7DBUZHV5NYUDMZDT7ZAQBBMJQJ","short_pith_number":"pith:7DBUZHV5","schema_version":"1.0","canonical_sha256":"f8c34c9ebd6e28366473fe4100858982719dc746aa55f18b4ebcba76fefc02f0","source":{"kind":"arxiv","id":"1304.5876","version":1},"attestation_state":"computed","paper":{"title":"Solving the minimum sum coloring problem via binary quadratic programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Fred Glover, Jin-Kao Hao, Yang Wang, Zhipeng L\\\"u","submitted_at":"2013-04-22T08:56:11Z","abstract_excerpt":"In recent years, binary quadratic programming (BQP) has been successively applied to solve several combinatorial optimization problems. We consider in this paper a study of using the BQP model to solve the minimum sum coloring problem (MSCP). For this purpose, we recast the MSCP with a quadratic model which is then solved via a recently proposed Path Relinking (PR) algorithm designed for the general BQP. Based on a set of MSCP benchmark instances, we investigate the performance of this solution approach compared with existing methods."},"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":"1304.5876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-22T08:56:11Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9de6e58135615770c9d1f812a653324ffbd9d4cc48a841ec0f094cfd87765129","abstract_canon_sha256":"ca65a45c3dc04ddc24f0e2f46b41fd7871101b205b265206e0a7f6e1eda4805c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:23.905271Z","signature_b64":"LV085adfH+XlobzNs3HWAtmGmW50xjoywUDo3Bgb4uBnnvD0hnqKKhQVnz7rcwdd05y2ciGY1bxPQxjfvhRNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8c34c9ebd6e28366473fe4100858982719dc746aa55f18b4ebcba76fefc02f0","last_reissued_at":"2026-05-18T03:27:23.904826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:23.904826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving the minimum sum coloring problem via binary quadratic programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Fred Glover, Jin-Kao Hao, Yang Wang, Zhipeng L\\\"u","submitted_at":"2013-04-22T08:56:11Z","abstract_excerpt":"In recent years, binary quadratic programming (BQP) has been successively applied to solve several combinatorial optimization problems. We consider in this paper a study of using the BQP model to solve the minimum sum coloring problem (MSCP). For this purpose, we recast the MSCP with a quadratic model which is then solved via a recently proposed Path Relinking (PR) algorithm designed for the general BQP. Based on a set of MSCP benchmark instances, we investigate the performance of this solution approach compared with existing methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5876","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":"1304.5876","created_at":"2026-05-18T03:27:23.904902+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.5876v1","created_at":"2026-05-18T03:27:23.904902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5876","created_at":"2026-05-18T03:27:23.904902+00:00"},{"alias_kind":"pith_short_12","alias_value":"7DBUZHV5NYUD","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7DBUZHV5NYUDMZDT","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7DBUZHV5","created_at":"2026-05-18T12:27:36.564083+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/7DBUZHV5NYUDMZDT7ZAQBBMJQJ","json":"https://pith.science/pith/7DBUZHV5NYUDMZDT7ZAQBBMJQJ.json","graph_json":"https://pith.science/api/pith-number/7DBUZHV5NYUDMZDT7ZAQBBMJQJ/graph.json","events_json":"https://pith.science/api/pith-number/7DBUZHV5NYUDMZDT7ZAQBBMJQJ/events.json","paper":"https://pith.science/paper/7DBUZHV5"},"agent_actions":{"view_html":"https://pith.science/pith/7DBUZHV5NYUDMZDT7ZAQBBMJQJ","download_json":"https://pith.science/pith/7DBUZHV5NYUDMZDT7ZAQBBMJQJ.json","view_paper":"https://pith.science/paper/7DBUZHV5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.5876&json=true","fetch_graph":"https://pith.science/api/pith-number/7DBUZHV5NYUDMZDT7ZAQBBMJQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/7DBUZHV5NYUDMZDT7ZAQBBMJQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7DBUZHV5NYUDMZDT7ZAQBBMJQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7DBUZHV5NYUDMZDT7ZAQBBMJQJ/action/storage_attestation","attest_author":"https://pith.science/pith/7DBUZHV5NYUDMZDT7ZAQBBMJQJ/action/author_attestation","sign_citation":"https://pith.science/pith/7DBUZHV5NYUDMZDT7ZAQBBMJQJ/action/citation_signature","submit_replication":"https://pith.science/pith/7DBUZHV5NYUDMZDT7ZAQBBMJQJ/action/replication_record"}},"created_at":"2026-05-18T03:27:23.904902+00:00","updated_at":"2026-05-18T03:27:23.904902+00:00"}