{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:N6I4RNDIAHZJIDAK4PRVR6IUXG","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":"bbf5a3b2df4300a8139f1816739dc7cc31b2082ecc9f91398bdace561cbd8df5","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-18T16:42:24Z","title_canon_sha256":"b1b4fb935c328e98f1bd02668ad269616dedcc9f2975b3de05437a61379c5363"},"schema_version":"1.0","source":{"id":"2605.18634","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18634","created_at":"2026-05-20T00:06:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18634v1","created_at":"2026-05-20T00:06:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18634","created_at":"2026-05-20T00:06:11Z"},{"alias_kind":"pith_short_12","alias_value":"N6I4RNDIAHZJ","created_at":"2026-05-20T00:06:11Z"},{"alias_kind":"pith_short_16","alias_value":"N6I4RNDIAHZJIDAK","created_at":"2026-05-20T00:06:11Z"},{"alias_kind":"pith_short_8","alias_value":"N6I4RNDI","created_at":"2026-05-20T00:06:11Z"}],"graph_snapshots":[{"event_id":"sha256:62720958e002bdeb20c54d6b714f5dd58eebe1300c0ffaaf9ce7fd5e23da870d","target":"graph","created_at":"2026-05-20T00:06:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T00:01:59.198620Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.18634/integrity.json","findings":[],"snapshot_sha256":"73ad2342962516d140c2ade07ec6eec9aee950b8fb882894f7e8fee1c23c6841","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A proper coloring $c$ of a simple graph $G$ is harmonious if, for every pair of distinct edges $uv,xy\\in E(G)$, we have that $\\{c(u),c(v)\\}\\neq \\{c(x),c(y)\\}$. The harmonious chromatic number of $G$, denoted by $h(G)$, is the least positive integer $k$ such that $G$ has a harmonious coloring with $k$ colors. In this work, we extend an idea presented in [Kolay, et al. Harmonious coloring: Parameterized algorithms and upper bounds. Theor. Comp. Sci. 772 (2019), 132-142] to compare the harmonious chromatic numbers of two graphs $G$ and $H$, with $H$ being obtained from $G$ by identifying vertices","authors_text":"Beatriz Martins, J\\'ulio Ara\\'ujo, Manoel Camp\\^elo, Marcio C. Santos","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-18T16:42:24Z","title":"Harmonious Colorings: bounds, heuristics and integer-linear formulations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18634","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:e1bd9c14006b7f42b878f76e6440079e9853f8f514cca5d8515492acf243b274","target":"record","created_at":"2026-05-20T00:06:11Z","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":"bbf5a3b2df4300a8139f1816739dc7cc31b2082ecc9f91398bdace561cbd8df5","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-18T16:42:24Z","title_canon_sha256":"b1b4fb935c328e98f1bd02668ad269616dedcc9f2975b3de05437a61379c5363"},"schema_version":"1.0","source":{"id":"2605.18634","kind":"arxiv","version":1}},"canonical_sha256":"6f91c8b46801f2940c0ae3e358f914b9916e42e2ba28df9b88a5202faeecb621","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f91c8b46801f2940c0ae3e358f914b9916e42e2ba28df9b88a5202faeecb621","first_computed_at":"2026-05-20T00:06:11.872802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:06:11.872802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yKuuFh2NPU/2AH5ETtGF2DYzW5GQSLcirX4dnuIaj5QzW0npO3H3es3T+62yFhs1oUAJg3YHK888wq4RpR89Cw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:06:11.873659Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.18634","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1bd9c14006b7f42b878f76e6440079e9853f8f514cca5d8515492acf243b274","sha256:62720958e002bdeb20c54d6b714f5dd58eebe1300c0ffaaf9ce7fd5e23da870d"],"state_sha256":"92cbf6e4fe0845972337a1faf216512684e482317c7a1bfa67c2ceb638dac240"}