{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BWATHST5BOC7CIZH4WTOAFSDIO","short_pith_number":"pith:BWATHST5","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"},"canonical_sha256":"0d8133ca7d0b85f12327e5a6e0164343b81a858f5f2d4f6e422910b618b85adf","source":{"kind":"arxiv","id":"1304.2641","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2641","created_at":"2026-05-18T03:00:00Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2641v1","created_at":"2026-05-18T03:00:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2641","created_at":"2026-05-18T03:00:00Z"},{"alias_kind":"pith_short_12","alias_value":"BWATHST5BOC7","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BWATHST5BOC7CIZH","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BWATHST5","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BWATHST5BOC7CIZH4WTOAFSDIO","target":"record","payload":{"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"},"canonical_sha256":"0d8133ca7d0b85f12327e5a6e0164343b81a858f5f2d4f6e422910b618b85adf","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"},"source_kind":"arxiv","source_id":"1304.2641","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:00:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mhJjAL66ulcqMoMuVDYu8TdcoM0LgPnTRsdRDuKQMX1hd4QdU+jqnnYS7DQ2Hs0wons960MWwXcifzAoytuuAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T13:24:10.475683Z"},"content_sha256":"7f6abcda7759f59c16e288ef4e1b5d1564ff4cf4c7fa62cf6c090c9b5a841047","schema_version":"1.0","event_id":"sha256:7f6abcda7759f59c16e288ef4e1b5d1564ff4cf4c7fa62cf6c090c9b5a841047"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BWATHST5BOC7CIZH4WTOAFSDIO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:00:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/FhPtXh26V9Za8+SwG8EZQiNFmHhddnGG3M9q7u5E0urHSb6Emz6GP3FcwFkpF7m7r7bzoPox9rcD0WcVXbSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T13:24:10.476266Z"},"content_sha256":"3381744380dd275f3e86491a7f6648a96bc5bd3ac38478bceff6b073bc3d789a","schema_version":"1.0","event_id":"sha256:3381744380dd275f3e86491a7f6648a96bc5bd3ac38478bceff6b073bc3d789a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWATHST5BOC7CIZH4WTOAFSDIO/bundle.json","state_url":"https://pith.science/pith/BWATHST5BOC7CIZH4WTOAFSDIO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWATHST5BOC7CIZH4WTOAFSDIO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-19T13:24:10Z","links":{"resolver":"https://pith.science/pith/BWATHST5BOC7CIZH4WTOAFSDIO","bundle":"https://pith.science/pith/BWATHST5BOC7CIZH4WTOAFSDIO/bundle.json","state":"https://pith.science/pith/BWATHST5BOC7CIZH4WTOAFSDIO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWATHST5BOC7CIZH4WTOAFSDIO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BWATHST5BOC7CIZH4WTOAFSDIO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c6377a8848b6f929cbf96a18b591080edf4eca8aa7bbb5ff777e64435cc18180","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-09T15:54:53Z","title_canon_sha256":"51ad6d25455c0f6961f1eb801538a0b12a80e1da3b74fe2d7e96eebebc4a81b1"},"schema_version":"1.0","source":{"id":"1304.2641","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2641","created_at":"2026-05-18T03:00:00Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2641v1","created_at":"2026-05-18T03:00:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2641","created_at":"2026-05-18T03:00:00Z"},{"alias_kind":"pith_short_12","alias_value":"BWATHST5BOC7","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BWATHST5BOC7CIZH","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BWATHST5","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:3381744380dd275f3e86491a7f6648a96bc5bd3ac38478bceff6b073bc3d789a","target":"graph","created_at":"2026-05-18T03:00:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jean-Philippe Hamiez, Jin-Kao Hao, Yan Jin","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-09T15:54:53Z","title":"A memetic algorithm for the minimum sum coloring problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2641","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7f6abcda7759f59c16e288ef4e1b5d1564ff4cf4c7fa62cf6c090c9b5a841047","target":"record","created_at":"2026-05-18T03:00:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c6377a8848b6f929cbf96a18b591080edf4eca8aa7bbb5ff777e64435cc18180","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-09T15:54:53Z","title_canon_sha256":"51ad6d25455c0f6961f1eb801538a0b12a80e1da3b74fe2d7e96eebebc4a81b1"},"schema_version":"1.0","source":{"id":"1304.2641","kind":"arxiv","version":1}},"canonical_sha256":"0d8133ca7d0b85f12327e5a6e0164343b81a858f5f2d4f6e422910b618b85adf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d8133ca7d0b85f12327e5a6e0164343b81a858f5f2d4f6e422910b618b85adf","first_computed_at":"2026-05-18T03:00:00.983976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:00.983976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6/iFty7yE4u+cs8rlparwf+WBPO4mw3xtMYss5dG1CJULjO6IBJmTPB8syJNzL6/aAd++RvziXYZ4VBYjBDqCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:00.984814Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.2641","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f6abcda7759f59c16e288ef4e1b5d1564ff4cf4c7fa62cf6c090c9b5a841047","sha256:3381744380dd275f3e86491a7f6648a96bc5bd3ac38478bceff6b073bc3d789a"],"state_sha256":"e8285adf569e4be8d579fc9301e2520ea371c33f49081b5175f73a01594dc7a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SnkMh2jp1VoLJFnhl4sc99FdNlNOWx6U/nqI0pwmhqg4hEnrl5DhYpEV3g2ZgubgOdIhItvr8MJNLdZeJc75DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T13:24:10.478846Z","bundle_sha256":"d11d65b4a8f75d3dd200a91f8547ea7e7e43957b6f21df4151efe415f03531a6"}}