{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:N6I4RNDIAHZJIDAK4PRVR6IUXG","short_pith_number":"pith:N6I4RNDI","schema_version":"1.0","canonical_sha256":"6f91c8b46801f2940c0ae3e358f914b9916e42e2ba28df9b88a5202faeecb621","source":{"kind":"arxiv","id":"2605.18634","version":1},"attestation_state":"computed","paper":{"title":"Harmonious Colorings: bounds, heuristics and integer-linear formulations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Beatriz Martins, J\\'ulio Ara\\'ujo, Manoel Camp\\^elo, Marcio C. Santos","submitted_at":"2026-05-18T16:42:24Z","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"},"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":"2605.18634","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-18T16:42:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b1b4fb935c328e98f1bd02668ad269616dedcc9f2975b3de05437a61379c5363","abstract_canon_sha256":"bbf5a3b2df4300a8139f1816739dc7cc31b2082ecc9f91398bdace561cbd8df5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:06:11.873659Z","signature_b64":"yKuuFh2NPU/2AH5ETtGF2DYzW5GQSLcirX4dnuIaj5QzW0npO3H3es3T+62yFhs1oUAJg3YHK888wq4RpR89Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f91c8b46801f2940c0ae3e358f914b9916e42e2ba28df9b88a5202faeecb621","last_reissued_at":"2026-05-20T00:06:11.872802Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:06:11.872802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Harmonious Colorings: bounds, heuristics and integer-linear formulations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Beatriz Martins, J\\'ulio Ara\\'ujo, Manoel Camp\\^elo, Marcio C. Santos","submitted_at":"2026-05-18T16:42:24Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18634","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.18634/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T00:01:59.198620Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"73ad2342962516d140c2ade07ec6eec9aee950b8fb882894f7e8fee1c23c6841"},"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":"2605.18634","created_at":"2026-05-20T00:06:11.872937+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.18634v1","created_at":"2026-05-20T00:06:11.872937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18634","created_at":"2026-05-20T00:06:11.872937+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6I4RNDIAHZJ","created_at":"2026-05-20T00:06:11.872937+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6I4RNDIAHZJIDAK","created_at":"2026-05-20T00:06:11.872937+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6I4RNDI","created_at":"2026-05-20T00:06:11.872937+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/N6I4RNDIAHZJIDAK4PRVR6IUXG","json":"https://pith.science/pith/N6I4RNDIAHZJIDAK4PRVR6IUXG.json","graph_json":"https://pith.science/api/pith-number/N6I4RNDIAHZJIDAK4PRVR6IUXG/graph.json","events_json":"https://pith.science/api/pith-number/N6I4RNDIAHZJIDAK4PRVR6IUXG/events.json","paper":"https://pith.science/paper/N6I4RNDI"},"agent_actions":{"view_html":"https://pith.science/pith/N6I4RNDIAHZJIDAK4PRVR6IUXG","download_json":"https://pith.science/pith/N6I4RNDIAHZJIDAK4PRVR6IUXG.json","view_paper":"https://pith.science/paper/N6I4RNDI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.18634&json=true","fetch_graph":"https://pith.science/api/pith-number/N6I4RNDIAHZJIDAK4PRVR6IUXG/graph.json","fetch_events":"https://pith.science/api/pith-number/N6I4RNDIAHZJIDAK4PRVR6IUXG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6I4RNDIAHZJIDAK4PRVR6IUXG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6I4RNDIAHZJIDAK4PRVR6IUXG/action/storage_attestation","attest_author":"https://pith.science/pith/N6I4RNDIAHZJIDAK4PRVR6IUXG/action/author_attestation","sign_citation":"https://pith.science/pith/N6I4RNDIAHZJIDAK4PRVR6IUXG/action/citation_signature","submit_replication":"https://pith.science/pith/N6I4RNDIAHZJIDAK4PRVR6IUXG/action/replication_record"}},"created_at":"2026-05-20T00:06:11.872937+00:00","updated_at":"2026-05-20T00:06:11.872937+00:00"}