{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4IJ2LLVOW2QWEPETKYQA5VILEA","short_pith_number":"pith:4IJ2LLVO","canonical_record":{"source":{"id":"1405.7020","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-05-27T19:14:10Z","cross_cats_sorted":[],"title_canon_sha256":"e3b6cd6274d88b531e7cc0e07e1746732cc066be07b503d3f136e676619d9cf6","abstract_canon_sha256":"602a8d55d947e5936e8e2d070312d297d0621638fbf72029f836241f829123bb"},"schema_version":"1.0"},"canonical_sha256":"e213a5aeaeb6a1623c9356200ed50b2023e8b3ab145cac4db847a53e78acd40e","source":{"kind":"arxiv","id":"1405.7020","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7020","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7020v1","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7020","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"pith_short_12","alias_value":"4IJ2LLVOW2QW","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4IJ2LLVOW2QWEPET","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4IJ2LLVO","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4IJ2LLVOW2QWEPETKYQA5VILEA","target":"record","payload":{"canonical_record":{"source":{"id":"1405.7020","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-05-27T19:14:10Z","cross_cats_sorted":[],"title_canon_sha256":"e3b6cd6274d88b531e7cc0e07e1746732cc066be07b503d3f136e676619d9cf6","abstract_canon_sha256":"602a8d55d947e5936e8e2d070312d297d0621638fbf72029f836241f829123bb"},"schema_version":"1.0"},"canonical_sha256":"e213a5aeaeb6a1623c9356200ed50b2023e8b3ab145cac4db847a53e78acd40e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:59.698068Z","signature_b64":"xn1DKF1nRaow0Xv3Z9hZWQrwnBj7LLN+8qvPec5OkV6ipGyQdYcwIK7QINnLO3yNfUq+WEiWte/tC24CH2LuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e213a5aeaeb6a1623c9356200ed50b2023e8b3ab145cac4db847a53e78acd40e","last_reissued_at":"2026-05-18T00:31:59.697584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:59.697584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.7020","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-18T00:31:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dc5Zoev4Ur3LkNYq6zfK2daNKilYfVEgXT2gyMCWIcCPK7uvzBCP2HxNTxjwvOOoxPPHkBF27AZMh7ZZAgwzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:39:12.544340Z"},"content_sha256":"5fc8c9167d67f27cc624a2926d20a373001f4413287ae9a6e2e63a313e41fdd4","schema_version":"1.0","event_id":"sha256:5fc8c9167d67f27cc624a2926d20a373001f4413287ae9a6e2e63a313e41fdd4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4IJ2LLVOW2QWEPETKYQA5VILEA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A tabu search heuristic for the Equitable Coloring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Daniel Sever\\'in, Graciela Nasini, Isabel M\\'endez D\\'iaz","submitted_at":"2014-05-27T19:14:10Z","abstract_excerpt":"The Equitable Coloring Problem is a variant of the Graph Coloring Problem where the sizes of two arbitrary color classes differ in at most one unit. This additional condition, called equity constraints, arises naturally in several applications. Due to the hardness of the problem, current exact algorithms can not solve large-sized instances. Such instances must be addressed only via heuristic methods. In this paper we present a tabu search heuristic for the Equitable Coloring Problem. This algorithm is an adaptation of the dynamic TabuCol version of Galinier and Hao. In order to satisfy equity "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7020","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-18T00:31:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bmXFVlKWGLv1NsnFhhxCbUf+28yB2d7FKu2sUNPS/3o6nembQayH0VHNIyWWcwJQ3nSorKOxbZ+oj66Khuy4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:39:12.545014Z"},"content_sha256":"d1757a20c13eb7ef32a3f92a148d15a0e8b177a95285bcac172c43ea7fe5cfe1","schema_version":"1.0","event_id":"sha256:d1757a20c13eb7ef32a3f92a148d15a0e8b177a95285bcac172c43ea7fe5cfe1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4IJ2LLVOW2QWEPETKYQA5VILEA/bundle.json","state_url":"https://pith.science/pith/4IJ2LLVOW2QWEPETKYQA5VILEA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4IJ2LLVOW2QWEPETKYQA5VILEA/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-31T08:39:12Z","links":{"resolver":"https://pith.science/pith/4IJ2LLVOW2QWEPETKYQA5VILEA","bundle":"https://pith.science/pith/4IJ2LLVOW2QWEPETKYQA5VILEA/bundle.json","state":"https://pith.science/pith/4IJ2LLVOW2QWEPETKYQA5VILEA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4IJ2LLVOW2QWEPETKYQA5VILEA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4IJ2LLVOW2QWEPETKYQA5VILEA","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":"602a8d55d947e5936e8e2d070312d297d0621638fbf72029f836241f829123bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-05-27T19:14:10Z","title_canon_sha256":"e3b6cd6274d88b531e7cc0e07e1746732cc066be07b503d3f136e676619d9cf6"},"schema_version":"1.0","source":{"id":"1405.7020","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7020","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7020v1","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7020","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"pith_short_12","alias_value":"4IJ2LLVOW2QW","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4IJ2LLVOW2QWEPET","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4IJ2LLVO","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:d1757a20c13eb7ef32a3f92a148d15a0e8b177a95285bcac172c43ea7fe5cfe1","target":"graph","created_at":"2026-05-18T00:31:59Z","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":"The Equitable Coloring Problem is a variant of the Graph Coloring Problem where the sizes of two arbitrary color classes differ in at most one unit. This additional condition, called equity constraints, arises naturally in several applications. Due to the hardness of the problem, current exact algorithms can not solve large-sized instances. Such instances must be addressed only via heuristic methods. In this paper we present a tabu search heuristic for the Equitable Coloring Problem. This algorithm is an adaptation of the dynamic TabuCol version of Galinier and Hao. In order to satisfy equity ","authors_text":"Daniel Sever\\'in, Graciela Nasini, Isabel M\\'endez D\\'iaz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-05-27T19:14:10Z","title":"A tabu search heuristic for the Equitable Coloring Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7020","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:5fc8c9167d67f27cc624a2926d20a373001f4413287ae9a6e2e63a313e41fdd4","target":"record","created_at":"2026-05-18T00:31:59Z","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":"602a8d55d947e5936e8e2d070312d297d0621638fbf72029f836241f829123bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-05-27T19:14:10Z","title_canon_sha256":"e3b6cd6274d88b531e7cc0e07e1746732cc066be07b503d3f136e676619d9cf6"},"schema_version":"1.0","source":{"id":"1405.7020","kind":"arxiv","version":1}},"canonical_sha256":"e213a5aeaeb6a1623c9356200ed50b2023e8b3ab145cac4db847a53e78acd40e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e213a5aeaeb6a1623c9356200ed50b2023e8b3ab145cac4db847a53e78acd40e","first_computed_at":"2026-05-18T00:31:59.697584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:59.697584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xn1DKF1nRaow0Xv3Z9hZWQrwnBj7LLN+8qvPec5OkV6ipGyQdYcwIK7QINnLO3yNfUq+WEiWte/tC24CH2LuAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:59.698068Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.7020","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5fc8c9167d67f27cc624a2926d20a373001f4413287ae9a6e2e63a313e41fdd4","sha256:d1757a20c13eb7ef32a3f92a148d15a0e8b177a95285bcac172c43ea7fe5cfe1"],"state_sha256":"e108ea1d38baa1496aee73f4f27b44fd17dbdfa5f4d56810f4ca480c405ffb1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NwlnBTyfNxmx3LZXnztonjRVjP6NR1XheNbVyWEps6hS8J0QIFtuy6uukfdC6bYdRUE/YDssuaPVZQVH5vL/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:39:12.548381Z","bundle_sha256":"329897f6e973a80591bfe98bf1155a19880eb0587fb9eba3c332790ce014c420"}}