{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BWATHST5BOC7CIZH4WTOAFSDIO","short_pith_number":"pith:BWATHST5","schema_version":"1.0","canonical_sha256":"0d8133ca7d0b85f12327e5a6e0164343b81a858f5f2d4f6e422910b618b85adf","source":{"kind":"arxiv","id":"1304.2641","version":1},"attestation_state":"computed","paper":{"title":"A memetic algorithm for the minimum sum coloring problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Jean-Philippe Hamiez, Jin-Kao Hao, Yan Jin","submitted_at":"2013-04-09T15:54:53Z","abstract_excerpt":"Given an undirected graph $G$, the Minimum Sum Coloring problem (MSCP) is to find a legal assignment of colors (represented by natural numbers) to each vertex of $G$ such that the total sum of the colors assigned to the vertices is minimized. This paper presents a memetic algorithm for MSCP based on a tabu search procedure with two neighborhoods and a multi-parent crossover operator. Experiments on a set of 77 well-known DIMACS and COLOR 2002-2004 benchmark instances show that the proposed algorithm achieves highly competitive results in comparison with five state-of-the-art algorithms. In par"},"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.2641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-09T15:54:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"51ad6d25455c0f6961f1eb801538a0b12a80e1da3b74fe2d7e96eebebc4a81b1","abstract_canon_sha256":"c6377a8848b6f929cbf96a18b591080edf4eca8aa7bbb5ff777e64435cc18180"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:00.984814Z","signature_b64":"6/iFty7yE4u+cs8rlparwf+WBPO4mw3xtMYss5dG1CJULjO6IBJmTPB8syJNzL6/aAd++RvziXYZ4VBYjBDqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d8133ca7d0b85f12327e5a6e0164343b81a858f5f2d4f6e422910b618b85adf","last_reissued_at":"2026-05-18T03:00:00.983976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:00.983976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A memetic algorithm for the minimum sum coloring problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Jean-Philippe Hamiez, Jin-Kao Hao, Yan Jin","submitted_at":"2013-04-09T15:54:53Z","abstract_excerpt":"Given an undirected graph $G$, the Minimum Sum Coloring problem (MSCP) is to find a legal assignment of colors (represented by natural numbers) to each vertex of $G$ such that the total sum of the colors assigned to the vertices is minimized. This paper presents a memetic algorithm for MSCP based on a tabu search procedure with two neighborhoods and a multi-parent crossover operator. Experiments on a set of 77 well-known DIMACS and COLOR 2002-2004 benchmark instances show that the proposed algorithm achieves highly competitive results in comparison with five state-of-the-art algorithms. In par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2641","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.2641","created_at":"2026-05-18T03:00:00.984119+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.2641v1","created_at":"2026-05-18T03:00:00.984119+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2641","created_at":"2026-05-18T03:00:00.984119+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWATHST5BOC7","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWATHST5BOC7CIZH","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWATHST5","created_at":"2026-05-18T12:27:40.988391+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/BWATHST5BOC7CIZH4WTOAFSDIO","json":"https://pith.science/pith/BWATHST5BOC7CIZH4WTOAFSDIO.json","graph_json":"https://pith.science/api/pith-number/BWATHST5BOC7CIZH4WTOAFSDIO/graph.json","events_json":"https://pith.science/api/pith-number/BWATHST5BOC7CIZH4WTOAFSDIO/events.json","paper":"https://pith.science/paper/BWATHST5"},"agent_actions":{"view_html":"https://pith.science/pith/BWATHST5BOC7CIZH4WTOAFSDIO","download_json":"https://pith.science/pith/BWATHST5BOC7CIZH4WTOAFSDIO.json","view_paper":"https://pith.science/paper/BWATHST5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.2641&json=true","fetch_graph":"https://pith.science/api/pith-number/BWATHST5BOC7CIZH4WTOAFSDIO/graph.json","fetch_events":"https://pith.science/api/pith-number/BWATHST5BOC7CIZH4WTOAFSDIO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWATHST5BOC7CIZH4WTOAFSDIO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWATHST5BOC7CIZH4WTOAFSDIO/action/storage_attestation","attest_author":"https://pith.science/pith/BWATHST5BOC7CIZH4WTOAFSDIO/action/author_attestation","sign_citation":"https://pith.science/pith/BWATHST5BOC7CIZH4WTOAFSDIO/action/citation_signature","submit_replication":"https://pith.science/pith/BWATHST5BOC7CIZH4WTOAFSDIO/action/replication_record"}},"created_at":"2026-05-18T03:00:00.984119+00:00","updated_at":"2026-05-18T03:00:00.984119+00:00"}