{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZDOYVGS2QKRAZV27FRG2TLZEX2","short_pith_number":"pith:ZDOYVGS2","schema_version":"1.0","canonical_sha256":"c8dd8a9a5a82a20cd75f2c4da9af24bead31826afe3eb480d6bb1fba9a14a6e4","source":{"kind":"arxiv","id":"1406.3683","version":1},"attestation_state":"computed","paper":{"title":"Relaxed Locally Identifying coloring of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"M\\'eziane A\\\"ider, Souad Slimani, Sylvain Gravier","submitted_at":"2014-06-14T04:25:26Z","abstract_excerpt":"A \\textit{locally identifying coloring} ($lid$-coloring) of a graph is a proper coloring such that the sets of colors appearing in the closed neighborhoods of any pair of adjacent vertices having distinct neighborhoods are distinct. Our goal is to study a \\textit{relaxed locally identifying coloring} ($rlid$-coloring) of a graph that is similar to locally identifying coloring for which the coloring is not necessary proper.We denote by $\\chi_{rlid}(G)$ the minimum number of colors used in a relaxed locally identifying coloring of a graph $G$\n  In this paper, we prove that the problem of decidin"},"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":"1406.3683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-14T04:25:26Z","cross_cats_sorted":[],"title_canon_sha256":"6460c79eea26d4491d8c5d4cdeae0804ac6acb8ce40ded87274d063c9340ddc8","abstract_canon_sha256":"a609fbb5e41e416991c82f34d1f5dcb3d3e013951bcfdda10215aff94b74dd76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:45.228183Z","signature_b64":"3tZCX9gkhVxZFbWBfkf3nCrIgGk9OcSov+UwPFblpaDZ2PcfyCzI/IAQUzmJ5HzjwonUT6egVMH1ivsVMZouDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8dd8a9a5a82a20cd75f2c4da9af24bead31826afe3eb480d6bb1fba9a14a6e4","last_reissued_at":"2026-05-18T02:49:45.227745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:45.227745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relaxed Locally Identifying coloring of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"M\\'eziane A\\\"ider, Souad Slimani, Sylvain Gravier","submitted_at":"2014-06-14T04:25:26Z","abstract_excerpt":"A \\textit{locally identifying coloring} ($lid$-coloring) of a graph is a proper coloring such that the sets of colors appearing in the closed neighborhoods of any pair of adjacent vertices having distinct neighborhoods are distinct. Our goal is to study a \\textit{relaxed locally identifying coloring} ($rlid$-coloring) of a graph that is similar to locally identifying coloring for which the coloring is not necessary proper.We denote by $\\chi_{rlid}(G)$ the minimum number of colors used in a relaxed locally identifying coloring of a graph $G$\n  In this paper, we prove that the problem of decidin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3683","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":"1406.3683","created_at":"2026-05-18T02:49:45.227812+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3683v1","created_at":"2026-05-18T02:49:45.227812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3683","created_at":"2026-05-18T02:49:45.227812+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDOYVGS2QKRA","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDOYVGS2QKRAZV27","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDOYVGS2","created_at":"2026-05-18T12:28:59.999130+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/ZDOYVGS2QKRAZV27FRG2TLZEX2","json":"https://pith.science/pith/ZDOYVGS2QKRAZV27FRG2TLZEX2.json","graph_json":"https://pith.science/api/pith-number/ZDOYVGS2QKRAZV27FRG2TLZEX2/graph.json","events_json":"https://pith.science/api/pith-number/ZDOYVGS2QKRAZV27FRG2TLZEX2/events.json","paper":"https://pith.science/paper/ZDOYVGS2"},"agent_actions":{"view_html":"https://pith.science/pith/ZDOYVGS2QKRAZV27FRG2TLZEX2","download_json":"https://pith.science/pith/ZDOYVGS2QKRAZV27FRG2TLZEX2.json","view_paper":"https://pith.science/paper/ZDOYVGS2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3683&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDOYVGS2QKRAZV27FRG2TLZEX2/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDOYVGS2QKRAZV27FRG2TLZEX2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDOYVGS2QKRAZV27FRG2TLZEX2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDOYVGS2QKRAZV27FRG2TLZEX2/action/storage_attestation","attest_author":"https://pith.science/pith/ZDOYVGS2QKRAZV27FRG2TLZEX2/action/author_attestation","sign_citation":"https://pith.science/pith/ZDOYVGS2QKRAZV27FRG2TLZEX2/action/citation_signature","submit_replication":"https://pith.science/pith/ZDOYVGS2QKRAZV27FRG2TLZEX2/action/replication_record"}},"created_at":"2026-05-18T02:49:45.227812+00:00","updated_at":"2026-05-18T02:49:45.227812+00:00"}